ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/AnyEvent-Fork/Fork.pm
Revision: 1.19
Committed: Sat Apr 6 02:31:26 2013 UTC (11 years, 2 months ago) by root
Branch: MAIN
Changes since 1.18: +61 -47 lines
Log Message:
*** empty log message ***

File Contents

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