| … | |
… | |
| 4 | |
4 | |
| 5 | =head1 SYNOPSIS |
5 | =head1 SYNOPSIS |
| 6 | |
6 | |
| 7 | use Faster; |
7 | use Faster; |
| 8 | |
8 | |
|
|
9 | perl -MFaster ... |
|
|
10 | |
| 9 | =head1 DESCRIPTION |
11 | =head1 DESCRIPTION |
| 10 | |
12 | |
|
|
13 | This module implements a very simple-minded "JIT" (or actually AIT, ahead |
|
|
14 | of time compiler). It works by more or less translating every function it |
|
|
15 | sees into a C program, compiling it and then replacing the function by the |
|
|
16 | compiled code. |
|
|
17 | |
|
|
18 | As a result, startup times are immense, as every function might lead to a |
|
|
19 | full-blown compilation. |
|
|
20 | |
|
|
21 | The speed improvements are also not great, you can expect 20% or so on |
|
|
22 | average, for code that runs very often. The reason for this is that data |
|
|
23 | handling is mostly being done by the same old code, it just gets called |
|
|
24 | a bit faster. Regexes and string operations won't get faster. Airhtmetic |
|
|
25 | doresn't become any faster. Just the operands and other stuff is put on |
|
|
26 | the stack faster, and the opcodes themselves have a bit less overhead. |
|
|
27 | |
|
|
28 | Faster is in the early stages of development. Due to its design its |
|
|
29 | relatively safe to use (it will either work or simply slowdown the program |
|
|
30 | immensely, but rarely cause bugs). |
|
|
31 | |
|
|
32 | More intelligent algorithms (loop optimisation, type inference) could |
|
|
33 | improve that easily, but requires a much more elaborate presentation and |
|
|
34 | optimiser than what is in place. There are no plans to improve Faster in |
|
|
35 | this way, yet, but it would provide a reasonably good place to start. |
|
|
36 | |
|
|
37 | Usage is very easy, just C<use Faster> and every function called from then |
|
|
38 | on will be compiled. |
|
|
39 | |
|
|
40 | Right now, Faster can leave lots of F<*.c> and F<*.so> files in your |
|
|
41 | F<$FASTER_CACHEDIR> (by default F<$HOME/.perl-faster-cache>), and it will |
|
|
42 | even create those temporary files in an insecure manner, so watch out. |
|
|
43 | |
| 11 | =over 4 |
44 | =over 4 |
| 12 | |
45 | |
| 13 | =cut |
46 | =cut |
| 14 | |
47 | |
| 15 | package Faster; |
48 | package Faster; |
|
|
49 | |
|
|
50 | no warnings; |
| 16 | |
51 | |
| 17 | use strict; |
52 | use strict; |
| 18 | use Config; |
53 | use Config; |
| 19 | use B (); |
54 | use B (); |
|
|
55 | use DynaLoader (); |
| 20 | use Digest::MD5 (); |
56 | use Digest::MD5 (); |
| 21 | use DynaLoader (); |
57 | use Storable (); |
|
|
58 | use Fcntl (); |
| 22 | |
59 | |
| 23 | BEGIN { |
60 | BEGIN { |
| 24 | our $VERSION = '0.01'; |
61 | our $VERSION = '0.01'; |
| 25 | |
62 | |
| 26 | require XSLoader; |
63 | require XSLoader; |
| 27 | XSLoader::load __PACKAGE__, $VERSION; |
64 | XSLoader::load __PACKAGE__, $VERSION; |
| 28 | } |
65 | } |
|
|
66 | |
|
|
67 | my $CACHEDIR = |
|
|
68 | $ENV{FASTER_CACHE} |
|
|
69 | || (exists $ENV{HOME} && "$ENV{HOME}/.perl-faster-cache") |
|
|
70 | || do { |
|
|
71 | require File::Temp; |
|
|
72 | File::Temp::tempdir (CLEANUP => 1) |
|
|
73 | }; |
| 29 | |
74 | |
| 30 | my $COMPILE = "$Config{cc} -c -I$Config{archlibexp}/CORE $Config{optimize} $Config{ccflags} $Config{cccdlflags}"; |
75 | my $COMPILE = "$Config{cc} -c -I$Config{archlibexp}/CORE $Config{optimize} $Config{ccflags} $Config{cccdlflags}"; |
| 31 | my $LINK = "$Config{ld} $Config{ldflags} $Config{lddlflags} $Config{ccdlflags}"; |
76 | my $LINK = "$Config{ld} $Config{ldflags} $Config{lddlflags} $Config{ccdlflags}"; |
| 32 | my $LIBS = "$Config{libs}"; |
77 | my $LIBS = "$Config{libs}"; |
| 33 | my $_o = $Config{_o}; |
78 | my $_o = $Config{_o}; |
| 34 | my $_so = ".so"; |
79 | my $_so = ".so"; |
| 35 | |
80 | |
| 36 | my $opt_assert = 1; |
81 | # we don't need no steenking PIC on x86 |
|
|
82 | $COMPILE =~ s/-f(?:PIC|pic)//g |
|
|
83 | if $Config{archname} =~ /^(i[3456]86)-/; |
|
|
84 | |
|
|
85 | my $opt_assert = $ENV{FASTER_DEBUG} > 1; |
|
|
86 | my $verbose = $ENV{FASTER_VERBOSE}+0; |
|
|
87 | |
|
|
88 | warn "Faster: CACHEDIR is $CACHEDIR\n" if $verbose > 2; |
| 37 | |
89 | |
| 38 | our $source; |
90 | our $source; |
| 39 | |
91 | |
| 40 | my @ops; |
92 | our @ops; |
| 41 | my $op; |
93 | our $insn; |
|
|
94 | our $op; |
| 42 | my $op_name; |
95 | our $op_name; |
| 43 | my @loop; |
96 | our @op_loop; |
|
|
97 | our %op_regcomp; |
| 44 | |
98 | |
| 45 | my %flag; |
99 | # ops that cause immediate return to the interpreter |
|
|
100 | my %f_unsafe = map +($_ => undef), qw( |
|
|
101 | leavesub leavesublv return |
|
|
102 | goto last redo next |
|
|
103 | eval flip leaveeval entertry |
|
|
104 | formline grepstart mapstart |
|
|
105 | substcont entereval require |
|
|
106 | ); |
| 46 | |
107 | |
| 47 | # complex flag steting is no longer required, rewrite this ugly code |
108 | # ops with known stack extend behaviour |
| 48 | for (split /\n/, <<EOF) { |
109 | # the values given are maximum values |
| 49 | leavesub unsafe |
110 | my %extend = ( |
| 50 | leavesublv unsafe |
111 | pushmark => 0, |
| 51 | return unsafe |
112 | nextstate => 0, # might reduce the stack |
| 52 | flip unsafe |
113 | unstack => 0, |
| 53 | goto unsafe |
114 | enter => 0, |
| 54 | last unsafe |
|
|
| 55 | redo unsafe |
|
|
| 56 | next unsafe |
|
|
| 57 | eval unsafe |
|
|
| 58 | leaveeval unsafe |
|
|
| 59 | entertry unsafe |
|
|
| 60 | formline unsafe |
|
|
| 61 | grepstart unsafe |
|
|
| 62 | mapstart unsafe |
|
|
| 63 | substcont unsafe |
|
|
| 64 | entereval unsafe noasync todo |
|
|
| 65 | require unsafe |
|
|
| 66 | |
115 | |
| 67 | mapstart noasync |
116 | stringify => 0, |
| 68 | grepstart noasync |
117 | not => 0, |
| 69 | match noasync todo#whyisitunsafe? unsafe |
118 | and => 0, |
|
|
119 | or => 0, |
|
|
120 | gvsv => 0, |
|
|
121 | rv2gv => 0, |
|
|
122 | preinc => 0, |
|
|
123 | predec => 0, |
|
|
124 | postinc => 0, |
|
|
125 | postdec => 0, |
|
|
126 | aelem => 0, |
|
|
127 | helem => 0, |
|
|
128 | qr => 1, #??? |
|
|
129 | pushre => 1, |
|
|
130 | gv => 1, |
|
|
131 | aelemfast => 1, |
|
|
132 | aelem => 0, |
|
|
133 | padsv => 1, |
|
|
134 | const => 1, |
|
|
135 | pop => 1, |
|
|
136 | shift => 1, |
|
|
137 | eq => -1, |
|
|
138 | ne => -1, |
|
|
139 | gt => -1, |
|
|
140 | lt => -1, |
|
|
141 | ge => -1, |
|
|
142 | lt => -1, |
|
|
143 | cond_expr => -1, |
|
|
144 | add => -1, |
|
|
145 | subtract => -1, |
|
|
146 | multiply => -1, |
|
|
147 | divide => -1, |
|
|
148 | aassign => 0, |
|
|
149 | sassign => -2, |
|
|
150 | method => 0, |
|
|
151 | method_named => 1, |
|
|
152 | ); |
| 70 | |
153 | |
| 71 | last noasync |
154 | # ops that do not need an ASYNC_CHECK |
| 72 | next noasync |
155 | my %f_noasync = map +($_ => undef), qw( |
| 73 | redo noasync |
156 | mapstart grepstart match entereval |
| 74 | seq noasync |
157 | enteriter entersub leaveloop |
| 75 | pushmark noasync extend=0 |
|
|
| 76 | padsv noasync extend=1 |
|
|
| 77 | padav noasync extend=1 |
|
|
| 78 | padhv noasync extend=1 |
|
|
| 79 | padany noasync extend=1 |
|
|
| 80 | entersub noasync |
|
|
| 81 | aassign noasync |
|
|
| 82 | sassign noasync |
|
|
| 83 | rv2av noasync |
|
|
| 84 | rv2cv noasync |
|
|
| 85 | rv2gv noasync |
|
|
| 86 | rv2hv noasync |
|
|
| 87 | refgen noasync |
|
|
| 88 | nextstate noasync |
|
|
| 89 | gv noasync |
|
|
| 90 | gvsv noasync |
|
|
| 91 | add noasync |
|
|
| 92 | subtract noasync |
|
|
| 93 | multiply noasync |
|
|
| 94 | divide noasync |
|
|
| 95 | complement noasync |
|
|
| 96 | cond_expr noasync |
|
|
| 97 | and noasync |
|
|
| 98 | or noasync |
|
|
| 99 | not noasync |
|
|
| 100 | defined noasync |
|
|
| 101 | method_named noasync |
|
|
| 102 | preinc noasync |
|
|
| 103 | postinc noasync |
|
|
| 104 | predec noasync |
|
|
| 105 | postdec noasync |
|
|
| 106 | stub noasync |
|
|
| 107 | unstack noasync |
|
|
| 108 | leaveloop noasync |
|
|
| 109 | aelem noasync |
|
|
| 110 | aelemfast noasync |
|
|
| 111 | helem noasync |
|
|
| 112 | pushre noasync |
|
|
| 113 | subst noasync |
|
|
| 114 | const noasync extend=1 |
|
|
| 115 | list noasync |
|
|
| 116 | join noasync |
|
|
| 117 | split noasync |
|
|
| 118 | concat noasync |
|
|
| 119 | push noasync |
|
|
| 120 | pop noasync |
|
|
| 121 | shift noasync |
|
|
| 122 | unshift noasync |
|
|
| 123 | length noasync |
|
|
| 124 | substr noasync |
|
|
| 125 | stringify noasync |
|
|
| 126 | eq noasync |
|
|
| 127 | ne noasync |
|
|
| 128 | gt noasync |
|
|
| 129 | lt noasync |
|
|
| 130 | ge noasync |
|
|
| 131 | le noasync |
|
|
| 132 | enteriter noasync |
|
|
| 133 | ord noasync |
|
|
| 134 | |
158 | |
| 135 | iter async |
159 | pushmark nextstate caller |
| 136 | EOF |
|
|
| 137 | my (undef, $op, @flags) = split /\s+/; |
|
|
| 138 | |
160 | |
| 139 | undef $flag{$_}{$op} |
161 | const stub unstack |
| 140 | for ("known", @flags); |
162 | last next redo goto seq |
| 141 | } |
163 | padsv padav padhv padany |
|
|
164 | aassign sassign orassign |
|
|
165 | rv2av rv2cv rv2gv rv2hv refgen |
|
|
166 | gv gvsv |
|
|
167 | add subtract multiply divide |
|
|
168 | complement cond_expr and or not |
|
|
169 | bit_and bit_or bit_xor |
|
|
170 | defined |
|
|
171 | method method_named bless |
|
|
172 | preinc postinc predec postdec |
|
|
173 | aelem aelemfast helem delete exists |
|
|
174 | pushre subst list lslice join split concat |
|
|
175 | length substr stringify ord |
|
|
176 | push pop shift unshift |
|
|
177 | eq ne gt lt ge le |
|
|
178 | regcomp regcreset regcmaybe |
|
|
179 | ); |
| 142 | |
180 | |
| 143 | my %callop = ( |
181 | my %callop = ( |
| 144 | entersub => "(PL_ppaddr [OP_ENTERSUB]) (aTHX)", |
182 | entersub => "(PL_op->op_ppaddr) (aTHX)", |
| 145 | mapstart => "Perl_pp_grepstart (aTHX)", |
183 | mapstart => "Perl_pp_grepstart (aTHX)", |
| 146 | ); |
184 | ); |
| 147 | |
185 | |
| 148 | sub callop { |
186 | sub callop { |
| 149 | $callop{$op_name} || "Perl_pp_$op_name (aTHX)" |
187 | $callop{$op_name} || "Perl_pp_$op_name (aTHX)" |
| … | |
… | |
| 157 | sub out_callop { |
195 | sub out_callop { |
| 158 | assert "nextop == (OP *)$$op"; |
196 | assert "nextop == (OP *)$$op"; |
| 159 | $source .= " PL_op = nextop; nextop = " . (callop $op) . ";\n"; |
197 | $source .= " PL_op = nextop; nextop = " . (callop $op) . ";\n"; |
| 160 | } |
198 | } |
| 161 | |
199 | |
|
|
200 | sub out_cond_jump { |
|
|
201 | $source .= " if (nextop == (OP *)${$_[0]}L) goto op_${$_[0]};\n"; |
|
|
202 | } |
|
|
203 | |
| 162 | sub out_jump_next { |
204 | sub out_jump_next { |
|
|
205 | out_cond_jump $op_regcomp{$$op} |
|
|
206 | if $op_regcomp{$$op}; |
|
|
207 | |
| 163 | assert "nextop == (OP *)${$op->next}"; |
208 | assert "nextop == (OP *)${$op->next}"; |
| 164 | $source .= " goto op_${$op->next};\n"; |
209 | $source .= " goto op_${$op->next};\n"; |
| 165 | } |
210 | } |
| 166 | |
211 | |
| 167 | sub out_next { |
212 | sub out_next { |
| … | |
… | |
| 171 | } |
216 | } |
| 172 | |
217 | |
| 173 | sub out_linear { |
218 | sub out_linear { |
| 174 | out_callop; |
219 | out_callop; |
| 175 | out_jump_next; |
220 | out_jump_next; |
| 176 | } |
|
|
| 177 | |
|
|
| 178 | sub out_cond_jump { |
|
|
| 179 | $source .= " if (nextop == (OP *)${$_[0]}L) goto op_${$_[0]};\n"; |
|
|
| 180 | } |
221 | } |
| 181 | |
222 | |
| 182 | sub op_entersub { |
223 | sub op_entersub { |
| 183 | out_callop; |
224 | out_callop; |
| 184 | $source .= " RUNOPS_TILL ((OP *)${$op->next}L);\n"; |
225 | $source .= " RUNOPS_TILL ((OP *)${$op->next}L);\n"; |
| … | |
… | |
| 194 | |
235 | |
| 195 | out_next; |
236 | out_next; |
| 196 | } |
237 | } |
| 197 | |
238 | |
| 198 | sub op_pushmark { |
239 | sub op_pushmark { |
| 199 | $source .= " PUSHMARK (PL_stack_sp);\n"; |
240 | $source .= " faster_PUSHMARK (PL_stack_sp);\n"; |
| 200 | |
241 | |
| 201 | out_next; |
242 | out_next; |
| 202 | } |
243 | } |
| 203 | |
244 | |
| 204 | if (0 && $Config{useithreads} ne "define") { |
245 | if ($Config{useithreads} ne "define") { |
| 205 | # disable optimisations on ithreads |
246 | # disable optimisations on ithreads |
| 206 | |
247 | |
| 207 | *op_const = sub { |
248 | *op_const = sub { |
| 208 | $source .= " { dSP; XPUSHs ((SV *)${$op->sv}L); PUTBACK; }\n"; |
249 | $source .= " { dSP; PUSHs ((SV *)${$op->sv}L); PUTBACK; }\n"; |
|
|
250 | |
|
|
251 | $ops[0]{follows_const}++ if @ops;#d# |
| 209 | |
252 | |
| 210 | out_next; |
253 | out_next; |
| 211 | }; |
254 | }; |
| 212 | |
255 | |
| 213 | *op_gv = \&op_const; |
256 | *op_gv = \&op_const; |
| … | |
… | |
| 233 | if (!($op->flags & B::OPf_MOD)) { |
276 | if (!($op->flags & B::OPf_MOD)) { |
| 234 | $source .= " if (SvGMAGICAL (sv)) sv = sv_mortalcopy (sv);\n"; |
277 | $source .= " if (SvGMAGICAL (sv)) sv = sv_mortalcopy (sv);\n"; |
| 235 | } |
278 | } |
| 236 | |
279 | |
| 237 | $source .= " dSP;\n"; |
280 | $source .= " dSP;\n"; |
| 238 | $source .= " XPUSHs (sv);\n"; |
281 | $source .= " PUSHs (sv);\n"; |
| 239 | $source .= " PUTBACK;\n"; |
282 | $source .= " PUTBACK;\n"; |
| 240 | $source .= " }\n"; |
283 | $source .= " }\n"; |
| 241 | |
284 | |
| 242 | out_next; |
285 | out_next; |
| 243 | }; |
286 | }; |
| 244 | |
287 | |
| 245 | *op_gvsv = sub { |
288 | *op_gvsv = sub { |
| 246 | $source .= " {\n"; |
289 | $source .= " {\n"; |
| 247 | $source .= " dSP;\n"; |
290 | $source .= " dSP;\n"; |
| 248 | $source .= " EXTEND (SP, 1);\n"; |
|
|
| 249 | |
291 | |
| 250 | if ($op->private & B::OPpLVAL_INTRO) { |
292 | if ($op->private & B::OPpLVAL_INTRO) { |
| 251 | $source .= " PUSHs (save_scalar ((GV *)${$op->sv}L));\n"; |
293 | $source .= " PUSHs (save_scalar ((GV *)${$op->sv}L));\n"; |
| 252 | } else { |
294 | } else { |
| 253 | $source .= " PUSHs (GvSV ((GV *)${$op->sv}L));\n"; |
295 | $source .= " PUSHs (GvSV ((GV *)${$op->sv}L));\n"; |
| … | |
… | |
| 258 | |
300 | |
| 259 | out_next; |
301 | out_next; |
| 260 | }; |
302 | }; |
| 261 | } |
303 | } |
| 262 | |
304 | |
|
|
305 | # does kill Crossfire/res2pm |
| 263 | sub xop_stringify { |
306 | sub op_stringify { |
| 264 | $source .= " { dSP; dTARGET; sv_copypv (TARG, TOPs); SETTARG; PUTBACK; }\n"; |
307 | my $targ = $op->targ; |
|
|
308 | |
|
|
309 | $source .= <<EOF; |
|
|
310 | { |
|
|
311 | dSP; |
|
|
312 | SV *targ = PAD_SV ((PADOFFSET)$targ); |
|
|
313 | sv_copypv (TARG, TOPs); |
|
|
314 | SETTARG; |
|
|
315 | PUTBACK; |
|
|
316 | } |
|
|
317 | EOF |
| 265 | |
318 | |
| 266 | out_next; |
319 | out_next; |
| 267 | } |
320 | } |
| 268 | |
321 | |
| 269 | sub op_and { |
322 | sub op_and { |
| … | |
… | |
| 302 | out_next; |
355 | out_next; |
| 303 | } |
356 | } |
| 304 | |
357 | |
| 305 | sub op_padsv { |
358 | sub op_padsv { |
| 306 | my $flags = $op->flags; |
359 | my $flags = $op->flags; |
| 307 | my $target = $op->targ; |
360 | my $padofs = "(PADOFFSET)" . $op->targ; |
| 308 | |
361 | |
| 309 | $source .= <<EOF; |
362 | $source .= <<EOF; |
| 310 | { |
363 | { |
| 311 | dSP; |
364 | dSP; |
| 312 | XPUSHs (PAD_SV ((PADOFFSET)$target)); |
365 | SV *sv = PAD_SVl ($padofs); |
|
|
366 | EOF |
|
|
367 | |
|
|
368 | if (($flags & B::OPf_MOD) && ($op->private & B::OPpLVAL_INTRO)) { |
|
|
369 | $source .= " SAVECLEARSV (PAD_SVl ($padofs));\n"; |
|
|
370 | $ops[0]{follows_padsv_lval_intro}++ if @ops;#d# |
|
|
371 | } |
|
|
372 | |
|
|
373 | $source .= <<EOF; |
|
|
374 | PUSHs (sv); |
| 313 | PUTBACK; |
375 | PUTBACK; |
| 314 | EOF |
376 | EOF |
| 315 | if ($op->flags & B::OPf_MOD) { |
377 | |
| 316 | if ($op->private & B::OPpLVAL_INTRO) { |
378 | if (($flags & B::OPf_MOD) && ($op->private & B::OPpDEREF)) { |
| 317 | $source .= " SAVECLEARSV (PAD_SVl ((PADOFFSET)$target));\n"; |
379 | $source .= " if (!SvROK (sv)) vivify_ref (sv, " . $op->private . " & OPpDEREF);\n"; |
| 318 | } elsif ($op->private & B::OPpDEREF) { |
|
|
| 319 | my $deref = $op->private & B::OPpDEREF; |
|
|
| 320 | $source .= " Perl_vivify_ref (PAD_SVl ((PADOFFSET)$target), $deref);\n"; |
|
|
| 321 | } |
|
|
| 322 | } |
380 | } |
|
|
381 | $source .= " }\n"; |
|
|
382 | |
|
|
383 | out_next; |
|
|
384 | } |
|
|
385 | |
|
|
386 | sub op_sassign { |
|
|
387 | $source .= <<EOF; |
|
|
388 | { |
|
|
389 | dSP; |
|
|
390 | dPOPTOPssrl; |
|
|
391 | EOF |
|
|
392 | $source .= " SV *temp = left; left = right; right = temp;\n" |
|
|
393 | if $op->private & B::OPpASSIGN_BACKWARDS; |
|
|
394 | |
|
|
395 | if ($insn->{follows_padsv_lval_intro} && !($op->private & B::OPpASSIGN_BACKWARDS)) { |
|
|
396 | # simple assignment - the target exists, but is basically undef |
|
|
397 | $source .= " SvSetSV (right, left);\n"; |
|
|
398 | } else { |
|
|
399 | $source .= " SvSetMagicSV (right, left);\n"; |
|
|
400 | } |
|
|
401 | |
| 323 | $source .= <<EOF; |
402 | $source .= <<EOF; |
|
|
403 | SETs (right); |
|
|
404 | PUTBACK; |
| 324 | } |
405 | } |
| 325 | EOF |
406 | EOF |
| 326 | |
407 | |
| 327 | out_next; |
408 | out_next; |
| 328 | } |
409 | } |
| 329 | |
410 | |
| 330 | # pattern const+ (or general push1) |
411 | # pattern const+ (or general push1) |
| 331 | # pattern pushmark return(?) |
|
|
| 332 | # pattern pushmark gv rv2av pushmark padsv+o.ä. aassign |
412 | # pattern pushmark gv rv2av pushmark padsv+o.ä. aassign |
| 333 | |
413 | |
| 334 | # pattern const method_named |
|
|
| 335 | sub xop_method_named { |
414 | sub op_method_named { |
|
|
415 | if ($insn->{follows_const}) { |
| 336 | $source .= <<EOF; |
416 | $source .= <<EOF; |
|
|
417 | { |
|
|
418 | dSP; |
|
|
419 | static SV *last_cv; |
|
|
420 | static U32 last_sub_generation; |
|
|
421 | |
|
|
422 | /* simple "polymorphic" inline cache */ |
|
|
423 | if (PL_sub_generation == last_sub_generation) |
|
|
424 | { |
|
|
425 | PUSHs (last_cv); |
|
|
426 | PUTBACK; |
|
|
427 | } |
|
|
428 | else |
|
|
429 | { |
|
|
430 | PL_op = nextop; nextop = Perl_pp_method_named (aTHX); |
|
|
431 | |
|
|
432 | SPAGAIN; |
|
|
433 | last_sub_generation = PL_sub_generation; |
|
|
434 | last_cv = TOPs; |
|
|
435 | } |
|
|
436 | } |
|
|
437 | EOF |
|
|
438 | } else { |
|
|
439 | $source .= <<EOF; |
| 337 | { |
440 | { |
| 338 | static HV *last_stash; |
441 | static HV *last_stash; |
| 339 | static SV *last_cv; |
442 | static SV *last_cv; |
| 340 | static U32 last_sub_generation; |
443 | static U32 last_sub_generation; |
| 341 | |
444 | |
| … | |
… | |
| 348 | |
451 | |
| 349 | /* simple "polymorphic" inline cache */ |
452 | /* simple "polymorphic" inline cache */ |
| 350 | if (stash == last_stash |
453 | if (stash == last_stash |
| 351 | && PL_sub_generation == last_sub_generation) |
454 | && PL_sub_generation == last_sub_generation) |
| 352 | { |
455 | { |
| 353 | XPUSHs (last_cv); |
456 | PUSHs (last_cv); |
| 354 | PUTBACK; |
457 | PUTBACK; |
| 355 | } |
458 | } |
| 356 | else |
459 | else |
| 357 | { |
460 | { |
| 358 | PL_op = nextop; nextop = Perl_pp_method_named (aTHX); |
461 | PL_op = nextop; nextop = Perl_pp_method_named (aTHX); |
| … | |
… | |
| 368 | /* error case usually */ |
471 | /* error case usually */ |
| 369 | PL_op = nextop; nextop = Perl_pp_method_named (aTHX); |
472 | PL_op = nextop; nextop = Perl_pp_method_named (aTHX); |
| 370 | } |
473 | } |
| 371 | } |
474 | } |
| 372 | EOF |
475 | EOF |
|
|
476 | } |
| 373 | |
477 | |
| 374 | out_next; |
478 | out_next; |
| 375 | } |
479 | } |
| 376 | |
480 | |
| 377 | sub op_grepstart { |
481 | sub op_grepstart { |
| 378 | out_callop; |
482 | out_callop; |
|
|
483 | $op = $op->next; |
| 379 | out_cond_jump $op->next->other; |
484 | out_cond_jump $op->other; |
| 380 | out_jump_next; |
485 | out_jump_next; |
| 381 | } |
486 | } |
| 382 | |
487 | |
| 383 | *op_mapstart = \&op_grepstart; |
488 | *op_mapstart = \&op_grepstart; |
| 384 | |
489 | |
| … | |
… | |
| 393 | my ($idx) = @_; |
498 | my ($idx) = @_; |
| 394 | |
499 | |
| 395 | out_callop; |
500 | out_callop; |
| 396 | |
501 | |
| 397 | out_cond_jump $_->[$idx] |
502 | out_cond_jump $_->[$idx] |
| 398 | for reverse @loop; |
503 | for reverse @op_loop; |
| 399 | |
504 | |
| 400 | $source .= " return nextop;\n"; |
505 | $source .= " return nextop;\n"; |
| 401 | } |
506 | } |
| 402 | |
507 | |
| 403 | sub xop_next { |
508 | sub xop_next { |
| … | |
… | |
| 413 | } |
518 | } |
| 414 | |
519 | |
| 415 | sub cv2c { |
520 | sub cv2c { |
| 416 | my ($cv) = @_; |
521 | my ($cv) = @_; |
| 417 | |
522 | |
| 418 | @loop = (); |
523 | local @ops; |
|
|
524 | local @op_loop; |
|
|
525 | local %op_regcomp; |
| 419 | |
526 | |
| 420 | my %opsseen; |
527 | my %opsseen; |
| 421 | my @todo = $cv->START; |
528 | my @todo = $cv->START; |
|
|
529 | my %op_target; |
|
|
530 | my $numpushmark; |
| 422 | |
531 | |
| 423 | while (my $op = shift @todo) { |
532 | while (my $op = shift @todo) { |
| 424 | for (; $$op; $op = $op->next) { |
533 | for (; $$op; $op = $op->next) { |
| 425 | last if $opsseen{$$op}++; |
534 | last if $opsseen{$$op}++; |
| 426 | push @ops, $op; |
|
|
| 427 | |
535 | |
| 428 | my $name = $op->name; |
536 | my $name = $op->name; |
| 429 | my $class = B::class $op; |
537 | my $class = B::class $op; |
| 430 | |
538 | |
|
|
539 | my $insn = { op => $op }; |
|
|
540 | |
|
|
541 | push @ops, $insn; |
|
|
542 | |
|
|
543 | if (exists $extend{$name}) { |
|
|
544 | my $extend = $extend{$name}; |
|
|
545 | $extend = $extend->($op) if ref $extend; |
|
|
546 | $insn->{extend} = $extend if defined $extend; |
|
|
547 | } |
|
|
548 | |
|
|
549 | push @todo, $op->next; |
|
|
550 | |
| 431 | if ($class eq "LOGOP") { |
551 | if ($class eq "LOGOP") { |
| 432 | unshift @todo, $op->other; # unshift vs. push saves jumps |
552 | push @todo, $op->other; |
|
|
553 | $op_target{${$op->other}}++; |
|
|
554 | |
|
|
555 | # regcomp/o patches ops at runtime, lets expect that |
|
|
556 | if ($name eq "regcomp" && $op->other->pmflags & B::PMf_KEEP) { |
|
|
557 | $op_target{${$op->first}}++; |
|
|
558 | $op_regcomp{${$op->first}} = $op->next; |
|
|
559 | } |
|
|
560 | |
| 433 | } elsif ($class eq "PMOP") { |
561 | } elsif ($class eq "PMOP") { |
|
|
562 | if (${$op->pmreplstart}) { |
| 434 | unshift @todo, $op->pmreplstart if ${$op->pmreplstart}; |
563 | unshift @todo, $op->pmreplstart; |
|
|
564 | $op_target{${$op->pmreplstart}}++; |
|
|
565 | } |
|
|
566 | |
| 435 | } elsif ($class eq "LOOP") { |
567 | } elsif ($class eq "LOOP") { |
| 436 | push @loop, [$op->nextop, $op->lastop->next, $op->redoop->next]; |
568 | my @targ = ($op->nextop, $op->lastop->next, $op->redoop->next); |
|
|
569 | |
|
|
570 | push @op_loop, \@targ; |
|
|
571 | push @todo, @targ; |
|
|
572 | |
|
|
573 | $op_target{$$_}++ for @targ; |
|
|
574 | |
|
|
575 | } elsif ($class eq "COP") { |
|
|
576 | $insn->{bblock}++ if defined $op->label; |
|
|
577 | |
|
|
578 | } else { |
|
|
579 | if ($name eq "pushmark") { |
|
|
580 | $numpushmark++; |
|
|
581 | } |
| 437 | } |
582 | } |
| 438 | } |
583 | } |
| 439 | } |
584 | } |
|
|
585 | |
|
|
586 | $_->{bblock}++ for grep $op_target{${$_->{op}}}, @ops; |
| 440 | |
587 | |
| 441 | local $source = <<EOF; |
588 | local $source = <<EOF; |
| 442 | OP *%%%FUNC%%% (pTHX) |
589 | OP *%%%FUNC%%% (pTHX) |
| 443 | { |
590 | { |
| 444 | register OP *nextop = (OP *)${$ops[0]}L; |
591 | register OP *nextop = (OP *)${$ops[0]->{op}}L; |
| 445 | EOF |
592 | EOF |
|
|
593 | |
|
|
594 | $source .= " faster_PUSHMARK_PREALLOC ($numpushmark);\n" |
|
|
595 | if $numpushmark; |
| 446 | |
596 | |
| 447 | while (@ops) { |
597 | while (@ops) { |
| 448 | $op = shift @ops; |
598 | $insn = shift @ops; |
|
|
599 | |
|
|
600 | $op = $insn->{op}; |
| 449 | $op_name = $op->name; |
601 | $op_name = $op->name; |
| 450 | |
602 | |
|
|
603 | my $class = B::class $op; |
|
|
604 | |
|
|
605 | $source .= "\n/* start basic block */\n" if exists $insn->{bblock};#d# |
| 451 | $source .= "op_$$op: /* $op_name */\n"; |
606 | $source .= "op_$$op: /* $op_name */\n"; |
| 452 | #$source .= "fprintf (stderr, \"$$op in op $op_name\\n\");\n";#d# |
607 | #$source .= "fprintf (stderr, \"$$op in op $op_name\\n\");\n";#d# |
| 453 | #$source .= "{ dSP; sv_dump (TOPs); }\n";#d# |
608 | #$source .= "{ dSP; sv_dump (TOPs); }\n";#d# |
| 454 | |
609 | |
| 455 | $source .= " PERL_ASYNC_CHECK ();\n" |
610 | $source .= " PERL_ASYNC_CHECK ();\n" |
| 456 | unless exists $flag{noasync}{$op_name}; |
611 | unless exists $f_noasync{$op_name}; |
| 457 | |
612 | |
| 458 | if (my $can = __PACKAGE__->can ("op_$op_name")) { |
613 | if (my $can = __PACKAGE__->can ("op_$op_name")) { |
| 459 | # handcrafted replacement |
614 | # handcrafted replacement |
|
|
615 | |
|
|
616 | if ($insn->{extend} > 0) { |
|
|
617 | # coalesce EXTENDs |
|
|
618 | # TODO: properly take negative preceeding and following EXTENDs into account |
|
|
619 | for my $i (@ops) { |
|
|
620 | last if exists $i->{bblock}; |
|
|
621 | last unless exists $i->{extend}; |
|
|
622 | my $extend = delete $i->{extend}; |
|
|
623 | $insn->{extend} += $extend if $extend > 0; |
|
|
624 | } |
|
|
625 | |
|
|
626 | $source .= " { dSP; EXTEND (SP, $insn->{extend}); PUTBACK; }\n" |
|
|
627 | if $insn->{extend} > 0; |
|
|
628 | } |
|
|
629 | |
| 460 | $can->($op); |
630 | $can->($op); |
| 461 | |
631 | |
| 462 | } elsif (exists $flag{unsafe}{$op_name}) { |
632 | } elsif (exists $f_unsafe{$op_name}) { |
| 463 | # unsafe, return to interpreter |
633 | # unsafe, return to interpreter |
| 464 | assert "nextop == (OP *)$$op"; |
634 | assert "nextop == (OP *)$$op"; |
| 465 | $source .= " return nextop;\n"; |
635 | $source .= " return nextop;\n"; |
| 466 | |
636 | |
| 467 | } elsif ("LOGOP" eq B::class $op) { |
637 | } elsif ("LOGOP" eq $class) { |
| 468 | # logical operation with optionaö branch |
638 | # logical operation with optional branch |
| 469 | out_callop; |
639 | out_callop; |
| 470 | out_cond_jump $op->other; |
640 | out_cond_jump $op->other; |
| 471 | out_jump_next; |
641 | out_jump_next; |
| 472 | |
642 | |
| 473 | } elsif ("PMOP" eq B::class $op) { |
643 | } elsif ("PMOP" eq $class) { |
| 474 | # regex-thingy |
644 | # regex-thingy |
| 475 | out_callop; |
645 | out_callop; |
| 476 | out_cond_jump $op->pmreplroot if ${$op->pmreplroot}; |
646 | out_cond_jump $op->pmreplroot if $op_name ne "pushre" && ${$op->pmreplroot}; |
| 477 | out_jump_next; |
647 | out_jump_next; |
| 478 | |
648 | |
| 479 | } else { |
649 | } else { |
| 480 | # normal operator, linear execution |
650 | # normal operator, linear execution |
| 481 | out_linear; |
651 | out_linear; |
| … | |
… | |
| 492 | #warn $source; |
662 | #warn $source; |
| 493 | |
663 | |
| 494 | $source |
664 | $source |
| 495 | } |
665 | } |
| 496 | |
666 | |
|
|
667 | my $uid = "aaaaaaa0"; |
|
|
668 | my %so; |
|
|
669 | |
| 497 | sub source2ptr { |
670 | sub func2ptr { |
| 498 | my ($source) = @_; |
671 | my (@func) = @_; |
| 499 | |
672 | |
| 500 | my $md5 = Digest::MD5::md5_hex $source; |
673 | #LOCK |
| 501 | $source =~ s/%%%FUNC%%%/Faster_$md5/; |
674 | mkdir $CACHEDIR, 0777; |
|
|
675 | sysopen my $meta_fh, "$CACHEDIR/meta", &Fcntl::O_RDWR | &Fcntl::O_CREAT, 0666 |
|
|
676 | or die "$$CACHEDIR/meta: $!"; |
|
|
677 | binmode $meta_fh, ":raw:perlio"; |
|
|
678 | fcntl_lock fileno $meta_fh |
|
|
679 | or die "$CACHEDIR/meta: $!"; |
| 502 | |
680 | |
| 503 | my $stem = "/tmp/$md5"; |
681 | my $meta = eval { Storable::fd_retrieve $meta_fh } || { version => 1 }; |
| 504 | |
682 | |
| 505 | unless (-e "$stem$_so") { |
683 | for my $f (@func) { |
|
|
684 | $f->{func} = "F" . Digest::MD5::md5_hex ($f->{source}); |
|
|
685 | $f->{so} = $meta->{$f->{func}}; |
|
|
686 | } |
|
|
687 | |
|
|
688 | if (grep !$_->{so}, @func) { |
|
|
689 | my $stem; |
|
|
690 | |
|
|
691 | do { |
|
|
692 | $stem = "$CACHEDIR/$$-" . $uid++; |
|
|
693 | } while -e "$stem$_so"; |
|
|
694 | |
| 506 | open FILE, ">:raw", "$stem.c"; |
695 | open my $fh, ">:raw", "$stem.c"; |
| 507 | print FILE <<EOF; |
696 | print $fh <<EOF; |
| 508 | #define PERL_NO_GET_CONTEXT |
697 | #define PERL_NO_GET_CONTEXT |
|
|
698 | #define PERL_CORE |
| 509 | |
699 | |
| 510 | #include <assert.h> |
700 | #include <assert.h> |
| 511 | |
701 | |
| 512 | #include "EXTERN.h" |
702 | #include "EXTERN.h" |
| 513 | #include "perl.h" |
703 | #include "perl.h" |
| 514 | #include "XSUB.h" |
704 | #include "XSUB.h" |
|
|
705 | |
|
|
706 | #if 1 |
|
|
707 | # define faster_PUSHMARK_PREALLOC(count) while (PL_markstack_ptr + (count) >= PL_markstack_max) markstack_grow () |
|
|
708 | # define faster_PUSHMARK(p) *++PL_markstack_ptr = (p) - PL_stack_base |
|
|
709 | #else |
|
|
710 | # define faster_PUSHMARK_PREALLOC(count) 1 |
|
|
711 | # define faster_PUSHMARK(p) PUSHMARK(p) |
|
|
712 | #endif |
| 515 | |
713 | |
| 516 | #define RUNOPS_TILL(op) \\ |
714 | #define RUNOPS_TILL(op) \\ |
| 517 | while (nextop != (op)) \\ |
715 | while (nextop != (op)) \\ |
| 518 | { \\ |
716 | { \\ |
| 519 | PERL_ASYNC_CHECK (); \\ |
717 | PERL_ASYNC_CHECK (); \\ |
| 520 | PL_op = nextop; nextop = (PL_op->op_ppaddr)(aTHX); \\ |
718 | PL_op = nextop; nextop = (PL_op->op_ppaddr)(aTHX); \\ |
| 521 | } |
719 | } |
| 522 | |
720 | |
| 523 | EOF |
721 | EOF |
|
|
722 | for my $f (grep !$_->{so}, @func) { |
|
|
723 | next if $f->{so} = $meta->{$f->{func}}; # some cv's alias others |
|
|
724 | |
|
|
725 | warn "compiling $f->{name} to $stem$_so:$f->{func}\n" if $verbose > 1; |
|
|
726 | my $source = $f->{source}; |
|
|
727 | $source =~ s/%%%FUNC%%%/$f->{func}/g; |
| 524 | print FILE $source; |
728 | print $fh $source; |
|
|
729 | $meta->{$f->{func}} = $f->{so} = $stem; |
|
|
730 | } |
|
|
731 | |
| 525 | close FILE; |
732 | close $fh; |
| 526 | system "$COMPILE -o $stem$_o $stem.c"; |
733 | system "$COMPILE -o $stem$_o $stem.c"; |
|
|
734 | unlink "$stem.c" unless $ENV{FASTER_DEBUG} > 0; |
| 527 | system "$LINK -o $stem$_so $stem$_o $LIBS"; |
735 | system "$LINK -o $stem$_so $stem$_o $LIBS"; |
|
|
736 | unlink "$stem$_o"; |
| 528 | } |
737 | } |
| 529 | |
738 | |
| 530 | # warn $source; |
739 | for my $f (@func) { |
|
|
740 | my $stem = $f->{so}; |
|
|
741 | |
| 531 | my $so = DynaLoader::dl_load_file "$stem$_so" |
742 | my $so = ($so{$stem} ||= DynaLoader::dl_load_file "$stem$_so") |
| 532 | or die "$stem$_so: $!"; |
743 | or die "$stem$_so: $!"; |
| 533 | |
744 | |
| 534 | DynaLoader::dl_find_symbol $so, "Faster_$md5" |
745 | #unlink "$stem$_so"; |
| 535 | or die "Faster_$md5: $!" |
746 | |
|
|
747 | $f->{ptr} = DynaLoader::dl_find_symbol $so, $f->{func} |
|
|
748 | or die "$f->{func} not found in $stem$_so: $!"; |
|
|
749 | } |
|
|
750 | |
|
|
751 | seek $meta_fh, 0, 0 or die "$CACHEDIR/meta: $!"; |
|
|
752 | Storable::nstore_fd $meta, $meta_fh; |
|
|
753 | truncate $meta_fh, tell $meta_fh; |
|
|
754 | |
|
|
755 | # UNLOCK (by closing $meta_fh) |
| 536 | } |
756 | } |
|
|
757 | |
|
|
758 | my %ignore; |
| 537 | |
759 | |
| 538 | sub entersub { |
760 | sub entersub { |
| 539 | my ($cv) = @_; |
761 | my ($cv) = @_; |
| 540 | |
762 | |
| 541 | # always compile the whole stash |
763 | my $pkg = $cv->STASH->NAME; |
| 542 | # my @stash = $cv->STASH->ARRAY; |
764 | |
| 543 | # warn join ":", @stash; |
765 | return if $ignore{$pkg}; |
| 544 | # exit; |
766 | |
|
|
767 | warn "optimising ", $cv->STASH->NAME, "\n" |
|
|
768 | if $verbose; |
| 545 | |
769 | |
| 546 | eval { |
770 | eval { |
|
|
771 | my @func; |
|
|
772 | |
|
|
773 | push @func, { |
|
|
774 | cv => $cv, |
|
|
775 | name => "<>", |
| 547 | my $source = cv2c $cv; |
776 | source => cv2c $cv, |
|
|
777 | }; |
| 548 | |
778 | |
| 549 | my $ptr = source2ptr $source; |
779 | # always compile the whole stash |
|
|
780 | my %stash = $cv->STASH->ARRAY; |
|
|
781 | while (my ($k, $v) = each %stash) { |
|
|
782 | $v->isa (B::GV::) |
|
|
783 | or next; |
| 550 | |
784 | |
|
|
785 | my $cv = $v->CV; |
|
|
786 | |
|
|
787 | if ($cv->isa (B::CV::) |
|
|
788 | && ${$cv->START} |
|
|
789 | && $cv->START->name ne "null") { |
|
|
790 | |
|
|
791 | push @func, { |
|
|
792 | cv => $cv, |
|
|
793 | name => $k, |
|
|
794 | source => cv2c $cv, |
|
|
795 | }; |
|
|
796 | } |
|
|
797 | } |
|
|
798 | |
|
|
799 | func2ptr @func; |
|
|
800 | |
|
|
801 | for my $f (@func) { |
| 551 | patch_cv $cv, $ptr; |
802 | patch_cv $f->{cv}, $f->{ptr}; |
|
|
803 | } |
| 552 | }; |
804 | }; |
| 553 | |
805 | |
| 554 | warn $@ if $@; |
806 | if ($@) { |
|
|
807 | $ignore{$pkg}++; |
|
|
808 | warn $@; |
|
|
809 | } |
| 555 | } |
810 | } |
| 556 | |
811 | |
| 557 | hook_entersub; |
812 | hook_entersub; |
| 558 | |
813 | |
| 559 | 1; |
814 | 1; |
|
|
815 | |
|
|
816 | =back |
|
|
817 | |
|
|
818 | =head1 ENVIRONMENT VARIABLES |
|
|
819 | |
|
|
820 | The following environment variables influence the behaviour of Faster: |
|
|
821 | |
|
|
822 | =over 4 |
|
|
823 | |
|
|
824 | =item FASTER_VERBOSE |
|
|
825 | |
|
|
826 | Faster will output more informational messages when set to values higher |
|
|
827 | than C<0>. Currently, C<1> outputs which packages are being compiled, C<3> |
|
|
828 | outputs the cache directory and C<10> outputs information on which perl |
|
|
829 | function is compiled into which shared object. |
|
|
830 | |
|
|
831 | =item FASTER_DEBUG |
|
|
832 | |
|
|
833 | Add debugging code when set to values higher than C<0>. Currently, this |
|
|
834 | adds 1-3 C<assert>'s per perl op (FASTER_DEBUG > 1), to ensure that opcode |
|
|
835 | order and C execution order are compatible. |
|
|
836 | |
|
|
837 | =item FASTER_CACHE |
|
|
838 | |
|
|
839 | Set a persistent cache directory that caches compiled code fragments. The |
|
|
840 | default is C<$HOME/.perl-faster-cache> if C<HOME> is set and a temporary |
|
|
841 | directory otherwise. |
|
|
842 | |
|
|
843 | This directory will always grow in size, so you might need to erase it |
|
|
844 | from time to time. |
| 560 | |
845 | |
| 561 | =back |
846 | =back |
| 562 | |
847 | |
| 563 | =head1 BUGS/LIMITATIONS |
848 | =head1 BUGS/LIMITATIONS |
| 564 | |
849 | |
| 565 | Perl will check much less often for asynchronous signals in |
850 | Perl will check much less often for asynchronous signals in |
| 566 | Faster-compiled code. It tries to check on every function call, loop |
851 | Faster-compiled code. It tries to check on every function call, loop |
| 567 | iteration and every I/O operator, though. |
852 | iteration and every I/O operator, though. |
| 568 | |
853 | |
| 569 | The following things will disable Faster. If you manage to enable them at |
854 | The following things will disable Faster. If you manage to enable them at |
| 570 | runtime, bad things will happen. |
855 | runtime, bad things will happen. Enabling them at startup will be fine, |
|
|
856 | though. |
| 571 | |
857 | |
| 572 | enabled tainting |
858 | enabled tainting |
| 573 | enabled debugging |
859 | enabled debugging |
| 574 | |
860 | |
| 575 | This will dramatically reduce Faster's performance: |
861 | Thread-enabled builds of perl will dramatically reduce Faster's |
|
|
862 | performance, but you don't care about speed if you enable threads anyway. |
| 576 | |
863 | |
| 577 | threads (but you don't care about speed if you use threads anyway) |
|
|
| 578 | |
|
|
| 579 | These constructs will force the use of the interpreter as soon as they are |
864 | These constructs will force the use of the interpreter for the currently |
| 580 | being executed, for the rest of the currently executed: |
865 | executed function as soon as they are being encountered during execution. |
| 581 | |
866 | |
| 582 | .., ... (flipflop operators) |
|
|
| 583 | goto |
867 | goto |
| 584 | next, redo (but not well-behaved last's) |
868 | next, redo (but not well-behaved last's) |
| 585 | eval |
869 | eval |
| 586 | require |
870 | require |
| 587 | any use of formats |
871 | any use of formats |
|
|
872 | .., ... (flipflop operators) |
| 588 | |
873 | |
| 589 | =head1 AUTHOR |
874 | =head1 AUTHOR |
| 590 | |
875 | |
| 591 | Marc Lehmann <schmorp@schmorp.de> |
876 | Marc Lehmann <schmorp@schmorp.de> |
| 592 | http://home.schmorp.de/ |
877 | http://home.schmorp.de/ |
