Silence genperf's success-related chatter.

patched-yasm/tools/genperf/perfect.c

 /* Modified for use with yasm by Peter Johnson.
  * $Id: perfect.c 1942 2007-09-11 02:11:19Z peter $
  */
 /*
 ------------------------------------------------------------------------------
 perfect.c: code to generate code for a hash for perfect hashing.
 (c) Bob Jenkins, September 1996, December 1999
 You may use this code in any way you wish, and it is free.  No warranty.
 I hereby place this in the public domain.
 Source is http://burtleburtle.net/bob/c/perfect.c
@@ skipping 655 matching lines @@
   }
   else if (*blen < USE_SCRAMBLE)
   {
     sprintf(final->line[0], "  unsigned long rsl = (a ^ tab[b]);\n");
   }
   else
   {
     sprintf(final->line[0], "  unsigned long rsl = (a ^ scramble[tab[b]]);\n");
   }
 
-  printf("success, found a perfect hash\n");
+  /* printf("success, found a perfect hash\n"); */

[Nico, 2012/03/02 21:32:48]

Can you delete them instead?

 
   free((void *)tabq);
   free((void *)tabh);
 }
 
 
 /* guess initial values for alen and blen */
 static void initalen(
     ub4      *alen,                                  /* output, initial alen */
     ub4      *blen,                                  /* output, initial blen */
@@ skipping 209 matching lines @@
           duplicates(*tabb, *blen, keys, form);      /* check for duplicates */
           fprintf(stderr, "fatal error: Cannot perfect hash: cannot find distinct (A,B)\n");
           exit(EXIT_FAILURE);
         }
         bad_initkey = 0;
         bad_perfect = 0;
       }
       continue;                             /* two keys have same (a,b) pair */
     }
 
-    printf("found distinct (A,B) on attempt %ld\n", trysalt);
+    /* printf("found distinct (A,B) on attempt %ld\n", trysalt); */
 
     /* Given distinct (A,B) for all keys, build a perfect hash */
     if (!perfect(*tabb, *tabh, tabq, *blen, *smax, scramble, nkeys, form))
     {
       if ((form->hashtype != INT_HT && ++bad_perfect >= RETRY_PERFECT) || 
           (form->hashtype == INT_HT && ++bad_perfect >= RETRY_HEX))
       {
         if (*blen < *smax)
         {
           *blen *= 2;
@@ skipping 10 matching lines @@
         }
         bad_perfect = 0;
       }
       continue;
     }
     
     *salt = trysalt;
     break;
   }
 
-  printf("built perfect hash table of size %ld\n", *blen);
+  /* printf("built perfect hash table of size %ld\n", *blen); */
 
   /* free working memory */
   free((void *)tabq);
 }
 
 #if 0
 /*
 ------------------------------------------------------------------------------
 Input/output type routines
 ------------------------------------------------------------------------------
@@ skipping 190 matching lines @@
   keyroot  = remkroot(sizeof(key));
 
   /* set up code for final hash */
   final.line = buf2;
   final.used = 0;
   final.len  = 10;
   for (i=0; i<10; ++i) final.line[i] = buf[i];
 
   /* read in the list of keywords */
   getkeys(&keys, &nkeys, textroot, keyroot, form);
-  printf("Read in %ld keys\n",nkeys);
+  /* printf("Read in %ld keys\n",nkeys); */
 
   /* find the hash */
   findhash(&tab, &alen, &blen, &salt, &final, 
            scramble, &smax, keys, nkeys, form);
 
   /* generate the phash.c file */
   make_c(tab, smax, blen, scramble, &final, form);
-  printf("Wrote phash.c\n");
+  /* printf("Wrote phash.c\n"); */
 
   /* clean up memory sources */
   refree(textroot);
   refree(keyroot);
   free((void *)tab);
-  printf("Cleaned up\n");
+  /* printf("Cleaned up\n"); */
 }
 
 
 /* Interpret arguments and call the driver */
 /* See usage_error for the expected arguments */
 int main(argc, argv)
 int    argc;
 char **argv;
 {
   int      mode_given = FALSE;
   int      minimal_given = FALSE;
   int      speed_given = FALSE;
   hashform form;
   char    *c;
 
   /* default behavior */
   form.mode = NORMAL_HM;
   form.hashtype = STRING_HT;
   form.perfect = MINIMAL_HP;
   form.speed = SLOW_HS;
 
   /* Generate the [minimal] perfect hash */
   driver(&form);
 
   return EXIT_SUCCESS;
 }
 #endif