[ViewVC] Diff of: cvs/AnyEvent-Fork-RPC/RPC.pm

Comparing AnyEvent-Fork-RPC/RPC.pm (file contents):
Revision 1.7 by root, Wed Apr 17 20:19:41 2013 UTC vs.
Revision 1.36 by root, Sat Nov 30 17:41:46 2013 UTC

…		…
2		2
3	AnyEvent::Fork::RPC - simple RPC extension for AnyEvent::Fork	3	AnyEvent::Fork::RPC - simple RPC extension for AnyEvent::Fork
4		4
5	=head1 SYNOPSIS	5	=head1 SYNOPSIS
6		6
		7	use AnyEvent::Fork;
7	use AnyEvent::Fork::RPC;	8	use AnyEvent::Fork::RPC;
8	# use AnyEvent::Fork is not needed
9		9
10	my $rpc = AnyEvent::Fork	10	my $rpc = AnyEvent::Fork
11	->new	11	->new
12	->require ("MyModule")	12	->require ("MyModule")
13	->AnyEvent::Fork::RPC::run (	13	->AnyEvent::Fork::RPC::run (
14	"MyModule::server",	14	"MyModule::server",
15	);	15	);
16		16
		17	use AnyEvent;
		18
17	my $cv = AE::cv;	19	my $cv = AE::cv;
18		20
19	$rpc->(1, 2, 3, sub {	21	$rpc->(1, 2, 3, sub {
20	print "MyModule::server returned @_\n";	22	print "MyModule::server returned @_\n";
21	$cv->send;	23	$cv->send;
…		…
24	$cv->recv;	26	$cv->recv;
25		27
26	=head1 DESCRIPTION	28	=head1 DESCRIPTION
27		29
28	This module implements a simple RPC protocol and backend for processes	30	This module implements a simple RPC protocol and backend for processes
29	created via L<AnyEvent::Fork>, allowing you to call a function in the	31	created via L<AnyEvent::Fork> or L<AnyEvent::Fork::Remote>, allowing you
30	child process and receive its return values (up to 4GB serialised).	32	to call a function in the child process and receive its return values (up
		33	to 4GB serialised).
31		34
32	It implements two different backends: a synchronous one that works like a	35	It implements two different backends: a synchronous one that works like a
33	normal function call, and an asynchronous one that can run multiple jobs	36	normal function call, and an asynchronous one that can run multiple jobs
34	concurrently in the child, using AnyEvent.	37	concurrently in the child, using AnyEvent.
35		38
36	It also implements an asynchronous event mechanism from the child to the	39	It also implements an asynchronous event mechanism from the child to the
37	parent, that could be used for progress indications or other information.	40	parent, that could be used for progress indications or other information.
38		41
39	Loading this module also always loads L<AnyEvent::Fork>, so you can make a
40	separate C<use AnyEvent::Fork> if you wish, but you don't have to.
41
42	=head1 EXAMPLES	42	=head1 EXAMPLES
43		43
44	=head2 Synchronous Backend	44	=head2 Example 1: Synchronous Backend
45		45
46	Here is a simple example that implements a backend that executes C<unlink>	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	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	48	number of requests it has processed every three requests, which is clearly
49	silly, but illustrates the use of events.	49	silly, but illustrates the use of events.
…		…
58		58
59	my $rpc = AnyEvent::Fork	59	my $rpc = AnyEvent::Fork
60	->new	60	->new
61	->require ("MyWorker")	61	->require ("MyWorker")
62	->AnyEvent::Fork::RPC::run ("MyWorker::run",	62	->AnyEvent::Fork::RPC::run ("MyWorker::run",
63	on_error => sub { warn "FATAL: $_[0]"; exit 1 },	63	on_error => sub { warn "ERROR: $_[0]"; exit 1 },
64	on_event => sub { warn "$_[0] requests handled\n" },	64	on_event => sub { warn "$_[0] requests handled\n" },
65	on_destroy => $done,	65	on_destroy => $done,
66	);	66	);
67		67
68	for my $id (1..6) {	68	for my $id (1..6) {
…		…
137		137
138	And as a final remark, there is a fine module on CPAN that can	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	139	asynchronously C<rmdir> and C<unlink> and a lot more, and more efficiently
140	than this example, namely L<IO::AIO>.	140	than this example, namely L<IO::AIO>.
141		141
		142	=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	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 the
		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	use AnyEvent::Fork;
		196	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	on_error => sub { warn "ERROR: $_[0]"; exit 1 },
		207	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
		292	=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	=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
142	=head1 PARENT PROCESS USAGE	379	=head1 PARENT PROCESS USAGE
143		380
144	This module exports nothing, and only implements a single function:	381	This module exports nothing, and only implements a single function:
145		382
146	=over 4	383	=over 4
…		…
153		390
154	use Errno ();	391	use Errno ();
155	use Guard ();	392	use Guard ();
156		393
157	use AnyEvent;	394	use AnyEvent;
158	use AnyEvent::Fork; # we don't actually depend on it, this is for convenience
159		395
160	our $VERSION = 0.1;	396	our $VERSION = 1.21;
161		397
162	=item my $rpc = AnyEvent::Fork::RPC::run $fork, $function, [key => value...]	398	=item my $rpc = AnyEvent::Fork::RPC::run $fork, $function, [key => value...]
163		399
164	The traditional way to call it. But it is way cooler to call it in the	400	The traditional way to call it. But it is way cooler to call it in the
165	following way:	401	following way:
…		…
185	Called on (fatal) errors, with a descriptive (hopefully) message. If	421	Called on (fatal) errors, with a descriptive (hopefully) message. If
186	this callback is not provided, but C<on_event> is, then the C<on_event>	422	this callback is not provided, but C<on_event> is, then the C<on_event>
187	callback is called with the first argument being the string C<error>,	423	callback is called with the first argument being the string C<error>,
188	followed by the error message.	424	followed by the error message.
189		425
190	If neither handler is provided it prints the error to STDERR and will	426	If neither handler is provided, then the error is reported with loglevel
191	start failing badly.	427	C<error> via C<AE::log>.
192		428
193	=item on_event => $cb->(...)	429	=item on_event => $cb->(...)
194		430
195	Called for every call to the C<AnyEvent::Fork::RPC::event> function in the	431	Called for every call to the C<AnyEvent::Fork::RPC::event> function in the
196	child, with the arguments of that function passed to the callback.	432	child, with the arguments of that function passed to the callback.
…		…
218	It is called very early - before the serialisers are created or the	454	It is called very early - before the serialisers are created or the
219	C<$function> name is resolved into a function reference, so it could be	455	C<$function> name is resolved into a function reference, so it could be
220	used to load any modules that provide the serialiser or function. It can	456	used to load any modules that provide the serialiser or function. It can
221	not, however, create events.	457	not, however, create events.
222		458
		459	=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
223	=item async => $boolean (default: 0)	473	=item async => $boolean (default: 0)
224		474
225	The default server used in the child does all I/O blockingly, and only	475	The default server used in the child does all I/O blockingly, and only
226	allows a single RPC call to execute concurrently.	476	allows a single RPC call to execute concurrently.
227		477
228	Setting C<async> to a true value switches to another implementation that	478	Setting C<async> to a true value switches to another implementation that
229	uses L<AnyEvent> in the child and allows multiple concurrent RPC calls.	479	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).
230		482
231	The actual API in the child is documented in the section that describes	483	The actual API in the child is documented in the section that describes
232	the calling semantics of the returned C<$rpc> function.	484	the calling semantics of the returned C<$rpc> function.
233		485
234	If you want to pre-load the actual back-end modules to enable memory	486	If you want to pre-load the actual back-end modules to enable memory
…		…
236	synchronous, and C<AnyEvent::Fork::RPC::Async> for asynchronous mode.	488	synchronous, and C<AnyEvent::Fork::RPC::Async> for asynchronous mode.
237		489
238	If you use a template process and want to fork both sync and async	490	If you use a template process and want to fork both sync and async
239	children, then it is permissible to load both modules.	491	children, then it is permissible to load both modules.
240		492
241	=item serialiser => $string (default: '(sub { pack "(w/a)", @_ }, sub { unpack "(w/a)", shift })')	493	=item serialiser => $string (default: $AnyEvent::Fork::RPC::STRING_SERIALISER)
242		494
243	All arguments, result data and event data have to be serialised to be	495	All arguments, result data and event data have to be serialised to be
244	transferred between the processes. For this, they have to be frozen and	496	transferred between the processes. For this, they have to be frozen and
245	thawed in both parent and child processes.	497	thawed in both parent and child processes.
246		498
247	By default, only octet strings can be passed between the processes, which	499	By default, only octet strings can be passed between the processes,
248	is reasonably fast and efficient.	500	which is reasonably fast and efficient and requires no extra modules
		501	(the C<AnyEvent::Fork::RPC> distribution does not provide these extra
		502	serialiser modules).
249		503
250	For more complicated use cases, you can provide your own freeze and thaw	504	For more complicated use cases, you can provide your own freeze and thaw
251	functions, by specifying a string with perl source code. It's supposed to	505	functions, by specifying a string with perl source code. It's supposed to
252	return two code references when evaluated: the first receives a list of	506	return two code references when evaluated: the first receives a list of
253	perl values and must return an octet string. The second receives the octet	507	perl values and must return an octet string. The second receives the octet
…		…
255		509
256	If you need an external module for serialisation, then you can either	510	If you need an external module for serialisation, then you can either
257	pre-load it into your L<AnyEvent::Fork> process, or you can add a C<use>	511	pre-load it into your L<AnyEvent::Fork> process, or you can add a C<use>
258	or C<require> statement into the serialiser string. Or both.	512	or C<require> statement into the serialiser string. Or both.
259		513
		514	Here are some examples - some of them are also available as global
		515	variables that make them easier to use.
		516
		517	=over 4
		518
		519	=item octet strings - C<$AnyEvent::Fork::RPC::STRING_SERIALISER>
		520
		521	This serialiser concatenates length-prefixes octet strings, and is the
		522	default. That means you can only pass (and return) strings containing
		523	character codes 0-255.
		524
		525	Implementation:
		526
		527	(
		528	sub { pack "(w/a)", @_ },
		529	sub { unpack "(w/a)", shift }
		530	)
		531
		532	=item cbor - C<$AnyEvent::Fork::RPC::CBOR_XS_SERIALISER>
		533
		534	This serialiser creates CBOR::XS arrays - you have to make sure the
		535	L<CBOR::XS> module is installed for this serialiser to work. It can be
		536	beneficial for sharing when you preload the L<CBOR::XS> module in a template
		537	process.
		538
		539	L<CBOR::XS> is about as fast as the octet string serialiser, but supports
		540	complex data structures (similar to JSON) and is faster than any of the
		541	other serialisers. If you have the L<CBOR::XS> module available, it's the
		542	best choice.
		543
		544	The encoder enables C<allow_sharing> (so this serialisation method can
		545	encode cyclic and self-referencing data structures).
		546
		547	Implementation:
		548
		549	use CBOR::XS ();
		550	(
		551	sub { CBOR::XS::encode_cbor_sharing \@_ },
		552	sub { @{ CBOR::XS::decode_cbor shift } }
		553	)
		554
		555	=item json - C<$AnyEvent::Fork::RPC::JSON_SERIALISER>
		556
		557	This serialiser creates JSON arrays - you have to make sure the L<JSON>
		558	module is installed for this serialiser to work. It can be beneficial for
		559	sharing when you preload the L<JSON> module in a template process.
		560
		561	L<JSON> (with L<JSON::XS> installed) is slower than the octet string
		562	serialiser, but usually much faster than L<Storable>, unless big chunks of
		563	binary data need to be transferred.
		564
		565	Implementation:
		566
		567	use JSON ();
		568	(
		569	sub { JSON::encode_json \@_ },
		570	sub { @{ JSON::decode_json shift } }
		571	)
		572
		573	=item storable - C<$AnyEvent::Fork::RPC::STORABLE_SERIALISER>
		574
		575	This serialiser uses L<Storable>, which means it has high chance of
		576	serialising just about anything you throw at it, at the cost of having
		577	very high overhead per operation. It also comes with perl. It should be
		578	used when you need to serialise complex data structures.
		579
		580	Implementation:
		581
		582	use Storable ();
		583	(
		584	sub { Storable::freeze \@_ },
		585	sub { @{ Storable::thaw shift } }
		586	)
		587
		588	=item portable storable - C<$AnyEvent::Fork::RPC::NSTORABLE_SERIALISER>
		589
		590	This serialiser also uses L<Storable>, but uses it's "network" format
		591	to serialise data, which makes it possible to talk to different
		592	perl binaries (for example, when talking to a process created with
		593	L<AnyEvent::Fork::Remote>).
		594
		595	Implementation:
		596
		597	use Storable ();
		598	(
		599	sub { Storable::nfreeze \@_ },
		600	sub { @{ Storable::thaw shift } }
		601	)
		602
260	=back	603	=back
261		604
		605	=back
		606
		607	See the examples section earlier in this document for some actual
		608	examples.
		609
262	=cut	610	=cut
263		611
264	our $STRING_SERIALISER = '(sub { pack "(w/a)", @_ }, sub { unpack "(w/a)", shift })';	612	our $STRING_SERIALISER = '(sub { pack "(w/a)", @_ }, sub { unpack "(w/a)", shift })';
		613	our $CBOR_XS_SERIALISER = 'use CBOR::XS (); (sub { CBOR::XS::encode_cbor_sharing \@_ }, sub { @{ CBOR::XS::decode_cbor shift } })';
		614	our $JSON_SERIALISER = 'use JSON (); (sub { JSON::encode_json \@_ }, sub { @{ JSON::decode_json shift } })';
		615	our $STORABLE_SERIALISER = 'use Storable (); (sub { Storable::freeze \@_ }, sub { @{ Storable::thaw shift } })';
		616	our $NSTORABLE_SERIALISER = 'use Storable (); (sub { Storable::nfreeze \@_ }, sub { @{ Storable::thaw shift } })';
265		617
266	sub run {	618	sub run {
267	my ($self, $function, %arg) = @_;	619	my ($self, $function, %arg) = @_;
268		620
269	my $serialiser = delete $arg{serialiser} \|\| $STRING_SERIALISER;	621	my $serialiser = delete $arg{serialiser} \|\| $STRING_SERIALISER;
…		…
272	my $on_destroy = delete $arg{on_destroy};	624	my $on_destroy = delete $arg{on_destroy};
273		625
274	# default for on_error is to on_event, if specified	626	# default for on_error is to on_event, if specified
275	$on_error \|\|= $on_event	627	$on_error \|\|= $on_event
276	? sub { $on_event->(error => shift) }	628	? sub { $on_event->(error => shift) }
277	: sub { die "AnyEvent::Fork::RPC: uncaught error: $_[0].\n" };	629	: sub { AE::log die => "AnyEvent::Fork::RPC: uncaught error: $_[0]." };
278		630
279	# default for on_event is to raise an error	631	# default for on_event is to raise an error
280	$on_event \|\|= sub { $on_error->("event received, but no on_event handler") };	632	$on_event \|\|= sub { $on_error->("event received, but no on_event handler") };
281		633
282	my ($f, $t) = eval $serialiser; die $@ if $@;	634	my ($f, $t) = eval $serialiser; die $@ if $@;
283		635
284	my (@rcb, $fh, $shutdown, $wbuf, $ww, $rw);	636	my (@rcb, %rcb, $fh, $shutdown, $wbuf, $ww);
285	my ($rlen, $rbuf) = 512 - 16;	637	my ($rlen, $rbuf, $rw) = 512 - 16;
286		638
287	my $wcb = sub {	639	my $wcb = sub {
288	my $len = syswrite $fh, $wbuf;	640	my $len = syswrite $fh, $wbuf;
289		641
290	if (!defined $len) {	642	unless (defined $len) {
291	if ($! != Errno::EAGAIN && $! != Errno::EWOULDBLOCK) {	643	if ($! != Errno::EAGAIN && $! != Errno::EWOULDBLOCK) {
292	undef $rw; undef $ww; # it ends here	644	undef $rw; undef $ww; # it ends here
293	$on_error->("$!");	645	$on_error->("$!");
294	}	646	}
295	}	647	}
…		…
303	};	655	};
304		656
305	my $module = "AnyEvent::Fork::RPC::" . ($arg{async} ? "Async" : "Sync");	657	my $module = "AnyEvent::Fork::RPC::" . ($arg{async} ? "Async" : "Sync");
306		658
307	$self->require ($module)	659	$self->require ($module)
308	->send_arg ($function, $arg{init}, $serialiser)	660	->send_arg ($function, $arg{init}, $serialiser, $arg{done} \|\| "$module\::do_exit")
309	->run ("$module\::run", sub {	661	->run ("$module\::run", sub {
310	$fh = shift;	662	$fh = shift;
		663
		664	my ($id, $len);
311	$rw = AE::io $fh, 0, sub {	665	$rw = AE::io $fh, 0, sub {
312	$rlen = $rlen * 2 + 16 if $rlen - 128 < length $rbuf;	666	$rlen = $rlen * 2 + 16 if $rlen - 128 < length $rbuf;
313	my $len = sysread $fh, $rbuf, $rlen - length $rbuf, length $rbuf;	667	$len = sysread $fh, $rbuf, $rlen - length $rbuf, length $rbuf;
314		668
315	if ($len) {	669	if ($len) {
316	while (4 <= length $rbuf) {	670	while (8 <= length $rbuf) {
317	$len = unpack "L", $rbuf;	671	($id, $len) = unpack "NN", $rbuf;
318	4 + $len <= length $rbuf	672	8 + $len <= length $rbuf
319	or last;	673	or last;
320		674
321	my @r = $t->(substr $rbuf, 4, $len);	675	my @r = $t->(substr $rbuf, 8, $len);
322	substr $rbuf, 0, $len + 4, "";	676	substr $rbuf, 0, 8 + $len, "";
		677
		678	if ($id) {
		679	if (@rcb) {
		680	(shift @rcb)->(@r);
		681	} elsif (my $cb = delete $rcb{$id}) {
		682	$cb->(@r);
		683	} else {
		684	undef $rw; undef $ww;
		685	$on_error->("unexpected data from child");
323		686	}
324	if (pop @r) {	687	} else {
325	$on_event->(@r);	688	$on_event->(@r);
326	} elsif (@rcb) {
327	(shift @rcb)->(@r);
328	} else {
329	undef $rw; undef $ww;
330	$on_error->("unexpected data from child");
331	}	689	}
332	}	690	}
333	} elsif (defined $len) {	691	} elsif (defined $len) {
334	undef $rw; undef $ww; # it ends here	692	undef $rw; undef $ww; # it ends here
335		693
336	if (@rcb) {	694	if (@rcb \|\| %rcb) {
337	$on_error->("unexpected eof");	695	$on_error->("unexpected eof");
338	} else {	696	} else {
339	$on_destroy->();	697	$on_destroy->()
		698	if $on_destroy;
340	}	699	}
341	} elsif ($! != Errno::EAGAIN && $! != Errno::EWOULDBLOCK) {	700	} elsif ($! != Errno::EAGAIN && $! != Errno::EWOULDBLOCK) {
342	undef $rw; undef $ww; # it ends here	701	undef $rw; undef $ww; # it ends here
343	$on_error->("read: $!");	702	$on_error->("read: $!");
344	}	703	}
…		…
347	$ww \|\|= AE::io $fh, 1, $wcb;	706	$ww \|\|= AE::io $fh, 1, $wcb;
348	});	707	});
349		708
350	my $guard = Guard::guard {	709	my $guard = Guard::guard {
351	$shutdown = 1;	710	$shutdown = 1;
352	$ww \|\|= $fh && AE::io $fh, 1, $wcb;	711
		712	shutdown $fh, 1 if $fh && !$ww;
353	};	713	};
354		714
		715	my $id;
		716
		717	$arg{async}
355	sub {	718	? sub {
356	push @rcb, pop;	719	$id = ($id == 0xffffffff ? 0 : $id) + 1;
		720	$id = ($id == 0xffffffff ? 0 : $id) + 1 while exists $rcb{$id}; # rarely loops
357		721
		722	$rcb{$id} = pop;
		723
358	$guard; # keep it alive	724	$guard if 0; # keep it alive
359		725
360	$wbuf .= pack "L/a*", &$f;	726	$wbuf .= pack "NN/a*", $id, &$f;
361	$ww \|\|= $fh && AE::io $fh, 1, $wcb;	727	$ww \|\|= $fh && AE::io $fh, 1, $wcb;
362	}	728	}
		729	: sub {
		730	push @rcb, pop;
		731
		732	$guard; # keep it alive
		733
		734	$wbuf .= pack "N/a*", &$f;
		735	$ww \|\|= $fh && AE::io $fh, 1, $wcb;
		736	}
363	}	737	}
364		738
365	=item $rpc->(..., $cb->(...))	739	=item $rpc->(..., $cb->(...))
366		740
367	The RPC object returned by C<AnyEvent::Fork::RPC::run> is actually a code	741	The RPC object returned by C<AnyEvent::Fork::RPC::run> is actually a code
…		…
382		756
383	The other thing that can be done with the RPC object is to destroy it. In	757	The other thing that can be done with the RPC object is to destroy it. In
384	this case, the child process will execute all remaining RPC calls, report	758	this case, the child process will execute all remaining RPC calls, report
385	their results, and then exit.	759	their results, and then exit.
386		760
		761	See the examples section earlier in this document for some actual
		762	examples.
		763
387	=back	764	=back
388		765
389	=head1 CHILD PROCESS USAGE	766	=head1 CHILD PROCESS USAGE
390		767
391	The following function is not available in this module. They are only	768	The following function is not available in this module. They are only
…		…
399		776
400	Send an event to the parent. Events are a bit like RPC calls made by the	777	Send an event to the parent. Events are a bit like RPC calls made by the
401	child process to the parent, except that there is no notion of return	778	child process to the parent, except that there is no notion of return
402	values.	779	values.
403		780
		781	See the examples section earlier in this document for some actual
		782	examples.
		783
404	=back	784	=back
405		785
		786	=head2 PROCESS EXIT
		787
		788	If and when the child process exits depends on the backend and
		789	configuration. Apart from explicit exits (e.g. by calling C<exit>) or
		790	runtime conditions (uncaught exceptions, signals etc.), the backends exit
		791	under these conditions:
		792
		793	=over 4
		794
		795	=item Synchronous Backend
		796
		797	The synchronous backend is very simple: when the process waits for another
		798	request to arrive and the writing side (usually in the parent) is closed,
		799	it will exit normally, i.e. as if your main program reached the end of the
		800	file.
		801
		802	That means that if your parent process exits, the RPC process will usually
		803	exit as well, either because it is idle anyway, or because it executes a
		804	request. In the latter case, you will likely get an error when the RPc
		805	process tries to send the results to the parent (because agruably, you
		806	shouldn't exit your parent while there are still outstanding requests).
		807
		808	The process is usually quiescent when it happens, so it should rarely be a
		809	problem, and C<END> handlers can be used to clean up.
		810
		811	=item Asynchronous Backend
		812
		813	For the asynchronous backend, things are more complicated: Whenever it
		814	listens for another request by the parent, it might detect that the socket
		815	was closed (e.g. because the parent exited). It will sotp listening for
		816	new requests and instead try to write out any remaining data (if any) or
		817	simply check whether the socket can be written to. After this, the RPC
		818	process is effectively done - no new requests are incoming, no outstanding
		819	request data can be written back.
		820
		821	Since chances are high that there are event watchers that the RPC server
		822	knows nothing about (why else would one use the async backend if not for
		823	the ability to register watchers?), the event loop would often happily
		824	continue.
		825
		826	This is why the asynchronous backend explicitly calls C<CORE::exit> when
		827	it is done (under other circumstances, such as when there is an I/O error
		828	and there is outstanding data to write, it will log a fatal message via
		829	L<AnyEvent::Log>, also causing the program to exit).
		830
		831	You can override this by specifying a function name to call via the C<done>
		832	parameter instead.
		833
		834	=back
		835
		836	=head1 ADVANCED TOPICS
		837
		838	=head2 Choosing a backend
		839
		840	So how do you decide which backend to use? Well, that's your problem to
		841	solve, but here are some thoughts on the matter:
		842
		843	=over 4
		844
		845	=item Synchronous
		846
		847	The synchronous backend does not rely on any external modules (well,
		848	except L<common::sense>, which works around a bug in how perl's warning
		849	system works). This keeps the process very small, for example, on my
		850	system, an empty perl interpreter uses 1492kB RSS, which becomes 2020kB
		851	after C<use warnings; use strict> (for people who grew up with C64s around
		852	them this is probably shocking every single time they see it). The worker
		853	process in the first example in this document uses 1792kB.
		854
		855	Since the calls are done synchronously, slow jobs will keep newer jobs
		856	from executing.
		857
		858	The synchronous backend also has no overhead due to running an event loop
		859	- reading requests is therefore very efficient, while writing responses is
		860	less so, as every response results in a write syscall.
		861
		862	If the parent process is busy and a bit slow reading responses, the child
		863	waits instead of processing further requests. This also limits the amount
		864	of memory needed for buffering, as never more than one response has to be
		865	buffered.
		866
		867	The API in the child is simple - you just have to define a function that
		868	does something and returns something.
		869
		870	It's hard to use modules or code that relies on an event loop, as the
		871	child cannot execute anything while it waits for more input.
		872
		873	=item Asynchronous
		874
		875	The asynchronous backend relies on L<AnyEvent>, which tries to be small,
		876	but still comes at a price: On my system, the worker from example 1a uses
		877	3420kB RSS (for L<AnyEvent>, which loads L<EV>, which needs L<XSLoader>
		878	which in turn loads a lot of other modules such as L<warnings>, L<strict>,
		879	L<vars>, L<Exporter>...).
		880
		881	It batches requests and responses reasonably efficiently, doing only as
		882	few reads and writes as needed, but needs to poll for events via the event
		883	loop.
		884
		885	Responses are queued when the parent process is busy. This means the child
		886	can continue to execute any queued requests. It also means that a child
		887	might queue a lot of responses in memory when it generates them and the
		888	parent process is slow accepting them.
		889
		890	The API is not a straightforward RPC pattern - you have to call a
		891	"done" callback to pass return values and signal completion. Also, more
		892	importantly, the API starts jobs as fast as possible - when 1000 jobs
		893	are queued and the jobs are slow, they will all run concurrently. The
		894	child must implement some queueing/limiting mechanism if this causes
		895	problems. Alternatively, the parent could limit the amount of rpc calls
		896	that are outstanding.
		897
		898	Blocking use of condvars is not supported.
		899
		900	Using event-based modules such as L<IO::AIO>, L<Gtk2>, L<Tk> and so on is
		901	easy.
		902
		903	=back
		904
		905	=head2 Passing file descriptors
		906
		907	Unlike L<AnyEvent::Fork>, this module has no in-built file handle or file
		908	descriptor passing abilities.
		909
		910	The reason is that passing file descriptors is extraordinary tricky
		911	business, and conflicts with efficient batching of messages.
		912
		913	There still is a method you can use: Create a
		914	C<AnyEvent::Util::portable_socketpair> and C<send_fh> one half of it to
		915	the process before you pass control to C<AnyEvent::Fork::RPC::run>.
		916
		917	Whenever you want to pass a file descriptor, send an rpc request to the
		918	child process (so it expects the descriptor), then send it over the other
		919	half of the socketpair. The child should fetch the descriptor from the
		920	half it has passed earlier.
		921
		922	Here is some (untested) pseudocode to that effect:
		923
		924	use AnyEvent::Util;
		925	use AnyEvent::Fork;
		926	use AnyEvent::Fork::RPC;
		927	use IO::FDPass;
		928
		929	my ($s1, $s2) = AnyEvent::Util::portable_socketpair;
		930
		931	my $rpc = AnyEvent::Fork
		932	->new
		933	->send_fh ($s2)
		934	->require ("MyWorker")
		935	->AnyEvent::Fork::RPC::run ("MyWorker::run"
		936	init => "MyWorker::init",
		937	);
		938
		939	undef $s2; # no need to keep it around
		940
		941	# pass an fd
		942	$rpc->("i'll send some fd now, please expect it!", my $cv = AE::cv);
		943
		944	IO::FDPass fileno $s1, fileno $handle_to_pass;
		945
		946	$cv->recv;
		947
		948	The MyWorker module could look like this:
		949
		950	package MyWorker;
		951
		952	use IO::FDPass;
		953
		954	my $s2;
		955
		956	sub init {
		957	$s2 = $_[0];
		958	}
		959
		960	sub run {
		961	if ($_[0] eq "i'll send some fd now, please expect it!") {
		962	my $fd = IO::FDPass::recv fileno $s2;
		963	...
		964	}
		965	}
		966
		967	Of course, this might be blocking if you pass a lot of file descriptors,
		968	so you might want to look into L<AnyEvent::FDpasser> which can handle the
		969	gory details.
		970
		971	=head1 EXCEPTIONS
		972
		973	There are no provisions whatsoever for catching exceptions at this time -
		974	in the child, exeptions might kill the process, causing calls to be lost
		975	and the parent encountering a fatal error. In the parent, exceptions in
		976	the result callback will not be caught and cause undefined behaviour.
		977
406	=head1 SEE ALSO	978	=head1 SEE ALSO
407		979
408	L<AnyEvent::Fork> (to create the processes in the first place),	980	L<AnyEvent::Fork>, to create the processes in the first place.
		981
		982	L<AnyEvent::Fork::Remote>, likewise, but helpful for remote processes.
		983
409	L<AnyEvent::Fork::Pool> (to manage whole pools of processes).	984	L<AnyEvent::Fork::Pool>, to manage whole pools of processes.
410		985
411	=head1 AUTHOR AND CONTACT INFORMATION	986	=head1 AUTHOR AND CONTACT INFORMATION
412		987
413	Marc Lehmann <schmorp@schmorp.de>	988	Marc Lehmann <schmorp@schmorp.de>
414	http://software.schmorp.de/pkg/AnyEvent-Fork-RPC	989	http://software.schmorp.de/pkg/AnyEvent-Fork-RPC

Diff Legend

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines

Comparing AnyEvent-Fork-RPC/RPC.pm (file contents): Revision 1.7 by root, Wed Apr 17 20:19:41 2013 UTC vs. Revision 1.36 by root, Sat Nov 30 17:41:46 2013 UTC

Diff Legend

Comparing AnyEvent-Fork-RPC/RPC.pm (file contents):
Revision 1.7 by root, Wed Apr 17 20:19:41 2013 UTC vs.
Revision 1.36 by root, Sat Nov 30 17:41:46 2013 UTC