-x should be C<-x>, reported by Gerben Wierda.
[p5sagit/p5-mst-13.2.git] / pod / perlcall.pod
CommitLineData
a0d0e21e 1=head1 NAME
2
3perlcall - Perl calling conventions from C
4
5=head1 DESCRIPTION
6
d1b91892 7The purpose of this document is to show you how to call Perl subroutines
5f05dabc 8directly from C, i.e., how to write I<callbacks>.
a0d0e21e 9
d1b91892 10Apart from discussing the C interface provided by Perl for writing
11callbacks the document uses a series of examples to show how the
12interface actually works in practice. In addition some techniques for
13coding callbacks are covered.
a0d0e21e 14
d1b91892 15Examples where callbacks are necessary include
a0d0e21e 16
17=over 5
18
d1b91892 19=item * An Error Handler
a0d0e21e 20
21You have created an XSUB interface to an application's C API.
22
23A fairly common feature in applications is to allow you to define a C
d1b91892 24function that will be called whenever something nasty occurs. What we
25would like is to be able to specify a Perl subroutine that will be
26called instead.
a0d0e21e 27
d1b91892 28=item * An Event Driven Program
a0d0e21e 29
d1b91892 30The classic example of where callbacks are used is when writing an
31event driven program like for an X windows application. In this case
184e9718 32you register functions to be called whenever specific events occur,
5f05dabc 33e.g., a mouse button is pressed, the cursor moves into a window or a
d1b91892 34menu item is selected.
a0d0e21e 35
36=back
37
d1b91892 38Although the techniques described here are applicable when embedding
39Perl in a C program, this is not the primary goal of this document.
40There are other details that must be considered and are specific to
41embedding Perl. For details on embedding Perl in C refer to
42L<perlembed>.
a0d0e21e 43
d1b91892 44Before you launch yourself head first into the rest of this document,
45it would be a good idea to have read the following two documents -
8e07c86e 46L<perlxs> and L<perlguts>.
a0d0e21e 47
d1b91892 48=head1 THE PERL_CALL FUNCTIONS
a0d0e21e 49
d1b91892 50Although this stuff is easier to explain using examples, you first need
51be aware of a few important definitions.
a0d0e21e 52
d1b91892 53Perl has a number of C functions that allow you to call Perl
54subroutines. They are
a0d0e21e 55
56 I32 perl_call_sv(SV* sv, I32 flags) ;
57 I32 perl_call_pv(char *subname, I32 flags) ;
58 I32 perl_call_method(char *methname, I32 flags) ;
59 I32 perl_call_argv(char *subname, I32 flags, register char **argv) ;
60
d1b91892 61The key function is I<perl_call_sv>. All the other functions are
62fairly simple wrappers which make it easier to call Perl subroutines in
63special cases. At the end of the day they will all call I<perl_call_sv>
5f05dabc 64to invoke the Perl subroutine.
d1b91892 65
66All the I<perl_call_*> functions have a C<flags> parameter which is
67used to pass a bit mask of options to Perl. This bit mask operates
68identically for each of the functions. The settings available in the
69bit mask are discussed in L<FLAG VALUES>.
70
71Each of the functions will now be discussed in turn.
72
73=over 5
74
75=item B<perl_call_sv>
76
77I<perl_call_sv> takes two parameters, the first, C<sv>, is an SV*.
78This allows you to specify the Perl subroutine to be called either as a
79C string (which has first been converted to an SV) or a reference to a
80subroutine. The section, I<Using perl_call_sv>, shows how you can make
81use of I<perl_call_sv>.
82
83=item B<perl_call_pv>
84
85The function, I<perl_call_pv>, is similar to I<perl_call_sv> except it
86expects its first parameter to be a C char* which identifies the Perl
5f05dabc 87subroutine you want to call, e.g., C<perl_call_pv("fred", 0)>. If the
d1b91892 88subroutine you want to call is in another package, just include the
5f05dabc 89package name in the string, e.g., C<"pkg::fred">.
d1b91892 90
91=item B<perl_call_method>
92
93The function I<perl_call_method> is used to call a method from a Perl
94class. The parameter C<methname> corresponds to the name of the method
95to be called. Note that the class that the method belongs to is passed
96on the Perl stack rather than in the parameter list. This class can be
97either the name of the class (for a static method) or a reference to an
98object (for a virtual method). See L<perlobj> for more information on
99static and virtual methods and L<Using perl_call_method> for an example
100of using I<perl_call_method>.
101
102=item B<perl_call_argv>
103
104I<perl_call_argv> calls the Perl subroutine specified by the C string
105stored in the C<subname> parameter. It also takes the usual C<flags>
106parameter. The final parameter, C<argv>, consists of a NULL terminated
107list of C strings to be passed as parameters to the Perl subroutine.
108See I<Using perl_call_argv>.
109
110=back
111
112All the functions return an integer. This is a count of the number of
113items returned by the Perl subroutine. The actual items returned by the
114subroutine are stored on the Perl stack.
115
116As a general rule you should I<always> check the return value from
117these functions. Even if you are expecting only a particular number of
118values to be returned from the Perl subroutine, there is nothing to
119stop someone from doing something unexpected - don't say you haven't
120been warned.
121
122=head1 FLAG VALUES
123
124The C<flags> parameter in all the I<perl_call_*> functions is a bit mask
125which can consist of any combination of the symbols defined below,
126OR'ed together.
127
128
54310121 129=head2 G_VOID
130
131Calls the Perl subroutine in a void context.
132
133This flag has 2 effects:
134
135=over 5
136
137=item 1.
138
139It indicates to the subroutine being called that it is executing in
140a void context (if it executes I<wantarray> the result will be the
141undefined value).
142
143=item 2.
144
145It ensures that nothing is actually returned from the subroutine.
146
147=back
148
149The value returned by the I<perl_call_*> function indicates how many
150items have been returned by the Perl subroutine - in this case it will
151be 0.
152
153
d1b91892 154=head2 G_SCALAR
155
156Calls the Perl subroutine in a scalar context. This is the default
157context flag setting for all the I<perl_call_*> functions.
158
184e9718 159This flag has 2 effects:
d1b91892 160
161=over 5
162
163=item 1.
164
184e9718 165It indicates to the subroutine being called that it is executing in a
d1b91892 166scalar context (if it executes I<wantarray> the result will be false).
a0d0e21e 167
d1b91892 168=item 2.
169
184e9718 170It ensures that only a scalar is actually returned from the subroutine.
d1b91892 171The subroutine can, of course, ignore the I<wantarray> and return a
172list anyway. If so, then only the last element of the list will be
173returned.
174
175=back
176
184e9718 177The value returned by the I<perl_call_*> function indicates how many
d1b91892 178items have been returned by the Perl subroutine - in this case it will
179be either 0 or 1.
a0d0e21e 180
d1b91892 181If 0, then you have specified the G_DISCARD flag.
a0d0e21e 182
d1b91892 183If 1, then the item actually returned by the Perl subroutine will be
184stored on the Perl stack - the section I<Returning a Scalar> shows how
185to access this value on the stack. Remember that regardless of how
186many items the Perl subroutine returns, only the last one will be
187accessible from the stack - think of the case where only one value is
188returned as being a list with only one element. Any other items that
189were returned will not exist by the time control returns from the
190I<perl_call_*> function. The section I<Returning a list in a scalar
54310121 191context> shows an example of this behavior.
a0d0e21e 192
a0d0e21e 193
d1b91892 194=head2 G_ARRAY
a0d0e21e 195
d1b91892 196Calls the Perl subroutine in a list context.
a0d0e21e 197
184e9718 198As with G_SCALAR, this flag has 2 effects:
a0d0e21e 199
200=over 5
201
d1b91892 202=item 1.
203
184e9718 204It indicates to the subroutine being called that it is executing in an
d1b91892 205array context (if it executes I<wantarray> the result will be true).
a0d0e21e 206
a0d0e21e 207
d1b91892 208=item 2.
a0d0e21e 209
184e9718 210It ensures that all items returned from the subroutine will be
d1b91892 211accessible when control returns from the I<perl_call_*> function.
a0d0e21e 212
d1b91892 213=back
a0d0e21e 214
184e9718 215The value returned by the I<perl_call_*> function indicates how many
d1b91892 216items have been returned by the Perl subroutine.
a0d0e21e 217
184e9718 218If 0, then you have specified the G_DISCARD flag.
a0d0e21e 219
d1b91892 220If not 0, then it will be a count of the number of items returned by
221the subroutine. These items will be stored on the Perl stack. The
222section I<Returning a list of values> gives an example of using the
223G_ARRAY flag and the mechanics of accessing the returned items from the
224Perl stack.
a0d0e21e 225
d1b91892 226=head2 G_DISCARD
a0d0e21e 227
d1b91892 228By default, the I<perl_call_*> functions place the items returned from
229by the Perl subroutine on the stack. If you are not interested in
230these items, then setting this flag will make Perl get rid of them
231automatically for you. Note that it is still possible to indicate a
232context to the Perl subroutine by using either G_SCALAR or G_ARRAY.
a0d0e21e 233
d1b91892 234If you do not set this flag then it is I<very> important that you make
5f05dabc 235sure that any temporaries (i.e., parameters passed to the Perl
d1b91892 236subroutine and values returned from the subroutine) are disposed of
237yourself. The section I<Returning a Scalar> gives details of how to
5f05dabc 238dispose of these temporaries explicitly and the section I<Using Perl to
d1b91892 239dispose of temporaries> discusses the specific circumstances where you
240can ignore the problem and let Perl deal with it for you.
a0d0e21e 241
d1b91892 242=head2 G_NOARGS
a0d0e21e 243
d1b91892 244Whenever a Perl subroutine is called using one of the I<perl_call_*>
245functions, it is assumed by default that parameters are to be passed to
246the subroutine. If you are not passing any parameters to the Perl
247subroutine, you can save a bit of time by setting this flag. It has
248the effect of not creating the C<@_> array for the Perl subroutine.
a0d0e21e 249
d1b91892 250Although the functionality provided by this flag may seem
251straightforward, it should be used only if there is a good reason to do
252so. The reason for being cautious is that even if you have specified
253the G_NOARGS flag, it is still possible for the Perl subroutine that
254has been called to think that you have passed it parameters.
a0d0e21e 255
d1b91892 256In fact, what can happen is that the Perl subroutine you have called
257can access the C<@_> array from a previous Perl subroutine. This will
258occur when the code that is executing the I<perl_call_*> function has
259itself been called from another Perl subroutine. The code below
260illustrates this
a0d0e21e 261
d1b91892 262 sub fred
263 { print "@_\n" }
a0d0e21e 264
d1b91892 265 sub joe
266 { &fred }
a0d0e21e 267
d1b91892 268 &joe(1,2,3) ;
a0d0e21e 269
270This will print
271
d1b91892 272 1 2 3
273
274What has happened is that C<fred> accesses the C<@_> array which
275belongs to C<joe>.
a0d0e21e 276
a0d0e21e 277
54310121 278=head2 G_EVAL
a0d0e21e 279
d1b91892 280It is possible for the Perl subroutine you are calling to terminate
5f05dabc 281abnormally, e.g., by calling I<die> explicitly or by not actually
268118b2 282existing. By default, when either of these events occurs, the
283process will terminate immediately. If you want to trap this
d1b91892 284type of event, specify the G_EVAL flag. It will put an I<eval { }>
285around the subroutine call.
a0d0e21e 286
287Whenever control returns from the I<perl_call_*> function you need to
d1b91892 288check the C<$@> variable as you would in a normal Perl script.
289
290The value returned from the I<perl_call_*> function is dependent on
291what other flags have been specified and whether an error has
184e9718 292occurred. Here are all the different cases that can occur:
d1b91892 293
294=over 5
295
296=item *
297
298If the I<perl_call_*> function returns normally, then the value
299returned is as specified in the previous sections.
300
301=item *
302
303If G_DISCARD is specified, the return value will always be 0.
304
305=item *
306
307If G_ARRAY is specified I<and> an error has occurred, the return value
308will always be 0.
309
310=item *
a0d0e21e 311
d1b91892 312If G_SCALAR is specified I<and> an error has occurred, the return value
313will be 1 and the value on the top of the stack will be I<undef>. This
314means that if you have already detected the error by checking C<$@> and
315you want the program to continue, you must remember to pop the I<undef>
316from the stack.
a0d0e21e 317
318=back
319
54310121 320See I<Using G_EVAL> for details on using G_EVAL.
d1b91892 321
c07a80fd 322=head2 G_KEEPERR
323
324You may have noticed that using the G_EVAL flag described above will
325B<always> clear the C<$@> variable and set it to a string describing
326the error iff there was an error in the called code. This unqualified
327resetting of C<$@> can be problematic in the reliable identification of
328errors using the C<eval {}> mechanism, because the possibility exists
329that perl will call other code (end of block processing code, for
330example) between the time the error causes C<$@> to be set within
331C<eval {}>, and the subsequent statement which checks for the value of
332C<$@> gets executed in the user's script.
333
334This scenario will mostly be applicable to code that is meant to be
335called from within destructors, asynchronous callbacks, signal
336handlers, C<__DIE__> or C<__WARN__> hooks, and C<tie> functions. In
337such situations, you will not want to clear C<$@> at all, but simply to
338append any new errors to any existing value of C<$@>.
339
340The G_KEEPERR flag is meant to be used in conjunction with G_EVAL in
341I<perl_call_*> functions that are used to implement such code. This flag
342has no effect when G_EVAL is not used.
343
344When G_KEEPERR is used, any errors in the called code will be prefixed
345with the string "\t(in cleanup)", and appended to the current value
346of C<$@>.
347
348The G_KEEPERR flag was introduced in Perl version 5.002.
349
350See I<Using G_KEEPERR> for an example of a situation that warrants the
351use of this flag.
352
54310121 353=head2 Determining the Context
d1b91892 354
355As mentioned above, you can determine the context of the currently
54310121 356executing subroutine in Perl with I<wantarray>. The equivalent test
357can be made in C by using the C<GIMME_V> macro, which returns
358C<G_ARRAY> if you have been called in an array context, C<G_SCALAR> if
7a2e2cd6 359in a scalar context, or C<G_VOID> if in a void context (i.e. the
54310121 360return value will not be used). An older version of this macro is
361called C<GIMME>; in a void context it returns C<G_SCALAR> instead of
362C<G_VOID>. An example of using the C<GIMME_V> macro is shown in
363section I<Using GIMME_V>.
d1b91892 364
365=head1 KNOWN PROBLEMS
366
367This section outlines all known problems that exist in the
368I<perl_call_*> functions.
369
370=over 5
371
372=item 1.
373
374If you are intending to make use of both the G_EVAL and G_SCALAR flags
375in your code, use a version of Perl greater than 5.000. There is a bug
376in version 5.000 of Perl which means that the combination of these two
377flags will not work as described in the section I<FLAG VALUES>.
378
379Specifically, if the two flags are used when calling a subroutine and
380that subroutine does not call I<die>, the value returned by
381I<perl_call_*> will be wrong.
382
383
384=item 2.
385
386In Perl 5.000 and 5.001 there is a problem with using I<perl_call_*> if
387the Perl sub you are calling attempts to trap a I<die>.
388
389The symptom of this problem is that the called Perl sub will continue
390to completion, but whenever it attempts to pass control back to the
391XSUB, the program will immediately terminate.
392
393For example, say you want to call this Perl sub
394
395 sub fred
396 {
397 eval { die "Fatal Error" ; }
54310121 398 print "Trapped error: $@\n"
d1b91892 399 if $@ ;
400 }
401
402via this XSUB
403
404 void
405 Call_fred()
406 CODE:
924508f0 407 PUSHMARK(SP) ;
d1b91892 408 perl_call_pv("fred", G_DISCARD|G_NOARGS) ;
409 fprintf(stderr, "back in Call_fred\n") ;
410
411When C<Call_fred> is executed it will print
412
413 Trapped error: Fatal Error
414
415As control never returns to C<Call_fred>, the C<"back in Call_fred">
416string will not get printed.
417
3fe9a6f1 418To work around this problem, you can either upgrade to Perl 5.002 or
419higher, or use the G_EVAL flag with I<perl_call_*> as shown below
d1b91892 420
421 void
422 Call_fred()
423 CODE:
924508f0 424 PUSHMARK(SP) ;
d1b91892 425 perl_call_pv("fred", G_EVAL|G_DISCARD|G_NOARGS) ;
426 fprintf(stderr, "back in Call_fred\n") ;
427
428=back
429
430
a0d0e21e 431
432=head1 EXAMPLES
433
434Enough of the definition talk, let's have a few examples.
435
d1b91892 436Perl provides many macros to assist in accessing the Perl stack.
437Wherever possible, these macros should always be used when interfacing
5f05dabc 438to Perl internals. We hope this should make the code less vulnerable
d1b91892 439to any changes made to Perl in the future.
a0d0e21e 440
d1b91892 441Another point worth noting is that in the first series of examples I
442have made use of only the I<perl_call_pv> function. This has been done
443to keep the code simpler and ease you into the topic. Wherever
444possible, if the choice is between using I<perl_call_pv> and
445I<perl_call_sv>, you should always try to use I<perl_call_sv>. See
446I<Using perl_call_sv> for details.
a0d0e21e 447
d1b91892 448=head2 No Parameters, Nothing returned
a0d0e21e 449
d1b91892 450This first trivial example will call a Perl subroutine, I<PrintUID>, to
451print out the UID of the process.
a0d0e21e 452
453 sub PrintUID
454 {
455 print "UID is $<\n" ;
456 }
457
d1b91892 458and here is a C function to call it
a0d0e21e 459
d1b91892 460 static void
a0d0e21e 461 call_PrintUID()
462 {
d1b91892 463 dSP ;
a0d0e21e 464
924508f0 465 PUSHMARK(SP) ;
a0d0e21e 466 perl_call_pv("PrintUID", G_DISCARD|G_NOARGS) ;
467 }
468
d1b91892 469Simple, eh.
a0d0e21e 470
d1b91892 471A few points to note about this example.
a0d0e21e 472
473=over 5
474
d1b91892 475=item 1.
a0d0e21e 476
924508f0 477Ignore C<dSP> and C<PUSHMARK(SP)> for now. They will be discussed in
d1b91892 478the next example.
a0d0e21e 479
480=item 2.
481
d1b91892 482We aren't passing any parameters to I<PrintUID> so G_NOARGS can be
483specified.
a0d0e21e 484
d1b91892 485=item 3.
a0d0e21e 486
487We aren't interested in anything returned from I<PrintUID>, so
5f05dabc 488G_DISCARD is specified. Even if I<PrintUID> was changed to
a0d0e21e 489return some value(s), having specified G_DISCARD will mean that they
490will be wiped by the time control returns from I<perl_call_pv>.
491
d1b91892 492=item 4.
a0d0e21e 493
d1b91892 494As I<perl_call_pv> is being used, the Perl subroutine is specified as a
495C string. In this case the subroutine name has been 'hard-wired' into the
496code.
a0d0e21e 497
498=item 5.
499
d1b91892 500Because we specified G_DISCARD, it is not necessary to check the value
501returned from I<perl_call_pv>. It will always be 0.
a0d0e21e 502
503=back
504
d1b91892 505=head2 Passing Parameters
a0d0e21e 506
d1b91892 507Now let's make a slightly more complex example. This time we want to
508call a Perl subroutine, C<LeftString>, which will take 2 parameters - a
509string (C<$s>) and an integer (C<$n>). The subroutine will simply
510print the first C<$n> characters of the string.
a0d0e21e 511
d1b91892 512So the Perl subroutine would look like this
a0d0e21e 513
514 sub LeftString
515 {
516 my($s, $n) = @_ ;
517 print substr($s, 0, $n), "\n" ;
518 }
519
520The C function required to call I<LeftString> would look like this.
521
522 static void
523 call_LeftString(a, b)
524 char * a ;
525 int b ;
526 {
527 dSP ;
528
9b6570b4 529 ENTER ;
530 SAVETMPS ;
531
924508f0 532 PUSHMARK(SP) ;
a0d0e21e 533 XPUSHs(sv_2mortal(newSVpv(a, 0)));
534 XPUSHs(sv_2mortal(newSViv(b)));
535 PUTBACK ;
536
537 perl_call_pv("LeftString", G_DISCARD);
9b6570b4 538
539 FREETMPS ;
540 LEAVE ;
a0d0e21e 541 }
542
a0d0e21e 543Here are a few notes on the C function I<call_LeftString>.
544
545=over 5
546
d1b91892 547=item 1.
a0d0e21e 548
d1b91892 549Parameters are passed to the Perl subroutine using the Perl stack.
550This is the purpose of the code beginning with the line C<dSP> and
1e62ac33 551ending with the line C<PUTBACK>. The C<dSP> declares a local copy
924508f0 552of the stack pointer. This local copy should B<always> be accessed
553as C<SP>.
a0d0e21e 554
d1b91892 555=item 2.
a0d0e21e 556
557If you are going to put something onto the Perl stack, you need to know
d1b91892 558where to put it. This is the purpose of the macro C<dSP> - it declares
559and initializes a I<local> copy of the Perl stack pointer.
a0d0e21e 560
561All the other macros which will be used in this example require you to
d1b91892 562have used this macro.
a0d0e21e 563
d1b91892 564The exception to this rule is if you are calling a Perl subroutine
565directly from an XSUB function. In this case it is not necessary to
5f05dabc 566use the C<dSP> macro explicitly - it will be declared for you
d1b91892 567automatically.
a0d0e21e 568
d1b91892 569=item 3.
a0d0e21e 570
571Any parameters to be pushed onto the stack should be bracketed by the
d1b91892 572C<PUSHMARK> and C<PUTBACK> macros. The purpose of these two macros, in
5f05dabc 573this context, is to count the number of parameters you are
574pushing automatically. Then whenever Perl is creating the C<@_> array for the
d1b91892 575subroutine, it knows how big to make it.
576
577The C<PUSHMARK> macro tells Perl to make a mental note of the current
578stack pointer. Even if you aren't passing any parameters (like the
579example shown in the section I<No Parameters, Nothing returned>) you
580must still call the C<PUSHMARK> macro before you can call any of the
581I<perl_call_*> functions - Perl still needs to know that there are no
582parameters.
583
584The C<PUTBACK> macro sets the global copy of the stack pointer to be
585the same as our local copy. If we didn't do this I<perl_call_pv>
586wouldn't know where the two parameters we pushed were - remember that
587up to now all the stack pointer manipulation we have done is with our
588local copy, I<not> the global copy.
589
590=item 4.
591
5f05dabc 592The only flag specified this time is G_DISCARD. Because we are passing 2
d1b91892 593parameters to the Perl subroutine this time, we have not specified
594G_NOARGS.
a0d0e21e 595
596=item 5.
597
598Next, we come to XPUSHs. This is where the parameters actually get
d1b91892 599pushed onto the stack. In this case we are pushing a string and an
600integer.
a0d0e21e 601
54310121 602See L<perlguts/"XSUBs and the Argument Stack"> for details
d1b91892 603on how the XPUSH macros work.
a0d0e21e 604
605=item 6.
606
9b6570b4 607Because we created temporary values (by means of sv_2mortal() calls)
608we will have to tidy up the Perl stack and dispose of mortal SVs.
609
610This is the purpose of
611
612 ENTER ;
613 SAVETMPS ;
614
615at the start of the function, and
616
617 FREETMPS ;
618 LEAVE ;
619
620at the end. The C<ENTER>/C<SAVETMPS> pair creates a boundary for any
621temporaries we create. This means that the temporaries we get rid of
622will be limited to those which were created after these calls.
623
624The C<FREETMPS>/C<LEAVE> pair will get rid of any values returned by
625the Perl subroutine (see next example), plus it will also dump the
626mortal SVs we have created. Having C<ENTER>/C<SAVETMPS> at the
627beginning of the code makes sure that no other mortals are destroyed.
628
629Think of these macros as working a bit like using C<{> and C<}> in Perl
630to limit the scope of local variables.
631
632See the section I<Using Perl to dispose of temporaries> for details of
633an alternative to using these macros.
634
635=item 7.
636
d1b91892 637Finally, I<LeftString> can now be called via the I<perl_call_pv>
638function.
a0d0e21e 639
640=back
641
d1b91892 642=head2 Returning a Scalar
a0d0e21e 643
d1b91892 644Now for an example of dealing with the items returned from a Perl
645subroutine.
a0d0e21e 646
5f05dabc 647Here is a Perl subroutine, I<Adder>, that takes 2 integer parameters
d1b91892 648and simply returns their sum.
a0d0e21e 649
650 sub Adder
651 {
652 my($a, $b) = @_ ;
653 $a + $b ;
654 }
655
5f05dabc 656Because we are now concerned with the return value from I<Adder>, the C
d1b91892 657function required to call it is now a bit more complex.
a0d0e21e 658
659 static void
660 call_Adder(a, b)
661 int a ;
662 int b ;
663 {
664 dSP ;
665 int count ;
666
667 ENTER ;
668 SAVETMPS;
669
924508f0 670 PUSHMARK(SP) ;
a0d0e21e 671 XPUSHs(sv_2mortal(newSViv(a)));
672 XPUSHs(sv_2mortal(newSViv(b)));
673 PUTBACK ;
674
675 count = perl_call_pv("Adder", G_SCALAR);
676
677 SPAGAIN ;
678
d1b91892 679 if (count != 1)
680 croak("Big trouble\n") ;
a0d0e21e 681
d1b91892 682 printf ("The sum of %d and %d is %d\n", a, b, POPi) ;
a0d0e21e 683
684 PUTBACK ;
685 FREETMPS ;
686 LEAVE ;
687 }
688
a0d0e21e 689Points to note this time are
690
691=over 5
692
54310121 693=item 1.
a0d0e21e 694
d1b91892 695The only flag specified this time was G_SCALAR. That means the C<@_>
696array will be created and that the value returned by I<Adder> will
697still exist after the call to I<perl_call_pv>.
a0d0e21e 698
a0d0e21e 699=item 2.
700
a0d0e21e 701The purpose of the macro C<SPAGAIN> is to refresh the local copy of the
702stack pointer. This is necessary because it is possible that the memory
68dc0745 703allocated to the Perl stack has been reallocated whilst in the
d1b91892 704I<perl_call_pv> call.
a0d0e21e 705
d1b91892 706If you are making use of the Perl stack pointer in your code you must
54310121 707always refresh the local copy using SPAGAIN whenever you make use
a0d0e21e 708of the I<perl_call_*> functions or any other Perl internal function.
709
9b6570b4 710=item 3.
a0d0e21e 711
d1b91892 712Although only a single value was expected to be returned from I<Adder>,
713it is still good practice to check the return code from I<perl_call_pv>
714anyway.
a0d0e21e 715
d1b91892 716Expecting a single value is not quite the same as knowing that there
717will be one. If someone modified I<Adder> to return a list and we
718didn't check for that possibility and take appropriate action the Perl
719stack would end up in an inconsistent state. That is something you
5f05dabc 720I<really> don't want to happen ever.
a0d0e21e 721
9b6570b4 722=item 4.
a0d0e21e 723
d1b91892 724The C<POPi> macro is used here to pop the return value from the stack.
725In this case we wanted an integer, so C<POPi> was used.
a0d0e21e 726
727
d1b91892 728Here is the complete list of POP macros available, along with the types
729they return.
a0d0e21e 730
d1b91892 731 POPs SV
732 POPp pointer
733 POPn double
734 POPi integer
735 POPl long
a0d0e21e 736
9b6570b4 737=item 5.
a0d0e21e 738
d1b91892 739The final C<PUTBACK> is used to leave the Perl stack in a consistent
740state before exiting the function. This is necessary because when we
741popped the return value from the stack with C<POPi> it updated only our
742local copy of the stack pointer. Remember, C<PUTBACK> sets the global
743stack pointer to be the same as our local copy.
a0d0e21e 744
745=back
746
747
d1b91892 748=head2 Returning a list of values
a0d0e21e 749
d1b91892 750Now, let's extend the previous example to return both the sum of the
751parameters and the difference.
a0d0e21e 752
d1b91892 753Here is the Perl subroutine
a0d0e21e 754
755 sub AddSubtract
756 {
757 my($a, $b) = @_ ;
758 ($a+$b, $a-$b) ;
759 }
760
a0d0e21e 761and this is the C function
762
763 static void
764 call_AddSubtract(a, b)
765 int a ;
766 int b ;
767 {
768 dSP ;
769 int count ;
770
771 ENTER ;
772 SAVETMPS;
773
924508f0 774 PUSHMARK(SP) ;
a0d0e21e 775 XPUSHs(sv_2mortal(newSViv(a)));
776 XPUSHs(sv_2mortal(newSViv(b)));
777 PUTBACK ;
778
779 count = perl_call_pv("AddSubtract", G_ARRAY);
780
781 SPAGAIN ;
782
d1b91892 783 if (count != 2)
784 croak("Big trouble\n") ;
a0d0e21e 785
d1b91892 786 printf ("%d - %d = %d\n", a, b, POPi) ;
787 printf ("%d + %d = %d\n", a, b, POPi) ;
a0d0e21e 788
789 PUTBACK ;
790 FREETMPS ;
791 LEAVE ;
792 }
793
d1b91892 794If I<call_AddSubtract> is called like this
795
796 call_AddSubtract(7, 4) ;
797
798then here is the output
799
800 7 - 4 = 3
801 7 + 4 = 11
a0d0e21e 802
803Notes
804
805=over 5
806
807=item 1.
808
d1b91892 809We wanted array context, so G_ARRAY was used.
a0d0e21e 810
811=item 2.
812
d1b91892 813Not surprisingly C<POPi> is used twice this time because we were
814retrieving 2 values from the stack. The important thing to note is that
815when using the C<POP*> macros they come off the stack in I<reverse>
816order.
a0d0e21e 817
818=back
819
d1b91892 820=head2 Returning a list in a scalar context
821
822Say the Perl subroutine in the previous section was called in a scalar
823context, like this
824
825 static void
826 call_AddSubScalar(a, b)
827 int a ;
828 int b ;
829 {
830 dSP ;
831 int count ;
832 int i ;
833
834 ENTER ;
835 SAVETMPS;
836
924508f0 837 PUSHMARK(SP) ;
d1b91892 838 XPUSHs(sv_2mortal(newSViv(a)));
839 XPUSHs(sv_2mortal(newSViv(b)));
840 PUTBACK ;
841
842 count = perl_call_pv("AddSubtract", G_SCALAR);
843
844 SPAGAIN ;
845
846 printf ("Items Returned = %d\n", count) ;
847
848 for (i = 1 ; i <= count ; ++i)
849 printf ("Value %d = %d\n", i, POPi) ;
850
851 PUTBACK ;
852 FREETMPS ;
853 LEAVE ;
854 }
855
856The other modification made is that I<call_AddSubScalar> will print the
857number of items returned from the Perl subroutine and their value (for
858simplicity it assumes that they are integer). So if
859I<call_AddSubScalar> is called
860
861 call_AddSubScalar(7, 4) ;
862
863then the output will be
864
865 Items Returned = 1
866 Value 1 = 3
867
868In this case the main point to note is that only the last item in the
54310121 869list is returned from the subroutine, I<AddSubtract> actually made it back to
d1b91892 870I<call_AddSubScalar>.
871
872
873=head2 Returning Data from Perl via the parameter list
a0d0e21e 874
875It is also possible to return values directly via the parameter list -
876whether it is actually desirable to do it is another matter entirely.
877
d1b91892 878The Perl subroutine, I<Inc>, below takes 2 parameters and increments
879each directly.
a0d0e21e 880
881 sub Inc
882 {
883 ++ $_[0] ;
884 ++ $_[1] ;
885 }
886
887and here is a C function to call it.
888
889 static void
890 call_Inc(a, b)
891 int a ;
892 int b ;
893 {
894 dSP ;
895 int count ;
896 SV * sva ;
897 SV * svb ;
898
899 ENTER ;
900 SAVETMPS;
901
902 sva = sv_2mortal(newSViv(a)) ;
903 svb = sv_2mortal(newSViv(b)) ;
904
924508f0 905 PUSHMARK(SP) ;
a0d0e21e 906 XPUSHs(sva);
907 XPUSHs(svb);
908 PUTBACK ;
909
910 count = perl_call_pv("Inc", G_DISCARD);
911
912 if (count != 0)
d1b91892 913 croak ("call_Inc: expected 0 values from 'Inc', got %d\n",
914 count) ;
a0d0e21e 915
916 printf ("%d + 1 = %d\n", a, SvIV(sva)) ;
917 printf ("%d + 1 = %d\n", b, SvIV(svb)) ;
918
919 FREETMPS ;
d1b91892 920 LEAVE ;
a0d0e21e 921 }
922
d1b91892 923To be able to access the two parameters that were pushed onto the stack
924after they return from I<perl_call_pv> it is necessary to make a note
925of their addresses - thus the two variables C<sva> and C<svb>.
a0d0e21e 926
d1b91892 927The reason this is necessary is that the area of the Perl stack which
928held them will very likely have been overwritten by something else by
929the time control returns from I<perl_call_pv>.
a0d0e21e 930
931
932
933
d1b91892 934=head2 Using G_EVAL
a0d0e21e 935
d1b91892 936Now an example using G_EVAL. Below is a Perl subroutine which computes
937the difference of its 2 parameters. If this would result in a negative
938result, the subroutine calls I<die>.
a0d0e21e 939
940 sub Subtract
941 {
d1b91892 942 my ($a, $b) = @_ ;
a0d0e21e 943
944 die "death can be fatal\n" if $a < $b ;
945
d1b91892 946 $a - $b ;
a0d0e21e 947 }
948
949and some C to call it
950
951 static void
952 call_Subtract(a, b)
953 int a ;
954 int b ;
955 {
956 dSP ;
957 int count ;
a0d0e21e 958
959 ENTER ;
960 SAVETMPS;
961
924508f0 962 PUSHMARK(SP) ;
a0d0e21e 963 XPUSHs(sv_2mortal(newSViv(a)));
964 XPUSHs(sv_2mortal(newSViv(b)));
965 PUTBACK ;
966
967 count = perl_call_pv("Subtract", G_EVAL|G_SCALAR);
968
d1b91892 969 SPAGAIN ;
970
971 /* Check the eval first */
9cde0e7f 972 if (SvTRUE(ERRSV))
d1b91892 973 {
9cde0e7f 974 printf ("Uh oh - %s\n", SvPV(ERRSV, PL_na)) ;
d1b91892 975 POPs ;
976 }
977 else
978 {
979 if (count != 1)
980 croak("call_Subtract: wanted 1 value from 'Subtract', got %d\n",
981 count) ;
a0d0e21e 982
d1b91892 983 printf ("%d - %d = %d\n", a, b, POPi) ;
984 }
a0d0e21e 985
986 PUTBACK ;
987 FREETMPS ;
988 LEAVE ;
a0d0e21e 989 }
990
991If I<call_Subtract> is called thus
992
d1b91892 993 call_Subtract(4, 5)
a0d0e21e 994
995the following will be printed
996
d1b91892 997 Uh oh - death can be fatal
a0d0e21e 998
999Notes
1000
1001=over 5
1002
1003=item 1.
1004
d1b91892 1005We want to be able to catch the I<die> so we have used the G_EVAL
1006flag. Not specifying this flag would mean that the program would
1007terminate immediately at the I<die> statement in the subroutine
1008I<Subtract>.
a0d0e21e 1009
1010=item 2.
1011
54310121 1012The code
a0d0e21e 1013
9cde0e7f 1014 if (SvTRUE(ERRSV))
d1b91892 1015 {
9cde0e7f 1016 printf ("Uh oh - %s\n", SvPV(ERRSV, PL_na)) ;
d1b91892 1017 POPs ;
1018 }
a0d0e21e 1019
d1b91892 1020is the direct equivalent of this bit of Perl
a0d0e21e 1021
d1b91892 1022 print "Uh oh - $@\n" if $@ ;
a0d0e21e 1023
9cde0e7f 1024C<PL_errgv> is a perl global of type C<GV *> that points to the
1025symbol table entry containing the error. C<ERRSV> therefore
c07a80fd 1026refers to the C equivalent of C<$@>.
1027
d1b91892 1028=item 3.
a0d0e21e 1029
d1b91892 1030Note that the stack is popped using C<POPs> in the block where
9cde0e7f 1031C<SvTRUE(ERRSV)> is true. This is necessary because whenever a
d1b91892 1032I<perl_call_*> function invoked with G_EVAL|G_SCALAR returns an error,
5f05dabc 1033the top of the stack holds the value I<undef>. Because we want the
d1b91892 1034program to continue after detecting this error, it is essential that
1035the stack is tidied up by removing the I<undef>.
a0d0e21e 1036
1037=back
1038
1039
c07a80fd 1040=head2 Using G_KEEPERR
1041
1042Consider this rather facetious example, where we have used an XS
1043version of the call_Subtract example above inside a destructor:
1044
1045 package Foo;
1046 sub new { bless {}, $_[0] }
54310121 1047 sub Subtract {
c07a80fd 1048 my($a,$b) = @_;
1049 die "death can be fatal" if $a < $b ;
1050 $a - $b;
1051 }
1052 sub DESTROY { call_Subtract(5, 4); }
1053 sub foo { die "foo dies"; }
1054
1055 package main;
1056 eval { Foo->new->foo };
1057 print "Saw: $@" if $@; # should be, but isn't
1058
1059This example will fail to recognize that an error occurred inside the
1060C<eval {}>. Here's why: the call_Subtract code got executed while perl
5f05dabc 1061was cleaning up temporaries when exiting the eval block, and because
c07a80fd 1062call_Subtract is implemented with I<perl_call_pv> using the G_EVAL
1063flag, it promptly reset C<$@>. This results in the failure of the
1064outermost test for C<$@>, and thereby the failure of the error trap.
1065
1066Appending the G_KEEPERR flag, so that the I<perl_call_pv> call in
1067call_Subtract reads:
1068
1069 count = perl_call_pv("Subtract", G_EVAL|G_SCALAR|G_KEEPERR);
1070
1071will preserve the error and restore reliable error handling.
1072
d1b91892 1073=head2 Using perl_call_sv
a0d0e21e 1074
d1b91892 1075In all the previous examples I have 'hard-wired' the name of the Perl
1076subroutine to be called from C. Most of the time though, it is more
1077convenient to be able to specify the name of the Perl subroutine from
1078within the Perl script.
a0d0e21e 1079
1080Consider the Perl code below
1081
d1b91892 1082 sub fred
1083 {
1084 print "Hello there\n" ;
1085 }
1086
1087 CallSubPV("fred") ;
1088
1089Here is a snippet of XSUB which defines I<CallSubPV>.
1090
1091 void
1092 CallSubPV(name)
1093 char * name
1094 CODE:
924508f0 1095 PUSHMARK(SP) ;
d1b91892 1096 perl_call_pv(name, G_DISCARD|G_NOARGS) ;
a0d0e21e 1097
54310121 1098That is fine as far as it goes. The thing is, the Perl subroutine
5f05dabc 1099can be specified as only a string. For Perl 4 this was adequate,
d1b91892 1100but Perl 5 allows references to subroutines and anonymous subroutines.
1101This is where I<perl_call_sv> is useful.
1102
1103The code below for I<CallSubSV> is identical to I<CallSubPV> except
1104that the C<name> parameter is now defined as an SV* and we use
1105I<perl_call_sv> instead of I<perl_call_pv>.
1106
1107 void
1108 CallSubSV(name)
1109 SV * name
1110 CODE:
924508f0 1111 PUSHMARK(SP) ;
d1b91892 1112 perl_call_sv(name, G_DISCARD|G_NOARGS) ;
a0d0e21e 1113
5f05dabc 1114Because we are using an SV to call I<fred> the following can all be used
a0d0e21e 1115
d1b91892 1116 CallSubSV("fred") ;
1117 CallSubSV(\&fred) ;
1118 $ref = \&fred ;
1119 CallSubSV($ref) ;
1120 CallSubSV( sub { print "Hello there\n" } ) ;
a0d0e21e 1121
d1b91892 1122As you can see, I<perl_call_sv> gives you much greater flexibility in
1123how you can specify the Perl subroutine.
1124
1125You should note that if it is necessary to store the SV (C<name> in the
1126example above) which corresponds to the Perl subroutine so that it can
5f05dabc 1127be used later in the program, it not enough just to store a copy of the
d1b91892 1128pointer to the SV. Say the code above had been like this
1129
1130 static SV * rememberSub ;
1131
1132 void
1133 SaveSub1(name)
1134 SV * name
1135 CODE:
1136 rememberSub = name ;
1137
1138 void
1139 CallSavedSub1()
1140 CODE:
924508f0 1141 PUSHMARK(SP) ;
d1b91892 1142 perl_call_sv(rememberSub, G_DISCARD|G_NOARGS) ;
a0d0e21e 1143
d1b91892 1144The reason this is wrong is that by the time you come to use the
1145pointer C<rememberSub> in C<CallSavedSub1>, it may or may not still refer
1146to the Perl subroutine that was recorded in C<SaveSub1>. This is
1147particularly true for these cases
a0d0e21e 1148
d1b91892 1149 SaveSub1(\&fred) ;
1150 CallSavedSub1() ;
a0d0e21e 1151
d1b91892 1152 SaveSub1( sub { print "Hello there\n" } ) ;
1153 CallSavedSub1() ;
a0d0e21e 1154
d1b91892 1155By the time each of the C<SaveSub1> statements above have been executed,
54310121 1156the SV*s which corresponded to the parameters will no longer exist.
d1b91892 1157Expect an error message from Perl of the form
a0d0e21e 1158
d1b91892 1159 Can't use an undefined value as a subroutine reference at ...
a0d0e21e 1160
d1b91892 1161for each of the C<CallSavedSub1> lines.
a0d0e21e 1162
54310121 1163Similarly, with this code
a0d0e21e 1164
d1b91892 1165 $ref = \&fred ;
1166 SaveSub1($ref) ;
1167 $ref = 47 ;
1168 CallSavedSub1() ;
a0d0e21e 1169
54310121 1170you can expect one of these messages (which you actually get is dependent on
1171the version of Perl you are using)
a0d0e21e 1172
d1b91892 1173 Not a CODE reference at ...
1174 Undefined subroutine &main::47 called ...
a0d0e21e 1175
d1b91892 1176The variable C<$ref> may have referred to the subroutine C<fred>
1177whenever the call to C<SaveSub1> was made but by the time
5f05dabc 1178C<CallSavedSub1> gets called it now holds the number C<47>. Because we
d1b91892 1179saved only a pointer to the original SV in C<SaveSub1>, any changes to
1180C<$ref> will be tracked by the pointer C<rememberSub>. This means that
1181whenever C<CallSavedSub1> gets called, it will attempt to execute the
1182code which is referenced by the SV* C<rememberSub>. In this case
1183though, it now refers to the integer C<47>, so expect Perl to complain
1184loudly.
a0d0e21e 1185
d1b91892 1186A similar but more subtle problem is illustrated with this code
a0d0e21e 1187
d1b91892 1188 $ref = \&fred ;
1189 SaveSub1($ref) ;
1190 $ref = \&joe ;
1191 CallSavedSub1() ;
a0d0e21e 1192
d1b91892 1193This time whenever C<CallSavedSub1> get called it will execute the Perl
54310121 1194subroutine C<joe> (assuming it exists) rather than C<fred> as was
d1b91892 1195originally requested in the call to C<SaveSub1>.
a0d0e21e 1196
d1b91892 1197To get around these problems it is necessary to take a full copy of the
1198SV. The code below shows C<SaveSub2> modified to do that
a0d0e21e 1199
d1b91892 1200 static SV * keepSub = (SV*)NULL ;
1201
1202 void
1203 SaveSub2(name)
1204 SV * name
1205 CODE:
1206 /* Take a copy of the callback */
1207 if (keepSub == (SV*)NULL)
1208 /* First time, so create a new SV */
1209 keepSub = newSVsv(name) ;
1210 else
1211 /* Been here before, so overwrite */
1212 SvSetSV(keepSub, name) ;
1213
1214 void
1215 CallSavedSub2()
1216 CODE:
924508f0 1217 PUSHMARK(SP) ;
d1b91892 1218 perl_call_sv(keepSub, G_DISCARD|G_NOARGS) ;
1219
5f05dabc 1220To avoid creating a new SV every time C<SaveSub2> is called,
d1b91892 1221the function first checks to see if it has been called before. If not,
1222then space for a new SV is allocated and the reference to the Perl
1223subroutine, C<name> is copied to the variable C<keepSub> in one
1224operation using C<newSVsv>. Thereafter, whenever C<SaveSub2> is called
1225the existing SV, C<keepSub>, is overwritten with the new value using
1226C<SvSetSV>.
1227
1228=head2 Using perl_call_argv
1229
1230Here is a Perl subroutine which prints whatever parameters are passed
1231to it.
1232
1233 sub PrintList
1234 {
1235 my(@list) = @_ ;
1236
1237 foreach (@list) { print "$_\n" }
1238 }
1239
1240and here is an example of I<perl_call_argv> which will call
1241I<PrintList>.
1242
1243 static char * words[] = {"alpha", "beta", "gamma", "delta", NULL} ;
1244
1245 static void
1246 call_PrintList()
1247 {
1248 dSP ;
1249
1250 perl_call_argv("PrintList", G_DISCARD, words) ;
1251 }
1252
1253Note that it is not necessary to call C<PUSHMARK> in this instance.
1254This is because I<perl_call_argv> will do it for you.
1255
1256=head2 Using perl_call_method
a0d0e21e 1257
1258Consider the following Perl code
1259
d1b91892 1260 {
1261 package Mine ;
1262
1263 sub new
1264 {
1265 my($type) = shift ;
1266 bless [@_]
1267 }
1268
1269 sub Display
1270 {
1271 my ($self, $index) = @_ ;
1272 print "$index: $$self[$index]\n" ;
1273 }
1274
1275 sub PrintID
1276 {
1277 my($class) = @_ ;
1278 print "This is Class $class version 1.0\n" ;
1279 }
1280 }
1281
5f05dabc 1282It implements just a very simple class to manage an array. Apart from
d1b91892 1283the constructor, C<new>, it declares methods, one static and one
5f05dabc 1284virtual. The static method, C<PrintID>, prints out simply the class
d1b91892 1285name and a version number. The virtual method, C<Display>, prints out a
1286single element of the array. Here is an all Perl example of using it.
1287
1288 $a = new Mine ('red', 'green', 'blue') ;
1289 $a->Display(1) ;
1290 PrintID Mine;
a0d0e21e 1291
d1b91892 1292will print
a0d0e21e 1293
d1b91892 1294 1: green
54310121 1295 This is Class Mine version 1.0
a0d0e21e 1296
d1b91892 1297Calling a Perl method from C is fairly straightforward. The following
1298things are required
a0d0e21e 1299
d1b91892 1300=over 5
1301
1302=item *
1303
1304a reference to the object for a virtual method or the name of the class
1305for a static method.
1306
1307=item *
1308
1309the name of the method.
1310
1311=item *
1312
1313any other parameters specific to the method.
1314
1315=back
1316
1317Here is a simple XSUB which illustrates the mechanics of calling both
1318the C<PrintID> and C<Display> methods from C.
1319
1320 void
1321 call_Method(ref, method, index)
1322 SV * ref
1323 char * method
1324 int index
1325 CODE:
924508f0 1326 PUSHMARK(SP);
d1b91892 1327 XPUSHs(ref);
1328 XPUSHs(sv_2mortal(newSViv(index))) ;
1329 PUTBACK;
1330
1331 perl_call_method(method, G_DISCARD) ;
1332
1333 void
1334 call_PrintID(class, method)
1335 char * class
1336 char * method
1337 CODE:
924508f0 1338 PUSHMARK(SP);
d1b91892 1339 XPUSHs(sv_2mortal(newSVpv(class, 0))) ;
1340 PUTBACK;
1341
1342 perl_call_method(method, G_DISCARD) ;
1343
1344
1345So the methods C<PrintID> and C<Display> can be invoked like this
1346
1347 $a = new Mine ('red', 'green', 'blue') ;
1348 call_Method($a, 'Display', 1) ;
1349 call_PrintID('Mine', 'PrintID') ;
1350
1351The only thing to note is that in both the static and virtual methods,
1352the method name is not passed via the stack - it is used as the first
1353parameter to I<perl_call_method>.
1354
54310121 1355=head2 Using GIMME_V
d1b91892 1356
54310121 1357Here is a trivial XSUB which prints the context in which it is
d1b91892 1358currently executing.
1359
1360 void
1361 PrintContext()
1362 CODE:
54310121 1363 I32 gimme = GIMME_V;
1364 if (gimme == G_VOID)
1365 printf ("Context is Void\n") ;
1366 else if (gimme == G_SCALAR)
d1b91892 1367 printf ("Context is Scalar\n") ;
1368 else
1369 printf ("Context is Array\n") ;
1370
1371and here is some Perl to test it
1372
54310121 1373 PrintContext ;
d1b91892 1374 $a = PrintContext ;
1375 @a = PrintContext ;
1376
1377The output from that will be
1378
54310121 1379 Context is Void
d1b91892 1380 Context is Scalar
1381 Context is Array
1382
1383=head2 Using Perl to dispose of temporaries
1384
1385In the examples given to date, any temporaries created in the callback
5f05dabc 1386(i.e., parameters passed on the stack to the I<perl_call_*> function or
d1b91892 1387values returned via the stack) have been freed by one of these methods
1388
1389=over 5
1390
1391=item *
1392
1393specifying the G_DISCARD flag with I<perl_call_*>.
1394
1395=item *
1396
1397explicitly disposed of using the C<ENTER>/C<SAVETMPS> -
1398C<FREETMPS>/C<LEAVE> pairing.
1399
1400=back
1401
1402There is another method which can be used, namely letting Perl do it
1403for you automatically whenever it regains control after the callback
1404has terminated. This is done by simply not using the
1405
1406 ENTER ;
1407 SAVETMPS ;
1408 ...
1409 FREETMPS ;
1410 LEAVE ;
1411
1412sequence in the callback (and not, of course, specifying the G_DISCARD
1413flag).
1414
1415If you are going to use this method you have to be aware of a possible
1416memory leak which can arise under very specific circumstances. To
1417explain these circumstances you need to know a bit about the flow of
1418control between Perl and the callback routine.
1419
1420The examples given at the start of the document (an error handler and
1421an event driven program) are typical of the two main sorts of flow
1422control that you are likely to encounter with callbacks. There is a
1423very important distinction between them, so pay attention.
1424
1425In the first example, an error handler, the flow of control could be as
1426follows. You have created an interface to an external library.
1427Control can reach the external library like this
1428
1429 perl --> XSUB --> external library
1430
1431Whilst control is in the library, an error condition occurs. You have
1432previously set up a Perl callback to handle this situation, so it will
1433get executed. Once the callback has finished, control will drop back to
1434Perl again. Here is what the flow of control will be like in that
1435situation
1436
1437 perl --> XSUB --> external library
1438 ...
1439 error occurs
1440 ...
1441 external library --> perl_call --> perl
1442 |
1443 perl <-- XSUB <-- external library <-- perl_call <----+
1444
1445After processing of the error using I<perl_call_*> is completed,
1446control reverts back to Perl more or less immediately.
1447
1448In the diagram, the further right you go the more deeply nested the
1449scope is. It is only when control is back with perl on the extreme
1450left of the diagram that you will have dropped back to the enclosing
1451scope and any temporaries you have left hanging around will be freed.
1452
1453In the second example, an event driven program, the flow of control
1454will be more like this
1455
1456 perl --> XSUB --> event handler
1457 ...
54310121 1458 event handler --> perl_call --> perl
d1b91892 1459 |
54310121 1460 event handler <-- perl_call <----+
d1b91892 1461 ...
54310121 1462 event handler --> perl_call --> perl
d1b91892 1463 |
54310121 1464 event handler <-- perl_call <----+
d1b91892 1465 ...
54310121 1466 event handler --> perl_call --> perl
d1b91892 1467 |
54310121 1468 event handler <-- perl_call <----+
d1b91892 1469
1470In this case the flow of control can consist of only the repeated
1471sequence
1472
1473 event handler --> perl_call --> perl
1474
54310121 1475for practically the complete duration of the program. This means that
1476control may I<never> drop back to the surrounding scope in Perl at the
1477extreme left.
d1b91892 1478
1479So what is the big problem? Well, if you are expecting Perl to tidy up
1480those temporaries for you, you might be in for a long wait. For Perl
5f05dabc 1481to dispose of your temporaries, control must drop back to the
d1b91892 1482enclosing scope at some stage. In the event driven scenario that may
1483never happen. This means that as time goes on, your program will
1484create more and more temporaries, none of which will ever be freed. As
1485each of these temporaries consumes some memory your program will
1486eventually consume all the available memory in your system - kapow!
1487
1488So here is the bottom line - if you are sure that control will revert
1489back to the enclosing Perl scope fairly quickly after the end of your
5f05dabc 1490callback, then it isn't absolutely necessary to dispose explicitly of
d1b91892 1491any temporaries you may have created. Mind you, if you are at all
1492uncertain about what to do, it doesn't do any harm to tidy up anyway.
1493
1494
1495=head2 Strategies for storing Callback Context Information
1496
1497
1498Potentially one of the trickiest problems to overcome when designing a
1499callback interface can be figuring out how to store the mapping between
1500the C callback function and the Perl equivalent.
1501
1502To help understand why this can be a real problem first consider how a
1503callback is set up in an all C environment. Typically a C API will
1504provide a function to register a callback. This will expect a pointer
1505to a function as one of its parameters. Below is a call to a
1506hypothetical function C<register_fatal> which registers the C function
1507to get called when a fatal error occurs.
1508
1509 register_fatal(cb1) ;
1510
1511The single parameter C<cb1> is a pointer to a function, so you must
1512have defined C<cb1> in your code, say something like this
1513
1514 static void
1515 cb1()
1516 {
1517 printf ("Fatal Error\n") ;
1518 exit(1) ;
1519 }
1520
1521Now change that to call a Perl subroutine instead
1522
1523 static SV * callback = (SV*)NULL;
1524
1525 static void
1526 cb1()
1527 {
1528 dSP ;
1529
924508f0 1530 PUSHMARK(SP) ;
d1b91892 1531
1532 /* Call the Perl sub to process the callback */
1533 perl_call_sv(callback, G_DISCARD) ;
1534 }
1535
1536
1537 void
1538 register_fatal(fn)
1539 SV * fn
1540 CODE:
1541 /* Remember the Perl sub */
1542 if (callback == (SV*)NULL)
1543 callback = newSVsv(fn) ;
1544 else
1545 SvSetSV(callback, fn) ;
1546
1547 /* register the callback with the external library */
1548 register_fatal(cb1) ;
1549
1550where the Perl equivalent of C<register_fatal> and the callback it
1551registers, C<pcb1>, might look like this
1552
1553 # Register the sub pcb1
1554 register_fatal(\&pcb1) ;
1555
1556 sub pcb1
1557 {
1558 die "I'm dying...\n" ;
1559 }
1560
1561The mapping between the C callback and the Perl equivalent is stored in
1562the global variable C<callback>.
1563
5f05dabc 1564This will be adequate if you ever need to have only one callback
d1b91892 1565registered at any time. An example could be an error handler like the
1566code sketched out above. Remember though, repeated calls to
1567C<register_fatal> will replace the previously registered callback
1568function with the new one.
1569
1570Say for example you want to interface to a library which allows asynchronous
1571file i/o. In this case you may be able to register a callback whenever
1572a read operation has completed. To be of any use we want to be able to
1573call separate Perl subroutines for each file that is opened. As it
1574stands, the error handler example above would not be adequate as it
1575allows only a single callback to be defined at any time. What we
1576require is a means of storing the mapping between the opened file and
1577the Perl subroutine we want to be called for that file.
1578
1579Say the i/o library has a function C<asynch_read> which associates a C
1580function C<ProcessRead> with a file handle C<fh> - this assumes that it
1581has also provided some routine to open the file and so obtain the file
1582handle.
1583
1584 asynch_read(fh, ProcessRead)
1585
1586This may expect the C I<ProcessRead> function of this form
1587
1588 void
1589 ProcessRead(fh, buffer)
1590 int fh ;
1591 char * buffer ;
1592 {
54310121 1593 ...
d1b91892 1594 }
1595
1596To provide a Perl interface to this library we need to be able to map
1597between the C<fh> parameter and the Perl subroutine we want called. A
1598hash is a convenient mechanism for storing this mapping. The code
1599below shows a possible implementation
1600
1601 static HV * Mapping = (HV*)NULL ;
a0d0e21e 1602
d1b91892 1603 void
1604 asynch_read(fh, callback)
1605 int fh
1606 SV * callback
1607 CODE:
1608 /* If the hash doesn't already exist, create it */
1609 if (Mapping == (HV*)NULL)
1610 Mapping = newHV() ;
1611
1612 /* Save the fh -> callback mapping */
1613 hv_store(Mapping, (char*)&fh, sizeof(fh), newSVsv(callback), 0) ;
1614
1615 /* Register with the C Library */
1616 asynch_read(fh, asynch_read_if) ;
1617
1618and C<asynch_read_if> could look like this
1619
1620 static void
1621 asynch_read_if(fh, buffer)
1622 int fh ;
1623 char * buffer ;
1624 {
1625 dSP ;
1626 SV ** sv ;
1627
1628 /* Get the callback associated with fh */
1629 sv = hv_fetch(Mapping, (char*)&fh , sizeof(fh), FALSE) ;
1630 if (sv == (SV**)NULL)
1631 croak("Internal error...\n") ;
1632
924508f0 1633 PUSHMARK(SP) ;
d1b91892 1634 XPUSHs(sv_2mortal(newSViv(fh))) ;
1635 XPUSHs(sv_2mortal(newSVpv(buffer, 0))) ;
1636 PUTBACK ;
1637
1638 /* Call the Perl sub */
1639 perl_call_sv(*sv, G_DISCARD) ;
1640 }
1641
1642For completeness, here is C<asynch_close>. This shows how to remove
1643the entry from the hash C<Mapping>.
1644
1645 void
1646 asynch_close(fh)
1647 int fh
1648 CODE:
1649 /* Remove the entry from the hash */
1650 (void) hv_delete(Mapping, (char*)&fh, sizeof(fh), G_DISCARD) ;
a0d0e21e 1651
d1b91892 1652 /* Now call the real asynch_close */
1653 asynch_close(fh) ;
a0d0e21e 1654
d1b91892 1655So the Perl interface would look like this
1656
1657 sub callback1
1658 {
1659 my($handle, $buffer) = @_ ;
1660 }
a0d0e21e 1661
d1b91892 1662 # Register the Perl callback
1663 asynch_read($fh, \&callback1) ;
a0d0e21e 1664
d1b91892 1665 asynch_close($fh) ;
1666
1667The mapping between the C callback and Perl is stored in the global
1668hash C<Mapping> this time. Using a hash has the distinct advantage that
1669it allows an unlimited number of callbacks to be registered.
1670
1671What if the interface provided by the C callback doesn't contain a
1672parameter which allows the file handle to Perl subroutine mapping? Say
1673in the asynchronous i/o package, the callback function gets passed only
1674the C<buffer> parameter like this
1675
1676 void
1677 ProcessRead(buffer)
1678 char * buffer ;
1679 {
1680 ...
1681 }
a0d0e21e 1682
d1b91892 1683Without the file handle there is no straightforward way to map from the
1684C callback to the Perl subroutine.
a0d0e21e 1685
54310121 1686In this case a possible way around this problem is to predefine a
d1b91892 1687series of C functions to act as the interface to Perl, thus
1688
1689 #define MAX_CB 3
1690 #define NULL_HANDLE -1
1691 typedef void (*FnMap)() ;
1692
1693 struct MapStruct {
1694 FnMap Function ;
1695 SV * PerlSub ;
1696 int Handle ;
1697 } ;
1698
1699 static void fn1() ;
1700 static void fn2() ;
1701 static void fn3() ;
1702
1703 static struct MapStruct Map [MAX_CB] =
1704 {
1705 { fn1, NULL, NULL_HANDLE },
1706 { fn2, NULL, NULL_HANDLE },
1707 { fn3, NULL, NULL_HANDLE }
1708 } ;
1709
1710 static void
1711 Pcb(index, buffer)
1712 int index ;
1713 char * buffer ;
1714 {
1715 dSP ;
1716
924508f0 1717 PUSHMARK(SP) ;
d1b91892 1718 XPUSHs(sv_2mortal(newSVpv(buffer, 0))) ;
1719 PUTBACK ;
1720
1721 /* Call the Perl sub */
1722 perl_call_sv(Map[index].PerlSub, G_DISCARD) ;
1723 }
1724
1725 static void
1726 fn1(buffer)
1727 char * buffer ;
1728 {
1729 Pcb(0, buffer) ;
1730 }
1731
1732 static void
1733 fn2(buffer)
1734 char * buffer ;
1735 {
1736 Pcb(1, buffer) ;
1737 }
1738
1739 static void
1740 fn3(buffer)
1741 char * buffer ;
1742 {
1743 Pcb(2, buffer) ;
1744 }
1745
1746 void
1747 array_asynch_read(fh, callback)
1748 int fh
1749 SV * callback
1750 CODE:
1751 int index ;
1752 int null_index = MAX_CB ;
1753
1754 /* Find the same handle or an empty entry */
1755 for (index = 0 ; index < MAX_CB ; ++index)
1756 {
1757 if (Map[index].Handle == fh)
1758 break ;
1759
1760 if (Map[index].Handle == NULL_HANDLE)
1761 null_index = index ;
1762 }
1763
1764 if (index == MAX_CB && null_index == MAX_CB)
1765 croak ("Too many callback functions registered\n") ;
1766
1767 if (index == MAX_CB)
1768 index = null_index ;
1769
1770 /* Save the file handle */
1771 Map[index].Handle = fh ;
1772
1773 /* Remember the Perl sub */
1774 if (Map[index].PerlSub == (SV*)NULL)
1775 Map[index].PerlSub = newSVsv(callback) ;
1776 else
1777 SvSetSV(Map[index].PerlSub, callback) ;
1778
1779 asynch_read(fh, Map[index].Function) ;
1780
1781 void
1782 array_asynch_close(fh)
1783 int fh
1784 CODE:
1785 int index ;
1786
1787 /* Find the file handle */
1788 for (index = 0; index < MAX_CB ; ++ index)
1789 if (Map[index].Handle == fh)
1790 break ;
1791
1792 if (index == MAX_CB)
1793 croak ("could not close fh %d\n", fh) ;
1794
1795 Map[index].Handle = NULL_HANDLE ;
1796 SvREFCNT_dec(Map[index].PerlSub) ;
1797 Map[index].PerlSub = (SV*)NULL ;
1798
1799 asynch_close(fh) ;
1800
5f05dabc 1801In this case the functions C<fn1>, C<fn2>, and C<fn3> are used to
d1b91892 1802remember the Perl subroutine to be called. Each of the functions holds
4a6725af 1803a separate hard-wired index which is used in the function C<Pcb> to
d1b91892 1804access the C<Map> array and actually call the Perl subroutine.
1805
1806There are some obvious disadvantages with this technique.
1807
1808Firstly, the code is considerably more complex than with the previous
1809example.
1810
4a6725af 1811Secondly, there is a hard-wired limit (in this case 3) to the number of
d1b91892 1812callbacks that can exist simultaneously. The only way to increase the
1813limit is by modifying the code to add more functions and then
54310121 1814recompiling. None the less, as long as the number of functions is
d1b91892 1815chosen with some care, it is still a workable solution and in some
1816cases is the only one available.
1817
1818To summarize, here are a number of possible methods for you to consider
1819for storing the mapping between C and the Perl callback
1820
1821=over 5
1822
1823=item 1. Ignore the problem - Allow only 1 callback
1824
1825For a lot of situations, like interfacing to an error handler, this may
1826be a perfectly adequate solution.
1827
1828=item 2. Create a sequence of callbacks - hard wired limit
1829
1830If it is impossible to tell from the parameters passed back from the C
1831callback what the context is, then you may need to create a sequence of C
1832callback interface functions, and store pointers to each in an array.
1833
1834=item 3. Use a parameter to map to the Perl callback
1835
1836A hash is an ideal mechanism to store the mapping between C and Perl.
1837
1838=back
a0d0e21e 1839
a0d0e21e 1840
1841=head2 Alternate Stack Manipulation
1842
a0d0e21e 1843
d1b91892 1844Although I have made use of only the C<POP*> macros to access values
1845returned from Perl subroutines, it is also possible to bypass these
8e07c86e 1846macros and read the stack using the C<ST> macro (See L<perlxs> for a
d1b91892 1847full description of the C<ST> macro).
1848
1849Most of the time the C<POP*> macros should be adequate, the main
1850problem with them is that they force you to process the returned values
1851in sequence. This may not be the most suitable way to process the
1852values in some cases. What we want is to be able to access the stack in
1853a random order. The C<ST> macro as used when coding an XSUB is ideal
1854for this purpose.
1855
1856The code below is the example given in the section I<Returning a list
1857of values> recoded to use C<ST> instead of C<POP*>.
1858
1859 static void
1860 call_AddSubtract2(a, b)
1861 int a ;
1862 int b ;
1863 {
1864 dSP ;
1865 I32 ax ;
1866 int count ;
1867
1868 ENTER ;
1869 SAVETMPS;
1870
924508f0 1871 PUSHMARK(SP) ;
d1b91892 1872 XPUSHs(sv_2mortal(newSViv(a)));
1873 XPUSHs(sv_2mortal(newSViv(b)));
1874 PUTBACK ;
1875
1876 count = perl_call_pv("AddSubtract", G_ARRAY);
1877
1878 SPAGAIN ;
924508f0 1879 SP -= count ;
9cde0e7f 1880 ax = (SP - PL_stack_base) + 1 ;
d1b91892 1881
1882 if (count != 2)
1883 croak("Big trouble\n") ;
a0d0e21e 1884
d1b91892 1885 printf ("%d + %d = %d\n", a, b, SvIV(ST(0))) ;
1886 printf ("%d - %d = %d\n", a, b, SvIV(ST(1))) ;
1887
1888 PUTBACK ;
1889 FREETMPS ;
1890 LEAVE ;
1891 }
1892
1893Notes
1894
1895=over 5
1896
1897=item 1.
1898
1899Notice that it was necessary to define the variable C<ax>. This is
1900because the C<ST> macro expects it to exist. If we were in an XSUB it
1901would not be necessary to define C<ax> as it is already defined for
1902you.
1903
1904=item 2.
1905
1906The code
1907
1908 SPAGAIN ;
924508f0 1909 SP -= count ;
9cde0e7f 1910 ax = (SP - PL_stack_base) + 1 ;
d1b91892 1911
1912sets the stack up so that we can use the C<ST> macro.
1913
1914=item 3.
1915
1916Unlike the original coding of this example, the returned
1917values are not accessed in reverse order. So C<ST(0)> refers to the
54310121 1918first value returned by the Perl subroutine and C<ST(count-1)>
d1b91892 1919refers to the last.
1920
1921=back
a0d0e21e 1922
8f183262 1923=head2 Creating and calling an anonymous subroutine in C
1924
7b8d334a 1925As we've already shown, C<perl_call_sv> can be used to invoke an
8f183262 1926anonymous subroutine. However, our example showed how Perl script
1927invoking an XSUB to preform this operation. Let's see how it can be
1928done inside our C code:
1929
8f183262 1930 ...
1931
137443ea 1932 SV *cvrv = perl_eval_pv("sub { print 'You will not find me cluttering any namespace!' }", TRUE);
8f183262 1933
1934 ...
1935
1936 perl_call_sv(cvrv, G_VOID|G_NOARGS);
1937
7b8d334a 1938C<perl_eval_pv> is used to compile the anonymous subroutine, which
1939will be the return value as well (read more about C<perl_eval_pv> in
1940L<perlguts/perl_eval_pv>). Once this code reference is in hand, it
8f183262 1941can be mixed in with all the previous examples we've shown.
1942
a0d0e21e 1943=head1 SEE ALSO
1944
8e07c86e 1945L<perlxs>, L<perlguts>, L<perlembed>
a0d0e21e 1946
1947=head1 AUTHOR
1948
9607fc9c 1949Paul Marquess <F<pmarquess@bfsec.bt.co.uk>>
a0d0e21e 1950
d1b91892 1951Special thanks to the following people who assisted in the creation of
1952the document.
a0d0e21e 1953
c07a80fd 1954Jeff Okamoto, Tim Bunce, Nick Gianniotis, Steve Kelem, Gurusamy Sarathy
1955and Larry Wall.
a0d0e21e 1956
1957=head1 DATE
1958
137443ea 1959Version 1.3, 14th Apr 1997