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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines