This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
[inseparable changes from match from perl-5.003_97c to perl-5.003_97d]
[perl5.git] / pod / perlcall.pod
CommitLineData
a0d0e21e
LW
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
AD
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
LW
16
17=over 5
18
d1b91892 19=item * An Error Handler
a0d0e21e
LW
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
AD
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
AD
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
LW
35
36=back
37
d1b91892
AD
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
AD
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
AD
50Although this stuff is easier to explain using examples, you first need
51be aware of a few important definitions.
a0d0e21e 52
d1b91892
AD
53Perl has a number of C functions that allow you to call Perl
54subroutines. They are
a0d0e21e
LW
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
AD
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
AD
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
AD
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
AD
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
AD
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
AD
168=item 2.
169
184e9718 170It ensures that only a scalar is actually returned from the subroutine.
d1b91892
AD
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
AD
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
AD
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
LW
199
200=over 5
201
d1b91892
AD
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
AD
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
AD
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
AD
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
AD
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
AD
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
AD
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
AD
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
AD
262 sub fred
263 { print "@_\n" }
a0d0e21e 264
d1b91892
AD
265 sub joe
266 { &fred }
a0d0e21e 267
d1b91892 268 &joe(1,2,3) ;
a0d0e21e
LW
269
270This will print
271
d1b91892
AD
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
d1b91892
AD
282existing. By default, when either of these of events occurs, the
283process will terminate immediately. If though, you want to trap this
284type of event, specify the G_EVAL flag. It will put an I<eval { }>
285around the subroutine call.
a0d0e21e
LW
286
287Whenever control returns from the I<perl_call_*> function you need to
d1b91892
AD
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
AD
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
AD
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
LW
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
AD
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
AD
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
AD
399 if $@ ;
400 }
401
402via this XSUB
403
404 void
405 Call_fred()
406 CODE:
407 PUSHMARK(sp) ;
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
AD
420
421 void
422 Call_fred()
423 CODE:
424 PUSHMARK(sp) ;
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
LW
431
432=head1 EXAMPLES
433
434Enough of the definition talk, let's have a few examples.
435
d1b91892
AD
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
AD
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
AD
450This first trivial example will call a Perl subroutine, I<PrintUID>, to
451print out the UID of the process.
a0d0e21e
LW
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
LW
461 call_PrintUID()
462 {
d1b91892 463 dSP ;
a0d0e21e 464
d1b91892 465 PUSHMARK(sp) ;
a0d0e21e
LW
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
LW
472
473=over 5
474
d1b91892 475=item 1.
a0d0e21e 476
d1b91892
AD
477Ignore C<dSP> and C<PUSHMARK(sp)> for now. They will be discussed in
478the next example.
a0d0e21e
LW
479
480=item 2.
481
d1b91892
AD
482We aren't passing any parameters to I<PrintUID> so G_NOARGS can be
483specified.
a0d0e21e 484
d1b91892 485=item 3.
a0d0e21e
LW
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
LW
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
AD
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
LW
497
498=item 5.
499
d1b91892
AD
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
LW
502
503=back
504
d1b91892 505=head2 Passing Parameters
a0d0e21e 506
d1b91892
AD
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
LW
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
529 PUSHMARK(sp) ;
530 XPUSHs(sv_2mortal(newSVpv(a, 0)));
531 XPUSHs(sv_2mortal(newSViv(b)));
532 PUTBACK ;
533
534 perl_call_pv("LeftString", G_DISCARD);
535 }
536
a0d0e21e
LW
537Here are a few notes on the C function I<call_LeftString>.
538
539=over 5
540
d1b91892 541=item 1.
a0d0e21e 542
d1b91892
AD
543Parameters are passed to the Perl subroutine using the Perl stack.
544This is the purpose of the code beginning with the line C<dSP> and
545ending with the line C<PUTBACK>.
a0d0e21e
LW
546
547
d1b91892 548=item 2.
a0d0e21e
LW
549
550If you are going to put something onto the Perl stack, you need to know
d1b91892
AD
551where to put it. This is the purpose of the macro C<dSP> - it declares
552and initializes a I<local> copy of the Perl stack pointer.
a0d0e21e
LW
553
554All the other macros which will be used in this example require you to
d1b91892 555have used this macro.
a0d0e21e 556
d1b91892
AD
557The exception to this rule is if you are calling a Perl subroutine
558directly from an XSUB function. In this case it is not necessary to
5f05dabc 559use the C<dSP> macro explicitly - it will be declared for you
d1b91892 560automatically.
a0d0e21e 561
d1b91892 562=item 3.
a0d0e21e
LW
563
564Any parameters to be pushed onto the stack should be bracketed by the
d1b91892 565C<PUSHMARK> and C<PUTBACK> macros. The purpose of these two macros, in
5f05dabc 566this context, is to count the number of parameters you are
567pushing automatically. Then whenever Perl is creating the C<@_> array for the
d1b91892
AD
568subroutine, it knows how big to make it.
569
570The C<PUSHMARK> macro tells Perl to make a mental note of the current
571stack pointer. Even if you aren't passing any parameters (like the
572example shown in the section I<No Parameters, Nothing returned>) you
573must still call the C<PUSHMARK> macro before you can call any of the
574I<perl_call_*> functions - Perl still needs to know that there are no
575parameters.
576
577The C<PUTBACK> macro sets the global copy of the stack pointer to be
578the same as our local copy. If we didn't do this I<perl_call_pv>
579wouldn't know where the two parameters we pushed were - remember that
580up to now all the stack pointer manipulation we have done is with our
581local copy, I<not> the global copy.
582
583=item 4.
584
5f05dabc 585The only flag specified this time is G_DISCARD. Because we are passing 2
d1b91892
AD
586parameters to the Perl subroutine this time, we have not specified
587G_NOARGS.
a0d0e21e
LW
588
589=item 5.
590
591Next, we come to XPUSHs. This is where the parameters actually get
d1b91892
AD
592pushed onto the stack. In this case we are pushing a string and an
593integer.
a0d0e21e 594
54310121 595See L<perlguts/"XSUBs and the Argument Stack"> for details
d1b91892 596on how the XPUSH macros work.
a0d0e21e
LW
597
598=item 6.
599
d1b91892
AD
600Finally, I<LeftString> can now be called via the I<perl_call_pv>
601function.
a0d0e21e
LW
602
603=back
604
d1b91892 605=head2 Returning a Scalar
a0d0e21e 606
d1b91892
AD
607Now for an example of dealing with the items returned from a Perl
608subroutine.
a0d0e21e 609
5f05dabc 610Here is a Perl subroutine, I<Adder>, that takes 2 integer parameters
d1b91892 611and simply returns their sum.
a0d0e21e
LW
612
613 sub Adder
614 {
615 my($a, $b) = @_ ;
616 $a + $b ;
617 }
618
5f05dabc 619Because we are now concerned with the return value from I<Adder>, the C
d1b91892 620function required to call it is now a bit more complex.
a0d0e21e
LW
621
622 static void
623 call_Adder(a, b)
624 int a ;
625 int b ;
626 {
627 dSP ;
628 int count ;
629
630 ENTER ;
631 SAVETMPS;
632
633 PUSHMARK(sp) ;
634 XPUSHs(sv_2mortal(newSViv(a)));
635 XPUSHs(sv_2mortal(newSViv(b)));
636 PUTBACK ;
637
638 count = perl_call_pv("Adder", G_SCALAR);
639
640 SPAGAIN ;
641
d1b91892
AD
642 if (count != 1)
643 croak("Big trouble\n") ;
a0d0e21e 644
d1b91892 645 printf ("The sum of %d and %d is %d\n", a, b, POPi) ;
a0d0e21e
LW
646
647 PUTBACK ;
648 FREETMPS ;
649 LEAVE ;
650 }
651
a0d0e21e
LW
652Points to note this time are
653
654=over 5
655
54310121 656=item 1.
a0d0e21e 657
d1b91892
AD
658The only flag specified this time was G_SCALAR. That means the C<@_>
659array will be created and that the value returned by I<Adder> will
660still exist after the call to I<perl_call_pv>.
a0d0e21e
LW
661
662
663
664=item 2.
665
d1b91892
AD
666Because we are interested in what is returned from I<Adder> we cannot
667specify G_DISCARD. This means that we will have to tidy up the Perl
668stack and dispose of any temporary values ourselves. This is the
669purpose of
a0d0e21e 670
d1b91892
AD
671 ENTER ;
672 SAVETMPS ;
a0d0e21e
LW
673
674at the start of the function, and
675
d1b91892
AD
676 FREETMPS ;
677 LEAVE ;
678
679at the end. The C<ENTER>/C<SAVETMPS> pair creates a boundary for any
680temporaries we create. This means that the temporaries we get rid of
681will be limited to those which were created after these calls.
a0d0e21e 682
d1b91892 683The C<FREETMPS>/C<LEAVE> pair will get rid of any values returned by
54310121 684the Perl subroutine, plus it will also dump the mortal SVs we have
d1b91892
AD
685created. Having C<ENTER>/C<SAVETMPS> at the beginning of the code
686makes sure that no other mortals are destroyed.
a0d0e21e 687
d1b91892
AD
688Think of these macros as working a bit like using C<{> and C<}> in Perl
689to limit the scope of local variables.
690
691See the section I<Using Perl to dispose of temporaries> for details of
692an alternative to using these macros.
a0d0e21e
LW
693
694=item 3.
695
696The purpose of the macro C<SPAGAIN> is to refresh the local copy of the
697stack pointer. This is necessary because it is possible that the memory
68dc0745 698allocated to the Perl stack has been reallocated whilst in the
d1b91892 699I<perl_call_pv> call.
a0d0e21e 700
d1b91892 701If you are making use of the Perl stack pointer in your code you must
54310121 702always refresh the local copy using SPAGAIN whenever you make use
a0d0e21e
LW
703of the I<perl_call_*> functions or any other Perl internal function.
704
d1b91892 705=item 4.
a0d0e21e 706
d1b91892
AD
707Although only a single value was expected to be returned from I<Adder>,
708it is still good practice to check the return code from I<perl_call_pv>
709anyway.
a0d0e21e 710
d1b91892
AD
711Expecting a single value is not quite the same as knowing that there
712will be one. If someone modified I<Adder> to return a list and we
713didn't check for that possibility and take appropriate action the Perl
714stack would end up in an inconsistent state. That is something you
5f05dabc 715I<really> don't want to happen ever.
a0d0e21e
LW
716
717=item 5.
718
d1b91892
AD
719The C<POPi> macro is used here to pop the return value from the stack.
720In this case we wanted an integer, so C<POPi> was used.
a0d0e21e
LW
721
722
d1b91892
AD
723Here is the complete list of POP macros available, along with the types
724they return.
a0d0e21e 725
d1b91892
AD
726 POPs SV
727 POPp pointer
728 POPn double
729 POPi integer
730 POPl long
a0d0e21e
LW
731
732=item 6.
733
d1b91892
AD
734The final C<PUTBACK> is used to leave the Perl stack in a consistent
735state before exiting the function. This is necessary because when we
736popped the return value from the stack with C<POPi> it updated only our
737local copy of the stack pointer. Remember, C<PUTBACK> sets the global
738stack pointer to be the same as our local copy.
a0d0e21e
LW
739
740=back
741
742
d1b91892 743=head2 Returning a list of values
a0d0e21e 744
d1b91892
AD
745Now, let's extend the previous example to return both the sum of the
746parameters and the difference.
a0d0e21e 747
d1b91892 748Here is the Perl subroutine
a0d0e21e
LW
749
750 sub AddSubtract
751 {
752 my($a, $b) = @_ ;
753 ($a+$b, $a-$b) ;
754 }
755
a0d0e21e
LW
756and this is the C function
757
758 static void
759 call_AddSubtract(a, b)
760 int a ;
761 int b ;
762 {
763 dSP ;
764 int count ;
765
766 ENTER ;
767 SAVETMPS;
768
769 PUSHMARK(sp) ;
770 XPUSHs(sv_2mortal(newSViv(a)));
771 XPUSHs(sv_2mortal(newSViv(b)));
772 PUTBACK ;
773
774 count = perl_call_pv("AddSubtract", G_ARRAY);
775
776 SPAGAIN ;
777
d1b91892
AD
778 if (count != 2)
779 croak("Big trouble\n") ;
a0d0e21e 780
d1b91892
AD
781 printf ("%d - %d = %d\n", a, b, POPi) ;
782 printf ("%d + %d = %d\n", a, b, POPi) ;
a0d0e21e
LW
783
784 PUTBACK ;
785 FREETMPS ;
786 LEAVE ;
787 }
788
d1b91892
AD
789If I<call_AddSubtract> is called like this
790
791 call_AddSubtract(7, 4) ;
792
793then here is the output
794
795 7 - 4 = 3
796 7 + 4 = 11
a0d0e21e
LW
797
798Notes
799
800=over 5
801
802=item 1.
803
d1b91892 804We wanted array context, so G_ARRAY was used.
a0d0e21e
LW
805
806=item 2.
807
d1b91892
AD
808Not surprisingly C<POPi> is used twice this time because we were
809retrieving 2 values from the stack. The important thing to note is that
810when using the C<POP*> macros they come off the stack in I<reverse>
811order.
a0d0e21e
LW
812
813=back
814
d1b91892
AD
815=head2 Returning a list in a scalar context
816
817Say the Perl subroutine in the previous section was called in a scalar
818context, like this
819
820 static void
821 call_AddSubScalar(a, b)
822 int a ;
823 int b ;
824 {
825 dSP ;
826 int count ;
827 int i ;
828
829 ENTER ;
830 SAVETMPS;
831
832 PUSHMARK(sp) ;
833 XPUSHs(sv_2mortal(newSViv(a)));
834 XPUSHs(sv_2mortal(newSViv(b)));
835 PUTBACK ;
836
837 count = perl_call_pv("AddSubtract", G_SCALAR);
838
839 SPAGAIN ;
840
841 printf ("Items Returned = %d\n", count) ;
842
843 for (i = 1 ; i <= count ; ++i)
844 printf ("Value %d = %d\n", i, POPi) ;
845
846 PUTBACK ;
847 FREETMPS ;
848 LEAVE ;
849 }
850
851The other modification made is that I<call_AddSubScalar> will print the
852number of items returned from the Perl subroutine and their value (for
853simplicity it assumes that they are integer). So if
854I<call_AddSubScalar> is called
855
856 call_AddSubScalar(7, 4) ;
857
858then the output will be
859
860 Items Returned = 1
861 Value 1 = 3
862
863In this case the main point to note is that only the last item in the
54310121 864list is returned from the subroutine, I<AddSubtract> actually made it back to
d1b91892
AD
865I<call_AddSubScalar>.
866
867
868=head2 Returning Data from Perl via the parameter list
a0d0e21e
LW
869
870It is also possible to return values directly via the parameter list -
871whether it is actually desirable to do it is another matter entirely.
872
d1b91892
AD
873The Perl subroutine, I<Inc>, below takes 2 parameters and increments
874each directly.
a0d0e21e
LW
875
876 sub Inc
877 {
878 ++ $_[0] ;
879 ++ $_[1] ;
880 }
881
882and here is a C function to call it.
883
884 static void
885 call_Inc(a, b)
886 int a ;
887 int b ;
888 {
889 dSP ;
890 int count ;
891 SV * sva ;
892 SV * svb ;
893
894 ENTER ;
895 SAVETMPS;
896
897 sva = sv_2mortal(newSViv(a)) ;
898 svb = sv_2mortal(newSViv(b)) ;
899
900 PUSHMARK(sp) ;
901 XPUSHs(sva);
902 XPUSHs(svb);
903 PUTBACK ;
904
905 count = perl_call_pv("Inc", G_DISCARD);
906
907 if (count != 0)
d1b91892
AD
908 croak ("call_Inc: expected 0 values from 'Inc', got %d\n",
909 count) ;
a0d0e21e
LW
910
911 printf ("%d + 1 = %d\n", a, SvIV(sva)) ;
912 printf ("%d + 1 = %d\n", b, SvIV(svb)) ;
913
914 FREETMPS ;
d1b91892 915 LEAVE ;
a0d0e21e
LW
916 }
917
d1b91892
AD
918To be able to access the two parameters that were pushed onto the stack
919after they return from I<perl_call_pv> it is necessary to make a note
920of their addresses - thus the two variables C<sva> and C<svb>.
a0d0e21e 921
d1b91892
AD
922The reason this is necessary is that the area of the Perl stack which
923held them will very likely have been overwritten by something else by
924the time control returns from I<perl_call_pv>.
a0d0e21e
LW
925
926
927
928
d1b91892 929=head2 Using G_EVAL
a0d0e21e 930
d1b91892
AD
931Now an example using G_EVAL. Below is a Perl subroutine which computes
932the difference of its 2 parameters. If this would result in a negative
933result, the subroutine calls I<die>.
a0d0e21e
LW
934
935 sub Subtract
936 {
d1b91892 937 my ($a, $b) = @_ ;
a0d0e21e
LW
938
939 die "death can be fatal\n" if $a < $b ;
940
d1b91892 941 $a - $b ;
a0d0e21e
LW
942 }
943
944and some C to call it
945
946 static void
947 call_Subtract(a, b)
948 int a ;
949 int b ;
950 {
951 dSP ;
952 int count ;
a0d0e21e
LW
953
954 ENTER ;
955 SAVETMPS;
956
957 PUSHMARK(sp) ;
958 XPUSHs(sv_2mortal(newSViv(a)));
959 XPUSHs(sv_2mortal(newSViv(b)));
960 PUTBACK ;
961
962 count = perl_call_pv("Subtract", G_EVAL|G_SCALAR);
963
d1b91892
AD
964 SPAGAIN ;
965
966 /* Check the eval first */
c07a80fd 967 if (SvTRUE(GvSV(errgv)))
d1b91892 968 {
c07a80fd 969 printf ("Uh oh - %s\n", SvPV(GvSV(errgv), na)) ;
d1b91892
AD
970 POPs ;
971 }
972 else
973 {
974 if (count != 1)
975 croak("call_Subtract: wanted 1 value from 'Subtract', got %d\n",
976 count) ;
a0d0e21e 977
d1b91892
AD
978 printf ("%d - %d = %d\n", a, b, POPi) ;
979 }
a0d0e21e
LW
980
981 PUTBACK ;
982 FREETMPS ;
983 LEAVE ;
a0d0e21e
LW
984 }
985
986If I<call_Subtract> is called thus
987
d1b91892 988 call_Subtract(4, 5)
a0d0e21e
LW
989
990the following will be printed
991
d1b91892 992 Uh oh - death can be fatal
a0d0e21e
LW
993
994Notes
995
996=over 5
997
998=item 1.
999
d1b91892
AD
1000We want to be able to catch the I<die> so we have used the G_EVAL
1001flag. Not specifying this flag would mean that the program would
1002terminate immediately at the I<die> statement in the subroutine
1003I<Subtract>.
a0d0e21e
LW
1004
1005=item 2.
1006
54310121 1007The code
a0d0e21e 1008
c07a80fd 1009 if (SvTRUE(GvSV(errgv)))
d1b91892 1010 {
c07a80fd 1011 printf ("Uh oh - %s\n", SvPV(GvSV(errgv), na)) ;
d1b91892
AD
1012 POPs ;
1013 }
a0d0e21e 1014
d1b91892 1015is the direct equivalent of this bit of Perl
a0d0e21e 1016
d1b91892 1017 print "Uh oh - $@\n" if $@ ;
a0d0e21e 1018
c07a80fd 1019C<errgv> is a perl global of type C<GV *> that points to the
1020symbol table entry containing the error. C<GvSV(errgv)> therefore
1021refers to the C equivalent of C<$@>.
1022
d1b91892 1023=item 3.
a0d0e21e 1024
d1b91892 1025Note that the stack is popped using C<POPs> in the block where
c07a80fd 1026C<SvTRUE(GvSV(errgv))> is true. This is necessary because whenever a
d1b91892 1027I<perl_call_*> function invoked with G_EVAL|G_SCALAR returns an error,
5f05dabc 1028the top of the stack holds the value I<undef>. Because we want the
d1b91892
AD
1029program to continue after detecting this error, it is essential that
1030the stack is tidied up by removing the I<undef>.
a0d0e21e
LW
1031
1032=back
1033
1034
c07a80fd 1035=head2 Using G_KEEPERR
1036
1037Consider this rather facetious example, where we have used an XS
1038version of the call_Subtract example above inside a destructor:
1039
1040 package Foo;
1041 sub new { bless {}, $_[0] }
54310121 1042 sub Subtract {
c07a80fd 1043 my($a,$b) = @_;
1044 die "death can be fatal" if $a < $b ;
1045 $a - $b;
1046 }
1047 sub DESTROY { call_Subtract(5, 4); }
1048 sub foo { die "foo dies"; }
1049
1050 package main;
1051 eval { Foo->new->foo };
1052 print "Saw: $@" if $@; # should be, but isn't
1053
1054This example will fail to recognize that an error occurred inside the
1055C<eval {}>. Here's why: the call_Subtract code got executed while perl
5f05dabc 1056was cleaning up temporaries when exiting the eval block, and because
c07a80fd 1057call_Subtract is implemented with I<perl_call_pv> using the G_EVAL
1058flag, it promptly reset C<$@>. This results in the failure of the
1059outermost test for C<$@>, and thereby the failure of the error trap.
1060
1061Appending the G_KEEPERR flag, so that the I<perl_call_pv> call in
1062call_Subtract reads:
1063
1064 count = perl_call_pv("Subtract", G_EVAL|G_SCALAR|G_KEEPERR);
1065
1066will preserve the error and restore reliable error handling.
1067
d1b91892 1068=head2 Using perl_call_sv
a0d0e21e 1069
d1b91892
AD
1070In all the previous examples I have 'hard-wired' the name of the Perl
1071subroutine to be called from C. Most of the time though, it is more
1072convenient to be able to specify the name of the Perl subroutine from
1073within the Perl script.
a0d0e21e
LW
1074
1075Consider the Perl code below
1076
d1b91892
AD
1077 sub fred
1078 {
1079 print "Hello there\n" ;
1080 }
1081
1082 CallSubPV("fred") ;
1083
1084Here is a snippet of XSUB which defines I<CallSubPV>.
1085
1086 void
1087 CallSubPV(name)
1088 char * name
1089 CODE:
1090 PUSHMARK(sp) ;
1091 perl_call_pv(name, G_DISCARD|G_NOARGS) ;
a0d0e21e 1092
54310121 1093That is fine as far as it goes. The thing is, the Perl subroutine
5f05dabc 1094can be specified as only a string. For Perl 4 this was adequate,
d1b91892
AD
1095but Perl 5 allows references to subroutines and anonymous subroutines.
1096This is where I<perl_call_sv> is useful.
1097
1098The code below for I<CallSubSV> is identical to I<CallSubPV> except
1099that the C<name> parameter is now defined as an SV* and we use
1100I<perl_call_sv> instead of I<perl_call_pv>.
1101
1102 void
1103 CallSubSV(name)
1104 SV * name
1105 CODE:
1106 PUSHMARK(sp) ;
1107 perl_call_sv(name, G_DISCARD|G_NOARGS) ;
a0d0e21e 1108
5f05dabc 1109Because we are using an SV to call I<fred> the following can all be used
a0d0e21e 1110
d1b91892
AD
1111 CallSubSV("fred") ;
1112 CallSubSV(\&fred) ;
1113 $ref = \&fred ;
1114 CallSubSV($ref) ;
1115 CallSubSV( sub { print "Hello there\n" } ) ;
a0d0e21e 1116
d1b91892
AD
1117As you can see, I<perl_call_sv> gives you much greater flexibility in
1118how you can specify the Perl subroutine.
1119
1120You should note that if it is necessary to store the SV (C<name> in the
1121example above) which corresponds to the Perl subroutine so that it can
5f05dabc 1122be used later in the program, it not enough just to store a copy of the
d1b91892
AD
1123pointer to the SV. Say the code above had been like this
1124
1125 static SV * rememberSub ;
1126
1127 void
1128 SaveSub1(name)
1129 SV * name
1130 CODE:
1131 rememberSub = name ;
1132
1133 void
1134 CallSavedSub1()
1135 CODE:
1136 PUSHMARK(sp) ;
1137 perl_call_sv(rememberSub, G_DISCARD|G_NOARGS) ;
a0d0e21e 1138
d1b91892
AD
1139The reason this is wrong is that by the time you come to use the
1140pointer C<rememberSub> in C<CallSavedSub1>, it may or may not still refer
1141to the Perl subroutine that was recorded in C<SaveSub1>. This is
1142particularly true for these cases
a0d0e21e 1143
d1b91892
AD
1144 SaveSub1(\&fred) ;
1145 CallSavedSub1() ;
a0d0e21e 1146
d1b91892
AD
1147 SaveSub1( sub { print "Hello there\n" } ) ;
1148 CallSavedSub1() ;
a0d0e21e 1149
d1b91892 1150By the time each of the C<SaveSub1> statements above have been executed,
54310121 1151the SV*s which corresponded to the parameters will no longer exist.
d1b91892 1152Expect an error message from Perl of the form
a0d0e21e 1153
d1b91892 1154 Can't use an undefined value as a subroutine reference at ...
a0d0e21e 1155
d1b91892 1156for each of the C<CallSavedSub1> lines.
a0d0e21e 1157
54310121 1158Similarly, with this code
a0d0e21e 1159
d1b91892
AD
1160 $ref = \&fred ;
1161 SaveSub1($ref) ;
1162 $ref = 47 ;
1163 CallSavedSub1() ;
a0d0e21e 1164
54310121 1165you can expect one of these messages (which you actually get is dependent on
1166the version of Perl you are using)
a0d0e21e 1167
d1b91892
AD
1168 Not a CODE reference at ...
1169 Undefined subroutine &main::47 called ...
a0d0e21e 1170
d1b91892
AD
1171The variable C<$ref> may have referred to the subroutine C<fred>
1172whenever the call to C<SaveSub1> was made but by the time
5f05dabc 1173C<CallSavedSub1> gets called it now holds the number C<47>. Because we
d1b91892
AD
1174saved only a pointer to the original SV in C<SaveSub1>, any changes to
1175C<$ref> will be tracked by the pointer C<rememberSub>. This means that
1176whenever C<CallSavedSub1> gets called, it will attempt to execute the
1177code which is referenced by the SV* C<rememberSub>. In this case
1178though, it now refers to the integer C<47>, so expect Perl to complain
1179loudly.
a0d0e21e 1180
d1b91892 1181A similar but more subtle problem is illustrated with this code
a0d0e21e 1182
d1b91892
AD
1183 $ref = \&fred ;
1184 SaveSub1($ref) ;
1185 $ref = \&joe ;
1186 CallSavedSub1() ;
a0d0e21e 1187
d1b91892 1188This time whenever C<CallSavedSub1> get called it will execute the Perl
54310121 1189subroutine C<joe> (assuming it exists) rather than C<fred> as was
d1b91892 1190originally requested in the call to C<SaveSub1>.
a0d0e21e 1191
d1b91892
AD
1192To get around these problems it is necessary to take a full copy of the
1193SV. The code below shows C<SaveSub2> modified to do that
a0d0e21e 1194
d1b91892
AD
1195 static SV * keepSub = (SV*)NULL ;
1196
1197 void
1198 SaveSub2(name)
1199 SV * name
1200 CODE:
1201 /* Take a copy of the callback */
1202 if (keepSub == (SV*)NULL)
1203 /* First time, so create a new SV */
1204 keepSub = newSVsv(name) ;
1205 else
1206 /* Been here before, so overwrite */
1207 SvSetSV(keepSub, name) ;
1208
1209 void
1210 CallSavedSub2()
1211 CODE:
1212 PUSHMARK(sp) ;
1213 perl_call_sv(keepSub, G_DISCARD|G_NOARGS) ;
1214
5f05dabc 1215To avoid creating a new SV every time C<SaveSub2> is called,
d1b91892
AD
1216the function first checks to see if it has been called before. If not,
1217then space for a new SV is allocated and the reference to the Perl
1218subroutine, C<name> is copied to the variable C<keepSub> in one
1219operation using C<newSVsv>. Thereafter, whenever C<SaveSub2> is called
1220the existing SV, C<keepSub>, is overwritten with the new value using
1221C<SvSetSV>.
1222
1223=head2 Using perl_call_argv
1224
1225Here is a Perl subroutine which prints whatever parameters are passed
1226to it.
1227
1228 sub PrintList
1229 {
1230 my(@list) = @_ ;
1231
1232 foreach (@list) { print "$_\n" }
1233 }
1234
1235and here is an example of I<perl_call_argv> which will call
1236I<PrintList>.
1237
1238 static char * words[] = {"alpha", "beta", "gamma", "delta", NULL} ;
1239
1240 static void
1241 call_PrintList()
1242 {
1243 dSP ;
1244
1245 perl_call_argv("PrintList", G_DISCARD, words) ;
1246 }
1247
1248Note that it is not necessary to call C<PUSHMARK> in this instance.
1249This is because I<perl_call_argv> will do it for you.
1250
1251=head2 Using perl_call_method
a0d0e21e
LW
1252
1253Consider the following Perl code
1254
d1b91892
AD
1255 {
1256 package Mine ;
1257
1258 sub new
1259 {
1260 my($type) = shift ;
1261 bless [@_]
1262 }
1263
1264 sub Display
1265 {
1266 my ($self, $index) = @_ ;
1267 print "$index: $$self[$index]\n" ;
1268 }
1269
1270 sub PrintID
1271 {
1272 my($class) = @_ ;
1273 print "This is Class $class version 1.0\n" ;
1274 }
1275 }
1276
5f05dabc 1277It implements just a very simple class to manage an array. Apart from
d1b91892 1278the constructor, C<new>, it declares methods, one static and one
5f05dabc 1279virtual. The static method, C<PrintID>, prints out simply the class
d1b91892
AD
1280name and a version number. The virtual method, C<Display>, prints out a
1281single element of the array. Here is an all Perl example of using it.
1282
1283 $a = new Mine ('red', 'green', 'blue') ;
1284 $a->Display(1) ;
1285 PrintID Mine;
a0d0e21e 1286
d1b91892 1287will print
a0d0e21e 1288
d1b91892 1289 1: green
54310121 1290 This is Class Mine version 1.0
a0d0e21e 1291
d1b91892
AD
1292Calling a Perl method from C is fairly straightforward. The following
1293things are required
a0d0e21e 1294
d1b91892
AD
1295=over 5
1296
1297=item *
1298
1299a reference to the object for a virtual method or the name of the class
1300for a static method.
1301
1302=item *
1303
1304the name of the method.
1305
1306=item *
1307
1308any other parameters specific to the method.
1309
1310=back
1311
1312Here is a simple XSUB which illustrates the mechanics of calling both
1313the C<PrintID> and C<Display> methods from C.
1314
1315 void
1316 call_Method(ref, method, index)
1317 SV * ref
1318 char * method
1319 int index
1320 CODE:
1321 PUSHMARK(sp);
1322 XPUSHs(ref);
1323 XPUSHs(sv_2mortal(newSViv(index))) ;
1324 PUTBACK;
1325
1326 perl_call_method(method, G_DISCARD) ;
1327
1328 void
1329 call_PrintID(class, method)
1330 char * class
1331 char * method
1332 CODE:
1333 PUSHMARK(sp);
1334 XPUSHs(sv_2mortal(newSVpv(class, 0))) ;
1335 PUTBACK;
1336
1337 perl_call_method(method, G_DISCARD) ;
1338
1339
1340So the methods C<PrintID> and C<Display> can be invoked like this
1341
1342 $a = new Mine ('red', 'green', 'blue') ;
1343 call_Method($a, 'Display', 1) ;
1344 call_PrintID('Mine', 'PrintID') ;
1345
1346The only thing to note is that in both the static and virtual methods,
1347the method name is not passed via the stack - it is used as the first
1348parameter to I<perl_call_method>.
1349
54310121 1350=head2 Using GIMME_V
d1b91892 1351
54310121 1352Here is a trivial XSUB which prints the context in which it is
d1b91892
AD
1353currently executing.
1354
1355 void
1356 PrintContext()
1357 CODE:
54310121 1358 I32 gimme = GIMME_V;
1359 if (gimme == G_VOID)
1360 printf ("Context is Void\n") ;
1361 else if (gimme == G_SCALAR)
d1b91892
AD
1362 printf ("Context is Scalar\n") ;
1363 else
1364 printf ("Context is Array\n") ;
1365
1366and here is some Perl to test it
1367
54310121 1368 PrintContext ;
d1b91892
AD
1369 $a = PrintContext ;
1370 @a = PrintContext ;
1371
1372The output from that will be
1373
54310121 1374 Context is Void
d1b91892
AD
1375 Context is Scalar
1376 Context is Array
1377
1378=head2 Using Perl to dispose of temporaries
1379
1380In the examples given to date, any temporaries created in the callback
5f05dabc 1381(i.e., parameters passed on the stack to the I<perl_call_*> function or
d1b91892
AD
1382values returned via the stack) have been freed by one of these methods
1383
1384=over 5
1385
1386=item *
1387
1388specifying the G_DISCARD flag with I<perl_call_*>.
1389
1390=item *
1391
1392explicitly disposed of using the C<ENTER>/C<SAVETMPS> -
1393C<FREETMPS>/C<LEAVE> pairing.
1394
1395=back
1396
1397There is another method which can be used, namely letting Perl do it
1398for you automatically whenever it regains control after the callback
1399has terminated. This is done by simply not using the
1400
1401 ENTER ;
1402 SAVETMPS ;
1403 ...
1404 FREETMPS ;
1405 LEAVE ;
1406
1407sequence in the callback (and not, of course, specifying the G_DISCARD
1408flag).
1409
1410If you are going to use this method you have to be aware of a possible
1411memory leak which can arise under very specific circumstances. To
1412explain these circumstances you need to know a bit about the flow of
1413control between Perl and the callback routine.
1414
1415The examples given at the start of the document (an error handler and
1416an event driven program) are typical of the two main sorts of flow
1417control that you are likely to encounter with callbacks. There is a
1418very important distinction between them, so pay attention.
1419
1420In the first example, an error handler, the flow of control could be as
1421follows. You have created an interface to an external library.
1422Control can reach the external library like this
1423
1424 perl --> XSUB --> external library
1425
1426Whilst control is in the library, an error condition occurs. You have
1427previously set up a Perl callback to handle this situation, so it will
1428get executed. Once the callback has finished, control will drop back to
1429Perl again. Here is what the flow of control will be like in that
1430situation
1431
1432 perl --> XSUB --> external library
1433 ...
1434 error occurs
1435 ...
1436 external library --> perl_call --> perl
1437 |
1438 perl <-- XSUB <-- external library <-- perl_call <----+
1439
1440After processing of the error using I<perl_call_*> is completed,
1441control reverts back to Perl more or less immediately.
1442
1443In the diagram, the further right you go the more deeply nested the
1444scope is. It is only when control is back with perl on the extreme
1445left of the diagram that you will have dropped back to the enclosing
1446scope and any temporaries you have left hanging around will be freed.
1447
1448In the second example, an event driven program, the flow of control
1449will be more like this
1450
1451 perl --> XSUB --> event handler
1452 ...
54310121 1453 event handler --> perl_call --> perl
d1b91892 1454 |
54310121 1455 event handler <-- perl_call <----+
d1b91892 1456 ...
54310121 1457 event handler --> perl_call --> perl
d1b91892 1458 |
54310121 1459 event handler <-- perl_call <----+
d1b91892 1460 ...
54310121 1461 event handler --> perl_call --> perl
d1b91892 1462 |
54310121 1463 event handler <-- perl_call <----+
d1b91892
AD
1464
1465In this case the flow of control can consist of only the repeated
1466sequence
1467
1468 event handler --> perl_call --> perl
1469
54310121 1470for practically the complete duration of the program. This means that
1471control may I<never> drop back to the surrounding scope in Perl at the
1472extreme left.
d1b91892
AD
1473
1474So what is the big problem? Well, if you are expecting Perl to tidy up
1475those temporaries for you, you might be in for a long wait. For Perl
5f05dabc 1476to dispose of your temporaries, control must drop back to the
d1b91892
AD
1477enclosing scope at some stage. In the event driven scenario that may
1478never happen. This means that as time goes on, your program will
1479create more and more temporaries, none of which will ever be freed. As
1480each of these temporaries consumes some memory your program will
1481eventually consume all the available memory in your system - kapow!
1482
1483So here is the bottom line - if you are sure that control will revert
1484back to the enclosing Perl scope fairly quickly after the end of your
5f05dabc 1485callback, then it isn't absolutely necessary to dispose explicitly of
d1b91892
AD
1486any temporaries you may have created. Mind you, if you are at all
1487uncertain about what to do, it doesn't do any harm to tidy up anyway.
1488
1489
1490=head2 Strategies for storing Callback Context Information
1491
1492
1493Potentially one of the trickiest problems to overcome when designing a
1494callback interface can be figuring out how to store the mapping between
1495the C callback function and the Perl equivalent.
1496
1497To help understand why this can be a real problem first consider how a
1498callback is set up in an all C environment. Typically a C API will
1499provide a function to register a callback. This will expect a pointer
1500to a function as one of its parameters. Below is a call to a
1501hypothetical function C<register_fatal> which registers the C function
1502to get called when a fatal error occurs.
1503
1504 register_fatal(cb1) ;
1505
1506The single parameter C<cb1> is a pointer to a function, so you must
1507have defined C<cb1> in your code, say something like this
1508
1509 static void
1510 cb1()
1511 {
1512 printf ("Fatal Error\n") ;
1513 exit(1) ;
1514 }
1515
1516Now change that to call a Perl subroutine instead
1517
1518 static SV * callback = (SV*)NULL;
1519
1520 static void
1521 cb1()
1522 {
1523 dSP ;
1524
1525 PUSHMARK(sp) ;
1526
1527 /* Call the Perl sub to process the callback */
1528 perl_call_sv(callback, G_DISCARD) ;
1529 }
1530
1531
1532 void
1533 register_fatal(fn)
1534 SV * fn
1535 CODE:
1536 /* Remember the Perl sub */
1537 if (callback == (SV*)NULL)
1538 callback = newSVsv(fn) ;
1539 else
1540 SvSetSV(callback, fn) ;
1541
1542 /* register the callback with the external library */
1543 register_fatal(cb1) ;
1544
1545where the Perl equivalent of C<register_fatal> and the callback it
1546registers, C<pcb1>, might look like this
1547
1548 # Register the sub pcb1
1549 register_fatal(\&pcb1) ;
1550
1551 sub pcb1
1552 {
1553 die "I'm dying...\n" ;
1554 }
1555
1556The mapping between the C callback and the Perl equivalent is stored in
1557the global variable C<callback>.
1558
5f05dabc 1559This will be adequate if you ever need to have only one callback
d1b91892
AD
1560registered at any time. An example could be an error handler like the
1561code sketched out above. Remember though, repeated calls to
1562C<register_fatal> will replace the previously registered callback
1563function with the new one.
1564
1565Say for example you want to interface to a library which allows asynchronous
1566file i/o. In this case you may be able to register a callback whenever
1567a read operation has completed. To be of any use we want to be able to
1568call separate Perl subroutines for each file that is opened. As it
1569stands, the error handler example above would not be adequate as it
1570allows only a single callback to be defined at any time. What we
1571require is a means of storing the mapping between the opened file and
1572the Perl subroutine we want to be called for that file.
1573
1574Say the i/o library has a function C<asynch_read> which associates a C
1575function C<ProcessRead> with a file handle C<fh> - this assumes that it
1576has also provided some routine to open the file and so obtain the file
1577handle.
1578
1579 asynch_read(fh, ProcessRead)
1580
1581This may expect the C I<ProcessRead> function of this form
1582
1583 void
1584 ProcessRead(fh, buffer)
1585 int fh ;
1586 char * buffer ;
1587 {
54310121 1588 ...
d1b91892
AD
1589 }
1590
1591To provide a Perl interface to this library we need to be able to map
1592between the C<fh> parameter and the Perl subroutine we want called. A
1593hash is a convenient mechanism for storing this mapping. The code
1594below shows a possible implementation
1595
1596 static HV * Mapping = (HV*)NULL ;
a0d0e21e 1597
d1b91892
AD
1598 void
1599 asynch_read(fh, callback)
1600 int fh
1601 SV * callback
1602 CODE:
1603 /* If the hash doesn't already exist, create it */
1604 if (Mapping == (HV*)NULL)
1605 Mapping = newHV() ;
1606
1607 /* Save the fh -> callback mapping */
1608 hv_store(Mapping, (char*)&fh, sizeof(fh), newSVsv(callback), 0) ;
1609
1610 /* Register with the C Library */
1611 asynch_read(fh, asynch_read_if) ;
1612
1613and C<asynch_read_if> could look like this
1614
1615 static void
1616 asynch_read_if(fh, buffer)
1617 int fh ;
1618 char * buffer ;
1619 {
1620 dSP ;
1621 SV ** sv ;
1622
1623 /* Get the callback associated with fh */
1624 sv = hv_fetch(Mapping, (char*)&fh , sizeof(fh), FALSE) ;
1625 if (sv == (SV**)NULL)
1626 croak("Internal error...\n") ;
1627
1628 PUSHMARK(sp) ;
1629 XPUSHs(sv_2mortal(newSViv(fh))) ;
1630 XPUSHs(sv_2mortal(newSVpv(buffer, 0))) ;
1631 PUTBACK ;
1632
1633 /* Call the Perl sub */
1634 perl_call_sv(*sv, G_DISCARD) ;
1635 }
1636
1637For completeness, here is C<asynch_close>. This shows how to remove
1638the entry from the hash C<Mapping>.
1639
1640 void
1641 asynch_close(fh)
1642 int fh
1643 CODE:
1644 /* Remove the entry from the hash */
1645 (void) hv_delete(Mapping, (char*)&fh, sizeof(fh), G_DISCARD) ;
a0d0e21e 1646
d1b91892
AD
1647 /* Now call the real asynch_close */
1648 asynch_close(fh) ;
a0d0e21e 1649
d1b91892
AD
1650So the Perl interface would look like this
1651
1652 sub callback1
1653 {
1654 my($handle, $buffer) = @_ ;
1655 }
a0d0e21e 1656
d1b91892
AD
1657 # Register the Perl callback
1658 asynch_read($fh, \&callback1) ;
a0d0e21e 1659
d1b91892
AD
1660 asynch_close($fh) ;
1661
1662The mapping between the C callback and Perl is stored in the global
1663hash C<Mapping> this time. Using a hash has the distinct advantage that
1664it allows an unlimited number of callbacks to be registered.
1665
1666What if the interface provided by the C callback doesn't contain a
1667parameter which allows the file handle to Perl subroutine mapping? Say
1668in the asynchronous i/o package, the callback function gets passed only
1669the C<buffer> parameter like this
1670
1671 void
1672 ProcessRead(buffer)
1673 char * buffer ;
1674 {
1675 ...
1676 }
a0d0e21e 1677
d1b91892
AD
1678Without the file handle there is no straightforward way to map from the
1679C callback to the Perl subroutine.
a0d0e21e 1680
54310121 1681In this case a possible way around this problem is to predefine a
d1b91892
AD
1682series of C functions to act as the interface to Perl, thus
1683
1684 #define MAX_CB 3
1685 #define NULL_HANDLE -1
1686 typedef void (*FnMap)() ;
1687
1688 struct MapStruct {
1689 FnMap Function ;
1690 SV * PerlSub ;
1691 int Handle ;
1692 } ;
1693
1694 static void fn1() ;
1695 static void fn2() ;
1696 static void fn3() ;
1697
1698 static struct MapStruct Map [MAX_CB] =
1699 {
1700 { fn1, NULL, NULL_HANDLE },
1701 { fn2, NULL, NULL_HANDLE },
1702 { fn3, NULL, NULL_HANDLE }
1703 } ;
1704
1705 static void
1706 Pcb(index, buffer)
1707 int index ;
1708 char * buffer ;
1709 {
1710 dSP ;
1711
1712 PUSHMARK(sp) ;
1713 XPUSHs(sv_2mortal(newSVpv(buffer, 0))) ;
1714 PUTBACK ;
1715
1716 /* Call the Perl sub */
1717 perl_call_sv(Map[index].PerlSub, G_DISCARD) ;
1718 }
1719
1720 static void
1721 fn1(buffer)
1722 char * buffer ;
1723 {
1724 Pcb(0, buffer) ;
1725 }
1726
1727 static void
1728 fn2(buffer)
1729 char * buffer ;
1730 {
1731 Pcb(1, buffer) ;
1732 }
1733
1734 static void
1735 fn3(buffer)
1736 char * buffer ;
1737 {
1738 Pcb(2, buffer) ;
1739 }
1740
1741 void
1742 array_asynch_read(fh, callback)
1743 int fh
1744 SV * callback
1745 CODE:
1746 int index ;
1747 int null_index = MAX_CB ;
1748
1749 /* Find the same handle or an empty entry */
1750 for (index = 0 ; index < MAX_CB ; ++index)
1751 {
1752 if (Map[index].Handle == fh)
1753 break ;
1754
1755 if (Map[index].Handle == NULL_HANDLE)
1756 null_index = index ;
1757 }
1758
1759 if (index == MAX_CB && null_index == MAX_CB)
1760 croak ("Too many callback functions registered\n") ;
1761
1762 if (index == MAX_CB)
1763 index = null_index ;
1764
1765 /* Save the file handle */
1766 Map[index].Handle = fh ;
1767
1768 /* Remember the Perl sub */
1769 if (Map[index].PerlSub == (SV*)NULL)
1770 Map[index].PerlSub = newSVsv(callback) ;
1771 else
1772 SvSetSV(Map[index].PerlSub, callback) ;
1773
1774 asynch_read(fh, Map[index].Function) ;
1775
1776 void
1777 array_asynch_close(fh)
1778 int fh
1779 CODE:
1780 int index ;
1781
1782 /* Find the file handle */
1783 for (index = 0; index < MAX_CB ; ++ index)
1784 if (Map[index].Handle == fh)
1785 break ;
1786
1787 if (index == MAX_CB)
1788 croak ("could not close fh %d\n", fh) ;
1789
1790 Map[index].Handle = NULL_HANDLE ;
1791 SvREFCNT_dec(Map[index].PerlSub) ;
1792 Map[index].PerlSub = (SV*)NULL ;
1793
1794 asynch_close(fh) ;
1795
5f05dabc 1796In this case the functions C<fn1>, C<fn2>, and C<fn3> are used to
d1b91892 1797remember the Perl subroutine to be called. Each of the functions holds
4a6725af 1798a separate hard-wired index which is used in the function C<Pcb> to
d1b91892
AD
1799access the C<Map> array and actually call the Perl subroutine.
1800
1801There are some obvious disadvantages with this technique.
1802
1803Firstly, the code is considerably more complex than with the previous
1804example.
1805
4a6725af 1806Secondly, there is a hard-wired limit (in this case 3) to the number of
d1b91892
AD
1807callbacks that can exist simultaneously. The only way to increase the
1808limit is by modifying the code to add more functions and then
54310121 1809recompiling. None the less, as long as the number of functions is
d1b91892
AD
1810chosen with some care, it is still a workable solution and in some
1811cases is the only one available.
1812
1813To summarize, here are a number of possible methods for you to consider
1814for storing the mapping between C and the Perl callback
1815
1816=over 5
1817
1818=item 1. Ignore the problem - Allow only 1 callback
1819
1820For a lot of situations, like interfacing to an error handler, this may
1821be a perfectly adequate solution.
1822
1823=item 2. Create a sequence of callbacks - hard wired limit
1824
1825If it is impossible to tell from the parameters passed back from the C
1826callback what the context is, then you may need to create a sequence of C
1827callback interface functions, and store pointers to each in an array.
1828
1829=item 3. Use a parameter to map to the Perl callback
1830
1831A hash is an ideal mechanism to store the mapping between C and Perl.
1832
1833=back
a0d0e21e 1834
a0d0e21e
LW
1835
1836=head2 Alternate Stack Manipulation
1837
a0d0e21e 1838
d1b91892
AD
1839Although I have made use of only the C<POP*> macros to access values
1840returned from Perl subroutines, it is also possible to bypass these
8e07c86e 1841macros and read the stack using the C<ST> macro (See L<perlxs> for a
d1b91892
AD
1842full description of the C<ST> macro).
1843
1844Most of the time the C<POP*> macros should be adequate, the main
1845problem with them is that they force you to process the returned values
1846in sequence. This may not be the most suitable way to process the
1847values in some cases. What we want is to be able to access the stack in
1848a random order. The C<ST> macro as used when coding an XSUB is ideal
1849for this purpose.
1850
1851The code below is the example given in the section I<Returning a list
1852of values> recoded to use C<ST> instead of C<POP*>.
1853
1854 static void
1855 call_AddSubtract2(a, b)
1856 int a ;
1857 int b ;
1858 {
1859 dSP ;
1860 I32 ax ;
1861 int count ;
1862
1863 ENTER ;
1864 SAVETMPS;
1865
1866 PUSHMARK(sp) ;
1867 XPUSHs(sv_2mortal(newSViv(a)));
1868 XPUSHs(sv_2mortal(newSViv(b)));
1869 PUTBACK ;
1870
1871 count = perl_call_pv("AddSubtract", G_ARRAY);
1872
1873 SPAGAIN ;
1874 sp -= count ;
1875 ax = (sp - stack_base) + 1 ;
1876
1877 if (count != 2)
1878 croak("Big trouble\n") ;
a0d0e21e 1879
d1b91892
AD
1880 printf ("%d + %d = %d\n", a, b, SvIV(ST(0))) ;
1881 printf ("%d - %d = %d\n", a, b, SvIV(ST(1))) ;
1882
1883 PUTBACK ;
1884 FREETMPS ;
1885 LEAVE ;
1886 }
1887
1888Notes
1889
1890=over 5
1891
1892=item 1.
1893
1894Notice that it was necessary to define the variable C<ax>. This is
1895because the C<ST> macro expects it to exist. If we were in an XSUB it
1896would not be necessary to define C<ax> as it is already defined for
1897you.
1898
1899=item 2.
1900
1901The code
1902
1903 SPAGAIN ;
1904 sp -= count ;
1905 ax = (sp - stack_base) + 1 ;
1906
1907sets the stack up so that we can use the C<ST> macro.
1908
1909=item 3.
1910
1911Unlike the original coding of this example, the returned
1912values are not accessed in reverse order. So C<ST(0)> refers to the
54310121 1913first value returned by the Perl subroutine and C<ST(count-1)>
d1b91892
AD
1914refers to the last.
1915
1916=back
a0d0e21e 1917
8f183262
DM
1918=head2 Creating and calling an anonymous subroutine in C
1919
1920As we've already shown, L<perl_call_sv> can be used to invoke an
1921anonymous subroutine. However, our example showed how Perl script
1922invoking an XSUB to preform this operation. Let's see how it can be
1923done inside our C code:
1924
1925 SV *perl_eval(char *string, int croak_on_error)
1926 {
1927 dSP;
1928 SV *sv = newSVpv(string,0);
1929
1930 PUSHMARK(sp);
1931 perl_eval_sv(sv, G_SCALAR);
1932 SvREFCNT_dec(sv);
1933
1934 SPAGAIN;
1935 sv = POPs;
1936 PUTBACK;
1937
1938 if (croak_on_error && SvTRUE(GvSV(errgv)))
1939 croak(SvPV(GvSV(errgv),na));
1940
1941 return sv;
1942 }
1943
1944 ...
1945
1946 SV *cvrv = perl_eval("sub { print 'You will not find me cluttering any namespace!' }", TRUE);
1947
1948 ...
1949
1950 perl_call_sv(cvrv, G_VOID|G_NOARGS);
1951
1952L<perl_eval_sv> is used to compile the anonymous subroutine, which can
1953then be POPed off the stack. Once this code reference is in hand, it
1954can be mixed in with all the previous examples we've shown.
1955
a0d0e21e
LW
1956=head1 SEE ALSO
1957
8e07c86e 1958L<perlxs>, L<perlguts>, L<perlembed>
a0d0e21e
LW
1959
1960=head1 AUTHOR
1961
9607fc9c 1962Paul Marquess <F<pmarquess@bfsec.bt.co.uk>>
a0d0e21e 1963
d1b91892
AD
1964Special thanks to the following people who assisted in the creation of
1965the document.
a0d0e21e 1966
c07a80fd 1967Jeff Okamoto, Tim Bunce, Nick Gianniotis, Steve Kelem, Gurusamy Sarathy
1968and Larry Wall.
a0d0e21e
LW
1969
1970=head1 DATE
1971
c07a80fd 1972Version 1.2, 16th Jan 1996