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