3 # macros.pl produce macros.c from standard.mac
5 # The Netwide Assembler is copyright (C) 1996 Simon Tatham and
6 # Julian Hall. All rights reserved. The software is
7 # redistributable under the license given in the file "LICENSE"
8 # distributed in the NASM archive.
21 open(OUT,">macros.c") or die "unable to open macros.c\n";
24 print OUT " * Do not edit - this file auto-generated by macros.pl from:\n";
25 print OUT " * ", join(' ', @ARGV), "\n";
28 print OUT "#include \"tables.h\"\n";
29 print OUT "#include \"nasmlib.h\"\n";
30 print OUT "#include \"hashtbl.h\"\n";
32 print OUT "const char * const nasm_stdmac[] = {";
36 my %module_number = ();
37 my %module_index = ();
40 foreach $fname ( @ARGV ) {
41 open(INPUT,$fname) or die "unable to open $fname\n";
42 print OUT "\n /* From $fname */\n";
46 if (m/^\s*\*END\*TASM\*MACROS\*\s*$/) {
48 print OUT " /* End of TASM macros */\n";
49 } elsif (m/^USE:\s*(\S+)\s*$/) {
51 if (defined($module_number{$module})) {
52 die "$0: $fname: duplicate module: $module\n";
54 printf OUT " /* %4d */ NULL,\n", $index++;
55 print OUT " /* %use $module */\n";
56 push(@module_list, $module);
57 $module_number{$module} = $nmodule++;
58 $module_index{$module} = $index;
59 } elsif (m/^\s*((\s*([^\"\';\s]+|\"[^\"]*\"|\'[^\']*\'))*)\s*(;.*)?$/) {
60 my $s1, $s2, $pd, $ws;
62 $s1 =~ s/(\s)\s+/$1/g;
67 while ($s1 =~ /^(.*)(\%[a-zA-Z_][a-zA-Z0-9_]*)(\s*)(.*)$/) {
73 if (defined($pptok_hash{$pd}) &&
74 $pptok_hash{$pd} <= 127) {
75 $s2 .= sprintf("\\x%02x\"\"", $pptok_hash{$pd}+128);
82 if (length($s2) > 0) {
83 printf OUT " /* %4d */ \"%s\",\n", $index++, $s2;
86 die "$fname:$line: error unterminated quote";
91 printf OUT " /* %4d */ NULL\n};\n\n", $index++;
92 print OUT "const char * const * const nasm_stdmac_after_tasm = ",
93 "&nasm_stdmac[$tasm_count];\n\n";
95 my @hashinfo = gen_perfect_hash(\%module_number);
97 die "$0: no hash found\n";
100 verify_hash_table(\%module_number, \@hashinfo);
101 my ($n, $sv, $g) = @hashinfo;
102 die if ($n & ($n-1));
104 print OUT "const char * const *nasm_stdmac_find_module(const char *module)\n";
106 print OUT " static const struct {\n";
107 print OUT " const char *module;\n";
108 print OUT " const char * const *macros;\n";
109 print OUT " } modules[$nmodule] = {\n";
110 foreach $module (@module_list) {
111 printf OUT " { \"%s\", nasm_stdmac+%d },\n",
112 $module, $module_index{$module};
116 # Put a large value in unused slots. This makes it extremely unlikely
117 # that any combination that involves unused slot will pass the range test.
118 # This speeds up rejection of unrecognized tokens, i.e. identifiers.
119 print OUT "#define UNUSED 16383\n";
121 print OUT " static const int16_t hash1[$n] = {\n";
122 for ($i = 0; $i < $n; $i++) {
123 my $h = ${$g}[$i*2+0];
124 print OUT " ", defined($h) ? $h : 'UNUSED', ",\n";
128 print OUT " static const int16_t hash2[$n] = {\n";
129 for ($i = 0; $i < $n; $i++) {
130 my $h = ${$g}[$i*2+1];
131 print OUT " ", defined($h) ? $h : 'UNUSED', ",\n";
135 print OUT " uint32_t k1, k2;\n";
136 print OUT " uint64_t crc;\n";
137 # For correct overflow behavior, "ix" should be unsigned of the same
138 # width as the hash arrays.
139 print OUT " uint16_t ix;\n";
142 printf OUT " crc = crc64i(UINT64_C(0x%08x%08x), module);\n",
144 print OUT " k1 = (uint32_t)crc;\n";
145 print OUT " k2 = (uint32_t)(crc >> 32);\n";
147 printf OUT " ix = hash1[k1 & 0x%x] + hash2[k2 & 0x%x];\n", $n-1, $n-1;
148 printf OUT " if (ix >= %d)\n", scalar(@module_list);
149 print OUT " return NULL;\n";
151 print OUT " if (nasm_stricmp(modules[ix].module, module))\n";
152 print OUT " return NULL;\n";
154 print OUT " return modules[ix].macros;\n";