aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAmi Fischman <fischman@chromium.org>2012-03-02 14:12:19 -0800
committerAmi Fischman <fischman@chromium.org>2012-03-02 14:12:19 -0800
commit5f01ee0f94329014c498a665f51d2da37bbdac46 (patch)
tree69e4180eaaa1e02f8dbee70f63e481cf9c3c2902
parent827922d98d2f76347c8d884ec66276ad0e2b35e5 (diff)
downloadyasm-5f01ee0f94329014c498a665f51d2da37bbdac46.tar.gz
Drop success-path chatter from genperf.
-rw-r--r--tools/genperf/perfect.c9
1 files changed, 0 insertions, 9 deletions
diff --git a/tools/genperf/perfect.c b/tools/genperf/perfect.c
index af6b4612..7cd68678 100644
--- a/tools/genperf/perfect.c
+++ b/tools/genperf/perfect.c
@@ -671,8 +671,6 @@ static void hash_ab(
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);
}
@@ -901,8 +899,6 @@ void findhash(
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))
{
@@ -932,8 +928,6 @@ void findhash(
break;
}
- printf("built perfect hash table of size %ld\n", *blen);
-
/* free working memory */
free((void *)tabq);
}
@@ -1143,7 +1137,6 @@ hashform *form; /* user directives */
/* 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,
@@ -1151,13 +1144,11 @@ hashform *form; /* user directives */
/* 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");
}