summaryrefslogtreecommitdiff
path: root/phash.pl
blob: e1071b2e7ec4adf2536e4f4b3dfae197978270e3 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#!/usr/bin/perl
## --------------------------------------------------------------------------
##   
##   Copyright 1996-2009 the NASM Authors - All rights reserved.
##
##   Redistribution and use in source and binary forms, with or without
##   modification, are permitted provided that the following
##   conditions are met:
##
##   * Redistributions of source code must retain the above copyright
##     notice, this list of conditions and the following disclaimer.
##   * Redistributions in binary form must reproduce the above
##     copyright notice, this list of conditions and the following
##     disclaimer in the documentation and/or other materials provided
##     with the distribution.
##     
##     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
##     CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
##     INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
##     MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
##     DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
##     CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
##     SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
##     NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
##     LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
##     HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
##     CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
##     OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
##     EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
##
## --------------------------------------------------------------------------

#
# Perfect Minimal Hash Generator written in Perl, which produces
# C output.
#

require 'phash.ph';

#
# Main program
#
sub main() {
    my $n;
    my %data;
    my @hashinfo;
    my $x, $i;

    %data = read_input();
    @hashinfo = gen_perfect_hash(\%data);

    if (!defined(@hashinfo)) {
	die "$0: no hash found\n";
    }

    verify_hash_table(\%data, \@hashinfo);

    ($n, $sv, $f1, $f2, $g) = @hashinfo;

    print "static int HASHNAME_fg1[$n] =\n";
    print "{\n";
    for ($i = 0; $i < $n; $i++) {
	print "\t", ${$g}[${$f1}[$i]], "\n";
    }
    print "};\n\n";

    print "static int HASHNAME_fg2[$n] =\n";
    print "{\n";
    for ($i = 0; $i < $n; $i++) {
	print "\t", ${$g}[${$f2}[$i]], "\n";
    }
    print "};\n\n";

    print "struct p_hash HASHNAME =\n";
    print "{\n";
    print "\t$n\n";
    print "\t$sv\n";
    print "\tHASHNAME_fg1,\n";
    print "\tHASHNAME_fg2,\n";
    print "};\n";
}

main();