| 1 |
root |
1.1 |
=head1 NAME |
| 2 |
|
|
|
| 3 |
|
|
AnyEvent::Fork::RPC - simple RPC extension for AnyEvent::Fork |
| 4 |
|
|
|
| 5 |
|
|
=head1 SYNOPSIS |
| 6 |
|
|
|
| 7 |
root |
1.27 |
use AnyEvent::Fork; |
| 8 |
root |
1.1 |
use AnyEvent::Fork::RPC; |
| 9 |
|
|
|
| 10 |
|
|
my $rpc = AnyEvent::Fork |
| 11 |
|
|
->new |
| 12 |
|
|
->require ("MyModule") |
| 13 |
|
|
->AnyEvent::Fork::RPC::run ( |
| 14 |
|
|
"MyModule::server", |
| 15 |
|
|
); |
| 16 |
|
|
|
| 17 |
root |
1.16 |
use AnyEvent; |
| 18 |
|
|
|
| 19 |
root |
1.1 |
my $cv = AE::cv; |
| 20 |
|
|
|
| 21 |
|
|
$rpc->(1, 2, 3, sub { |
| 22 |
|
|
print "MyModule::server returned @_\n"; |
| 23 |
|
|
$cv->send; |
| 24 |
|
|
}); |
| 25 |
|
|
|
| 26 |
|
|
$cv->recv; |
| 27 |
|
|
|
| 28 |
|
|
=head1 DESCRIPTION |
| 29 |
|
|
|
| 30 |
|
|
This module implements a simple RPC protocol and backend for processes |
| 31 |
root |
1.29 |
created via L<AnyEvent::Fork> or L<AnyEvent::Fork::Remote>, allowing you |
| 32 |
root |
1.26 |
to call a function in the child process and receive its return values (up |
| 33 |
|
|
to 4GB serialised). |
| 34 |
root |
1.1 |
|
| 35 |
|
|
It implements two different backends: a synchronous one that works like a |
| 36 |
|
|
normal function call, and an asynchronous one that can run multiple jobs |
| 37 |
|
|
concurrently in the child, using AnyEvent. |
| 38 |
|
|
|
| 39 |
|
|
It also implements an asynchronous event mechanism from the child to the |
| 40 |
|
|
parent, that could be used for progress indications or other information. |
| 41 |
|
|
|
| 42 |
root |
1.4 |
=head1 EXAMPLES |
| 43 |
|
|
|
| 44 |
root |
1.10 |
=head2 Example 1: Synchronous Backend |
| 45 |
root |
1.4 |
|
| 46 |
|
|
Here is a simple example that implements a backend that executes C<unlink> |
| 47 |
|
|
and C<rmdir> calls, and reports their status back. It also reports the |
| 48 |
|
|
number of requests it has processed every three requests, which is clearly |
| 49 |
|
|
silly, but illustrates the use of events. |
| 50 |
|
|
|
| 51 |
|
|
First the parent process: |
| 52 |
|
|
|
| 53 |
|
|
use AnyEvent; |
| 54 |
root |
1.27 |
use AnyEvent::Fork; |
| 55 |
root |
1.4 |
use AnyEvent::Fork::RPC; |
| 56 |
|
|
|
| 57 |
|
|
my $done = AE::cv; |
| 58 |
|
|
|
| 59 |
|
|
my $rpc = AnyEvent::Fork |
| 60 |
|
|
->new |
| 61 |
|
|
->require ("MyWorker") |
| 62 |
|
|
->AnyEvent::Fork::RPC::run ("MyWorker::run", |
| 63 |
root |
1.29 |
on_error => sub { warn "ERROR: $_[0]"; exit 1 }, |
| 64 |
root |
1.4 |
on_event => sub { warn "$_[0] requests handled\n" }, |
| 65 |
|
|
on_destroy => $done, |
| 66 |
|
|
); |
| 67 |
|
|
|
| 68 |
|
|
for my $id (1..6) { |
| 69 |
|
|
$rpc->(rmdir => "/tmp/somepath/$id", sub { |
| 70 |
|
|
$_[0] |
| 71 |
|
|
or warn "/tmp/somepath/$id: $_[1]\n"; |
| 72 |
|
|
}); |
| 73 |
|
|
} |
| 74 |
|
|
|
| 75 |
|
|
undef $rpc; |
| 76 |
|
|
|
| 77 |
|
|
$done->recv; |
| 78 |
|
|
|
| 79 |
|
|
The parent creates the process, queues a few rmdir's. It then forgets |
| 80 |
|
|
about the C<$rpc> object, so that the child exits after it has handled the |
| 81 |
|
|
requests, and then it waits till the requests have been handled. |
| 82 |
|
|
|
| 83 |
|
|
The child is implemented using a separate module, C<MyWorker>, shown here: |
| 84 |
|
|
|
| 85 |
|
|
package MyWorker; |
| 86 |
|
|
|
| 87 |
|
|
my $count; |
| 88 |
|
|
|
| 89 |
|
|
sub run { |
| 90 |
|
|
my ($cmd, $path) = @_; |
| 91 |
|
|
|
| 92 |
|
|
AnyEvent::Fork::RPC::event ($count) |
| 93 |
|
|
unless ++$count % 3; |
| 94 |
|
|
|
| 95 |
|
|
my $status = $cmd eq "rmdir" ? rmdir $path |
| 96 |
|
|
: $cmd eq "unlink" ? unlink $path |
| 97 |
|
|
: die "fatal error, illegal command '$cmd'"; |
| 98 |
|
|
|
| 99 |
|
|
$status or (0, "$!") |
| 100 |
|
|
} |
| 101 |
|
|
|
| 102 |
|
|
1 |
| 103 |
|
|
|
| 104 |
|
|
The C<run> function first sends a "progress" event every three calls, and |
| 105 |
|
|
then executes C<rmdir> or C<unlink>, depending on the first parameter (or |
| 106 |
|
|
dies with a fatal error - obviously, you must never let this happen :). |
| 107 |
|
|
|
| 108 |
|
|
Eventually it returns the status value true if the command was successful, |
| 109 |
|
|
or the status value 0 and the stringified error message. |
| 110 |
|
|
|
| 111 |
root |
1.6 |
On my system, running the first code fragment with the given |
| 112 |
root |
1.4 |
F<MyWorker.pm> in the current directory yields: |
| 113 |
|
|
|
| 114 |
|
|
/tmp/somepath/1: No such file or directory |
| 115 |
|
|
/tmp/somepath/2: No such file or directory |
| 116 |
|
|
3 requests handled |
| 117 |
|
|
/tmp/somepath/3: No such file or directory |
| 118 |
|
|
/tmp/somepath/4: No such file or directory |
| 119 |
|
|
/tmp/somepath/5: No such file or directory |
| 120 |
|
|
6 requests handled |
| 121 |
|
|
/tmp/somepath/6: No such file or directory |
| 122 |
|
|
|
| 123 |
|
|
Obviously, none of the directories I am trying to delete even exist. Also, |
| 124 |
|
|
the events and responses are processed in exactly the same order as |
| 125 |
|
|
they were created in the child, which is true for both synchronous and |
| 126 |
|
|
asynchronous backends. |
| 127 |
|
|
|
| 128 |
|
|
Note that the parentheses in the call to C<AnyEvent::Fork::RPC::event> are |
| 129 |
|
|
not optional. That is because the function isn't defined when the code is |
| 130 |
|
|
compiled. You can make sure it is visible by pre-loading the correct |
| 131 |
|
|
backend module in the call to C<require>: |
| 132 |
|
|
|
| 133 |
|
|
->require ("AnyEvent::Fork::RPC::Sync", "MyWorker") |
| 134 |
|
|
|
| 135 |
|
|
Since the backend module declares the C<event> function, loading it first |
| 136 |
|
|
ensures that perl will correctly interpret calls to it. |
| 137 |
|
|
|
| 138 |
|
|
And as a final remark, there is a fine module on CPAN that can |
| 139 |
|
|
asynchronously C<rmdir> and C<unlink> and a lot more, and more efficiently |
| 140 |
|
|
than this example, namely L<IO::AIO>. |
| 141 |
|
|
|
| 142 |
root |
1.10 |
=head3 Example 1a: the same with the asynchronous backend |
| 143 |
|
|
|
| 144 |
|
|
This example only shows what needs to be changed to use the async backend |
| 145 |
|
|
instead. Doing this is not very useful, the purpose of this example is |
| 146 |
|
|
to show the minimum amount of change that is required to go from the |
| 147 |
|
|
synchronous to the asynchronous backend. |
| 148 |
|
|
|
| 149 |
|
|
To use the async backend in the previous example, you need to add the |
| 150 |
|
|
C<async> parameter to the C<AnyEvent::Fork::RPC::run> call: |
| 151 |
|
|
|
| 152 |
|
|
->AnyEvent::Fork::RPC::run ("MyWorker::run", |
| 153 |
|
|
async => 1, |
| 154 |
|
|
... |
| 155 |
|
|
|
| 156 |
|
|
And since the function call protocol is now changed, you need to adopt |
| 157 |
|
|
C<MyWorker::run> to the async API. |
| 158 |
|
|
|
| 159 |
|
|
First, you need to accept the extra initial C<$done> callback: |
| 160 |
|
|
|
| 161 |
|
|
sub run { |
| 162 |
|
|
my ($done, $cmd, $path) = @_; |
| 163 |
|
|
|
| 164 |
|
|
And since a response is now generated when C<$done> is called, as opposed |
| 165 |
|
|
to when the function returns, we need to call the C<$done> function with |
| 166 |
|
|
the status: |
| 167 |
|
|
|
| 168 |
|
|
$done->($status or (0, "$!")); |
| 169 |
|
|
|
| 170 |
|
|
A few remarks are in order. First, it's quite pointless to use the async |
| 171 |
|
|
backend for this example - but it I<is> possible. Second, you can call |
| 172 |
|
|
C<$done> before or after returning from the function. Third, having both |
| 173 |
|
|
returned from the function and having called the C<$done> callback, the |
| 174 |
|
|
child process may exit at any time, so you should call C<$done> only when |
| 175 |
|
|
you really I<are> done. |
| 176 |
|
|
|
| 177 |
|
|
=head2 Example 2: Asynchronous Backend |
| 178 |
|
|
|
| 179 |
root |
1.11 |
This example implements multiple count-downs in the child, using |
| 180 |
|
|
L<AnyEvent> timers. While this is a bit silly (one could use timers in te |
| 181 |
|
|
parent just as well), it illustrates the ability to use AnyEvent in the |
| 182 |
|
|
child and the fact that responses can arrive in a different order then the |
| 183 |
|
|
requests. |
| 184 |
|
|
|
| 185 |
|
|
It also shows how to embed the actual child code into a C<__DATA__> |
| 186 |
|
|
section, so it doesn't need any external files at all. |
| 187 |
|
|
|
| 188 |
|
|
And when your parent process is often busy, and you have stricter timing |
| 189 |
|
|
requirements, then running timers in a child process suddenly doesn't look |
| 190 |
|
|
so silly anymore. |
| 191 |
|
|
|
| 192 |
|
|
Without further ado, here is the code: |
| 193 |
|
|
|
| 194 |
|
|
use AnyEvent; |
| 195 |
root |
1.27 |
use AnyEvent::Fork; |
| 196 |
root |
1.11 |
use AnyEvent::Fork::RPC; |
| 197 |
|
|
|
| 198 |
|
|
my $done = AE::cv; |
| 199 |
|
|
|
| 200 |
|
|
my $rpc = AnyEvent::Fork |
| 201 |
|
|
->new |
| 202 |
|
|
->require ("AnyEvent::Fork::RPC::Async") |
| 203 |
|
|
->eval (do { local $/; <DATA> }) |
| 204 |
|
|
->AnyEvent::Fork::RPC::run ("run", |
| 205 |
|
|
async => 1, |
| 206 |
root |
1.29 |
on_error => sub { warn "ERROR: $_[0]"; exit 1 }, |
| 207 |
root |
1.11 |
on_event => sub { print $_[0] }, |
| 208 |
|
|
on_destroy => $done, |
| 209 |
|
|
); |
| 210 |
|
|
|
| 211 |
|
|
for my $count (3, 2, 1) { |
| 212 |
|
|
$rpc->($count, sub { |
| 213 |
|
|
warn "job $count finished\n"; |
| 214 |
|
|
}); |
| 215 |
|
|
} |
| 216 |
|
|
|
| 217 |
|
|
undef $rpc; |
| 218 |
|
|
|
| 219 |
|
|
$done->recv; |
| 220 |
|
|
|
| 221 |
|
|
__DATA__ |
| 222 |
|
|
|
| 223 |
|
|
# this ends up in main, as we don't use a package declaration |
| 224 |
|
|
|
| 225 |
|
|
use AnyEvent; |
| 226 |
|
|
|
| 227 |
|
|
sub run { |
| 228 |
|
|
my ($done, $count) = @_; |
| 229 |
|
|
|
| 230 |
|
|
my $n; |
| 231 |
|
|
|
| 232 |
|
|
AnyEvent::Fork::RPC::event "starting to count up to $count\n"; |
| 233 |
|
|
|
| 234 |
|
|
my $w; $w = AE::timer 1, 1, sub { |
| 235 |
|
|
++$n; |
| 236 |
|
|
|
| 237 |
|
|
AnyEvent::Fork::RPC::event "count $n of $count\n"; |
| 238 |
|
|
|
| 239 |
|
|
if ($n == $count) { |
| 240 |
|
|
undef $w; |
| 241 |
|
|
$done->(); |
| 242 |
|
|
} |
| 243 |
|
|
}; |
| 244 |
|
|
} |
| 245 |
|
|
|
| 246 |
|
|
The parent part (the one before the C<__DATA__> section) isn't very |
| 247 |
|
|
different from the earlier examples. It sets async mode, preloads |
| 248 |
|
|
the backend module (so the C<AnyEvent::Fork::RPC::event> function is |
| 249 |
|
|
declared), uses a slightly different C<on_event> handler (which we use |
| 250 |
|
|
simply for logging purposes) and then, instead of loading a module with |
| 251 |
|
|
the actual worker code, it C<eval>'s the code from the data section in the |
| 252 |
|
|
child process. |
| 253 |
|
|
|
| 254 |
|
|
It then starts three countdowns, from 3 to 1 seconds downwards, destroys |
| 255 |
|
|
the rpc object so the example finishes eventually, and then just waits for |
| 256 |
|
|
the stuff to trickle in. |
| 257 |
|
|
|
| 258 |
|
|
The worker code uses the event function to log some progress messages, but |
| 259 |
|
|
mostly just creates a recurring one-second timer. |
| 260 |
|
|
|
| 261 |
|
|
The timer callback increments a counter, logs a message, and eventually, |
| 262 |
|
|
when the count has been reached, calls the finish callback. |
| 263 |
|
|
|
| 264 |
|
|
On my system, this results in the following output. Since all timers fire |
| 265 |
|
|
at roughly the same time, the actual order isn't guaranteed, but the order |
| 266 |
|
|
shown is very likely what you would get, too. |
| 267 |
|
|
|
| 268 |
|
|
starting to count up to 3 |
| 269 |
|
|
starting to count up to 2 |
| 270 |
|
|
starting to count up to 1 |
| 271 |
|
|
count 1 of 3 |
| 272 |
|
|
count 1 of 2 |
| 273 |
|
|
count 1 of 1 |
| 274 |
|
|
job 1 finished |
| 275 |
|
|
count 2 of 2 |
| 276 |
|
|
job 2 finished |
| 277 |
|
|
count 2 of 3 |
| 278 |
|
|
count 3 of 3 |
| 279 |
|
|
job 3 finished |
| 280 |
|
|
|
| 281 |
|
|
While the overall ordering isn't guaranteed, the async backend still |
| 282 |
|
|
guarantees that events and responses are delivered to the parent process |
| 283 |
|
|
in the exact same ordering as they were generated in the child process. |
| 284 |
|
|
|
| 285 |
|
|
And unless your system is I<very> busy, it should clearly show that the |
| 286 |
|
|
job started last will finish first, as it has the lowest count. |
| 287 |
|
|
|
| 288 |
|
|
This concludes the async example. Since L<AnyEvent::Fork> does not |
| 289 |
|
|
actually fork, you are free to use about any module in the child, not just |
| 290 |
|
|
L<AnyEvent>, but also L<IO::AIO>, or L<Tk> for example. |
| 291 |
root |
1.10 |
|
| 292 |
root |
1.29 |
=head2 Example 3: Asynchronous backend with Coro |
| 293 |
|
|
|
| 294 |
|
|
With L<Coro> you can create a nice asynchronous backend implementation by |
| 295 |
|
|
defining an rpc server function that creates a new Coro thread for every |
| 296 |
|
|
request that calls a function "normally", i.e. the parameters from the |
| 297 |
|
|
parent process are passed to it, and any return values are returned to the |
| 298 |
|
|
parent process, e.g.: |
| 299 |
|
|
|
| 300 |
|
|
package My::Arith; |
| 301 |
|
|
|
| 302 |
|
|
sub add { |
| 303 |
|
|
return $_[0] + $_[1]; |
| 304 |
|
|
} |
| 305 |
|
|
|
| 306 |
|
|
sub mul { |
| 307 |
|
|
return $_[0] * $_[1]; |
| 308 |
|
|
} |
| 309 |
|
|
|
| 310 |
|
|
sub run { |
| 311 |
|
|
my ($done, $func, @arg) = @_; |
| 312 |
|
|
|
| 313 |
|
|
Coro::async_pool { |
| 314 |
|
|
$done->($func->(@arg)); |
| 315 |
|
|
}; |
| 316 |
|
|
} |
| 317 |
|
|
|
| 318 |
|
|
The C<run> function creates a new thread for every invocation, using the |
| 319 |
|
|
first argument as function name, and calls the C<$done> callback on it's |
| 320 |
|
|
return values. This makes it quite natural to define the C<add> and C<mul> |
| 321 |
|
|
functions to add or multiply two numbers and return the result. |
| 322 |
|
|
|
| 323 |
|
|
Since this is the asynchronous backend, it's quite possible to define RPC |
| 324 |
|
|
function that do I/O or wait for external events - their execution will |
| 325 |
|
|
overlap as needed. |
| 326 |
|
|
|
| 327 |
|
|
The above could be used like this: |
| 328 |
|
|
|
| 329 |
|
|
my $rpc = AnyEvent::Fork |
| 330 |
|
|
->new |
| 331 |
|
|
->require ("MyWorker") |
| 332 |
|
|
->AnyEvent::Fork::RPC::run ("My::Arith::run", |
| 333 |
|
|
on_error => ..., on_event => ..., on_destroy => ..., |
| 334 |
|
|
); |
| 335 |
|
|
|
| 336 |
|
|
$rpc->(add => 1, 3, Coro::rouse_cb); say Coro::rouse_wait; |
| 337 |
|
|
$rpc->(mul => 3, 2, Coro::rouse_cb); say Coro::rouse_wait; |
| 338 |
|
|
|
| 339 |
|
|
The C<say>'s will print C<4> and C<6>. |
| 340 |
|
|
|
| 341 |
root |
1.30 |
=head2 Example 4: Forward AnyEvent::Log messages using C<on_event> |
| 342 |
|
|
|
| 343 |
|
|
This partial example shows how to use the C<event> function to forward |
| 344 |
|
|
L<AnyEvent::Log> messages to the parent. |
| 345 |
|
|
|
| 346 |
|
|
For this, the parent needs to provide a suitable C<on_event>: |
| 347 |
|
|
|
| 348 |
|
|
->AnyEvent::Fork::RPC::run ( |
| 349 |
|
|
on_event => sub { |
| 350 |
|
|
if ($_[0] eq "ae_log") { |
| 351 |
|
|
my (undef, $level, $message) = @_; |
| 352 |
|
|
AE::log $level, $message; |
| 353 |
|
|
} else { |
| 354 |
|
|
# other event types |
| 355 |
|
|
} |
| 356 |
|
|
}, |
| 357 |
|
|
) |
| 358 |
|
|
|
| 359 |
|
|
In the child, as early as possible, the following code should reconfigure |
| 360 |
|
|
L<AnyEvent::Log> to log via C<AnyEvent::Fork::RPC::event>: |
| 361 |
|
|
|
| 362 |
|
|
$AnyEvent::Log::LOG->log_cb (sub { |
| 363 |
|
|
my ($timestamp, $orig_ctx, $level, $message) = @{+shift}; |
| 364 |
|
|
|
| 365 |
|
|
if (defined &AnyEvent::Fork::RPC::event) { |
| 366 |
|
|
AnyEvent::Fork::RPC::event (ae_log => $level, $message); |
| 367 |
|
|
} else { |
| 368 |
|
|
warn "[$$ before init] $message\n"; |
| 369 |
|
|
} |
| 370 |
|
|
}); |
| 371 |
|
|
|
| 372 |
|
|
There is an important twist - the C<AnyEvent::Fork::RPC::event> function |
| 373 |
|
|
is only defined when the child is fully initialised. If you redirect the |
| 374 |
|
|
log messages in your C<init> function for example, then the C<event> |
| 375 |
|
|
function might not yet be available. This is why the log callback checks |
| 376 |
|
|
whether the fucntion is there using C<defined>, and only then uses it to |
| 377 |
|
|
log the message. |
| 378 |
|
|
|
| 379 |
root |
1.1 |
=head1 PARENT PROCESS USAGE |
| 380 |
|
|
|
| 381 |
|
|
This module exports nothing, and only implements a single function: |
| 382 |
|
|
|
| 383 |
|
|
=over 4 |
| 384 |
|
|
|
| 385 |
|
|
=cut |
| 386 |
|
|
|
| 387 |
|
|
package AnyEvent::Fork::RPC; |
| 388 |
|
|
|
| 389 |
|
|
use common::sense; |
| 390 |
|
|
|
| 391 |
|
|
use Errno (); |
| 392 |
|
|
use Guard (); |
| 393 |
|
|
|
| 394 |
|
|
use AnyEvent; |
| 395 |
|
|
|
| 396 |
root |
1.32 |
our $VERSION = 1.2; |
| 397 |
root |
1.1 |
|
| 398 |
|
|
=item my $rpc = AnyEvent::Fork::RPC::run $fork, $function, [key => value...] |
| 399 |
|
|
|
| 400 |
|
|
The traditional way to call it. But it is way cooler to call it in the |
| 401 |
|
|
following way: |
| 402 |
|
|
|
| 403 |
|
|
=item my $rpc = $fork->AnyEvent::Fork::RPC::run ($function, [key => value...]) |
| 404 |
|
|
|
| 405 |
|
|
This C<run> function/method can be used in place of the |
| 406 |
|
|
L<AnyEvent::Fork::run> method. Just like that method, it takes over |
| 407 |
|
|
the L<AnyEvent::Fork> process, but instead of calling the specified |
| 408 |
|
|
C<$function> directly, it runs a server that accepts RPC calls and handles |
| 409 |
|
|
responses. |
| 410 |
|
|
|
| 411 |
|
|
It returns a function reference that can be used to call the function in |
| 412 |
|
|
the child process, handling serialisation and data transfers. |
| 413 |
|
|
|
| 414 |
|
|
The following key/value pairs are allowed. It is recommended to have at |
| 415 |
|
|
least an C<on_error> or C<on_event> handler set. |
| 416 |
|
|
|
| 417 |
|
|
=over 4 |
| 418 |
|
|
|
| 419 |
|
|
=item on_error => $cb->($msg) |
| 420 |
|
|
|
| 421 |
|
|
Called on (fatal) errors, with a descriptive (hopefully) message. If |
| 422 |
|
|
this callback is not provided, but C<on_event> is, then the C<on_event> |
| 423 |
|
|
callback is called with the first argument being the string C<error>, |
| 424 |
|
|
followed by the error message. |
| 425 |
|
|
|
| 426 |
root |
1.29 |
If neither handler is provided, then the error is reported with loglevel |
| 427 |
|
|
C<error> via C<AE::log>. |
| 428 |
root |
1.1 |
|
| 429 |
|
|
=item on_event => $cb->(...) |
| 430 |
|
|
|
| 431 |
|
|
Called for every call to the C<AnyEvent::Fork::RPC::event> function in the |
| 432 |
|
|
child, with the arguments of that function passed to the callback. |
| 433 |
|
|
|
| 434 |
|
|
Also called on errors when no C<on_error> handler is provided. |
| 435 |
|
|
|
| 436 |
root |
1.4 |
=item on_destroy => $cb->() |
| 437 |
|
|
|
| 438 |
|
|
Called when the C<$rpc> object has been destroyed and all requests have |
| 439 |
|
|
been successfully handled. This is useful when you queue some requests and |
| 440 |
|
|
want the child to go away after it has handled them. The problem is that |
| 441 |
|
|
the parent must not exit either until all requests have been handled, and |
| 442 |
root |
1.6 |
this can be accomplished by waiting for this callback. |
| 443 |
root |
1.4 |
|
| 444 |
root |
1.1 |
=item init => $function (default none) |
| 445 |
|
|
|
| 446 |
|
|
When specified (by name), this function is called in the child as the very |
| 447 |
|
|
first thing when taking over the process, with all the arguments normally |
| 448 |
|
|
passed to the C<AnyEvent::Fork::run> function, except the communications |
| 449 |
|
|
socket. |
| 450 |
|
|
|
| 451 |
|
|
It can be used to do one-time things in the child such as storing passed |
| 452 |
|
|
parameters or opening database connections. |
| 453 |
|
|
|
| 454 |
root |
1.4 |
It is called very early - before the serialisers are created or the |
| 455 |
|
|
C<$function> name is resolved into a function reference, so it could be |
| 456 |
|
|
used to load any modules that provide the serialiser or function. It can |
| 457 |
|
|
not, however, create events. |
| 458 |
|
|
|
| 459 |
root |
1.31 |
=item done => $function (default C<CORE::exit>) |
| 460 |
|
|
|
| 461 |
|
|
The function to call when the asynchronous backend detects an end of file |
| 462 |
|
|
condition when reading from the communications socket I<and> there are no |
| 463 |
|
|
outstanding requests. It's ignored by the synchronous backend. |
| 464 |
|
|
|
| 465 |
|
|
By overriding this you can prolong the life of a RPC process after e.g. |
| 466 |
|
|
the parent has exited by running the event loop in the provided function |
| 467 |
|
|
(or simply calling it, for example, when your child process uses L<EV> you |
| 468 |
|
|
could provide L<EV::loop> as C<done> function). |
| 469 |
|
|
|
| 470 |
|
|
Of course, in that case you are responsible for exiting at the appropriate |
| 471 |
|
|
time and not returning from |
| 472 |
|
|
|
| 473 |
root |
1.1 |
=item async => $boolean (default: 0) |
| 474 |
|
|
|
| 475 |
|
|
The default server used in the child does all I/O blockingly, and only |
| 476 |
|
|
allows a single RPC call to execute concurrently. |
| 477 |
|
|
|
| 478 |
|
|
Setting C<async> to a true value switches to another implementation that |
| 479 |
root |
1.15 |
uses L<AnyEvent> in the child and allows multiple concurrent RPC calls (it |
| 480 |
|
|
does not support recursion in the event loop however, blocking condvar |
| 481 |
|
|
calls will fail). |
| 482 |
root |
1.1 |
|
| 483 |
|
|
The actual API in the child is documented in the section that describes |
| 484 |
|
|
the calling semantics of the returned C<$rpc> function. |
| 485 |
|
|
|
| 486 |
root |
1.2 |
If you want to pre-load the actual back-end modules to enable memory |
| 487 |
|
|
sharing, then you should load C<AnyEvent::Fork::RPC::Sync> for |
| 488 |
|
|
synchronous, and C<AnyEvent::Fork::RPC::Async> for asynchronous mode. |
| 489 |
|
|
|
| 490 |
root |
1.4 |
If you use a template process and want to fork both sync and async |
| 491 |
root |
1.6 |
children, then it is permissible to load both modules. |
| 492 |
root |
1.4 |
|
| 493 |
root |
1.14 |
=item serialiser => $string (default: $AnyEvent::Fork::RPC::STRING_SERIALISER) |
| 494 |
root |
1.1 |
|
| 495 |
|
|
All arguments, result data and event data have to be serialised to be |
| 496 |
|
|
transferred between the processes. For this, they have to be frozen and |
| 497 |
|
|
thawed in both parent and child processes. |
| 498 |
|
|
|
| 499 |
|
|
By default, only octet strings can be passed between the processes, which |
| 500 |
root |
1.14 |
is reasonably fast and efficient and requires no extra modules. |
| 501 |
root |
1.1 |
|
| 502 |
|
|
For more complicated use cases, you can provide your own freeze and thaw |
| 503 |
|
|
functions, by specifying a string with perl source code. It's supposed to |
| 504 |
|
|
return two code references when evaluated: the first receives a list of |
| 505 |
|
|
perl values and must return an octet string. The second receives the octet |
| 506 |
|
|
string and must return the original list of values. |
| 507 |
|
|
|
| 508 |
root |
1.2 |
If you need an external module for serialisation, then you can either |
| 509 |
|
|
pre-load it into your L<AnyEvent::Fork> process, or you can add a C<use> |
| 510 |
|
|
or C<require> statement into the serialiser string. Or both. |
| 511 |
|
|
|
| 512 |
root |
1.14 |
Here are some examples - some of them are also available as global |
| 513 |
|
|
variables that make them easier to use. |
| 514 |
|
|
|
| 515 |
|
|
=over 4 |
| 516 |
|
|
|
| 517 |
|
|
=item octet strings - C<$AnyEvent::Fork::RPC::STRING_SERIALISER> |
| 518 |
|
|
|
| 519 |
|
|
This serialiser concatenates length-prefixes octet strings, and is the |
| 520 |
root |
1.29 |
default. That means you can only pass (and return) strings containing |
| 521 |
|
|
character codes 0-255. |
| 522 |
root |
1.14 |
|
| 523 |
|
|
Implementation: |
| 524 |
|
|
|
| 525 |
|
|
( |
| 526 |
|
|
sub { pack "(w/a*)*", @_ }, |
| 527 |
|
|
sub { unpack "(w/a*)*", shift } |
| 528 |
|
|
) |
| 529 |
|
|
|
| 530 |
|
|
=item json - C<$AnyEvent::Fork::RPC::JSON_SERIALISER> |
| 531 |
|
|
|
| 532 |
|
|
This serialiser creates JSON arrays - you have to make sure the L<JSON> |
| 533 |
|
|
module is installed for this serialiser to work. It can be beneficial for |
| 534 |
|
|
sharing when you preload the L<JSON> module in a template process. |
| 535 |
|
|
|
| 536 |
|
|
L<JSON> (with L<JSON::XS> installed) is slower than the octet string |
| 537 |
|
|
serialiser, but usually much faster than L<Storable>, unless big chunks of |
| 538 |
|
|
binary data need to be transferred. |
| 539 |
|
|
|
| 540 |
|
|
Implementation: |
| 541 |
|
|
|
| 542 |
|
|
use JSON (); |
| 543 |
|
|
( |
| 544 |
|
|
sub { JSON::encode_json \@_ }, |
| 545 |
|
|
sub { @{ JSON::decode_json shift } } |
| 546 |
|
|
) |
| 547 |
|
|
|
| 548 |
|
|
=item storable - C<$AnyEvent::Fork::RPC::STORABLE_SERIALISER> |
| 549 |
|
|
|
| 550 |
|
|
This serialiser uses L<Storable>, which means it has high chance of |
| 551 |
|
|
serialising just about anything you throw at it, at the cost of having |
| 552 |
root |
1.29 |
very high overhead per operation. It also comes with perl. It should be |
| 553 |
|
|
used when you need to serialise complex data structures. |
| 554 |
root |
1.14 |
|
| 555 |
|
|
Implementation: |
| 556 |
|
|
|
| 557 |
|
|
use Storable (); |
| 558 |
|
|
( |
| 559 |
|
|
sub { Storable::freeze \@_ }, |
| 560 |
|
|
sub { @{ Storable::thaw shift } } |
| 561 |
|
|
) |
| 562 |
|
|
|
| 563 |
root |
1.28 |
=item portable storable - C<$AnyEvent::Fork::RPC::NSTORABLE_SERIALISER> |
| 564 |
|
|
|
| 565 |
|
|
This serialiser also uses L<Storable>, but uses it's "network" format |
| 566 |
root |
1.29 |
to serialise data, which makes it possible to talk to different |
| 567 |
|
|
perl binaries (for example, when talking to a process created with |
| 568 |
root |
1.28 |
L<AnyEvent::Fork::Remote>). |
| 569 |
|
|
|
| 570 |
|
|
Implementation: |
| 571 |
|
|
|
| 572 |
|
|
use Storable (); |
| 573 |
|
|
( |
| 574 |
|
|
sub { Storable::nfreeze \@_ }, |
| 575 |
|
|
sub { @{ Storable::thaw shift } } |
| 576 |
|
|
) |
| 577 |
|
|
|
| 578 |
root |
1.14 |
=back |
| 579 |
|
|
|
| 580 |
root |
1.1 |
=back |
| 581 |
|
|
|
| 582 |
root |
1.9 |
See the examples section earlier in this document for some actual |
| 583 |
|
|
examples. |
| 584 |
root |
1.8 |
|
| 585 |
root |
1.1 |
=cut |
| 586 |
|
|
|
| 587 |
root |
1.28 |
our $STRING_SERIALISER = '(sub { pack "(w/a*)*", @_ }, sub { unpack "(w/a*)*", shift })'; |
| 588 |
|
|
our $JSON_SERIALISER = 'use JSON (); (sub { JSON::encode_json \@_ }, sub { @{ JSON::decode_json shift } })'; |
| 589 |
|
|
our $STORABLE_SERIALISER = 'use Storable (); (sub { Storable::freeze \@_ }, sub { @{ Storable::thaw shift } })'; |
| 590 |
|
|
our $NSTORABLE_SERIALISER = 'use Storable (); (sub { Storable::nfreeze \@_ }, sub { @{ Storable::thaw shift } })'; |
| 591 |
root |
1.2 |
|
| 592 |
root |
1.1 |
sub run { |
| 593 |
|
|
my ($self, $function, %arg) = @_; |
| 594 |
|
|
|
| 595 |
root |
1.2 |
my $serialiser = delete $arg{serialiser} || $STRING_SERIALISER; |
| 596 |
root |
1.1 |
my $on_event = delete $arg{on_event}; |
| 597 |
|
|
my $on_error = delete $arg{on_error}; |
| 598 |
root |
1.4 |
my $on_destroy = delete $arg{on_destroy}; |
| 599 |
root |
1.1 |
|
| 600 |
|
|
# default for on_error is to on_event, if specified |
| 601 |
|
|
$on_error ||= $on_event |
| 602 |
|
|
? sub { $on_event->(error => shift) } |
| 603 |
root |
1.29 |
: sub { AE::log die => "AnyEvent::Fork::RPC: uncaught error: $_[0]." }; |
| 604 |
root |
1.1 |
|
| 605 |
|
|
# default for on_event is to raise an error |
| 606 |
|
|
$on_event ||= sub { $on_error->("event received, but no on_event handler") }; |
| 607 |
|
|
|
| 608 |
|
|
my ($f, $t) = eval $serialiser; die $@ if $@; |
| 609 |
|
|
|
| 610 |
root |
1.9 |
my (@rcb, %rcb, $fh, $shutdown, $wbuf, $ww); |
| 611 |
|
|
my ($rlen, $rbuf, $rw) = 512 - 16; |
| 612 |
root |
1.1 |
|
| 613 |
|
|
my $wcb = sub { |
| 614 |
|
|
my $len = syswrite $fh, $wbuf; |
| 615 |
|
|
|
| 616 |
root |
1.9 |
unless (defined $len) { |
| 617 |
root |
1.1 |
if ($! != Errno::EAGAIN && $! != Errno::EWOULDBLOCK) { |
| 618 |
|
|
undef $rw; undef $ww; # it ends here |
| 619 |
|
|
$on_error->("$!"); |
| 620 |
|
|
} |
| 621 |
|
|
} |
| 622 |
|
|
|
| 623 |
|
|
substr $wbuf, 0, $len, ""; |
| 624 |
|
|
|
| 625 |
|
|
unless (length $wbuf) { |
| 626 |
|
|
undef $ww; |
| 627 |
|
|
$shutdown and shutdown $fh, 1; |
| 628 |
|
|
} |
| 629 |
|
|
}; |
| 630 |
|
|
|
| 631 |
|
|
my $module = "AnyEvent::Fork::RPC::" . ($arg{async} ? "Async" : "Sync"); |
| 632 |
|
|
|
| 633 |
|
|
$self->require ($module) |
| 634 |
root |
1.31 |
->send_arg ($function, $arg{init}, $serialiser, $arg{done} || "CORE::exit") |
| 635 |
root |
1.1 |
->run ("$module\::run", sub { |
| 636 |
|
|
$fh = shift; |
| 637 |
root |
1.9 |
|
| 638 |
|
|
my ($id, $len); |
| 639 |
root |
1.1 |
$rw = AE::io $fh, 0, sub { |
| 640 |
root |
1.4 |
$rlen = $rlen * 2 + 16 if $rlen - 128 < length $rbuf; |
| 641 |
root |
1.9 |
$len = sysread $fh, $rbuf, $rlen - length $rbuf, length $rbuf; |
| 642 |
root |
1.1 |
|
| 643 |
|
|
if ($len) { |
| 644 |
root |
1.9 |
while (8 <= length $rbuf) { |
| 645 |
root |
1.24 |
($id, $len) = unpack "NN", $rbuf; |
| 646 |
root |
1.9 |
8 + $len <= length $rbuf |
| 647 |
root |
1.2 |
or last; |
| 648 |
|
|
|
| 649 |
root |
1.9 |
my @r = $t->(substr $rbuf, 8, $len); |
| 650 |
|
|
substr $rbuf, 0, 8 + $len, ""; |
| 651 |
|
|
|
| 652 |
|
|
if ($id) { |
| 653 |
|
|
if (@rcb) { |
| 654 |
|
|
(shift @rcb)->(@r); |
| 655 |
|
|
} elsif (my $cb = delete $rcb{$id}) { |
| 656 |
|
|
$cb->(@r); |
| 657 |
|
|
} else { |
| 658 |
|
|
undef $rw; undef $ww; |
| 659 |
|
|
$on_error->("unexpected data from child"); |
| 660 |
|
|
} |
| 661 |
|
|
} else { |
| 662 |
root |
1.2 |
$on_event->(@r); |
| 663 |
root |
1.1 |
} |
| 664 |
|
|
} |
| 665 |
|
|
} elsif (defined $len) { |
| 666 |
|
|
undef $rw; undef $ww; # it ends here |
| 667 |
root |
1.4 |
|
| 668 |
root |
1.9 |
if (@rcb || %rcb) { |
| 669 |
root |
1.4 |
$on_error->("unexpected eof"); |
| 670 |
|
|
} else { |
| 671 |
root |
1.20 |
$on_destroy->() |
| 672 |
|
|
if $on_destroy; |
| 673 |
root |
1.4 |
} |
| 674 |
root |
1.1 |
} elsif ($! != Errno::EAGAIN && $! != Errno::EWOULDBLOCK) { |
| 675 |
|
|
undef $rw; undef $ww; # it ends here |
| 676 |
|
|
$on_error->("read: $!"); |
| 677 |
|
|
} |
| 678 |
|
|
}; |
| 679 |
|
|
|
| 680 |
|
|
$ww ||= AE::io $fh, 1, $wcb; |
| 681 |
|
|
}); |
| 682 |
|
|
|
| 683 |
|
|
my $guard = Guard::guard { |
| 684 |
|
|
$shutdown = 1; |
| 685 |
root |
1.18 |
|
| 686 |
root |
1.19 |
shutdown $fh, 1 if $fh && !$ww; |
| 687 |
root |
1.1 |
}; |
| 688 |
|
|
|
| 689 |
root |
1.9 |
my $id; |
| 690 |
root |
1.1 |
|
| 691 |
root |
1.9 |
$arg{async} |
| 692 |
|
|
? sub { |
| 693 |
|
|
$id = ($id == 0xffffffff ? 0 : $id) + 1; |
| 694 |
|
|
$id = ($id == 0xffffffff ? 0 : $id) + 1 while exists $rcb{$id}; # rarely loops |
| 695 |
root |
1.1 |
|
| 696 |
root |
1.9 |
$rcb{$id} = pop; |
| 697 |
|
|
|
| 698 |
root |
1.20 |
$guard if 0; # keep it alive |
| 699 |
root |
1.9 |
|
| 700 |
root |
1.24 |
$wbuf .= pack "NN/a*", $id, &$f; |
| 701 |
root |
1.9 |
$ww ||= $fh && AE::io $fh, 1, $wcb; |
| 702 |
|
|
} |
| 703 |
|
|
: sub { |
| 704 |
|
|
push @rcb, pop; |
| 705 |
|
|
|
| 706 |
|
|
$guard; # keep it alive |
| 707 |
|
|
|
| 708 |
root |
1.24 |
$wbuf .= pack "N/a*", &$f; |
| 709 |
root |
1.9 |
$ww ||= $fh && AE::io $fh, 1, $wcb; |
| 710 |
|
|
} |
| 711 |
root |
1.1 |
} |
| 712 |
|
|
|
| 713 |
root |
1.4 |
=item $rpc->(..., $cb->(...)) |
| 714 |
|
|
|
| 715 |
|
|
The RPC object returned by C<AnyEvent::Fork::RPC::run> is actually a code |
| 716 |
|
|
reference. There are two things you can do with it: call it, and let it go |
| 717 |
|
|
out of scope (let it get destroyed). |
| 718 |
|
|
|
| 719 |
|
|
If C<async> was false when C<$rpc> was created (the default), then, if you |
| 720 |
|
|
call C<$rpc>, the C<$function> is invoked with all arguments passed to |
| 721 |
|
|
C<$rpc> except the last one (the callback). When the function returns, the |
| 722 |
|
|
callback will be invoked with all the return values. |
| 723 |
|
|
|
| 724 |
|
|
If C<async> was true, then the C<$function> receives an additional |
| 725 |
|
|
initial argument, the result callback. In this case, returning from |
| 726 |
|
|
C<$function> does nothing - the function only counts as "done" when the |
| 727 |
|
|
result callback is called, and any arguments passed to it are considered |
| 728 |
|
|
the return values. This makes it possible to "return" from event handlers |
| 729 |
|
|
or e.g. Coro threads. |
| 730 |
|
|
|
| 731 |
|
|
The other thing that can be done with the RPC object is to destroy it. In |
| 732 |
|
|
this case, the child process will execute all remaining RPC calls, report |
| 733 |
|
|
their results, and then exit. |
| 734 |
|
|
|
| 735 |
root |
1.8 |
See the examples section earlier in this document for some actual |
| 736 |
|
|
examples. |
| 737 |
|
|
|
| 738 |
root |
1.1 |
=back |
| 739 |
|
|
|
| 740 |
|
|
=head1 CHILD PROCESS USAGE |
| 741 |
|
|
|
| 742 |
root |
1.4 |
The following function is not available in this module. They are only |
| 743 |
|
|
available in the namespace of this module when the child is running, |
| 744 |
|
|
without having to load any extra modules. They are part of the child-side |
| 745 |
|
|
API of L<AnyEvent::Fork::RPC>. |
| 746 |
root |
1.1 |
|
| 747 |
|
|
=over 4 |
| 748 |
|
|
|
| 749 |
|
|
=item AnyEvent::Fork::RPC::event ... |
| 750 |
|
|
|
| 751 |
|
|
Send an event to the parent. Events are a bit like RPC calls made by the |
| 752 |
|
|
child process to the parent, except that there is no notion of return |
| 753 |
|
|
values. |
| 754 |
|
|
|
| 755 |
root |
1.8 |
See the examples section earlier in this document for some actual |
| 756 |
|
|
examples. |
| 757 |
|
|
|
| 758 |
root |
1.1 |
=back |
| 759 |
|
|
|
| 760 |
root |
1.31 |
=head2 PROCESS EXIT |
| 761 |
|
|
|
| 762 |
|
|
If and when the child process exits depends on the backend and |
| 763 |
|
|
configuration. Apart from explicit exits (e.g. by calling C<exit>) or |
| 764 |
|
|
runtime conditions (uncaught exceptions, signals etc.), the backends exit |
| 765 |
|
|
under these conditions: |
| 766 |
|
|
|
| 767 |
|
|
=over 4 |
| 768 |
|
|
|
| 769 |
|
|
=item Synchronous Backend |
| 770 |
|
|
|
| 771 |
|
|
The synchronous backend is very simple: when the process waits for another |
| 772 |
|
|
request to arrive and the writing side (usually in the parent) is closed, |
| 773 |
|
|
it will exit normally, i.e. as if your main program reached the end of the |
| 774 |
|
|
file. |
| 775 |
|
|
|
| 776 |
|
|
That means that if your parent process exits, the RPC process will usually |
| 777 |
|
|
exit as well, either because it is idle anyway, or because it executes a |
| 778 |
|
|
request. In the latter case, you will likely get an error when the RPc |
| 779 |
|
|
process tries to send the results to the parent (because agruably, you |
| 780 |
|
|
shouldn't exit your parent while there are still outstanding requests). |
| 781 |
|
|
|
| 782 |
|
|
The process is usually quiescent when it happens, so it should rarely be a |
| 783 |
|
|
problem, and C<END> handlers can be used to clean up. |
| 784 |
|
|
|
| 785 |
|
|
=item Asynchronous Backend |
| 786 |
|
|
|
| 787 |
|
|
For the asynchronous backend, things are more complicated: Whenever it |
| 788 |
|
|
listens for another request by the parent, it might detect that the socket |
| 789 |
|
|
was closed (e.g. because the parent exited). It will sotp listening for |
| 790 |
|
|
new requests and instead try to write out any remaining data (if any) or |
| 791 |
|
|
simply check whether the socket cna be written to. After this, the RPC |
| 792 |
|
|
process is effectively done - no new requests are incoming, no outstanding |
| 793 |
|
|
request data can be written back. |
| 794 |
|
|
|
| 795 |
|
|
Since chances are high that there are event watchers that the RPC server |
| 796 |
|
|
knows nothing about (why else would one use the async backend if not for |
| 797 |
|
|
the ability to register watchers?), the event loop would often happily |
| 798 |
|
|
continue. |
| 799 |
|
|
|
| 800 |
|
|
This is why the asynchronous backend explicitly calls C<CORE::exit> when |
| 801 |
root |
1.32 |
it is done (under other circumstances, such as when there is an I/O error |
| 802 |
|
|
and there is outstanding data to write, it will log a fatal message via |
| 803 |
|
|
L<AnyEvent::Log>, also causing the program to exit). |
| 804 |
root |
1.31 |
|
| 805 |
|
|
You can override this by specifying a function name to call via the C<done> |
| 806 |
|
|
parameter instead. |
| 807 |
|
|
|
| 808 |
|
|
=back |
| 809 |
|
|
|
| 810 |
root |
1.12 |
=head1 ADVANCED TOPICS |
| 811 |
|
|
|
| 812 |
|
|
=head2 Choosing a backend |
| 813 |
|
|
|
| 814 |
|
|
So how do you decide which backend to use? Well, that's your problem to |
| 815 |
|
|
solve, but here are some thoughts on the matter: |
| 816 |
|
|
|
| 817 |
|
|
=over 4 |
| 818 |
|
|
|
| 819 |
|
|
=item Synchronous |
| 820 |
|
|
|
| 821 |
|
|
The synchronous backend does not rely on any external modules (well, |
| 822 |
|
|
except L<common::sense>, which works around a bug in how perl's warning |
| 823 |
|
|
system works). This keeps the process very small, for example, on my |
| 824 |
|
|
system, an empty perl interpreter uses 1492kB RSS, which becomes 2020kB |
| 825 |
|
|
after C<use warnings; use strict> (for people who grew up with C64s around |
| 826 |
|
|
them this is probably shocking every single time they see it). The worker |
| 827 |
|
|
process in the first example in this document uses 1792kB. |
| 828 |
|
|
|
| 829 |
|
|
Since the calls are done synchronously, slow jobs will keep newer jobs |
| 830 |
|
|
from executing. |
| 831 |
|
|
|
| 832 |
|
|
The synchronous backend also has no overhead due to running an event loop |
| 833 |
|
|
- reading requests is therefore very efficient, while writing responses is |
| 834 |
|
|
less so, as every response results in a write syscall. |
| 835 |
|
|
|
| 836 |
|
|
If the parent process is busy and a bit slow reading responses, the child |
| 837 |
|
|
waits instead of processing further requests. This also limits the amount |
| 838 |
|
|
of memory needed for buffering, as never more than one response has to be |
| 839 |
|
|
buffered. |
| 840 |
|
|
|
| 841 |
|
|
The API in the child is simple - you just have to define a function that |
| 842 |
|
|
does something and returns something. |
| 843 |
|
|
|
| 844 |
|
|
It's hard to use modules or code that relies on an event loop, as the |
| 845 |
|
|
child cannot execute anything while it waits for more input. |
| 846 |
|
|
|
| 847 |
|
|
=item Asynchronous |
| 848 |
|
|
|
| 849 |
|
|
The asynchronous backend relies on L<AnyEvent>, which tries to be small, |
| 850 |
|
|
but still comes at a price: On my system, the worker from example 1a uses |
| 851 |
|
|
3420kB RSS (for L<AnyEvent>, which loads L<EV>, which needs L<XSLoader> |
| 852 |
|
|
which in turn loads a lot of other modules such as L<warnings>, L<strict>, |
| 853 |
|
|
L<vars>, L<Exporter>...). |
| 854 |
|
|
|
| 855 |
|
|
It batches requests and responses reasonably efficiently, doing only as |
| 856 |
|
|
few reads and writes as needed, but needs to poll for events via the event |
| 857 |
|
|
loop. |
| 858 |
|
|
|
| 859 |
|
|
Responses are queued when the parent process is busy. This means the child |
| 860 |
|
|
can continue to execute any queued requests. It also means that a child |
| 861 |
|
|
might queue a lot of responses in memory when it generates them and the |
| 862 |
|
|
parent process is slow accepting them. |
| 863 |
|
|
|
| 864 |
|
|
The API is not a straightforward RPC pattern - you have to call a |
| 865 |
|
|
"done" callback to pass return values and signal completion. Also, more |
| 866 |
|
|
importantly, the API starts jobs as fast as possible - when 1000 jobs |
| 867 |
|
|
are queued and the jobs are slow, they will all run concurrently. The |
| 868 |
|
|
child must implement some queueing/limiting mechanism if this causes |
| 869 |
|
|
problems. Alternatively, the parent could limit the amount of rpc calls |
| 870 |
|
|
that are outstanding. |
| 871 |
|
|
|
| 872 |
root |
1.15 |
Blocking use of condvars is not supported. |
| 873 |
|
|
|
| 874 |
root |
1.12 |
Using event-based modules such as L<IO::AIO>, L<Gtk2>, L<Tk> and so on is |
| 875 |
|
|
easy. |
| 876 |
|
|
|
| 877 |
|
|
=back |
| 878 |
|
|
|
| 879 |
|
|
=head2 Passing file descriptors |
| 880 |
|
|
|
| 881 |
|
|
Unlike L<AnyEvent::Fork>, this module has no in-built file handle or file |
| 882 |
|
|
descriptor passing abilities. |
| 883 |
|
|
|
| 884 |
|
|
The reason is that passing file descriptors is extraordinary tricky |
| 885 |
|
|
business, and conflicts with efficient batching of messages. |
| 886 |
|
|
|
| 887 |
|
|
There still is a method you can use: Create a |
| 888 |
|
|
C<AnyEvent::Util::portable_socketpair> and C<send_fh> one half of it to |
| 889 |
|
|
the process before you pass control to C<AnyEvent::Fork::RPC::run>. |
| 890 |
|
|
|
| 891 |
|
|
Whenever you want to pass a file descriptor, send an rpc request to the |
| 892 |
|
|
child process (so it expects the descriptor), then send it over the other |
| 893 |
|
|
half of the socketpair. The child should fetch the descriptor from the |
| 894 |
|
|
half it has passed earlier. |
| 895 |
|
|
|
| 896 |
|
|
Here is some (untested) pseudocode to that effect: |
| 897 |
|
|
|
| 898 |
|
|
use AnyEvent::Util; |
| 899 |
root |
1.27 |
use AnyEvent::Fork; |
| 900 |
root |
1.12 |
use AnyEvent::Fork::RPC; |
| 901 |
|
|
use IO::FDPass; |
| 902 |
|
|
|
| 903 |
|
|
my ($s1, $s2) = AnyEvent::Util::portable_socketpair; |
| 904 |
|
|
|
| 905 |
|
|
my $rpc = AnyEvent::Fork |
| 906 |
|
|
->new |
| 907 |
|
|
->send_fh ($s2) |
| 908 |
|
|
->require ("MyWorker") |
| 909 |
|
|
->AnyEvent::Fork::RPC::run ("MyWorker::run" |
| 910 |
|
|
init => "MyWorker::init", |
| 911 |
|
|
); |
| 912 |
|
|
|
| 913 |
|
|
undef $s2; # no need to keep it around |
| 914 |
|
|
|
| 915 |
|
|
# pass an fd |
| 916 |
|
|
$rpc->("i'll send some fd now, please expect it!", my $cv = AE::cv); |
| 917 |
|
|
|
| 918 |
|
|
IO::FDPass fileno $s1, fileno $handle_to_pass; |
| 919 |
|
|
|
| 920 |
|
|
$cv->recv; |
| 921 |
|
|
|
| 922 |
|
|
The MyWorker module could look like this: |
| 923 |
|
|
|
| 924 |
|
|
package MyWorker; |
| 925 |
|
|
|
| 926 |
|
|
use IO::FDPass; |
| 927 |
|
|
|
| 928 |
|
|
my $s2; |
| 929 |
|
|
|
| 930 |
|
|
sub init { |
| 931 |
|
|
$s2 = $_[0]; |
| 932 |
|
|
} |
| 933 |
|
|
|
| 934 |
|
|
sub run { |
| 935 |
|
|
if ($_[0] eq "i'll send some fd now, please expect it!") { |
| 936 |
|
|
my $fd = IO::FDPass::recv fileno $s2; |
| 937 |
|
|
... |
| 938 |
|
|
} |
| 939 |
|
|
} |
| 940 |
|
|
|
| 941 |
|
|
Of course, this might be blocking if you pass a lot of file descriptors, |
| 942 |
|
|
so you might want to look into L<AnyEvent::FDpasser> which can handle the |
| 943 |
|
|
gory details. |
| 944 |
|
|
|
| 945 |
root |
1.21 |
=head1 EXCEPTIONS |
| 946 |
|
|
|
| 947 |
|
|
There are no provisions whatsoever for catching exceptions at this time - |
| 948 |
|
|
in the child, exeptions might kill the process, causing calls to be lost |
| 949 |
|
|
and the parent encountering a fatal error. In the parent, exceptions in |
| 950 |
|
|
the result callback will not be caught and cause undefined behaviour. |
| 951 |
|
|
|
| 952 |
root |
1.1 |
=head1 SEE ALSO |
| 953 |
|
|
|
| 954 |
root |
1.16 |
L<AnyEvent::Fork>, to create the processes in the first place. |
| 955 |
|
|
|
| 956 |
root |
1.27 |
L<AnyEvent::Fork::Remote>, likewise, but helpful for remote processes. |
| 957 |
root |
1.26 |
|
| 958 |
root |
1.16 |
L<AnyEvent::Fork::Pool>, to manage whole pools of processes. |
| 959 |
root |
1.1 |
|
| 960 |
|
|
=head1 AUTHOR AND CONTACT INFORMATION |
| 961 |
|
|
|
| 962 |
|
|
Marc Lehmann <schmorp@schmorp.de> |
| 963 |
|
|
http://software.schmorp.de/pkg/AnyEvent-Fork-RPC |
| 964 |
|
|
|
| 965 |
|
|
=cut |
| 966 |
|
|
|
| 967 |
|
|
1 |
| 968 |
|
|
|