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