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.19 by root, Sat Apr 6 02:31:26 2013 UTC vs.
Revision 1.39 by root, Sat Apr 6 22:39:37 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=head2 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=head2 COMPARISON TO OTHER MODULES
46
47There is an abundance of modules on CPAN that do "something fork", such as
48L<Parallel::ForkManager>, L<AnyEvent::ForkManager>, L<AnyEvent::Worker>
49or L<AnyEvent::Subprocess>. There are modules that implement their own
50process management, such as L<AnyEvent::DBI>.
51
52The problems that all these modules try to solve are real, however, none
53of them (from what I have seen) tackle the very real problems of unwanted
54memory sharing, efficiency, not being able to use event processing or
55similar modules in the processes they create.
56
57This module doesn't try to replace any of them - instead it tries to solve
58the problem of creating processes with a minimum of fuss and overhead (and
59also luxury). Ideally, most of these would use AnyEvent::Fork internally,
60except they were written before AnyEvent:Fork was available, so obviously
61had to roll their own.
62
63=head2 PROBLEM STATEMENT
64
65There are two traditional ways to implement parallel processing on UNIX
66like operating systems - fork and process, and fork+exec and process. They
67have different advantages and disadvantages that I describe below,
68together with how this module tries to mitigate the disadvantages.
69
70=over 4
71
72=item Forking from a big process can be very slow.
73
74A 5GB process needs 0.05s to fork on my 3.6GHz amd64 GNU/Linux box. This
75overhead is often shared with exec (because you have to fork first), but
76in some circumstances (e.g. when vfork is used), fork+exec can be much
77faster.
78
79This module can help here by telling a small(er) helper process to fork,
80which is faster then forking the main process, and also uses vfork where
81possible. This gives the speed of vfork, with the flexibility of fork.
82
83=item Forking usually creates a copy-on-write copy of the parent
84process.
85
86For example, modules or data files that are loaded will not use additional
87memory after a fork. When exec'ing a new process, modules and data files
88might need to be loaded again, at extra CPU and memory cost. But when
89forking, literally all data structures are copied - if the program frees
90them and replaces them by new data, the child processes will retain the
91old version even if it isn't used, which can suddenly and unexpectedly
92increase memory usage when freeing memory.
93
94The trade-off is between more sharing with fork (which can be good or
95bad), and no sharing with exec.
96
97This module allows the main program to do a controlled fork, and allows
98modules to exec processes safely at any time. When creating a custom
99process pool you can take advantage of data sharing via fork without
100risking to share large dynamic data structures that will blow up child
101memory usage.
102
103In other words, this module puts you into control over what is being
104shared and what isn't, at all times.
105
106=item Exec'ing a new perl process might be difficult.
107
108For example, it is not easy to find the correct path to the perl
109interpreter - C<$^X> might not be a perl interpreter at all.
110
111This module tries hard to identify the correct path to the perl
112interpreter. With a cooperative main program, exec'ing the interpreter
113might not even be necessary, but even without help from the main program,
114it will still work when used from a module.
115
116=item Exec'ing a new perl process might be slow, as all necessary modules
117have to be loaded from disk again, with no guarantees of success.
118
119Long running processes might run into problems when perl is upgraded
120and modules are no longer loadable because they refer to a different
121perl version, or parts of a distribution are newer than the ones already
122loaded.
123
124This module supports creating pre-initialised perl processes to be used as
125a template for new processes.
126
127=item Forking might be impossible when a program is running.
128
129For example, POSIX makes it almost impossible to fork from a
130multi-threaded program while doing anything useful in the child - in
131fact, if your perl program uses POSIX threads (even indirectly via
132e.g. L<IO::AIO> or L<threads>), you cannot call fork on the perl level
133anymore without risking corruption issues on a number of operating
134systems.
135
136This module can safely fork helper processes at any time, by calling
137fork+exec in C, in a POSIX-compatible way (via L<Proc::FastSpawn>).
138
139=item Parallel processing with fork might be inconvenient or difficult
140to implement. Modules might not work in both parent and child.
141
142For example, when a program uses an event loop and creates watchers it
143becomes very hard to use the event loop from a child program, as the
144watchers already exist but are only meaningful in the parent. Worse, a
145module might want to use such a module, not knowing whether another module
146or the main program also does, leading to problems.
147
148Apart from event loops, graphical toolkits also commonly fall into the
149"unsafe module" category, or just about anything that communicates with
150the external world, such as network libraries and file I/O modules, which
151usually don't like being copied and then allowed to continue in two
152processes.
153
154With this module only the main program is allowed to create new processes
155by forking (because only the main program can know when it is still safe
156to do so) - all other processes are created via fork+exec, which makes it
157possible to use modules such as event loops or window interfaces safely.
158
159=back
160
161=head1 EXAMPLES
162
10 # create a single new process, tell it to run your worker function 163=head2 Create a single new process, tell it to run your worker function.
11 164
12 AnyEvent::Fork 165 AnyEvent::Fork
13 ->new 166 ->new
14 ->require ("MyModule") 167 ->require ("MyModule")
15 ->run ("MyModule::worker, sub { 168 ->run ("MyModule::worker, sub {
17 170
18 # now $master_filehandle is connected to the 171 # now $master_filehandle is connected to the
19 # $slave_filehandle in the new process. 172 # $slave_filehandle in the new process.
20 }); 173 });
21 174
22 # MyModule::worker might look like this 175C<MyModule> might look like this:
176
177 package MyModule;
178
23 sub MyModule::worker { 179 sub worker {
24 my ($slave_filehandle) = @_; 180 my ($slave_filehandle) = @_;
25 181
26 # now $slave_filehandle is connected to the $master_filehandle 182 # now $slave_filehandle is connected to the $master_filehandle
27 # in the original prorcess. have fun! 183 # in the original prorcess. have fun!
28 } 184 }
29 185
30 ##################################################################
31 # create a pool of server processes all accepting on the same socket 186=head2 Create a pool of server processes all accepting on the same socket.
32 187
33 # create listener socket 188 # create listener socket
34 my $listener = ...; 189 my $listener = ...;
35 190
36 # create a pool template, initialise it and give it the socket 191 # create a pool template, initialise it and give it the socket
48 } 203 }
49 204
50 # now do other things - maybe use the filehandle provided by run 205 # now do other things - maybe use the filehandle provided by run
51 # to wait for the processes to die. or whatever. 206 # to wait for the processes to die. or whatever.
52 207
53 # My::Server::run might look like this 208C<My::Server> might look like this:
54 sub My::Server::run { 209
210 package My::Server;
211
212 sub run {
55 my ($slave, $listener, $id) = @_; 213 my ($slave, $listener, $id) = @_;
56 214
57 close $slave; # we do not use the socket, so close it to save resources 215 close $slave; # we do not use the socket, so close it to save resources
58 216
59 # we could go ballistic and use e.g. AnyEvent here, or IO::AIO, 217 # we could go ballistic and use e.g. AnyEvent here, or IO::AIO,
61 while (my $socket = $listener->accept) { 219 while (my $socket = $listener->accept) {
62 # do sth. with new socket 220 # do sth. with new socket
63 } 221 }
64 } 222 }
65 223
66=head1 DESCRIPTION 224=head2 use AnyEvent::Fork as a faster fork+exec
67 225
68This module allows you to create new processes, without actually forking 226This runs C</bin/echo hi>, with stdandard output redirected to /tmp/log
69them from your current process (avoiding the problems of forking), but 227and standard error redirected to the communications socket. It is usually
70preserving most of the advantages of fork. 228faster than fork+exec, but still lets you prepare the environment.
71 229
72It can be used to create new worker processes or new independent 230 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 web server), which can be faster (and more well behaved)
76than using fork+exec in big processes.
77 231
78Special care has been taken to make this module useful from other modules, 232 AnyEvent::Fork
79while still supporting specialised environments such as L<App::Staticperl> 233 ->new
80or L<PAR::Packer>. 234 ->eval ('
235 sub run {
236 my ($fh, $output, @cmd) = @_;
81 237
82=head1 WHAT THIS MODULE IS NOT 238 # perl will clear close-on-exec on STDOUT/STDERR
239 open STDOUT, ">&", $output or die;
240 open STDERR, ">&", $fh or die;
83 241
84This module only creates processes and lets you pass file handles and 242 exec @cmd;
85strings to it, and run perl code. It does not implement any kind of RPC - 243 }
86there is no back channel from the process back to you, and there is no RPC 244 ')
87or message passing going on. 245 ->send_fh ($output)
246 ->send_arg ("/bin/echo", "hi")
247 ->run ("run", my $cv = AE::cv);
88 248
89If you need some form of RPC, you can either implement it yourself 249 my $stderr = $cv->recv;
90in whatever way you like, use some message-passing module such
91as L<AnyEvent::MP>, some pipe such as L<AnyEvent::ZeroMQ>, use
92L<AnyEvent::Handle> on both sides to send e.g. JSON or Storable messages,
93and so on.
94
95=head1 PROBLEM STATEMENT
96
97There are two ways to implement parallel processing on UNIX like operating
98systems - fork and process, and fork+exec and process. They have different
99advantages and disadvantages that I describe below, together with how this
100module tries to mitigate the disadvantages.
101
102=over 4
103
104=item Forking from a big process can be very slow (a 5GB process needs
1050.05s to fork on my 3.6GHz amd64 GNU/Linux box for example). This overhead
106is often shared with exec (because you have to fork first), but in some
107circumstances (e.g. when vfork is used), fork+exec can be much faster.
108
109This module can help here by telling a small(er) helper process to fork,
110or fork+exec instead.
111
112=item Forking usually creates a copy-on-write copy of the parent
113process. Memory (for example, modules or data files that have been
114will not take additional memory). When exec'ing a new process, modules
115and data files might need to be loaded again, at extra CPU and memory
116cost. Likewise when forking, all data structures are copied as well - if
117the program frees them and replaces them by new data, the child processes
118will retain the memory even if it isn't used.
119
120This module allows the main program to do a controlled fork, and allows
121modules to exec processes safely at any time. When creating a custom
122process pool you can take advantage of data sharing via fork without
123risking to share large dynamic data structures that will blow up child
124memory usage.
125
126=item Exec'ing a new perl process might be difficult and slow. For
127example, it is not easy to find the correct path to the perl interpreter,
128and all modules have to be loaded from disk again. Long running processes
129might run into problems when perl is upgraded for example.
130
131This module supports creating pre-initialised perl processes to be used
132as template, and also tries hard to identify the correct path to the perl
133interpreter. With a cooperative main program, exec'ing the interpreter
134might not even be necessary.
135
136=item Forking might be impossible when a program is running. For example,
137POSIX makes it almost impossible to fork from a multi-threaded program and
138do anything useful in the child - strictly speaking, if your perl program
139uses posix threads (even indirectly via e.g. L<IO::AIO> or L<threads>),
140you cannot call fork on the perl level anymore, at all.
141
142This module can safely fork helper processes at any time, by calling
143fork+exec in C, in a POSIX-compatible way.
144
145=item Parallel processing with fork might be inconvenient or difficult
146to implement. For example, when a program uses an event loop and creates
147watchers it becomes very hard to use the event loop from a child
148program, as the watchers already exist but are only meaningful in the
149parent. Worse, a module might want to use such a system, not knowing
150whether another module or the main program also does, leading to problems.
151
152This module only lets the main program create pools by forking (because
153only the main program can know when it is still safe to do so) - all other
154pools are created by fork+exec, after which such modules can again be
155loaded.
156
157=back
158 250
159=head1 CONCEPTS 251=head1 CONCEPTS
160 252
161This module can create new processes either by executing a new perl 253This module can create new processes either by executing a new perl
162process, or by forking from an existing "template" process. 254process, or by forking from an existing "template" process.
241 my ($fork_fh) = @_; 333 my ($fork_fh) = @_;
242 }); 334 });
243 335
244=back 336=back
245 337
246=head1 FUNCTIONS 338=head1 THE C<AnyEvent::Fork> CLASS
339
340This module exports nothing, and only implements a single class -
341C<AnyEvent::Fork>.
342
343There are two class constructors that both create new processes - C<new>
344and C<new_exec>. The C<fork> method creates a new process by forking an
345existing one and could be considered a third constructor.
346
347Most of the remaining methods deal with preparing the new process, by
348loading code, evaluating code and sending data to the new process. They
349usually return the process object, so you can chain method calls.
350
351If a process object is destroyed before calling its C<run> method, then
352the process simply exits. After C<run> is called, all responsibility is
353passed to the specified function.
354
355As long as there is any outstanding work to be done, process objects
356resist being destroyed, so there is no reason to store them unless you
357need them later - configure and forget works just fine.
247 358
248=over 4 359=over 4
249 360
250=cut 361=cut
251 362
258use AnyEvent; 369use AnyEvent;
259use AnyEvent::Util (); 370use AnyEvent::Util ();
260 371
261use IO::FDPass; 372use IO::FDPass;
262 373
263our $VERSION = 0.2; 374our $VERSION = 0.5;
264 375
265our $PERL; # the path to the perl interpreter, deduces with various forms of magic 376our $PERL; # the path to the perl interpreter, deduces with various forms of magic
266
267=item my $pool = new AnyEvent::Fork key => value...
268
269Create a new process pool. The following named parameters are supported:
270 377
271=over 4 378=over 4
272 379
273=back 380=back
274 381
320 427
321 # everything written 428 # everything written
322 undef $self->[3]; 429 undef $self->[3];
323 430
324 # invoke run callback, if any 431 # invoke run callback, if any
325 $self->[0]->($self->[1]) if $self->[0]; 432 $self->[4]->($self->[1]) if $self->[4];
326 }; 433 };
327 434
328 () # make sure we don't leak the watcher 435 () # make sure we don't leak the watcher
329} 436}
330 437
332 my ($self, $fh, $pid) = @_; 439 my ($self, $fh, $pid) = @_;
333 440
334 AnyEvent::Util::fh_nonblocking $fh, 1; 441 AnyEvent::Util::fh_nonblocking $fh, 1;
335 442
336 $self = bless [ 443 $self = bless [
337 undef, # run callback 444 $pid,
338 $fh, 445 $fh,
339 [], # write queue - strings or fd's 446 [], # write queue - strings or fd's
340 undef, # AE watcher 447 undef, # AE watcher
341 $pid,
342 ], $self; 448 ], $self;
343 449
344 $self 450 $self
345} 451}
346 452
371Create a new "empty" perl interpreter process and returns its process 477Create a new "empty" perl interpreter process and returns its process
372object for further manipulation. 478object for further manipulation.
373 479
374The new process is forked from a template process that is kept around 480The new process is forked from a template process that is kept around
375for this purpose. When it doesn't exist yet, it is created by a call to 481for this purpose. When it doesn't exist yet, it is created by a call to
376C<new_exec> and kept around for future calls. 482C<new_exec> first and then stays around for future calls.
377
378When the process object is destroyed, it will release the file handle
379that connects it with the new process. When the new process has not yet
380called C<run>, then the process will exit. Otherwise, what happens depends
381entirely on the code that is executed.
382 483
383=cut 484=cut
384 485
385sub new { 486sub new {
386 my $class = shift; 487 my $class = shift;
473 ) or die "unable to spawn AnyEvent::Fork server: $!"; 574 ) or die "unable to spawn AnyEvent::Fork server: $!";
474 575
475 $self->_new ($fh, $pid) 576 $self->_new ($fh, $pid)
476} 577}
477 578
579=item $pid = $proc->pid
580
581Returns the process id of the process I<iff it is a direct child of the
582process running AnyEvent::Fork>, and C<undef> otherwise.
583
584Normally, only processes created via C<< AnyEvent::Fork->new_exec >> and
585L<AnyEvent::Fork::Template> are direct children, and you are responsible
586to clean up their zombies when they die.
587
588All other processes are not direct children, and will be cleaned up by
589AnyEvent::Fork itself.
590
591=cut
592
593sub pid {
594 $_[0][0]
595}
596
478=item $proc = $proc->eval ($perlcode, @args) 597=item $proc = $proc->eval ($perlcode, @args)
479 598
480Evaluates the given C<$perlcode> as ... perl code, while setting C<@_> to 599Evaluates the given C<$perlcode> as ... perl code, while setting C<@_> to
481the strings specified by C<@args>. 600the strings specified by C<@args>, in the "main" package.
482 601
483This call is meant to do any custom initialisation that might be required 602This call is meant to do any custom initialisation that might be required
484(for example, the C<require> method uses it). It's not supposed to be used 603(for example, the C<require> method uses it). It's not supposed to be used
485to completely take over the process, use C<run> for that. 604to completely take over the process, use C<run> for that.
486 605
487The code will usually be executed after this call returns, and there is no 606The code will usually be executed after this call returns, and there is no
488way to pass anything back to the calling process. Any evaluation errors 607way to pass anything back to the calling process. Any evaluation errors
489will be reported to stderr and cause the process to exit. 608will be reported to stderr and cause the process to exit.
490 609
610If you want to execute some code (that isn't in a module) to take over the
611process, you should compile a function via C<eval> first, and then call
612it via C<run>. This also gives you access to any arguments passed via the
613C<send_xxx> methods, such as file handles. See the L<use AnyEvent::Fork as
614a faster fork+exec> example to see it in action.
615
491Returns the process object for easy chaining of method calls. 616Returns the process object for easy chaining of method calls.
492 617
493=cut 618=cut
494 619
495sub eval { 620sub eval {
520=item $proc = $proc->send_fh ($handle, ...) 645=item $proc = $proc->send_fh ($handle, ...)
521 646
522Send one or more file handles (I<not> file descriptors) to the process, 647Send one or more file handles (I<not> file descriptors) to the process,
523to prepare a call to C<run>. 648to prepare a call to C<run>.
524 649
525The process object keeps a reference to the handles until this is done, 650The process object keeps a reference to the handles until they have
526so you must not explicitly close the handles. This is most easily 651been passed over to the process, so you must not explicitly close the
527accomplished by simply not storing the file handles anywhere after passing 652handles. This is most easily accomplished by simply not storing the file
528them to this method. 653handles anywhere after passing them to this method - when AnyEvent::Fork
654is finished using them, perl will automatically close them.
529 655
530Returns the process object for easy chaining of method calls. 656Returns the process object for easy chaining of method calls.
531 657
532Example: pass a file handle to a process, and release it without 658Example: pass a file handle to a process, and release it without
533closing. It will be closed automatically when it is no longer used. 659closing. It will be closed automatically when it is no longer used.
549} 675}
550 676
551=item $proc = $proc->send_arg ($string, ...) 677=item $proc = $proc->send_arg ($string, ...)
552 678
553Send one or more argument strings to the process, to prepare a call to 679Send one or more argument strings to the process, to prepare a call to
554C<run>. The strings can be any octet string. 680C<run>. The strings can be any octet strings.
555 681
556The protocol is optimised to pass a moderate number of relatively short 682The protocol is optimised to pass a moderate number of relatively short
557strings - while you can pass up to 4GB of data in one go, this is more 683strings - while you can pass up to 4GB of data in one go, this is more
558meant to pass some ID information or other startup info, not big chunks of 684meant to pass some ID information or other startup info, not big chunks of
559data. 685data.
570 $self 696 $self
571} 697}
572 698
573=item $proc->run ($func, $cb->($fh)) 699=item $proc->run ($func, $cb->($fh))
574 700
575Enter the function specified by the fully qualified name in C<$func> in 701Enter the function specified by the function name in C<$func> in the
576the process. The function is called with the communication socket as first 702process. The function is called with the communication socket as first
577argument, followed by all file handles and string arguments sent earlier 703argument, followed by all file handles and string arguments sent earlier
578via C<send_fh> and C<send_arg> methods, in the order they were called. 704via C<send_fh> and C<send_arg> methods, in the order they were called.
579 705
580If the called function returns, the process exits.
581
582Preparing the process can take time - when the process is ready, the
583callback is invoked with the local communications socket as argument.
584
585The process object becomes unusable on return from this function. 706The process object becomes unusable on return from this function - any
707further method calls result in undefined behaviour.
708
709The function name should be fully qualified, but if it isn't, it will be
710looked up in the C<main> package.
711
712If the called function returns, doesn't exist, or any error occurs, the
713process exits.
714
715Preparing the process is done in the background - when all commands have
716been sent, the callback is invoked with the local communications socket
717as argument. At this point you can start using the socket in any way you
718like.
586 719
587If the communication socket isn't used, it should be closed on both sides, 720If the communication socket isn't used, it should be closed on both sides,
588to save on kernel memory. 721to save on kernel memory.
589 722
590The socket is non-blocking in the parent, and blocking in the newly 723The socket is non-blocking in the parent, and blocking in the newly
591created process. The close-on-exec flag is set on both. Even if not used 724created process. The close-on-exec flag is set in both.
725
592otherwise, the socket can be a good indicator for the existence of the 726Even if not used otherwise, the socket can be a good indicator for the
593process - if the other process exits, you get a readable event on it, 727existence of the process - if the other process exits, you get a readable
594because exiting the process closes the socket (if it didn't create any 728event on it, because exiting the process closes the socket (if it didn't
595children using fork). 729create any children using fork).
596 730
597Example: create a template for a process pool, pass a few strings, some 731Example: create a template for a process pool, pass a few strings, some
598file handles, then fork, pass one more string, and run some code. 732file handles, then fork, pass one more string, and run some code.
599 733
600 my $pool = AnyEvent::Fork 734 my $pool = AnyEvent::Fork
608 ->send_arg ("str3") 742 ->send_arg ("str3")
609 ->run ("Some::function", sub { 743 ->run ("Some::function", sub {
610 my ($fh) = @_; 744 my ($fh) = @_;
611 745
612 # fh is nonblocking, but we trust that the OS can accept these 746 # fh is nonblocking, but we trust that the OS can accept these
613 # extra 3 octets anyway. 747 # few octets anyway.
614 syswrite $fh, "hi #$_\n"; 748 syswrite $fh, "hi #$_\n";
615 749
616 # $fh is being closed here, as we don't store it anywhere 750 # $fh is being closed here, as we don't store it anywhere
617 }); 751 });
618 } 752 }
620 # Some::function might look like this - all parameters passed before fork 754 # Some::function might look like this - all parameters passed before fork
621 # and after will be passed, in order, after the communications socket. 755 # and after will be passed, in order, after the communications socket.
622 sub Some::function { 756 sub Some::function {
623 my ($fh, $str1, $str2, $fh1, $fh2, $str3) = @_; 757 my ($fh, $str1, $str2, $fh1, $fh2, $str3) = @_;
624 758
625 print scalar <$fh>; # prints "hi 1\n" and "hi 2\n" 759 print scalar <$fh>; # prints "hi #1\n" and "hi #2\n" in any order
626 } 760 }
627 761
628=cut 762=cut
629 763
630sub run { 764sub run {
631 my ($self, $func, $cb) = @_; 765 my ($self, $func, $cb) = @_;
632 766
633 $self->[0] = $cb; 767 $self->[4] = $cb;
634 $self->_cmd (r => $func); 768 $self->_cmd (r => $func);
635} 769}
636 770
637=back 771=back
638 772
664 479 vfork+execs per second, using AnyEvent::Fork->new_exec 798 479 vfork+execs per second, using AnyEvent::Fork->new_exec
665 799
666So how can C<< AnyEvent->new >> be faster than a standard fork, even 800So how can C<< AnyEvent->new >> be faster than a standard fork, even
667though it uses the same operations, but adds a lot of overhead? 801though it uses the same operations, but adds a lot of overhead?
668 802
669The difference is simply the process size: forking the 6MB process takes 803The difference is simply the process size: forking the 5MB process takes
670so much longer than forking the 2.5MB template process that the overhead 804so much longer than forking the 2.5MB template process that the extra
671introduced is canceled out. 805overhead introduced is canceled out.
672 806
673If the benchmark process grows, the normal fork becomes even slower: 807If the benchmark process grows, the normal fork becomes even slower:
674 808
675 1340 new processes, manual fork in a 20MB process 809 1340 new processes, manual fork of a 20MB process
676 731 new processes, manual fork in a 200MB process 810 731 new processes, manual fork of a 200MB process
677 235 new processes, manual fork in a 2000MB process 811 235 new processes, manual fork of a 2000MB process
678 812
679What that means (to me) is that I can use this module without having a 813What that means (to me) is that I can use this module without having a bad
680very bad conscience because of the extra overhead required to start new 814conscience because of the extra overhead required to start new processes.
681processes.
682 815
683=head1 TYPICAL PROBLEMS 816=head1 TYPICAL PROBLEMS
684 817
685This section lists typical problems that remain. I hope by recognising 818This section lists typical problems that remain. I hope by recognising
686them, most can be avoided. 819them, most can be avoided.
687 820
688=over 4 821=over 4
689 822
690=item "leaked" file descriptors for exec'ed processes 823=item leaked file descriptors for exec'ed processes
691 824
692POSIX systems inherit file descriptors by default when exec'ing a new 825POSIX systems inherit file descriptors by default when exec'ing a new
693process. While perl itself laudably sets the close-on-exec flags on new 826process. While perl itself laudably sets the close-on-exec flags on new
694file handles, most C libraries don't care, and even if all cared, it's 827file handles, most C libraries don't care, and even if all cared, it's
695often not possible to set the flag in a race-free manner. 828often not possible to set the flag in a race-free manner.
715libraries or the code that leaks those file descriptors. 848libraries or the code that leaks those file descriptors.
716 849
717Fortunately, most of these leaked descriptors do no harm, other than 850Fortunately, most of these leaked descriptors do no harm, other than
718sitting on some resources. 851sitting on some resources.
719 852
720=item "leaked" file descriptors for fork'ed processes 853=item leaked file descriptors for fork'ed processes
721 854
722Normally, L<AnyEvent::Fork> does start new processes by exec'ing them, 855Normally, L<AnyEvent::Fork> does start new processes by exec'ing them,
723which closes file descriptors not marked for being inherited. 856which closes file descriptors not marked for being inherited.
724 857
725However, L<AnyEvent::Fork::Early> and L<AnyEvent::Fork::Template> offer 858However, L<AnyEvent::Fork::Early> and L<AnyEvent::Fork::Template> offer
734 867
735The solution is to either not load these modules before use'ing 868The solution is to either not load these modules before use'ing
736L<AnyEvent::Fork::Early> or L<AnyEvent::Fork::Template>, or to delay 869L<AnyEvent::Fork::Early> or L<AnyEvent::Fork::Template>, or to delay
737initialising them, for example, by calling C<init Gtk2> manually. 870initialising them, for example, by calling C<init Gtk2> manually.
738 871
739=item exit runs destructors 872=item exiting calls object destructors
740 873
741This only applies to users of Lc<AnyEvent::Fork:Early> and 874This only applies to users of L<AnyEvent::Fork:Early> and
742L<AnyEvent::Fork::Template>. 875L<AnyEvent::Fork::Template>, or when initialiasing code creates objects
876that reference external resources.
743 877
744When a process created by AnyEvent::Fork exits, it might do so by calling 878When a process created by AnyEvent::Fork exits, it might do so by calling
745exit, or simply letting perl reach the end of the program. At which point 879exit, or simply letting perl reach the end of the program. At which point
746Perl runs all destructors. 880Perl runs all destructors.
747 881
766to make it so, mostly due to the bloody broken perl that nobody seems to 900to make it so, mostly due to the bloody broken perl that nobody seems to
767care about. The fork emulation is a bad joke - I have yet to see something 901care about. The fork emulation is a bad joke - I have yet to see something
768useful that you can do with it without running into memory corruption 902useful that you can do with it without running into memory corruption
769issues or other braindamage. Hrrrr. 903issues or other braindamage. Hrrrr.
770 904
771Cygwin perl is not supported at the moment, as it should implement fd 905Cygwin perl is not supported at the moment due to some hilarious
772passing, but doesn't, and rolling my own is hard, as cygwin doesn't 906shortcomings of its API - see L<IO::FDPoll> for more details.
773support enough functionality to do it.
774 907
775=head1 SEE ALSO 908=head1 SEE ALSO
776 909
777L<AnyEvent::Fork::Early> (to avoid executing a perl interpreter), 910L<AnyEvent::Fork::Early> (to avoid executing a perl interpreter),
778L<AnyEvent::Fork::Template> (to create a process by forking the main 911L<AnyEvent::Fork::Template> (to create a process by forking the main

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines