OLD | NEW |
(Empty) | |
| 1 Index: tools/genperf/perfect.c |
| 2 =================================================================== |
| 3 --- tools/genperf/perfect.c (revision 124732) |
| 4 +++ tools/genperf/perfect.c (working copy) |
| 5 @@ -673,8 +673,6 @@ |
| 6 sprintf(final->line[0], " unsigned long rsl = (a ^ scramble[tab[b]]);\n"); |
| 7 } |
| 8 |
| 9 - printf("success, found a perfect hash\n"); |
| 10 - |
| 11 free((void *)tabq); |
| 12 free((void *)tabh); |
| 13 } |
| 14 @@ -903,8 +901,6 @@ |
| 15 continue; /* two keys have same (a,b) pair */ |
| 16 } |
| 17 |
| 18 - printf("found distinct (A,B) on attempt %ld\n", trysalt); |
| 19 - |
| 20 /* Given distinct (A,B) for all keys, build a perfect hash */ |
| 21 if (!perfect(*tabb, *tabh, tabq, *blen, *smax, scramble, nkeys, form)) |
| 22 { |
| 23 @@ -934,8 +930,6 @@ |
| 24 break; |
| 25 } |
| 26 |
| 27 - printf("built perfect hash table of size %ld\n", *blen); |
| 28 - |
| 29 /* free working memory */ |
| 30 free((void *)tabq); |
| 31 } |
| 32 @@ -1145,7 +1139,6 @@ |
| 33 |
| 34 /* read in the list of keywords */ |
| 35 getkeys(&keys, &nkeys, textroot, keyroot, form); |
| 36 - printf("Read in %ld keys\n",nkeys); |
| 37 |
| 38 /* find the hash */ |
| 39 findhash(&tab, &alen, &blen, &salt, &final, |
| 40 @@ -1153,13 +1146,11 @@ |
| 41 |
| 42 /* generate the phash.c file */ |
| 43 make_c(tab, smax, blen, scramble, &final, form); |
| 44 - printf("Wrote phash.c\n"); |
| 45 |
| 46 /* clean up memory sources */ |
| 47 refree(textroot); |
| 48 refree(keyroot); |
| 49 free((void *)tab); |
| 50 - printf("Cleaned up\n"); |
| 51 } |
| 52 |
| 53 |
OLD | NEW |