Commit | Line | Data |
6294c161 |
1 | #!/usr/bin/perl |
2 | # |
3 | # Regenerate (overwriting only if changed): |
4 | # |
5 | # regnodes.h |
6 | # |
7 | # from information stored in |
8 | # |
9 | # regcomp.sym |
10 | # regexp.h |
11 | # |
12 | # Accepts the standard regen_lib -q and -v args. |
13 | # |
14 | # This script is normally invoked from regen.pl. |
15 | |
36bb303b |
16 | BEGIN { |
17 | # Get function prototypes |
9ad884cb |
18 | require 'regen_lib.pl'; |
36bb303b |
19 | } |
d09b2d29 |
20 | #use Fatal qw(open close rename chmod unlink); |
03363afd |
21 | use strict; |
22 | use warnings; |
23 | |
d09b2d29 |
24 | open DESC, 'regcomp.sym'; |
d09b2d29 |
25 | |
03363afd |
26 | my $ind = 0; |
27 | my (@name,@rest,@type,@code,@args,@longj); |
28 | my ($desc,$lastregop); |
d09b2d29 |
29 | while (<DESC>) { |
03363afd |
30 | s/#.*$//; |
31 | next if /^\s*$/; |
32 | s/\s*\z//; |
33 | if (/^-+\s*$/) { |
34 | $lastregop= $ind; |
35 | next; |
36 | } |
37 | unless ($lastregop) { |
38 | $ind++; |
39 | ($name[$ind], $desc, $rest[$ind]) = split /\t+/, $_, 3; |
40 | ($type[$ind], $code[$ind], $args[$ind], $longj[$ind]) |
41 | = split /[,\s]\s*/, $desc, 4; |
42 | } else { |
43 | my ($type,@lists)=split /\s*\t+\s*/, $_; |
44 | die "No list? $type" if !@lists; |
45 | foreach my $list (@lists) { |
46 | my ($names,$special)=split /:/, $list , 2; |
47 | $special ||= ""; |
48 | foreach my $name (split /,/,$names) { |
49 | my $real= $name eq 'resume' |
50 | ? "resume_$type" |
51 | : "${type}_$name"; |
52 | my @suffix; |
53 | if (!$special) { |
54 | @suffix=(""); |
55 | } elsif ($special=~/\d/) { |
56 | @suffix=(1..$special); |
57 | } elsif ($special eq 'FAIL') { |
58 | @suffix=("","_fail"); |
59 | } else { |
60 | die "unknown :type ':$special'"; |
61 | } |
62 | foreach my $suffix (@suffix) { |
63 | $ind++; |
64 | $name[$ind]="$real$suffix"; |
65 | $type[$ind]=$type; |
24b23f37 |
66 | $rest[$ind]="state for $type"; |
03363afd |
67 | } |
68 | } |
69 | } |
70 | |
71 | } |
72 | } |
5d458dd8 |
73 | # use fixed width to keep the diffs between regcomp.pl recompiles |
74 | # as small as possible. |
75 | my ($width,$rwidth,$twidth)=(22,12,9); |
03363afd |
76 | $lastregop ||= $ind; |
77 | my $tot = $ind; |
d09b2d29 |
78 | close DESC; |
03363afd |
79 | die "Too many regexp/state opcodes! Maximum is 256, but there are $lastregop in file!" |
80 | if $lastregop>256; |
d09b2d29 |
81 | |
266db279 |
82 | my $tmp_h = 'regnodes.h-new'; |
d09b2d29 |
83 | |
84 | unlink $tmp_h if -f $tmp_h; |
85 | |
424a4936 |
86 | my $out = safer_open($tmp_h); |
d09b2d29 |
87 | |
424a4936 |
88 | printf $out <<EOP, |
37442d52 |
89 | /* -*- buffer-read-only: t -*- |
90 | !!!!!!! DO NOT EDIT THIS FILE !!!!!!! |
9b155405 |
91 | This file is built by regcomp.pl from regcomp.sym. |
d09b2d29 |
92 | Any changes made here will be lost! |
93 | */ |
94 | |
6bda09f9 |
95 | /* Regops and State definitions */ |
96 | |
03363afd |
97 | #define %*s\t%d |
98 | #define %*s\t%d |
99 | |
d09b2d29 |
100 | EOP |
f9f4320a |
101 | -$width, REGNODE_MAX => $lastregop - 1, |
102 | -$width, REGMATCH_STATE_MAX => $tot - 1 |
103 | ; |
d09b2d29 |
104 | |
24b23f37 |
105 | |
106 | for ($ind=1; $ind <= $lastregop ; $ind++) { |
03363afd |
107 | my $oind = $ind - 1; |
424a4936 |
108 | printf $out "#define\t%*s\t%d\t/* %#04x %s */\n", |
03363afd |
109 | -$width, $name[$ind], $ind-1, $ind-1, $rest[$ind]; |
24b23f37 |
110 | } |
424a4936 |
111 | print $out "\t/* ------------ States ------------- */\n"; |
24b23f37 |
112 | for ( ; $ind <= $tot ; $ind++) { |
424a4936 |
113 | printf $out "#define\t%*s\t(REGNODE_MAX + %d)\t/* %s */\n", |
24b23f37 |
114 | -$width, $name[$ind], $ind - $lastregop, $rest[$ind]; |
d09b2d29 |
115 | } |
116 | |
424a4936 |
117 | print $out <<EOP; |
03363afd |
118 | |
6bda09f9 |
119 | /* PL_regkind[] What type of regop or state is this. */ |
d09b2d29 |
120 | |
121 | #ifndef DOINIT |
22c35a8c |
122 | EXTCONST U8 PL_regkind[]; |
d09b2d29 |
123 | #else |
22c35a8c |
124 | EXTCONST U8 PL_regkind[] = { |
d09b2d29 |
125 | EOP |
126 | |
127 | $ind = 0; |
128 | while (++$ind <= $tot) { |
424a4936 |
129 | printf $out "\t%*s\t/* %*s */\n", |
03363afd |
130 | -1-$twidth, "$type[$ind],", -$width, $name[$ind]; |
424a4936 |
131 | print $out "\t/* ------------ States ------------- */\n" |
03363afd |
132 | if $ind == $lastregop and $lastregop != $tot; |
d09b2d29 |
133 | } |
134 | |
424a4936 |
135 | print $out <<EOP; |
d09b2d29 |
136 | }; |
137 | #endif |
138 | |
6bda09f9 |
139 | /* regarglen[] - How large is the argument part of the node (in regnodes) */ |
d09b2d29 |
140 | |
141 | #ifdef REG_COMP_C |
29de9391 |
142 | static const U8 regarglen[] = { |
d09b2d29 |
143 | EOP |
144 | |
145 | $ind = 0; |
03363afd |
146 | while (++$ind <= $lastregop) { |
147 | my $size = 0; |
d09b2d29 |
148 | $size = "EXTRA_SIZE(struct regnode_$args[$ind])" if $args[$ind]; |
149 | |
424a4936 |
150 | printf $out "\t%*s\t/* %*s */\n", |
03363afd |
151 | -37, "$size,",-$rwidth,$name[$ind]; |
d09b2d29 |
152 | } |
153 | |
424a4936 |
154 | print $out <<EOP; |
d09b2d29 |
155 | }; |
156 | |
6bda09f9 |
157 | /* reg_off_by_arg[] - Which argument holds the offset to the next node */ |
158 | |
29de9391 |
159 | static const char reg_off_by_arg[] = { |
d09b2d29 |
160 | EOP |
161 | |
162 | $ind = 0; |
03363afd |
163 | while (++$ind <= $lastregop) { |
164 | my $size = $longj[$ind] || 0; |
9b155405 |
165 | |
424a4936 |
166 | printf $out "\t%d,\t/* %*s */\n", |
03363afd |
167 | $size, -$rwidth, $name[$ind] |
d09b2d29 |
168 | } |
169 | |
424a4936 |
170 | print $out <<EOP; |
d09b2d29 |
171 | }; |
9b155405 |
172 | |
13d6edb4 |
173 | #endif /* REG_COMP_C */ |
174 | |
6bda09f9 |
175 | /* reg_name[] - Opcode/state names in string form, for debugging */ |
176 | |
22429478 |
177 | #ifndef DOINIT |
13d6edb4 |
178 | EXTCONST char * PL_reg_name[]; |
22429478 |
179 | #else |
4764e399 |
180 | EXTCONST char * const PL_reg_name[] = { |
9b155405 |
181 | EOP |
182 | |
183 | $ind = 0; |
24b23f37 |
184 | my $ofs = 1; |
185 | my $sym = ""; |
9b155405 |
186 | while (++$ind <= $tot) { |
03363afd |
187 | my $size = $longj[$ind] || 0; |
9b155405 |
188 | |
424a4936 |
189 | printf $out "\t%*s\t/* $sym%#04x */\n", |
24b23f37 |
190 | -3-$width,qq("$name[$ind]",), $ind - $ofs; |
191 | if ($ind == $lastregop and $lastregop != $tot) { |
424a4936 |
192 | print $out "\t/* ------------ States ------------- */\n"; |
24b23f37 |
193 | $ofs = $lastregop; |
194 | $sym = 'REGNODE_MAX +'; |
195 | } |
196 | |
9b155405 |
197 | } |
198 | |
424a4936 |
199 | print $out <<EOP; |
9b155405 |
200 | }; |
22429478 |
201 | #endif /* DOINIT */ |
d09b2d29 |
202 | |
f7819f85 |
203 | /* PL_reg_extflags_name[] - Opcode/state names in string form, for debugging */ |
204 | |
205 | #ifndef DOINIT |
206 | EXTCONST char * PL_reg_extflags_name[]; |
207 | #else |
208 | EXTCONST char * const PL_reg_extflags_name[] = { |
d09b2d29 |
209 | EOP |
210 | |
f7819f85 |
211 | open my $fh,"<","regexp.h" or die "Can't read regexp.h: $!"; |
212 | my %rxfv; |
c8e4cf8b |
213 | my $val = 0; |
214 | my %reverse; |
f7819f85 |
215 | while (<$fh>) { |
216 | if (/#define\s+(RXf_\w+)\s+(0x[A-F\d]+)/i) { |
c8e4cf8b |
217 | my $newval = eval $2; |
218 | if($val & $newval) { |
219 | die sprintf "Both $1 and $reverse{$newval} use %08X", $newval; |
220 | } |
221 | $val|=$newval; |
222 | $rxfv{$1}= $newval; |
223 | $reverse{$newval} = $1; |
f7819f85 |
224 | } |
225 | } |
226 | my %vrxf=reverse %rxfv; |
424a4936 |
227 | printf $out "\t/* Bits in extflags defined: %032b */\n",$val; |
f7819f85 |
228 | for (0..31) { |
229 | my $n=$vrxf{2**$_}||"UNUSED_BIT_$_"; |
230 | $n=~s/^RXf_(PMf_)?//; |
424a4936 |
231 | printf $out qq(\t%-20s/* 0x%08x */\n), |
f7819f85 |
232 | qq("$n",),2**$_; |
233 | } |
234 | |
424a4936 |
235 | print $out <<EOP; |
f7819f85 |
236 | }; |
237 | #endif /* DOINIT */ |
238 | |
239 | /* ex: set ro: */ |
240 | EOP |
08858ed2 |
241 | safer_close($out); |
d09b2d29 |
242 | |
424a4936 |
243 | rename_if_different $tmp_h, 'regnodes.h'; |