3 perlcall - Perl calling conventions from C
7 The purpose of this document is to show you how to call Perl subroutines
8 directly from C, i.e., how to write I<callbacks>.
10 Apart from discussing the C interface provided by Perl for writing
11 callbacks the document uses a series of examples to show how the
12 interface actually works in practice. In addition some techniques for
13 coding callbacks are covered.
15 Examples where callbacks are necessary include
19 =item * An Error Handler
21 You have created an XSUB interface to an application's C API.
23 A fairly common feature in applications is to allow you to define a C
24 function that will be called whenever something nasty occurs. What we
25 would like is to be able to specify a Perl subroutine that will be
28 =item * An Event Driven Program
30 The classic example of where callbacks are used is when writing an
31 event driven program like for an X windows application. In this case
32 you register functions to be called whenever specific events occur,
33 e.g., a mouse button is pressed, the cursor moves into a window or a
34 menu item is selected.
38 Although the techniques described here are applicable when embedding
39 Perl in a C program, this is not the primary goal of this document.
40 There are other details that must be considered and are specific to
41 embedding Perl. For details on embedding Perl in C refer to
44 Before you launch yourself head first into the rest of this document,
45 it would be a good idea to have read the following two documents -
46 L<perlxs> and L<perlguts>.
48 =head1 THE PERL_CALL FUNCTIONS
50 Although this stuff is easier to explain using examples, you first need
51 be aware of a few important definitions.
53 Perl has a number of C functions that allow you to call Perl
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) ;
61 The key function is I<perl_call_sv>. All the other functions are
62 fairly simple wrappers which make it easier to call Perl subroutines in
63 special cases. At the end of the day they will all call I<perl_call_sv>
64 to invoke the Perl subroutine.
66 All the I<perl_call_*> functions have a C<flags> parameter which is
67 used to pass a bit mask of options to Perl. This bit mask operates
68 identically for each of the functions. The settings available in the
69 bit mask are discussed in L<FLAG VALUES>.
71 Each of the functions will now be discussed in turn.
77 I<perl_call_sv> takes two parameters, the first, C<sv>, is an SV*.
78 This allows you to specify the Perl subroutine to be called either as a
79 C string (which has first been converted to an SV) or a reference to a
80 subroutine. The section, I<Using perl_call_sv>, shows how you can make
81 use of I<perl_call_sv>.
85 The function, I<perl_call_pv>, is similar to I<perl_call_sv> except it
86 expects its first parameter to be a C char* which identifies the Perl
87 subroutine you want to call, e.g., C<perl_call_pv("fred", 0)>. If the
88 subroutine you want to call is in another package, just include the
89 package name in the string, e.g., C<"pkg::fred">.
91 =item B<perl_call_method>
93 The function I<perl_call_method> is used to call a method from a Perl
94 class. The parameter C<methname> corresponds to the name of the method
95 to be called. Note that the class that the method belongs to is passed
96 on the Perl stack rather than in the parameter list. This class can be
97 either the name of the class (for a static method) or a reference to an
98 object (for a virtual method). See L<perlobj> for more information on
99 static and virtual methods and L<Using perl_call_method> for an example
100 of using I<perl_call_method>.
102 =item B<perl_call_argv>
104 I<perl_call_argv> calls the Perl subroutine specified by the C string
105 stored in the C<subname> parameter. It also takes the usual C<flags>
106 parameter. The final parameter, C<argv>, consists of a NULL terminated
107 list of C strings to be passed as parameters to the Perl subroutine.
108 See I<Using perl_call_argv>.
112 All the functions return an integer. This is a count of the number of
113 items returned by the Perl subroutine. The actual items returned by the
114 subroutine are stored on the Perl stack.
116 As a general rule you should I<always> check the return value from
117 these functions. Even if you are expecting only a particular number of
118 values to be returned from the Perl subroutine, there is nothing to
119 stop someone from doing something unexpected - don't say you haven't
124 The C<flags> parameter in all the I<perl_call_*> functions is a bit mask
125 which can consist of any combination of the symbols defined below,
131 Calls the Perl subroutine in a void context.
133 This flag has 2 effects:
139 It indicates to the subroutine being called that it is executing in
140 a void context (if it executes I<wantarray> the result will be the
145 It ensures that nothing is actually returned from the subroutine.
149 The value returned by the I<perl_call_*> function indicates how many
150 items have been returned by the Perl subroutine - in this case it will
156 Calls the Perl subroutine in a scalar context. This is the default
157 context flag setting for all the I<perl_call_*> functions.
159 This flag has 2 effects:
165 It indicates to the subroutine being called that it is executing in a
166 scalar context (if it executes I<wantarray> the result will be false).
170 It ensures that only a scalar is actually returned from the subroutine.
171 The subroutine can, of course, ignore the I<wantarray> and return a
172 list anyway. If so, then only the last element of the list will be
177 The value returned by the I<perl_call_*> function indicates how many
178 items have been returned by the Perl subroutine - in this case it will
181 If 0, then you have specified the G_DISCARD flag.
183 If 1, then the item actually returned by the Perl subroutine will be
184 stored on the Perl stack - the section I<Returning a Scalar> shows how
185 to access this value on the stack. Remember that regardless of how
186 many items the Perl subroutine returns, only the last one will be
187 accessible from the stack - think of the case where only one value is
188 returned as being a list with only one element. Any other items that
189 were returned will not exist by the time control returns from the
190 I<perl_call_*> function. The section I<Returning a list in a scalar
191 context> shows an example of this behavior.
196 Calls the Perl subroutine in a list context.
198 As with G_SCALAR, this flag has 2 effects:
204 It indicates to the subroutine being called that it is executing in an
205 array context (if it executes I<wantarray> the result will be true).
210 It ensures that all items returned from the subroutine will be
211 accessible when control returns from the I<perl_call_*> function.
215 The value returned by the I<perl_call_*> function indicates how many
216 items have been returned by the Perl subroutine.
218 If 0, then you have specified the G_DISCARD flag.
220 If not 0, then it will be a count of the number of items returned by
221 the subroutine. These items will be stored on the Perl stack. The
222 section I<Returning a list of values> gives an example of using the
223 G_ARRAY flag and the mechanics of accessing the returned items from the
228 By default, the I<perl_call_*> functions place the items returned from
229 by the Perl subroutine on the stack. If you are not interested in
230 these items, then setting this flag will make Perl get rid of them
231 automatically for you. Note that it is still possible to indicate a
232 context to the Perl subroutine by using either G_SCALAR or G_ARRAY.
234 If you do not set this flag then it is I<very> important that you make
235 sure that any temporaries (i.e., parameters passed to the Perl
236 subroutine and values returned from the subroutine) are disposed of
237 yourself. The section I<Returning a Scalar> gives details of how to
238 dispose of these temporaries explicitly and the section I<Using Perl to
239 dispose of temporaries> discusses the specific circumstances where you
240 can ignore the problem and let Perl deal with it for you.
244 Whenever a Perl subroutine is called using one of the I<perl_call_*>
245 functions, it is assumed by default that parameters are to be passed to
246 the subroutine. If you are not passing any parameters to the Perl
247 subroutine, you can save a bit of time by setting this flag. It has
248 the effect of not creating the C<@_> array for the Perl subroutine.
250 Although the functionality provided by this flag may seem
251 straightforward, it should be used only if there is a good reason to do
252 so. The reason for being cautious is that even if you have specified
253 the G_NOARGS flag, it is still possible for the Perl subroutine that
254 has been called to think that you have passed it parameters.
256 In fact, what can happen is that the Perl subroutine you have called
257 can access the C<@_> array from a previous Perl subroutine. This will
258 occur when the code that is executing the I<perl_call_*> function has
259 itself been called from another Perl subroutine. The code below
274 What has happened is that C<fred> accesses the C<@_> array which
280 It is possible for the Perl subroutine you are calling to terminate
281 abnormally, e.g., by calling I<die> explicitly or by not actually
282 existing. By default, when either of these of events occurs, the
283 process will terminate immediately. If though, you want to trap this
284 type of event, specify the G_EVAL flag. It will put an I<eval { }>
285 around the subroutine call.
287 Whenever control returns from the I<perl_call_*> function you need to
288 check the C<$@> variable as you would in a normal Perl script.
290 The value returned from the I<perl_call_*> function is dependent on
291 what other flags have been specified and whether an error has
292 occurred. Here are all the different cases that can occur:
298 If the I<perl_call_*> function returns normally, then the value
299 returned is as specified in the previous sections.
303 If G_DISCARD is specified, the return value will always be 0.
307 If G_ARRAY is specified I<and> an error has occurred, the return value
312 If G_SCALAR is specified I<and> an error has occurred, the return value
313 will be 1 and the value on the top of the stack will be I<undef>. This
314 means that if you have already detected the error by checking C<$@> and
315 you want the program to continue, you must remember to pop the I<undef>
320 See I<Using G_EVAL> for details on using G_EVAL.
324 You may have noticed that using the G_EVAL flag described above will
325 B<always> clear the C<$@> variable and set it to a string describing
326 the error iff there was an error in the called code. This unqualified
327 resetting of C<$@> can be problematic in the reliable identification of
328 errors using the C<eval {}> mechanism, because the possibility exists
329 that perl will call other code (end of block processing code, for
330 example) between the time the error causes C<$@> to be set within
331 C<eval {}>, and the subsequent statement which checks for the value of
332 C<$@> gets executed in the user's script.
334 This scenario will mostly be applicable to code that is meant to be
335 called from within destructors, asynchronous callbacks, signal
336 handlers, C<__DIE__> or C<__WARN__> hooks, and C<tie> functions. In
337 such situations, you will not want to clear C<$@> at all, but simply to
338 append any new errors to any existing value of C<$@>.
340 The G_KEEPERR flag is meant to be used in conjunction with G_EVAL in
341 I<perl_call_*> functions that are used to implement such code. This flag
342 has no effect when G_EVAL is not used.
344 When G_KEEPERR is used, any errors in the called code will be prefixed
345 with the string "\t(in cleanup)", and appended to the current value
348 The G_KEEPERR flag was introduced in Perl version 5.002.
350 See I<Using G_KEEPERR> for an example of a situation that warrants the
353 =head2 Determining the Context
355 As mentioned above, you can determine the context of the currently
356 executing subroutine in Perl with I<wantarray>. The equivalent test
357 can be made in C by using the C<GIMME_V> macro, which returns
358 C<G_ARRAY> if you have been called in an array context, C<G_SCALAR> if
359 in a scalar context, or C<G_VOID> if in a void context (i.e. the
360 return value will not be used). An older version of this macro is
361 called C<GIMME>; in a void context it returns C<G_SCALAR> instead of
362 C<G_VOID>. An example of using the C<GIMME_V> macro is shown in
363 section I<Using GIMME_V>.
365 =head1 KNOWN PROBLEMS
367 This section outlines all known problems that exist in the
368 I<perl_call_*> functions.
374 If you are intending to make use of both the G_EVAL and G_SCALAR flags
375 in your code, use a version of Perl greater than 5.000. There is a bug
376 in version 5.000 of Perl which means that the combination of these two
377 flags will not work as described in the section I<FLAG VALUES>.
379 Specifically, if the two flags are used when calling a subroutine and
380 that subroutine does not call I<die>, the value returned by
381 I<perl_call_*> will be wrong.
386 In Perl 5.000 and 5.001 there is a problem with using I<perl_call_*> if
387 the Perl sub you are calling attempts to trap a I<die>.
389 The symptom of this problem is that the called Perl sub will continue
390 to completion, but whenever it attempts to pass control back to the
391 XSUB, the program will immediately terminate.
393 For example, say you want to call this Perl sub
397 eval { die "Fatal Error" ; }
398 print "Trapped error: $@\n"
408 perl_call_pv("fred", G_DISCARD|G_NOARGS) ;
409 fprintf(stderr, "back in Call_fred\n") ;
411 When C<Call_fred> is executed it will print
413 Trapped error: Fatal Error
415 As control never returns to C<Call_fred>, the C<"back in Call_fred">
416 string will not get printed.
418 To work around this problem, you can either upgrade to Perl 5.002 or
419 higher, or use the G_EVAL flag with I<perl_call_*> as shown below
425 perl_call_pv("fred", G_EVAL|G_DISCARD|G_NOARGS) ;
426 fprintf(stderr, "back in Call_fred\n") ;
434 Enough of the definition talk, let's have a few examples.
436 Perl provides many macros to assist in accessing the Perl stack.
437 Wherever possible, these macros should always be used when interfacing
438 to Perl internals. We hope this should make the code less vulnerable
439 to any changes made to Perl in the future.
441 Another point worth noting is that in the first series of examples I
442 have made use of only the I<perl_call_pv> function. This has been done
443 to keep the code simpler and ease you into the topic. Wherever
444 possible, if the choice is between using I<perl_call_pv> and
445 I<perl_call_sv>, you should always try to use I<perl_call_sv>. See
446 I<Using perl_call_sv> for details.
448 =head2 No Parameters, Nothing returned
450 This first trivial example will call a Perl subroutine, I<PrintUID>, to
451 print out the UID of the process.
455 print "UID is $<\n" ;
458 and here is a C function to call it
466 perl_call_pv("PrintUID", G_DISCARD|G_NOARGS) ;
471 A few points to note about this example.
477 Ignore C<dSP> and C<PUSHMARK(SP)> for now. They will be discussed in
482 We aren't passing any parameters to I<PrintUID> so G_NOARGS can be
487 We aren't interested in anything returned from I<PrintUID>, so
488 G_DISCARD is specified. Even if I<PrintUID> was changed to
489 return some value(s), having specified G_DISCARD will mean that they
490 will be wiped by the time control returns from I<perl_call_pv>.
494 As I<perl_call_pv> is being used, the Perl subroutine is specified as a
495 C string. In this case the subroutine name has been 'hard-wired' into the
500 Because we specified G_DISCARD, it is not necessary to check the value
501 returned from I<perl_call_pv>. It will always be 0.
505 =head2 Passing Parameters
507 Now let's make a slightly more complex example. This time we want to
508 call a Perl subroutine, C<LeftString>, which will take 2 parameters - a
509 string (C<$s>) and an integer (C<$n>). The subroutine will simply
510 print the first C<$n> characters of the string.
512 So the Perl subroutine would look like this
517 print substr($s, 0, $n), "\n" ;
520 The C function required to call I<LeftString> would look like this.
523 call_LeftString(a, b)
530 XPUSHs(sv_2mortal(newSVpv(a, 0)));
531 XPUSHs(sv_2mortal(newSViv(b)));
534 perl_call_pv("LeftString", G_DISCARD);
537 Here are a few notes on the C function I<call_LeftString>.
543 Parameters are passed to the Perl subroutine using the Perl stack.
544 This is the purpose of the code beginning with the line C<dSP> and
545 ending with the line C<PUTBACK>. The C<dSP> declares a local copy
546 of the stack pointer. This local copy should B<always> be accessed
551 If you are going to put something onto the Perl stack, you need to know
552 where to put it. This is the purpose of the macro C<dSP> - it declares
553 and initializes a I<local> copy of the Perl stack pointer.
555 All the other macros which will be used in this example require you to
556 have used this macro.
558 The exception to this rule is if you are calling a Perl subroutine
559 directly from an XSUB function. In this case it is not necessary to
560 use the C<dSP> macro explicitly - it will be declared for you
565 Any parameters to be pushed onto the stack should be bracketed by the
566 C<PUSHMARK> and C<PUTBACK> macros. The purpose of these two macros, in
567 this context, is to count the number of parameters you are
568 pushing automatically. Then whenever Perl is creating the C<@_> array for the
569 subroutine, it knows how big to make it.
571 The C<PUSHMARK> macro tells Perl to make a mental note of the current
572 stack pointer. Even if you aren't passing any parameters (like the
573 example shown in the section I<No Parameters, Nothing returned>) you
574 must still call the C<PUSHMARK> macro before you can call any of the
575 I<perl_call_*> functions - Perl still needs to know that there are no
578 The C<PUTBACK> macro sets the global copy of the stack pointer to be
579 the same as our local copy. If we didn't do this I<perl_call_pv>
580 wouldn't know where the two parameters we pushed were - remember that
581 up to now all the stack pointer manipulation we have done is with our
582 local copy, I<not> the global copy.
586 The only flag specified this time is G_DISCARD. Because we are passing 2
587 parameters to the Perl subroutine this time, we have not specified
592 Next, we come to XPUSHs. This is where the parameters actually get
593 pushed onto the stack. In this case we are pushing a string and an
596 See L<perlguts/"XSUBs and the Argument Stack"> for details
597 on how the XPUSH macros work.
601 Finally, I<LeftString> can now be called via the I<perl_call_pv>
606 =head2 Returning a Scalar
608 Now for an example of dealing with the items returned from a Perl
611 Here is a Perl subroutine, I<Adder>, that takes 2 integer parameters
612 and simply returns their sum.
620 Because we are now concerned with the return value from I<Adder>, the C
621 function required to call it is now a bit more complex.
635 XPUSHs(sv_2mortal(newSViv(a)));
636 XPUSHs(sv_2mortal(newSViv(b)));
639 count = perl_call_pv("Adder", G_SCALAR);
644 croak("Big trouble\n") ;
646 printf ("The sum of %d and %d is %d\n", a, b, POPi) ;
653 Points to note this time are
659 The only flag specified this time was G_SCALAR. That means the C<@_>
660 array will be created and that the value returned by I<Adder> will
661 still exist after the call to I<perl_call_pv>.
667 Because we are interested in what is returned from I<Adder> we cannot
668 specify G_DISCARD. This means that we will have to tidy up the Perl
669 stack and dispose of any temporary values ourselves. This is the
675 at the start of the function, and
680 at the end. The C<ENTER>/C<SAVETMPS> pair creates a boundary for any
681 temporaries we create. This means that the temporaries we get rid of
682 will be limited to those which were created after these calls.
684 The C<FREETMPS>/C<LEAVE> pair will get rid of any values returned by
685 the Perl subroutine, plus it will also dump the mortal SVs we have
686 created. Having C<ENTER>/C<SAVETMPS> at the beginning of the code
687 makes sure that no other mortals are destroyed.
689 Think of these macros as working a bit like using C<{> and C<}> in Perl
690 to limit the scope of local variables.
692 See the section I<Using Perl to dispose of temporaries> for details of
693 an alternative to using these macros.
697 The purpose of the macro C<SPAGAIN> is to refresh the local copy of the
698 stack pointer. This is necessary because it is possible that the memory
699 allocated to the Perl stack has been reallocated whilst in the
700 I<perl_call_pv> call.
702 If you are making use of the Perl stack pointer in your code you must
703 always refresh the local copy using SPAGAIN whenever you make use
704 of the I<perl_call_*> functions or any other Perl internal function.
708 Although only a single value was expected to be returned from I<Adder>,
709 it is still good practice to check the return code from I<perl_call_pv>
712 Expecting a single value is not quite the same as knowing that there
713 will be one. If someone modified I<Adder> to return a list and we
714 didn't check for that possibility and take appropriate action the Perl
715 stack would end up in an inconsistent state. That is something you
716 I<really> don't want to happen ever.
720 The C<POPi> macro is used here to pop the return value from the stack.
721 In this case we wanted an integer, so C<POPi> was used.
724 Here is the complete list of POP macros available, along with the types
735 The final C<PUTBACK> is used to leave the Perl stack in a consistent
736 state before exiting the function. This is necessary because when we
737 popped the return value from the stack with C<POPi> it updated only our
738 local copy of the stack pointer. Remember, C<PUTBACK> sets the global
739 stack pointer to be the same as our local copy.
744 =head2 Returning a list of values
746 Now, let's extend the previous example to return both the sum of the
747 parameters and the difference.
749 Here is the Perl subroutine
757 and this is the C function
760 call_AddSubtract(a, b)
771 XPUSHs(sv_2mortal(newSViv(a)));
772 XPUSHs(sv_2mortal(newSViv(b)));
775 count = perl_call_pv("AddSubtract", G_ARRAY);
780 croak("Big trouble\n") ;
782 printf ("%d - %d = %d\n", a, b, POPi) ;
783 printf ("%d + %d = %d\n", a, b, POPi) ;
790 If I<call_AddSubtract> is called like this
792 call_AddSubtract(7, 4) ;
794 then here is the output
805 We wanted array context, so G_ARRAY was used.
809 Not surprisingly C<POPi> is used twice this time because we were
810 retrieving 2 values from the stack. The important thing to note is that
811 when using the C<POP*> macros they come off the stack in I<reverse>
816 =head2 Returning a list in a scalar context
818 Say the Perl subroutine in the previous section was called in a scalar
822 call_AddSubScalar(a, b)
834 XPUSHs(sv_2mortal(newSViv(a)));
835 XPUSHs(sv_2mortal(newSViv(b)));
838 count = perl_call_pv("AddSubtract", G_SCALAR);
842 printf ("Items Returned = %d\n", count) ;
844 for (i = 1 ; i <= count ; ++i)
845 printf ("Value %d = %d\n", i, POPi) ;
852 The other modification made is that I<call_AddSubScalar> will print the
853 number of items returned from the Perl subroutine and their value (for
854 simplicity it assumes that they are integer). So if
855 I<call_AddSubScalar> is called
857 call_AddSubScalar(7, 4) ;
859 then the output will be
864 In this case the main point to note is that only the last item in the
865 list is returned from the subroutine, I<AddSubtract> actually made it back to
866 I<call_AddSubScalar>.
869 =head2 Returning Data from Perl via the parameter list
871 It is also possible to return values directly via the parameter list -
872 whether it is actually desirable to do it is another matter entirely.
874 The Perl subroutine, I<Inc>, below takes 2 parameters and increments
883 and here is a C function to call it.
898 sva = sv_2mortal(newSViv(a)) ;
899 svb = sv_2mortal(newSViv(b)) ;
906 count = perl_call_pv("Inc", G_DISCARD);
909 croak ("call_Inc: expected 0 values from 'Inc', got %d\n",
912 printf ("%d + 1 = %d\n", a, SvIV(sva)) ;
913 printf ("%d + 1 = %d\n", b, SvIV(svb)) ;
919 To be able to access the two parameters that were pushed onto the stack
920 after they return from I<perl_call_pv> it is necessary to make a note
921 of their addresses - thus the two variables C<sva> and C<svb>.
923 The reason this is necessary is that the area of the Perl stack which
924 held them will very likely have been overwritten by something else by
925 the time control returns from I<perl_call_pv>.
932 Now an example using G_EVAL. Below is a Perl subroutine which computes
933 the difference of its 2 parameters. If this would result in a negative
934 result, the subroutine calls I<die>.
940 die "death can be fatal\n" if $a < $b ;
945 and some C to call it
959 XPUSHs(sv_2mortal(newSViv(a)));
960 XPUSHs(sv_2mortal(newSViv(b)));
963 count = perl_call_pv("Subtract", G_EVAL|G_SCALAR);
967 /* Check the eval first */
968 if (SvTRUE(GvSV(errgv)))
970 printf ("Uh oh - %s\n", SvPV(GvSV(errgv), na)) ;
976 croak("call_Subtract: wanted 1 value from 'Subtract', got %d\n",
979 printf ("%d - %d = %d\n", a, b, POPi) ;
987 If I<call_Subtract> is called thus
991 the following will be printed
993 Uh oh - death can be fatal
1001 We want to be able to catch the I<die> so we have used the G_EVAL
1002 flag. Not specifying this flag would mean that the program would
1003 terminate immediately at the I<die> statement in the subroutine
1010 if (SvTRUE(GvSV(errgv)))
1012 printf ("Uh oh - %s\n", SvPV(GvSV(errgv), na)) ;
1016 is the direct equivalent of this bit of Perl
1018 print "Uh oh - $@\n" if $@ ;
1020 C<errgv> is a perl global of type C<GV *> that points to the
1021 symbol table entry containing the error. C<GvSV(errgv)> therefore
1022 refers to the C equivalent of C<$@>.
1026 Note that the stack is popped using C<POPs> in the block where
1027 C<SvTRUE(GvSV(errgv))> is true. This is necessary because whenever a
1028 I<perl_call_*> function invoked with G_EVAL|G_SCALAR returns an error,
1029 the top of the stack holds the value I<undef>. Because we want the
1030 program to continue after detecting this error, it is essential that
1031 the stack is tidied up by removing the I<undef>.
1036 =head2 Using G_KEEPERR
1038 Consider this rather facetious example, where we have used an XS
1039 version of the call_Subtract example above inside a destructor:
1042 sub new { bless {}, $_[0] }
1045 die "death can be fatal" if $a < $b ;
1048 sub DESTROY { call_Subtract(5, 4); }
1049 sub foo { die "foo dies"; }
1052 eval { Foo->new->foo };
1053 print "Saw: $@" if $@; # should be, but isn't
1055 This example will fail to recognize that an error occurred inside the
1056 C<eval {}>. Here's why: the call_Subtract code got executed while perl
1057 was cleaning up temporaries when exiting the eval block, and because
1058 call_Subtract is implemented with I<perl_call_pv> using the G_EVAL
1059 flag, it promptly reset C<$@>. This results in the failure of the
1060 outermost test for C<$@>, and thereby the failure of the error trap.
1062 Appending the G_KEEPERR flag, so that the I<perl_call_pv> call in
1063 call_Subtract reads:
1065 count = perl_call_pv("Subtract", G_EVAL|G_SCALAR|G_KEEPERR);
1067 will preserve the error and restore reliable error handling.
1069 =head2 Using perl_call_sv
1071 In all the previous examples I have 'hard-wired' the name of the Perl
1072 subroutine to be called from C. Most of the time though, it is more
1073 convenient to be able to specify the name of the Perl subroutine from
1074 within the Perl script.
1076 Consider the Perl code below
1080 print "Hello there\n" ;
1085 Here is a snippet of XSUB which defines I<CallSubPV>.
1092 perl_call_pv(name, G_DISCARD|G_NOARGS) ;
1094 That is fine as far as it goes. The thing is, the Perl subroutine
1095 can be specified as only a string. For Perl 4 this was adequate,
1096 but Perl 5 allows references to subroutines and anonymous subroutines.
1097 This is where I<perl_call_sv> is useful.
1099 The code below for I<CallSubSV> is identical to I<CallSubPV> except
1100 that the C<name> parameter is now defined as an SV* and we use
1101 I<perl_call_sv> instead of I<perl_call_pv>.
1108 perl_call_sv(name, G_DISCARD|G_NOARGS) ;
1110 Because we are using an SV to call I<fred> the following can all be used
1116 CallSubSV( sub { print "Hello there\n" } ) ;
1118 As you can see, I<perl_call_sv> gives you much greater flexibility in
1119 how you can specify the Perl subroutine.
1121 You should note that if it is necessary to store the SV (C<name> in the
1122 example above) which corresponds to the Perl subroutine so that it can
1123 be used later in the program, it not enough just to store a copy of the
1124 pointer to the SV. Say the code above had been like this
1126 static SV * rememberSub ;
1132 rememberSub = name ;
1138 perl_call_sv(rememberSub, G_DISCARD|G_NOARGS) ;
1140 The reason this is wrong is that by the time you come to use the
1141 pointer C<rememberSub> in C<CallSavedSub1>, it may or may not still refer
1142 to the Perl subroutine that was recorded in C<SaveSub1>. This is
1143 particularly true for these cases
1148 SaveSub1( sub { print "Hello there\n" } ) ;
1151 By the time each of the C<SaveSub1> statements above have been executed,
1152 the SV*s which corresponded to the parameters will no longer exist.
1153 Expect an error message from Perl of the form
1155 Can't use an undefined value as a subroutine reference at ...
1157 for each of the C<CallSavedSub1> lines.
1159 Similarly, with this code
1166 you can expect one of these messages (which you actually get is dependent on
1167 the version of Perl you are using)
1169 Not a CODE reference at ...
1170 Undefined subroutine &main::47 called ...
1172 The variable C<$ref> may have referred to the subroutine C<fred>
1173 whenever the call to C<SaveSub1> was made but by the time
1174 C<CallSavedSub1> gets called it now holds the number C<47>. Because we
1175 saved only a pointer to the original SV in C<SaveSub1>, any changes to
1176 C<$ref> will be tracked by the pointer C<rememberSub>. This means that
1177 whenever C<CallSavedSub1> gets called, it will attempt to execute the
1178 code which is referenced by the SV* C<rememberSub>. In this case
1179 though, it now refers to the integer C<47>, so expect Perl to complain
1182 A similar but more subtle problem is illustrated with this code
1189 This time whenever C<CallSavedSub1> get called it will execute the Perl
1190 subroutine C<joe> (assuming it exists) rather than C<fred> as was
1191 originally requested in the call to C<SaveSub1>.
1193 To get around these problems it is necessary to take a full copy of the
1194 SV. The code below shows C<SaveSub2> modified to do that
1196 static SV * keepSub = (SV*)NULL ;
1202 /* Take a copy of the callback */
1203 if (keepSub == (SV*)NULL)
1204 /* First time, so create a new SV */
1205 keepSub = newSVsv(name) ;
1207 /* Been here before, so overwrite */
1208 SvSetSV(keepSub, name) ;
1214 perl_call_sv(keepSub, G_DISCARD|G_NOARGS) ;
1216 To avoid creating a new SV every time C<SaveSub2> is called,
1217 the function first checks to see if it has been called before. If not,
1218 then space for a new SV is allocated and the reference to the Perl
1219 subroutine, C<name> is copied to the variable C<keepSub> in one
1220 operation using C<newSVsv>. Thereafter, whenever C<SaveSub2> is called
1221 the existing SV, C<keepSub>, is overwritten with the new value using
1224 =head2 Using perl_call_argv
1226 Here is a Perl subroutine which prints whatever parameters are passed
1233 foreach (@list) { print "$_\n" }
1236 and here is an example of I<perl_call_argv> which will call
1239 static char * words[] = {"alpha", "beta", "gamma", "delta", NULL} ;
1246 perl_call_argv("PrintList", G_DISCARD, words) ;
1249 Note that it is not necessary to call C<PUSHMARK> in this instance.
1250 This is because I<perl_call_argv> will do it for you.
1252 =head2 Using perl_call_method
1254 Consider the following Perl code
1267 my ($self, $index) = @_ ;
1268 print "$index: $$self[$index]\n" ;
1274 print "This is Class $class version 1.0\n" ;
1278 It implements just a very simple class to manage an array. Apart from
1279 the constructor, C<new>, it declares methods, one static and one
1280 virtual. The static method, C<PrintID>, prints out simply the class
1281 name and a version number. The virtual method, C<Display>, prints out a
1282 single element of the array. Here is an all Perl example of using it.
1284 $a = new Mine ('red', 'green', 'blue') ;
1291 This is Class Mine version 1.0
1293 Calling a Perl method from C is fairly straightforward. The following
1300 a reference to the object for a virtual method or the name of the class
1301 for a static method.
1305 the name of the method.
1309 any other parameters specific to the method.
1313 Here is a simple XSUB which illustrates the mechanics of calling both
1314 the C<PrintID> and C<Display> methods from C.
1317 call_Method(ref, method, index)
1324 XPUSHs(sv_2mortal(newSViv(index))) ;
1327 perl_call_method(method, G_DISCARD) ;
1330 call_PrintID(class, method)
1335 XPUSHs(sv_2mortal(newSVpv(class, 0))) ;
1338 perl_call_method(method, G_DISCARD) ;
1341 So the methods C<PrintID> and C<Display> can be invoked like this
1343 $a = new Mine ('red', 'green', 'blue') ;
1344 call_Method($a, 'Display', 1) ;
1345 call_PrintID('Mine', 'PrintID') ;
1347 The only thing to note is that in both the static and virtual methods,
1348 the method name is not passed via the stack - it is used as the first
1349 parameter to I<perl_call_method>.
1351 =head2 Using GIMME_V
1353 Here is a trivial XSUB which prints the context in which it is
1354 currently executing.
1359 I32 gimme = GIMME_V;
1360 if (gimme == G_VOID)
1361 printf ("Context is Void\n") ;
1362 else if (gimme == G_SCALAR)
1363 printf ("Context is Scalar\n") ;
1365 printf ("Context is Array\n") ;
1367 and here is some Perl to test it
1373 The output from that will be
1379 =head2 Using Perl to dispose of temporaries
1381 In the examples given to date, any temporaries created in the callback
1382 (i.e., parameters passed on the stack to the I<perl_call_*> function or
1383 values returned via the stack) have been freed by one of these methods
1389 specifying the G_DISCARD flag with I<perl_call_*>.
1393 explicitly disposed of using the C<ENTER>/C<SAVETMPS> -
1394 C<FREETMPS>/C<LEAVE> pairing.
1398 There is another method which can be used, namely letting Perl do it
1399 for you automatically whenever it regains control after the callback
1400 has terminated. This is done by simply not using the
1408 sequence in the callback (and not, of course, specifying the G_DISCARD
1411 If you are going to use this method you have to be aware of a possible
1412 memory leak which can arise under very specific circumstances. To
1413 explain these circumstances you need to know a bit about the flow of
1414 control between Perl and the callback routine.
1416 The examples given at the start of the document (an error handler and
1417 an event driven program) are typical of the two main sorts of flow
1418 control that you are likely to encounter with callbacks. There is a
1419 very important distinction between them, so pay attention.
1421 In the first example, an error handler, the flow of control could be as
1422 follows. You have created an interface to an external library.
1423 Control can reach the external library like this
1425 perl --> XSUB --> external library
1427 Whilst control is in the library, an error condition occurs. You have
1428 previously set up a Perl callback to handle this situation, so it will
1429 get executed. Once the callback has finished, control will drop back to
1430 Perl again. Here is what the flow of control will be like in that
1433 perl --> XSUB --> external library
1437 external library --> perl_call --> perl
1439 perl <-- XSUB <-- external library <-- perl_call <----+
1441 After processing of the error using I<perl_call_*> is completed,
1442 control reverts back to Perl more or less immediately.
1444 In the diagram, the further right you go the more deeply nested the
1445 scope is. It is only when control is back with perl on the extreme
1446 left of the diagram that you will have dropped back to the enclosing
1447 scope and any temporaries you have left hanging around will be freed.
1449 In the second example, an event driven program, the flow of control
1450 will be more like this
1452 perl --> XSUB --> event handler
1454 event handler --> perl_call --> perl
1456 event handler <-- perl_call <----+
1458 event handler --> perl_call --> perl
1460 event handler <-- perl_call <----+
1462 event handler --> perl_call --> perl
1464 event handler <-- perl_call <----+
1466 In this case the flow of control can consist of only the repeated
1469 event handler --> perl_call --> perl
1471 for practically the complete duration of the program. This means that
1472 control may I<never> drop back to the surrounding scope in Perl at the
1475 So what is the big problem? Well, if you are expecting Perl to tidy up
1476 those temporaries for you, you might be in for a long wait. For Perl
1477 to dispose of your temporaries, control must drop back to the
1478 enclosing scope at some stage. In the event driven scenario that may
1479 never happen. This means that as time goes on, your program will
1480 create more and more temporaries, none of which will ever be freed. As
1481 each of these temporaries consumes some memory your program will
1482 eventually consume all the available memory in your system - kapow!
1484 So here is the bottom line - if you are sure that control will revert
1485 back to the enclosing Perl scope fairly quickly after the end of your
1486 callback, then it isn't absolutely necessary to dispose explicitly of
1487 any temporaries you may have created. Mind you, if you are at all
1488 uncertain about what to do, it doesn't do any harm to tidy up anyway.
1491 =head2 Strategies for storing Callback Context Information
1494 Potentially one of the trickiest problems to overcome when designing a
1495 callback interface can be figuring out how to store the mapping between
1496 the C callback function and the Perl equivalent.
1498 To help understand why this can be a real problem first consider how a
1499 callback is set up in an all C environment. Typically a C API will
1500 provide a function to register a callback. This will expect a pointer
1501 to a function as one of its parameters. Below is a call to a
1502 hypothetical function C<register_fatal> which registers the C function
1503 to get called when a fatal error occurs.
1505 register_fatal(cb1) ;
1507 The single parameter C<cb1> is a pointer to a function, so you must
1508 have defined C<cb1> in your code, say something like this
1513 printf ("Fatal Error\n") ;
1517 Now change that to call a Perl subroutine instead
1519 static SV * callback = (SV*)NULL;
1528 /* Call the Perl sub to process the callback */
1529 perl_call_sv(callback, G_DISCARD) ;
1537 /* Remember the Perl sub */
1538 if (callback == (SV*)NULL)
1539 callback = newSVsv(fn) ;
1541 SvSetSV(callback, fn) ;
1543 /* register the callback with the external library */
1544 register_fatal(cb1) ;
1546 where the Perl equivalent of C<register_fatal> and the callback it
1547 registers, C<pcb1>, might look like this
1549 # Register the sub pcb1
1550 register_fatal(\&pcb1) ;
1554 die "I'm dying...\n" ;
1557 The mapping between the C callback and the Perl equivalent is stored in
1558 the global variable C<callback>.
1560 This will be adequate if you ever need to have only one callback
1561 registered at any time. An example could be an error handler like the
1562 code sketched out above. Remember though, repeated calls to
1563 C<register_fatal> will replace the previously registered callback
1564 function with the new one.
1566 Say for example you want to interface to a library which allows asynchronous
1567 file i/o. In this case you may be able to register a callback whenever
1568 a read operation has completed. To be of any use we want to be able to
1569 call separate Perl subroutines for each file that is opened. As it
1570 stands, the error handler example above would not be adequate as it
1571 allows only a single callback to be defined at any time. What we
1572 require is a means of storing the mapping between the opened file and
1573 the Perl subroutine we want to be called for that file.
1575 Say the i/o library has a function C<asynch_read> which associates a C
1576 function C<ProcessRead> with a file handle C<fh> - this assumes that it
1577 has also provided some routine to open the file and so obtain the file
1580 asynch_read(fh, ProcessRead)
1582 This may expect the C I<ProcessRead> function of this form
1585 ProcessRead(fh, buffer)
1592 To provide a Perl interface to this library we need to be able to map
1593 between the C<fh> parameter and the Perl subroutine we want called. A
1594 hash is a convenient mechanism for storing this mapping. The code
1595 below shows a possible implementation
1597 static HV * Mapping = (HV*)NULL ;
1600 asynch_read(fh, callback)
1604 /* If the hash doesn't already exist, create it */
1605 if (Mapping == (HV*)NULL)
1608 /* Save the fh -> callback mapping */
1609 hv_store(Mapping, (char*)&fh, sizeof(fh), newSVsv(callback), 0) ;
1611 /* Register with the C Library */
1612 asynch_read(fh, asynch_read_if) ;
1614 and C<asynch_read_if> could look like this
1617 asynch_read_if(fh, buffer)
1624 /* Get the callback associated with fh */
1625 sv = hv_fetch(Mapping, (char*)&fh , sizeof(fh), FALSE) ;
1626 if (sv == (SV**)NULL)
1627 croak("Internal error...\n") ;
1630 XPUSHs(sv_2mortal(newSViv(fh))) ;
1631 XPUSHs(sv_2mortal(newSVpv(buffer, 0))) ;
1634 /* Call the Perl sub */
1635 perl_call_sv(*sv, G_DISCARD) ;
1638 For completeness, here is C<asynch_close>. This shows how to remove
1639 the entry from the hash C<Mapping>.
1645 /* Remove the entry from the hash */
1646 (void) hv_delete(Mapping, (char*)&fh, sizeof(fh), G_DISCARD) ;
1648 /* Now call the real asynch_close */
1651 So the Perl interface would look like this
1655 my($handle, $buffer) = @_ ;
1658 # Register the Perl callback
1659 asynch_read($fh, \&callback1) ;
1663 The mapping between the C callback and Perl is stored in the global
1664 hash C<Mapping> this time. Using a hash has the distinct advantage that
1665 it allows an unlimited number of callbacks to be registered.
1667 What if the interface provided by the C callback doesn't contain a
1668 parameter which allows the file handle to Perl subroutine mapping? Say
1669 in the asynchronous i/o package, the callback function gets passed only
1670 the C<buffer> parameter like this
1679 Without the file handle there is no straightforward way to map from the
1680 C callback to the Perl subroutine.
1682 In this case a possible way around this problem is to predefine a
1683 series of C functions to act as the interface to Perl, thus
1686 #define NULL_HANDLE -1
1687 typedef void (*FnMap)() ;
1699 static struct MapStruct Map [MAX_CB] =
1701 { fn1, NULL, NULL_HANDLE },
1702 { fn2, NULL, NULL_HANDLE },
1703 { fn3, NULL, NULL_HANDLE }
1714 XPUSHs(sv_2mortal(newSVpv(buffer, 0))) ;
1717 /* Call the Perl sub */
1718 perl_call_sv(Map[index].PerlSub, G_DISCARD) ;
1743 array_asynch_read(fh, callback)
1748 int null_index = MAX_CB ;
1750 /* Find the same handle or an empty entry */
1751 for (index = 0 ; index < MAX_CB ; ++index)
1753 if (Map[index].Handle == fh)
1756 if (Map[index].Handle == NULL_HANDLE)
1757 null_index = index ;
1760 if (index == MAX_CB && null_index == MAX_CB)
1761 croak ("Too many callback functions registered\n") ;
1763 if (index == MAX_CB)
1764 index = null_index ;
1766 /* Save the file handle */
1767 Map[index].Handle = fh ;
1769 /* Remember the Perl sub */
1770 if (Map[index].PerlSub == (SV*)NULL)
1771 Map[index].PerlSub = newSVsv(callback) ;
1773 SvSetSV(Map[index].PerlSub, callback) ;
1775 asynch_read(fh, Map[index].Function) ;
1778 array_asynch_close(fh)
1783 /* Find the file handle */
1784 for (index = 0; index < MAX_CB ; ++ index)
1785 if (Map[index].Handle == fh)
1788 if (index == MAX_CB)
1789 croak ("could not close fh %d\n", fh) ;
1791 Map[index].Handle = NULL_HANDLE ;
1792 SvREFCNT_dec(Map[index].PerlSub) ;
1793 Map[index].PerlSub = (SV*)NULL ;
1797 In this case the functions C<fn1>, C<fn2>, and C<fn3> are used to
1798 remember the Perl subroutine to be called. Each of the functions holds
1799 a separate hard-wired index which is used in the function C<Pcb> to
1800 access the C<Map> array and actually call the Perl subroutine.
1802 There are some obvious disadvantages with this technique.
1804 Firstly, the code is considerably more complex than with the previous
1807 Secondly, there is a hard-wired limit (in this case 3) to the number of
1808 callbacks that can exist simultaneously. The only way to increase the
1809 limit is by modifying the code to add more functions and then
1810 recompiling. None the less, as long as the number of functions is
1811 chosen with some care, it is still a workable solution and in some
1812 cases is the only one available.
1814 To summarize, here are a number of possible methods for you to consider
1815 for storing the mapping between C and the Perl callback
1819 =item 1. Ignore the problem - Allow only 1 callback
1821 For a lot of situations, like interfacing to an error handler, this may
1822 be a perfectly adequate solution.
1824 =item 2. Create a sequence of callbacks - hard wired limit
1826 If it is impossible to tell from the parameters passed back from the C
1827 callback what the context is, then you may need to create a sequence of C
1828 callback interface functions, and store pointers to each in an array.
1830 =item 3. Use a parameter to map to the Perl callback
1832 A hash is an ideal mechanism to store the mapping between C and Perl.
1837 =head2 Alternate Stack Manipulation
1840 Although I have made use of only the C<POP*> macros to access values
1841 returned from Perl subroutines, it is also possible to bypass these
1842 macros and read the stack using the C<ST> macro (See L<perlxs> for a
1843 full description of the C<ST> macro).
1845 Most of the time the C<POP*> macros should be adequate, the main
1846 problem with them is that they force you to process the returned values
1847 in sequence. This may not be the most suitable way to process the
1848 values in some cases. What we want is to be able to access the stack in
1849 a random order. The C<ST> macro as used when coding an XSUB is ideal
1852 The code below is the example given in the section I<Returning a list
1853 of values> recoded to use C<ST> instead of C<POP*>.
1856 call_AddSubtract2(a, b)
1868 XPUSHs(sv_2mortal(newSViv(a)));
1869 XPUSHs(sv_2mortal(newSViv(b)));
1872 count = perl_call_pv("AddSubtract", G_ARRAY);
1876 ax = (SP - stack_base) + 1 ;
1879 croak("Big trouble\n") ;
1881 printf ("%d + %d = %d\n", a, b, SvIV(ST(0))) ;
1882 printf ("%d - %d = %d\n", a, b, SvIV(ST(1))) ;
1895 Notice that it was necessary to define the variable C<ax>. This is
1896 because the C<ST> macro expects it to exist. If we were in an XSUB it
1897 would not be necessary to define C<ax> as it is already defined for
1906 ax = (SP - stack_base) + 1 ;
1908 sets the stack up so that we can use the C<ST> macro.
1912 Unlike the original coding of this example, the returned
1913 values are not accessed in reverse order. So C<ST(0)> refers to the
1914 first value returned by the Perl subroutine and C<ST(count-1)>
1919 =head2 Creating and calling an anonymous subroutine in C
1921 As we've already shown, L<perl_call_sv> can be used to invoke an
1922 anonymous subroutine. However, our example showed how Perl script
1923 invoking an XSUB to preform this operation. Let's see how it can be
1924 done inside our C code:
1928 SV *cvrv = perl_eval_pv("sub { print 'You will not find me cluttering any namespace!' }", TRUE);
1932 perl_call_sv(cvrv, G_VOID|G_NOARGS);
1934 L<perlguts/perl_eval_pv> is used to compile the anonymous subroutine, which
1935 will be the return value as well. Once this code reference is in hand, it
1936 can be mixed in with all the previous examples we've shown.
1940 L<perlxs>, L<perlguts>, L<perlembed>
1944 Paul Marquess <F<pmarquess@bfsec.bt.co.uk>>
1946 Special thanks to the following people who assisted in the creation of
1949 Jeff Okamoto, Tim Bunce, Nick Gianniotis, Steve Kelem, Gurusamy Sarathy
1954 Version 1.3, 14th Apr 1997