ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/AnyEvent-Fork/Fork.pm
(Generate patch)

Comparing AnyEvent-Fork/Fork.pm (file contents):
Revision 1.15 by root, Fri Apr 5 08:56:36 2013 UTC vs.
Revision 1.30 by root, Sat Apr 6 09:28:45 2013 UTC

4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 use AnyEvent::Fork; 7 use AnyEvent::Fork;
8 8
9 ################################################################## 9 AnyEvent::Fork
10 ->new
11 ->require ("MyModule")
12 ->run ("MyModule::server", my $cv = AE::cv);
13
14 my $fh = $cv->recv;
15
16=head1 DESCRIPTION
17
18This module allows you to create new processes, without actually forking
19them from your current process (avoiding the problems of forking), but
20preserving most of the advantages of fork.
21
22It can be used to create new worker processes or new independent
23subprocesses for short- and long-running jobs, process pools (e.g. for use
24in pre-forked servers) but also to spawn new external processes (such as
25CGI scripts from a web server), which can be faster (and more well behaved)
26than using fork+exec in big processes.
27
28Special care has been taken to make this module useful from other modules,
29while still supporting specialised environments such as L<App::Staticperl>
30or L<PAR::Packer>.
31
32=head1 WHAT THIS MODULE IS NOT
33
34This module only creates processes and lets you pass file handles and
35strings to it, and run perl code. It does not implement any kind of RPC -
36there is no back channel from the process back to you, and there is no RPC
37or message passing going on.
38
39If you need some form of RPC, you can either implement it yourself
40in whatever way you like, use some message-passing module such
41as L<AnyEvent::MP>, some pipe such as L<AnyEvent::ZeroMQ>, use
42L<AnyEvent::Handle> on both sides to send e.g. JSON or Storable messages,
43and so on.
44
45=head1 PROBLEM STATEMENT
46
47There are two traditional ways to implement parallel processing on UNIX
48like operating systems - fork and process, and fork+exec and process. They
49have different advantages and disadvantages that I describe below,
50together with how this module tries to mitigate the disadvantages.
51
52=over 4
53
54=item Forking from a big process can be very slow.
55
56A 5GB process needs 0.05s to fork on my 3.6GHz amd64 GNU/Linux box. This
57overhead is often shared with exec (because you have to fork first), but
58in some circumstances (e.g. when vfork is used), fork+exec can be much
59faster.
60
61This module can help here by telling a small(er) helper process to fork,
62which is faster then forking the main process, and also uses vfork where
63possible. This gives the speed of vfork, with the flexibility of fork.
64
65=item Forking usually creates a copy-on-write copy of the parent
66process.
67
68For example, modules or data files that are loaded will not use additional
69memory after a fork. When exec'ing a new process, modules and data files
70might need to be loaded again, at extra CPU and memory cost. But when
71forking, literally all data structures are copied - if the program frees
72them and replaces them by new data, the child processes will retain the
73old version even if it isn't used, which can suddenly and unexpectedly
74increase memory usage when freeing memory.
75
76The trade-off is between more sharing with fork (which can be good or
77bad), and no sharing with exec.
78
79This module allows the main program to do a controlled fork, and allows
80modules to exec processes safely at any time. When creating a custom
81process pool you can take advantage of data sharing via fork without
82risking to share large dynamic data structures that will blow up child
83memory usage.
84
85In other words, this module puts you into control over what is being
86shared and what isn't, at all times.
87
88=item Exec'ing a new perl process might be difficult.
89
90For example, it is not easy to find the correct path to the perl
91interpreter - C<$^X> might not be a perl interpreter at all.
92
93This module tries hard to identify the correct path to the perl
94interpreter. With a cooperative main program, exec'ing the interpreter
95might not even be necessary, but even without help from the main program,
96it will still work when used from a module.
97
98=item Exec'ing a new perl process might be slow, as all necessary modules
99have to be loaded from disk again, with no guarantees of success.
100
101Long running processes might run into problems when perl is upgraded
102and modules are no longer loadable because they refer to a different
103perl version, or parts of a distribution are newer than the ones already
104loaded.
105
106This module supports creating pre-initialised perl processes to be used as
107a template for new processes.
108
109=item Forking might be impossible when a program is running.
110
111For example, POSIX makes it almost impossible to fork from a
112multi-threaded program while doing anything useful in the child - in
113fact, if your perl program uses POSIX threads (even indirectly via
114e.g. L<IO::AIO> or L<threads>), you cannot call fork on the perl level
115anymore without risking corruption issues on a number of operating
116systems.
117
118This module can safely fork helper processes at any time, by calling
119fork+exec in C, in a POSIX-compatible way (via L<Proc::FastSpawn>).
120
121=item Parallel processing with fork might be inconvenient or difficult
122to implement. Modules might not work in both parent and child.
123
124For example, when a program uses an event loop and creates watchers it
125becomes very hard to use the event loop from a child program, as the
126watchers already exist but are only meaningful in the parent. Worse, a
127module might want to use such a module, not knowing whether another module
128or the main program also does, leading to problems.
129
130Apart from event loops, graphical toolkits also commonly fall into the
131"unsafe module" category, or just about anything that communicates with
132the external world, such as network libraries and file I/O modules, which
133usually don't like being copied and then allowed to continue in two
134processes.
135
136With this module only the main program is allowed to create new processes
137by forking (because only the main program can know when it is still safe
138to do so) - all other processes are created via fork+exec, which makes it
139possible to use modules such as event loops or window interfaces safely.
140
141=back
142
143=head1 EXAMPLES
144
10 # create a single new process, tell it to run your worker function 145=head2 Create a single new process, tell it to run your worker function.
11 146
12 AnyEvent::Fork 147 AnyEvent::Fork
13 ->new 148 ->new
14 ->require ("MyModule") 149 ->require ("MyModule")
15 ->run ("MyModule::worker, sub { 150 ->run ("MyModule::worker, sub {
17 152
18 # now $master_filehandle is connected to the 153 # now $master_filehandle is connected to the
19 # $slave_filehandle in the new process. 154 # $slave_filehandle in the new process.
20 }); 155 });
21 156
22 # MyModule::worker might look like this 157MyModule::worker might look like this:
158
23 sub MyModule::worker { 159 sub MyModule::worker {
24 my ($slave_filehandle) = @_; 160 my ($slave_filehandle) = @_;
25 161
26 # now $slave_filehandle is connected to the $master_filehandle 162 # now $slave_filehandle is connected to the $master_filehandle
27 # in the original prorcess. have fun! 163 # in the original prorcess. have fun!
28 } 164 }
29 165
30 ##################################################################
31 # create a pool of server processes all accepting on the same socket 166=head2 Create a pool of server processes all accepting on the same socket.
32 167
33 # create listener socket 168 # create listener socket
34 my $listener = ...; 169 my $listener = ...;
35 170
36 # create a pool template, initialise it and give it the socket 171 # create a pool template, initialise it and give it the socket
48 } 183 }
49 184
50 # now do other things - maybe use the filehandle provided by run 185 # now do other things - maybe use the filehandle provided by run
51 # to wait for the processes to die. or whatever. 186 # to wait for the processes to die. or whatever.
52 187
53 # My::Server::run might look like this 188My::Server::run might look like this:
189
54 sub My::Server::run { 190 sub My::Server::run {
55 my ($slave, $listener, $id) = @_; 191 my ($slave, $listener, $id) = @_;
56 192
57 close $slave; # we do not use the socket, so close it to save resources 193 close $slave; # we do not use the socket, so close it to save resources
58 194
61 while (my $socket = $listener->accept) { 197 while (my $socket = $listener->accept) {
62 # do sth. with new socket 198 # do sth. with new socket
63 } 199 }
64 } 200 }
65 201
66=head1 DESCRIPTION 202=head2 use AnyEvent::Fork as a faster fork+exec
67 203
68This module allows you to create new processes, without actually forking 204This runs /bin/echo hi, with stdout redirected to /tmp/log and stderr to
69them from your current process (avoiding the problems of forking), but 205the communications socket. It is usually faster than fork+exec, but still
70preserving most of the advantages of fork. 206let's you prepare the environment.
71 207
72It can be used to create new worker processes or new independent 208 open my $output, ">/tmp/log" or die "$!";
73subprocesses for short- and long-running jobs, process pools (e.g. for use
74in pre-forked servers) but also to spawn new external processes (such as
75CGI scripts from a webserver), which can be faster (and more well behaved)
76than using fork+exec in big processes.
77 209
78Special care has been taken to make this module useful from other modules, 210 AnyEvent::Fork
79while still supporting specialised environments such as L<App::Staticperl> 211 ->new
80or L<PAR::Packer>. 212 ->eval ('
213 sub run {
214 my ($fh, $output, @cmd) = @_;
81 215
82=head1 PROBLEM STATEMENT 216 # perl will clear close-on-exec on STDOUT/STDERR
217 open STDOUT, ">&", $output or die;
218 open STDERR, ">&", $fh or die;
83 219
84There are two ways to implement parallel processing on UNIX like operating 220 exec @cmd;
85systems - fork and process, and fork+exec and process. They have different 221 }
86advantages and disadvantages that I describe below, together with how this 222 ')
87module tries to mitigate the disadvantages. 223 ->send_fh ($output)
224 ->send_arg ("/bin/echo", "hi")
225 ->run ("run", my $cv = AE::cv);
88 226
89=over 4 227 my $stderr = $cv->recv;
90
91=item Forking from a big process can be very slow (a 5GB process needs
920.05s to fork on my 3.6GHz amd64 GNU/Linux box for example). This overhead
93is often shared with exec (because you have to fork first), but in some
94circumstances (e.g. when vfork is used), fork+exec can be much faster.
95
96This module can help here by telling a small(er) helper process to fork,
97or fork+exec instead.
98
99=item Forking usually creates a copy-on-write copy of the parent
100process. Memory (for example, modules or data files that have been
101will not take additional memory). When exec'ing a new process, modules
102and data files might need to be loaded again, at extra cpu and memory
103cost. Likewise when forking, all data structures are copied as well - if
104the program frees them and replaces them by new data, the child processes
105will retain the memory even if it isn't used.
106
107This module allows the main program to do a controlled fork, and allows
108modules to exec processes safely at any time. When creating a custom
109process pool you can take advantage of data sharing via fork without
110risking to share large dynamic data structures that will blow up child
111memory usage.
112
113=item Exec'ing a new perl process might be difficult and slow. For
114example, it is not easy to find the correct path to the perl interpreter,
115and all modules have to be loaded from disk again. Long running processes
116might run into problems when perl is upgraded for example.
117
118This module supports creating pre-initialised perl processes to be used
119as template, and also tries hard to identify the correct path to the perl
120interpreter. With a cooperative main program, exec'ing the interpreter
121might not even be necessary.
122
123=item Forking might be impossible when a program is running. For example,
124POSIX makes it almost impossible to fork from a multithreaded program and
125do anything useful in the child - strictly speaking, if your perl program
126uses posix threads (even indirectly via e.g. L<IO::AIO> or L<threads>),
127you cannot call fork on the perl level anymore, at all.
128
129This module can safely fork helper processes at any time, by caling
130fork+exec in C, in a POSIX-compatible way.
131
132=item Parallel processing with fork might be inconvenient or difficult
133to implement. For example, when a program uses an event loop and creates
134watchers it becomes very hard to use the event loop from a child
135program, as the watchers already exist but are only meaningful in the
136parent. Worse, a module might want to use such a system, not knowing
137whether another module or the main program also does, leading to problems.
138
139This module only lets the main program create pools by forking (because
140only the main program can know when it is still safe to do so) - all other
141pools are created by fork+exec, after which such modules can again be
142loaded.
143
144=back
145 228
146=head1 CONCEPTS 229=head1 CONCEPTS
147 230
148This module can create new processes either by executing a new perl 231This module can create new processes either by executing a new perl
149process, or by forking from an existing "template" process. 232process, or by forking from an existing "template" process.
166needed the first time. Forking from this process shares the memory used 249needed the first time. Forking from this process shares the memory used
167for the perl interpreter with the new process, but loading modules takes 250for the perl interpreter with the new process, but loading modules takes
168time, and the memory is not shared with anything else. 251time, and the memory is not shared with anything else.
169 252
170This is ideal for when you only need one extra process of a kind, with the 253This is ideal for when you only need one extra process of a kind, with the
171option of starting and stipping it on demand. 254option of starting and stopping it on demand.
172 255
173Example: 256Example:
174 257
175 AnyEvent::Fork 258 AnyEvent::Fork
176 ->new 259 ->new
191modules you loaded) is shared between the processes, and each new process 274modules you loaded) is shared between the processes, and each new process
192consumes relatively little memory of its own. 275consumes relatively little memory of its own.
193 276
194The disadvantage of this approach is that you need to create a template 277The disadvantage of this approach is that you need to create a template
195process for the sole purpose of forking new processes from it, but if you 278process for the sole purpose of forking new processes from it, but if you
196only need a fixed number of proceses you can create them, and then destroy 279only need a fixed number of processes you can create them, and then destroy
197the template process. 280the template process.
198 281
199Example: 282Example:
200 283
201 my $template = AnyEvent::Fork->new->require ("Some::Module"); 284 my $template = AnyEvent::Fork->new->require ("Some::Module");
228 my ($fork_fh) = @_; 311 my ($fork_fh) = @_;
229 }); 312 });
230 313
231=back 314=back
232 315
233=head1 FUNCTIONS 316=head1 THE C<AnyEvent::Fork> CLASS
317
318This module exports nothing, and only implements a single class -
319C<AnyEvent::Fork>.
320
321There are two class constructors that both create new processes - C<new>
322and C<new_exec>. The C<fork> method creates a new process by forking an
323existing one and could be considered a third constructor.
324
325Most of the remaining methods deal with preparing the new process, by
326loading code, evaluating code and sending data to the new process. They
327usually return the process object, so you can chain method calls.
328
329If a process object is destroyed before calling its C<run> method, then
330the process simply exits. After C<run> is called, all responsibility is
331passed to the specified function.
332
333As long as there is any outstanding work to be done, process objects
334resist being destroyed, so there is no reason to store them unless you
335need them later - configure and forget works just fine.
234 336
235=over 4 337=over 4
236 338
237=cut 339=cut
238 340
239package AnyEvent::Fork; 341package AnyEvent::Fork;
240 342
241use common::sense; 343use common::sense;
242 344
243use Socket (); 345use Errno ();
244 346
245use AnyEvent; 347use AnyEvent;
246use AnyEvent::Util (); 348use AnyEvent::Util ();
247 349
248use IO::FDPass; 350use IO::FDPass;
249 351
250our $VERSION = 0.2; 352our $VERSION = 0.5;
251 353
252our $PERL; # the path to the perl interpreter, deduces with various forms of magic 354our $PERL; # the path to the perl interpreter, deduces with various forms of magic
253
254=item my $pool = new AnyEvent::Fork key => value...
255
256Create a new process pool. The following named parameters are supported:
257 355
258=over 4 356=over 4
259 357
260=back 358=back
261 359
268our $TEMPLATE; 366our $TEMPLATE;
269 367
270sub _cmd { 368sub _cmd {
271 my $self = shift; 369 my $self = shift;
272 370
273 #TODO: maybe append the packet to any existing string command already in the queue
274
275 # ideally, we would want to use "a (w/a)*" as format string, but perl versions 371 # ideally, we would want to use "a (w/a)*" as format string, but perl
276 # from at least 5.8.9 to 5.16.3 are all buggy and can't unpack it. 372 # versions from at least 5.8.9 to 5.16.3 are all buggy and can't unpack
277 push @{ $self->[2] }, pack "N/a*", pack "(w/a*)*", @_; 373 # it.
374 push @{ $self->[2] }, pack "a L/a*", $_[0], $_[1];
278 375
279 $self->[3] ||= AE::io $self->[1], 1, sub { 376 $self->[3] ||= AE::io $self->[1], 1, sub {
377 do {
280 # send the next "thing" in the queue - either a reference to an fh, 378 # send the next "thing" in the queue - either a reference to an fh,
281 # or a plain string. 379 # or a plain string.
282 380
283 if (ref $self->[2][0]) { 381 if (ref $self->[2][0]) {
284 # send fh 382 # send fh
285 IO::FDPass::send fileno $self->[1], fileno ${ $self->[2][0] } 383 unless (IO::FDPass::send fileno $self->[1], fileno ${ $self->[2][0] }) {
384 return if $! == Errno::EAGAIN || $! == Errno::EWOULDBLOCK;
385 undef $self->[3];
386 die "AnyEvent::Fork: file descriptor send failure: $!";
387 }
388
286 and shift @{ $self->[2] }; 389 shift @{ $self->[2] };
287 390
288 } else { 391 } else {
289 # send string 392 # send string
290 my $len = syswrite $self->[1], $self->[2][0] 393 my $len = syswrite $self->[1], $self->[2][0];
394
395 unless ($len) {
396 return if $! == Errno::EAGAIN || $! == Errno::EWOULDBLOCK;
397 undef $self->[3];
291 or do { undef $self->[3]; die "AnyEvent::Fork: command write failure: $!" }; 398 die "AnyEvent::Fork: command write failure: $!";
399 }
292 400
293 substr $self->[2][0], 0, $len, ""; 401 substr $self->[2][0], 0, $len, "";
294 shift @{ $self->[2] } unless length $self->[2][0]; 402 shift @{ $self->[2] } unless length $self->[2][0];
295 } 403 }
404 } while @{ $self->[2] };
296 405
297 unless (@{ $self->[2] }) { 406 # everything written
298 undef $self->[3]; 407 undef $self->[3];
408
299 # invoke run callback 409 # invoke run callback, if any
300 $self->[0]->($self->[1]) if $self->[0]; 410 $self->[4]->($self->[1]) if $self->[4];
301 }
302 }; 411 };
303 412
304 () # make sure we don't leak the watcher 413 () # make sure we don't leak the watcher
305} 414}
306 415
307sub _new { 416sub _new {
308 my ($self, $fh) = @_; 417 my ($self, $fh, $pid) = @_;
309 418
310 AnyEvent::Util::fh_nonblocking $fh, 1; 419 AnyEvent::Util::fh_nonblocking $fh, 1;
311 420
312 $self = bless [ 421 $self = bless [
313 undef, # run callback 422 $pid,
314 $fh, 423 $fh,
315 [], # write queue - strings or fd's 424 [], # write queue - strings or fd's
316 undef, # AE watcher 425 undef, # AE watcher
317 ], $self; 426 ], $self;
318 427
329 if ($pid eq 0) { 438 if ($pid eq 0) {
330 require AnyEvent::Fork::Serve; 439 require AnyEvent::Fork::Serve;
331 $AnyEvent::Fork::Serve::OWNER = $parent; 440 $AnyEvent::Fork::Serve::OWNER = $parent;
332 close $fh; 441 close $fh;
333 $0 = "$_[1] of $parent"; 442 $0 = "$_[1] of $parent";
443 $SIG{CHLD} = 'IGNORE';
334 AnyEvent::Fork::Serve::serve ($slave); 444 AnyEvent::Fork::Serve::serve ($slave);
335 exit 0; 445 exit 0;
336 } elsif (!$pid) { 446 } elsif (!$pid) {
337 die "AnyEvent::Fork::Early/Template: unable to fork template process: $!"; 447 die "AnyEvent::Fork::Early/Template: unable to fork template process: $!";
338 } 448 }
339 449
340 AnyEvent::Fork->_new ($fh) 450 AnyEvent::Fork->_new ($fh, $pid)
341} 451}
342 452
343=item my $proc = new AnyEvent::Fork 453=item my $proc = new AnyEvent::Fork
344 454
345Create a new "empty" perl interpreter process and returns its process 455Create a new "empty" perl interpreter process and returns its process
346object for further manipulation. 456object for further manipulation.
347 457
348The new process is forked from a template process that is kept around 458The new process is forked from a template process that is kept around
349for this purpose. When it doesn't exist yet, it is created by a call to 459for this purpose. When it doesn't exist yet, it is created by a call to
350C<new_exec> and kept around for future calls. 460C<new_exec> first and then stays around for future calls.
351
352When the process object is destroyed, it will release the file handle
353that connects it with the new process. When the new process has not yet
354called C<run>, then the process will exit. Otherwise, what happens depends
355entirely on the code that is executed.
356 461
357=cut 462=cut
358 463
359sub new { 464sub new {
360 my $class = shift; 465 my $class = shift;
396reduces the amount of memory sharing that is possible, and is also slower. 501reduces the amount of memory sharing that is possible, and is also slower.
397 502
398You should use C<new> whenever possible, except when having a template 503You should use C<new> whenever possible, except when having a template
399process around is unacceptable. 504process around is unacceptable.
400 505
401The path to the perl interpreter is divined usign various methods - first 506The path to the perl interpreter is divined using various methods - first
402C<$^X> is investigated to see if the path ends with something that sounds 507C<$^X> is investigated to see if the path ends with something that sounds
403as if it were the perl interpreter. Failing this, the module falls back to 508as if it were the perl interpreter. Failing this, the module falls back to
404using C<$Config::Config{perlpath}>. 509using C<$Config::Config{perlpath}>.
405 510
406=cut 511=cut
438 # quick. also doesn't work in win32. of course. what did you expect 543 # quick. also doesn't work in win32. of course. what did you expect
439 #local $ENV{PERL5LIB} = join ":", grep !ref, @INC; 544 #local $ENV{PERL5LIB} = join ":", grep !ref, @INC;
440 my %env = %ENV; 545 my %env = %ENV;
441 $env{PERL5LIB} = join +($^O eq "MSWin32" ? ";" : ":"), grep !ref, @INC; 546 $env{PERL5LIB} = join +($^O eq "MSWin32" ? ";" : ":"), grep !ref, @INC;
442 547
443 Proc::FastSpawn::spawn ( 548 my $pid = Proc::FastSpawn::spawn (
444 $perl, 549 $perl,
445 ["perl", "-MAnyEvent::Fork::Serve", "-e", "AnyEvent::Fork::Serve::me", fileno $slave, $$], 550 ["perl", "-MAnyEvent::Fork::Serve", "-e", "AnyEvent::Fork::Serve::me", fileno $slave, $$],
446 [map "$_=$env{$_}", keys %env], 551 [map "$_=$env{$_}", keys %env],
447 ) or die "unable to spawn AnyEvent::Fork server: $!"; 552 ) or die "unable to spawn AnyEvent::Fork server: $!";
448 553
449 $self->_new ($fh) 554 $self->_new ($fh, $pid)
555}
556
557=item $pid = $proc->pid
558
559Returns the process id of the process I<iff it is a direct child of the
560process> running AnyEvent::Fork, and C<undef> otherwise.
561
562Normally, only processes created via C<< AnyEvent::Fork->new_exec >> and
563L<AnyEvent::Fork::Template> are direct children, and you are responsible
564to clean up their zombies when they die.
565
566All other processes are not direct children, and will be cleaned up by
567AnyEvent::Fork itself.
568
569=cut
570
571sub pid {
572 $_[0][0]
450} 573}
451 574
452=item $proc = $proc->eval ($perlcode, @args) 575=item $proc = $proc->eval ($perlcode, @args)
453 576
454Evaluates the given C<$perlcode> as ... perl code, while setting C<@_> to 577Evaluates the given C<$perlcode> as ... perl code, while setting C<@_> to
455the strings specified by C<@args>. 578the strings specified by C<@args>, in the "main" package.
456 579
457This call is meant to do any custom initialisation that might be required 580This call is meant to do any custom initialisation that might be required
458(for example, the C<require> method uses it). It's not supposed to be used 581(for example, the C<require> method uses it). It's not supposed to be used
459to completely take over the process, use C<run> for that. 582to completely take over the process, use C<run> for that.
460 583
461The code will usually be executed after this call returns, and there is no 584The code will usually be executed after this call returns, and there is no
462way to pass anything back to the calling process. Any evaluation errors 585way to pass anything back to the calling process. Any evaluation errors
463will be reported to stderr and cause the process to exit. 586will be reported to stderr and cause the process to exit.
464 587
588If you want to execute some code to take over the process (see the
589"fork+exec" example in the SYNOPSIS), you should compile a function via
590C<eval> first, and then call it via C<run>. This also gives you access to
591any arguments passed via the C<send_xxx> methods, such as file handles.
592
465Returns the process object for easy chaining of method calls. 593Returns the process object for easy chaining of method calls.
466 594
467=cut 595=cut
468 596
469sub eval { 597sub eval {
470 my ($self, $code, @args) = @_; 598 my ($self, $code, @args) = @_;
471 599
472 $self->_cmd (e => $code, @args); 600 $self->_cmd (e => pack "(w/a*)*", $code, @args);
473 601
474 $self 602 $self
475} 603}
476 604
477=item $proc = $proc->require ($module, ...) 605=item $proc = $proc->require ($module, ...)
501accomplished by simply not storing the file handles anywhere after passing 629accomplished by simply not storing the file handles anywhere after passing
502them to this method. 630them to this method.
503 631
504Returns the process object for easy chaining of method calls. 632Returns the process object for easy chaining of method calls.
505 633
506Example: pass an fh to a process, and release it without closing. it will 634Example: pass a file handle to a process, and release it without
507be closed automatically when it is no longer used. 635closing. It will be closed automatically when it is no longer used.
508 636
509 $proc->send_fh ($my_fh); 637 $proc->send_fh ($my_fh);
510 undef $my_fh; # free the reference if you want, but DO NOT CLOSE IT 638 undef $my_fh; # free the reference if you want, but DO NOT CLOSE IT
511 639
512=cut 640=cut
525=item $proc = $proc->send_arg ($string, ...) 653=item $proc = $proc->send_arg ($string, ...)
526 654
527Send one or more argument strings to the process, to prepare a call to 655Send one or more argument strings to the process, to prepare a call to
528C<run>. The strings can be any octet string. 656C<run>. The strings can be any octet string.
529 657
658The protocol is optimised to pass a moderate number of relatively short
659strings - while you can pass up to 4GB of data in one go, this is more
660meant to pass some ID information or other startup info, not big chunks of
661data.
662
530Returns the process object for easy chaining of emthod calls. 663Returns the process object for easy chaining of method calls.
531 664
532=cut 665=cut
533 666
534sub send_arg { 667sub send_arg {
535 my ($self, @arg) = @_; 668 my ($self, @arg) = @_;
536 669
537 $self->_cmd (a => @arg); 670 $self->_cmd (a => pack "(w/a*)*", @arg);
538 671
539 $self 672 $self
540} 673}
541 674
542=item $proc->run ($func, $cb->($fh)) 675=item $proc->run ($func, $cb->($fh))
543 676
544Enter the function specified by the fully qualified name in C<$func> in 677Enter the function specified by the function name in C<$func> in the
545the process. The function is called with the communication socket as first 678process. The function is called with the communication socket as first
546argument, followed by all file handles and string arguments sent earlier 679argument, followed by all file handles and string arguments sent earlier
547via C<send_fh> and C<send_arg> methods, in the order they were called. 680via C<send_fh> and C<send_arg> methods, in the order they were called.
548 681
549If the called function returns, the process exits. 682The function name should be fully qualified, but if it isn't, it will be
683looked up in the main package.
550 684
551Preparing the process can take time - when the process is ready, the 685If the called function returns, doesn't exist, or any error occurs, the
686process exits.
687
688Preparing the process is done in the background - when all commands have
552callback is invoked with the local communications socket as argument. 689been sent, the callback is invoked with the local communications socket
690as argument. At this point you can start using the socket in any way you
691like.
553 692
554The process object becomes unusable on return from this function. 693The process object becomes unusable on return from this function - any
694further method calls result in undefined behaviour.
555 695
556If the communication socket isn't used, it should be closed on both sides, 696If the communication socket isn't used, it should be closed on both sides,
557to save on kernel memory. 697to save on kernel memory.
558 698
559The socket is non-blocking in the parent, and blocking in the newly 699The socket is non-blocking in the parent, and blocking in the newly
560created process. The close-on-exec flag is set on both. Even if not used 700created process. The close-on-exec flag is set in both.
701
561otherwise, the socket can be a good indicator for the existance of the 702Even if not used otherwise, the socket can be a good indicator for the
562process - if the other process exits, you get a readable event on it, 703existence of the process - if the other process exits, you get a readable
563because exiting the process closes the socket (if it didn't create any 704event on it, because exiting the process closes the socket (if it didn't
564children using fork). 705create any children using fork).
565 706
566Example: create a template for a process pool, pass a few strings, some 707Example: create a template for a process pool, pass a few strings, some
567file handles, then fork, pass one more string, and run some code. 708file handles, then fork, pass one more string, and run some code.
568 709
569 my $pool = AnyEvent::Fork 710 my $pool = AnyEvent::Fork
577 ->send_arg ("str3") 718 ->send_arg ("str3")
578 ->run ("Some::function", sub { 719 ->run ("Some::function", sub {
579 my ($fh) = @_; 720 my ($fh) = @_;
580 721
581 # fh is nonblocking, but we trust that the OS can accept these 722 # fh is nonblocking, but we trust that the OS can accept these
582 # extra 3 octets anyway. 723 # few octets anyway.
583 syswrite $fh, "hi #$_\n"; 724 syswrite $fh, "hi #$_\n";
584 725
585 # $fh is being closed here, as we don't store it anywhere 726 # $fh is being closed here, as we don't store it anywhere
586 }); 727 });
587 } 728 }
589 # Some::function might look like this - all parameters passed before fork 730 # Some::function might look like this - all parameters passed before fork
590 # and after will be passed, in order, after the communications socket. 731 # and after will be passed, in order, after the communications socket.
591 sub Some::function { 732 sub Some::function {
592 my ($fh, $str1, $str2, $fh1, $fh2, $str3) = @_; 733 my ($fh, $str1, $str2, $fh1, $fh2, $str3) = @_;
593 734
594 print scalar <$fh>; # prints "hi 1\n" and "hi 2\n" 735 print scalar <$fh>; # prints "hi #1\n" and "hi #2\n" in any order
595 } 736 }
596 737
597=cut 738=cut
598 739
599sub run { 740sub run {
600 my ($self, $func, $cb) = @_; 741 my ($self, $func, $cb) = @_;
601 742
602 $self->[0] = $cb; 743 $self->[4] = $cb;
603 $self->_cmd (r => $func); 744 $self->_cmd (r => $func);
604} 745}
605 746
606=back 747=back
748
749=head1 PERFORMANCE
750
751Now for some unscientific benchmark numbers (all done on an amd64
752GNU/Linux box). These are intended to give you an idea of the relative
753performance you can expect, they are not meant to be absolute performance
754numbers.
755
756OK, so, I ran a simple benchmark that creates a socket pair, forks, calls
757exit in the child and waits for the socket to close in the parent. I did
758load AnyEvent, EV and AnyEvent::Fork, for a total process size of 5100kB.
759
760 2079 new processes per second, using manual socketpair + fork
761
762Then I did the same thing, but instead of calling fork, I called
763AnyEvent::Fork->new->run ("CORE::exit") and then again waited for the
764socket form the child to close on exit. This does the same thing as manual
765socket pair + fork, except that what is forked is the template process
766(2440kB), and the socket needs to be passed to the server at the other end
767of the socket first.
768
769 2307 new processes per second, using AnyEvent::Fork->new
770
771And finally, using C<new_exec> instead C<new>, using vforks+execs to exec
772a new perl interpreter and compile the small server each time, I get:
773
774 479 vfork+execs per second, using AnyEvent::Fork->new_exec
775
776So how can C<< AnyEvent->new >> be faster than a standard fork, even
777though it uses the same operations, but adds a lot of overhead?
778
779The difference is simply the process size: forking the 6MB process takes
780so much longer than forking the 2.5MB template process that the overhead
781introduced is canceled out.
782
783If the benchmark process grows, the normal fork becomes even slower:
784
785 1340 new processes, manual fork in a 20MB process
786 731 new processes, manual fork in a 200MB process
787 235 new processes, manual fork in a 2000MB process
788
789What that means (to me) is that I can use this module without having a
790very bad conscience because of the extra overhead required to start new
791processes.
607 792
608=head1 TYPICAL PROBLEMS 793=head1 TYPICAL PROBLEMS
609 794
610This section lists typical problems that remain. I hope by recognising 795This section lists typical problems that remain. I hope by recognising
611them, most can be avoided. 796them, most can be avoided.
618process. While perl itself laudably sets the close-on-exec flags on new 803process. While perl itself laudably sets the close-on-exec flags on new
619file handles, most C libraries don't care, and even if all cared, it's 804file handles, most C libraries don't care, and even if all cared, it's
620often not possible to set the flag in a race-free manner. 805often not possible to set the flag in a race-free manner.
621 806
622That means some file descriptors can leak through. And since it isn't 807That means some file descriptors can leak through. And since it isn't
623possible to know which file descriptors are "good" and "neccessary" (or 808possible to know which file descriptors are "good" and "necessary" (or
624even to know which file descreiptors are open), there is no good way to 809even to know which file descriptors are open), there is no good way to
625close the ones that might harm. 810close the ones that might harm.
626 811
627As an example of what "harm" can be done consider a web server that 812As an example of what "harm" can be done consider a web server that
628accepts connections and afterwards some module uses AnyEvent::Fork for the 813accepts connections and afterwards some module uses AnyEvent::Fork for the
629first time, causing it to fork and exec a new process, which might inherit 814first time, causing it to fork and exec a new process, which might inherit
637well before many random file descriptors are open. 822well before many random file descriptors are open.
638 823
639In general, the solution for these kind of problems is to fix the 824In general, the solution for these kind of problems is to fix the
640libraries or the code that leaks those file descriptors. 825libraries or the code that leaks those file descriptors.
641 826
642Fortunately, most of these lekaed descriptors do no harm, other than 827Fortunately, most of these leaked descriptors do no harm, other than
643sitting on some resources. 828sitting on some resources.
644 829
645=item "leaked" file descriptors for fork'ed processes 830=item "leaked" file descriptors for fork'ed processes
646 831
647Normally, L<AnyEvent::Fork> does start new processes by exec'ing them, 832Normally, L<AnyEvent::Fork> does start new processes by exec'ing them,
659 844
660The solution is to either not load these modules before use'ing 845The solution is to either not load these modules before use'ing
661L<AnyEvent::Fork::Early> or L<AnyEvent::Fork::Template>, or to delay 846L<AnyEvent::Fork::Early> or L<AnyEvent::Fork::Template>, or to delay
662initialising them, for example, by calling C<init Gtk2> manually. 847initialising them, for example, by calling C<init Gtk2> manually.
663 848
849=item exit runs destructors
850
851This only applies to users of Lc<AnyEvent::Fork:Early> and
852L<AnyEvent::Fork::Template>.
853
854When a process created by AnyEvent::Fork exits, it might do so by calling
855exit, or simply letting perl reach the end of the program. At which point
856Perl runs all destructors.
857
858Not all destructors are fork-safe - for example, an object that represents
859the connection to an X display might tell the X server to free resources,
860which is inconvenient when the "real" object in the parent still needs to
861use them.
862
863This is obviously not a problem for L<AnyEvent::Fork::Early>, as you used
864it as the very first thing, right?
865
866It is a problem for L<AnyEvent::Fork::Template> though - and the solution
867is to not create objects with nontrivial destructors that might have an
868effect outside of Perl.
869
664=back 870=back
665 871
666=head1 PORTABILITY NOTES 872=head1 PORTABILITY NOTES
667 873
668Native win32 perls are somewhat supported (AnyEvent::Fork::Early is a nop, 874Native win32 perls are somewhat supported (AnyEvent::Fork::Early is a nop,
669and ::Template is not going to work), and it cost a lot of blood and sweat 875and ::Template is not going to work), and it cost a lot of blood and sweat
670to make it so, mostly due to the bloody broken perl that nobody seems to 876to make it so, mostly due to the bloody broken perl that nobody seems to
671care about. The fork emulation is a bad joke - I have yet to see something 877care about. The fork emulation is a bad joke - I have yet to see something
672useful that you cna do with it without running into memory corruption 878useful that you can do with it without running into memory corruption
673issues or other braindamage. Hrrrr. 879issues or other braindamage. Hrrrr.
674 880
675Cygwin perl is not supported at the moment, as it should implement fd 881Cygwin perl is not supported at the moment, as it should implement fd
676passing, but doesn't, and rolling my own is hard, as cygwin doesn't 882passing, but doesn't, and rolling my own is hard, as cygwin doesn't
677support enough functionality to do it. 883support enough functionality to do it.

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines