Don't boundcheck 64-bit numbers, it gives problems due to overflows
[nasm/avx512.git] / macros.pl
blob911da8db56a322ed6c333ac61ceae67ff2a0f61c
1 #!/usr/bin/perl
2 ## --------------------------------------------------------------------------
3 ##
4 ## Copyright 1996-2009 The NASM Authors - All Rights Reserved
5 ## See the file AUTHORS included with the NASM distribution for
6 ## the specific copyright holders.
7 ##
8 ## Redistribution and use in source and binary forms, with or without
9 ## modification, are permitted provided that the following
10 ## conditions are met:
12 ## * Redistributions of source code must retain the above copyright
13 ## notice, this list of conditions and the following disclaimer.
14 ## * Redistributions in binary form must reproduce the above
15 ## copyright notice, this list of conditions and the following
16 ## disclaimer in the documentation and/or other materials provided
17 ## with the distribution.
18 ##
19 ## THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
20 ## CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
21 ## INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
22 ## MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
23 ## DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
24 ## CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
25 ## SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
26 ## NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
27 ## LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 ## HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
29 ## CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
30 ## OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
31 ## EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 ## --------------------------------------------------------------------------
36 # macros.pl produce macros.c from standard.mac
39 require 'phash.ph';
40 require 'pptok.ph';
42 use bytes;
44 my $fname;
45 my $line = 0;
46 my $index = 0;
47 my $tasm_count = 0;
50 # Print out a string as a character array
52 sub charcify(@) {
53 my $l = '';
54 my $c, $o;
55 foreach $o (unpack("C*", join('',@_))) {
56 $c = pack("C", $o);
57 if ($o < 32 || $o > 126 || $c eq '"' || $c eq "\\") {
58 $l .= sprintf("%3d,", $o);
59 } else {
60 $l .= "\'".$c."\',";
63 return $l;
67 # Generate macros.c
69 open(OUT,"> macros.c\0") or die "unable to open macros.c\n";
71 print OUT "/*\n";
72 print OUT " * Do not edit - this file auto-generated by macros.pl from:\n";
73 print OUT " * ", join("\n * ", @ARGV), "\n";
74 print OUT " */\n";
75 print OUT "\n";
76 print OUT "#include \"tables.h\"\n";
77 print OUT "#include \"nasmlib.h\"\n";
78 print OUT "#include \"hashtbl.h\"\n";
79 print OUT "#include \"output/outform.h\"\n";
80 print OUT "\n";
81 print OUT "#if 1\n";
82 print OUT "const unsigned char nasm_stdmac[] = {";
84 my $npkg = 0;
85 my @pkg_list = ();
86 my %pkg_number = ();
87 my $pkg;
88 my @out_list = ();
89 my $outfmt;
90 my $lastname;
91 my $z;
93 foreach $fname ( @ARGV ) {
94 open(INPUT,"< $fname\0") or die "$0: $fname: $!\n";
95 while (<INPUT>) {
96 $line++;
97 chomp;
98 while (/^(.*)\\$/) {
99 $_ = $1;
100 $_ .= <INPUT>;
101 chomp;
102 $line++;
104 if (m/^\s*\*END\*TASM\*MACROS\*\s*$/) {
105 $tasm_count = $index;
106 print OUT " /* End of TASM macros */\n";
107 } elsif (m/^OUT:\s*(.*\S)\s*$/) {
108 undef $pkg;
109 my @out_alias = split(/\s+/, $1);
110 printf OUT " /* %4d */ 0\n", $index++;
111 print OUT "};\n#endif\n";
112 $index = 0;
113 print OUT "\n";
114 my $pfx = '#if';
115 foreach my $al (@out_alias) {
116 print OUT $pfx, " defined(OF_\U${al}\E)";
117 $pfx = ' ||';
119 printf OUT "\nconst unsigned char %s_stdmac[] = {\n", $out_alias[0];
120 print OUT " /* From $fname */\n";
121 $lastname = $fname;
122 push(@out_list, $out_alias[0]);
123 $out_index{$out_alias[0]} = $index;
124 } elsif (m/^USE:\s*(\S+)\s*$/) {
125 $pkg = $1;
126 if (defined($pkg_number{$pkg})) {
127 die "$0: $fname: duplicate package: $pkg\n";
129 printf OUT " /* %4d */ 0\n", $index++;
130 print OUT "};\n#endif\n";
131 $index = 0;
132 print OUT "\n#if 1\n";
133 printf OUT "static const unsigned char nasm_stdmac_%s[] = {\n", $pkg;
134 print OUT " /* From $fname */\n";
135 $lastname = $fname;
136 push(@pkg_list, $pkg);
137 $pkg_number{$pkg} = $npkg++;
138 $z = pack("C", $pptok_hash{'%define'}+128)."__USE_\U$pkg\E__";
139 printf OUT " /* %4d */ %s0,\n", $index, charcify($z);
140 $index += length($z)+1;
141 } elsif (m/^\s*((\s*([^\"\';\s]+|\"[^\"]*\"|\'[^\']*\'))*)\s*(;.*)?$/) {
142 my $s1, $s2, $pd, $ws;
143 $s1 = $1;
144 $s2 = '';
145 while ($s1 =~ /(\%[a-zA-Z_][a-zA-Z0-9_]*)((\s+)(.*)|)$/) {
146 $s2 .= "$'";
147 $pd = $1;
148 $ws = $3;
149 $s1 = $4;
150 if (defined($pptok_hash{$pd}) &&
151 $pptok_hash{$pd} <= 127) {
152 $s2 .= pack("C", $pptok_hash{$pd}+128);
153 } else {
154 $s2 .= $pd.$ws;
157 $s2 .= $s1;
158 if (length($s2) > 0) {
159 if ($lastname ne $fname) {
160 print OUT "\n /* From $fname */\n";
161 $lastname = $fname;
163 printf OUT " /* %4d */ %s0,\n",
164 $index, charcify($s2);
165 $index += length($s2)+1;
167 } else {
168 die "$fname:$line: error unterminated quote";
171 close(INPUT);
173 printf OUT " /* %4d */ 0\n};\n#endif\n\n", $index++;
174 print OUT "const unsigned char * const nasm_stdmac_after_tasm = ",
175 "&nasm_stdmac[$tasm_count];\n\n";
177 my @hashinfo = gen_perfect_hash(\%pkg_number);
178 if (!@hashinfo) {
179 die "$0: no hash found\n";
181 # Paranoia...
182 verify_hash_table(\%pkg_number, \@hashinfo);
183 my ($n, $sv, $g) = @hashinfo;
184 die if ($n & ($n-1));
186 print OUT "const unsigned char *nasm_stdmac_find_package(const char *package)\n";
187 print OUT "{\n";
188 print OUT " static const struct {\n";
189 print OUT " const char *package;\n";
190 print OUT " const unsigned char *macros;\n";
191 print OUT " } packages[$npkg] = {\n";
192 foreach $pkg (@pkg_list) {
193 printf OUT " { \"%s\", nasm_stdmac_%s },\n",
194 $pkg, $pkg;
196 print OUT " };\n";
198 # Put a large value in unused slots. This makes it extremely unlikely
199 # that any combination that involves unused slot will pass the range test.
200 # This speeds up rejection of unrecognized tokens, i.e. identifiers.
201 print OUT "#define UNUSED 16383\n";
203 print OUT " static const int16_t hash1[$n] = {\n";
204 for ($i = 0; $i < $n; $i++) {
205 my $h = ${$g}[$i*2+0];
206 print OUT " ", defined($h) ? $h : 'UNUSED', ",\n";
208 print OUT " };\n";
210 print OUT " static const int16_t hash2[$n] = {\n";
211 for ($i = 0; $i < $n; $i++) {
212 my $h = ${$g}[$i*2+1];
213 print OUT " ", defined($h) ? $h : 'UNUSED', ",\n";
215 print OUT " };\n";
217 print OUT " uint32_t k1, k2;\n";
218 print OUT " uint64_t crc;\n";
219 # For correct overflow behavior, "ix" should be unsigned of the same
220 # width as the hash arrays.
221 print OUT " uint16_t ix;\n";
222 print OUT "\n";
224 printf OUT " crc = crc64i(UINT64_C(0x%08x%08x), package);\n",
225 $$sv[0], $$sv[1];
226 print OUT " k1 = (uint32_t)crc;\n";
227 print OUT " k2 = (uint32_t)(crc >> 32);\n";
228 print OUT "\n";
229 printf OUT " ix = hash1[k1 & 0x%x] + hash2[k2 & 0x%x];\n", $n-1, $n-1;
230 printf OUT " if (ix >= %d)\n", scalar(@pkg_list);
231 print OUT " return NULL;\n";
232 print OUT "\n";
233 print OUT " if (nasm_stricmp(packages[ix].package, package))\n";
234 print OUT " return NULL;\n";
235 print OUT "\n";
236 print OUT " return packages[ix].macros;\n";
237 print OUT "}\n";
239 close(OUT);