Index: patched-yasm/tools/genperf/perfect.c |
=================================================================== |
--- patched-yasm/tools/genperf/perfect.c (revision 124732) |
+++ patched-yasm/tools/genperf/perfect.c (working copy) |
@@ -673,8 +673,6 @@ |
sprintf(final->line[0], " unsigned long rsl = (a ^ scramble[tab[b]]);\n"); |
} |
- printf("success, found a perfect hash\n"); |
- |
free((void *)tabq); |
free((void *)tabh); |
} |
@@ -903,8 +901,6 @@ |
continue; /* two keys have same (a,b) pair */ |
} |
- 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)) |
{ |
@@ -934,8 +930,6 @@ |
break; |
} |
- printf("built perfect hash table of size %ld\n", *blen); |
- |
/* free working memory */ |
free((void *)tabq); |
} |
@@ -1145,7 +1139,6 @@ |
/* read in the list of keywords */ |
getkeys(&keys, &nkeys, textroot, keyroot, form); |
- printf("Read in %ld keys\n",nkeys); |
/* find the hash */ |
findhash(&tab, &alen, &blen, &salt, &final, |
@@ -1153,13 +1146,11 @@ |
/* generate the phash.c file */ |
make_c(tab, smax, blen, scramble, &final, form); |
- printf("Wrote phash.c\n"); |
/* clean up memory sources */ |
refree(textroot); |
refree(keyroot); |
free((void *)tab); |
- printf("Cleaned up\n"); |
} |