This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
additional tests for package block syntax
[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
4929bf7b 48=head1 THE 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 55
4358a253
SS
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);
a0d0e21e 60
4929bf7b 61The key function is I<call_sv>. All the other functions are
d1b91892 62fairly simple wrappers which make it easier to call Perl subroutines in
4929bf7b 63special cases. At the end of the day they will all call I<call_sv>
5f05dabc 64to invoke the Perl subroutine.
d1b91892 65
4929bf7b 66All the I<call_*> functions have a C<flags> parameter which is
d1b91892
AD
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
4929bf7b 75=item call_sv
d1b91892 76
4929bf7b 77I<call_sv> takes two parameters, the first, C<sv>, is an SV*.
d1b91892
AD
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
4929bf7b
GS
80subroutine. The section, I<Using call_sv>, shows how you can make
81use of I<call_sv>.
d1b91892 82
4929bf7b 83=item call_pv
d1b91892 84
4929bf7b 85The function, I<call_pv>, is similar to I<call_sv> except it
d1b91892 86expects its first parameter to be a C char* which identifies the Perl
4929bf7b 87subroutine you want to call, e.g., C<call_pv("fred", 0)>. If the
d1b91892 88subroutine you want to call is in another package, just include the
5f05dabc 89package name in the string, e.g., C<"pkg::fred">.
d1b91892 90
4929bf7b 91=item call_method
d1b91892 92
4929bf7b 93The function I<call_method> is used to call a method from a Perl
d1b91892
AD
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
4929bf7b
GS
99static and virtual methods and L<Using call_method> for an example
100of using I<call_method>.
d1b91892 101
4929bf7b 102=item call_argv
d1b91892 103
4929bf7b 104I<call_argv> calls the Perl subroutine specified by the C string
d1b91892
AD
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.
4929bf7b 108See I<Using call_argv>.
d1b91892
AD
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
19799a22 119stop someone from doing something unexpected--don't say you haven't
d1b91892
AD
120been warned.
121
122=head1 FLAG VALUES
123
4929bf7b 124The C<flags> parameter in all the I<call_*> functions is a bit mask
d1b91892
AD
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
4929bf7b 149The value returned by the I<call_*> function indicates how many
54310121 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
4929bf7b 157context flag setting for all the I<call_*> functions.
d1b91892 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
4929bf7b 177The value returned by the I<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
4929bf7b 190I<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
90fdbbb7
DC
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).
a0d0e21e 206
a0d0e21e 207
d1b91892 208=item 2.
a0d0e21e 209
184e9718 210It ensures that all items returned from the subroutine will be
4929bf7b 211accessible when control returns from the I<call_*> function.
a0d0e21e 212
d1b91892 213=back
a0d0e21e 214
4929bf7b 215The value returned by the I<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
4929bf7b 228By default, the I<call_*> functions place the items returned from
d1b91892
AD
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
4929bf7b 244Whenever a Perl subroutine is called using one of the I<call_*>
d1b91892
AD
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
4929bf7b 258occur when the code that is executing the I<call_*> function has
d1b91892
AD
259itself been called from another Perl subroutine. The code below
260illustrates this
a0d0e21e 261
84f709e7
JH
262 sub fred
263 { print "@_\n" }
a0d0e21e 264
84f709e7
JH
265 sub joe
266 { &fred }
a0d0e21e 267
4358a253 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
268118b2
HS
282existing. By default, when either of these events occurs, the
283process will terminate immediately. If you want to trap this
d1b91892
AD
284type of event, specify the G_EVAL flag. It will put an I<eval { }>
285around the subroutine call.
a0d0e21e 286
4929bf7b 287Whenever control returns from the I<call_*> function you need to
d1b91892
AD
288check the C<$@> variable as you would in a normal Perl script.
289
4929bf7b 290The value returned from the I<call_*> function is dependent on
d1b91892 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
4929bf7b 298If the I<call_*> function returns normally, then the value
d1b91892
AD
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
7ce09284
Z
324Using the G_EVAL flag described above will always set C<$@>: clearing
325it if there was no error, and setting it to describe the error if there
326was an error in the called code. This is what you want if your intention
327is to handle possible errors, but sometimes you just want to trap errors
328and stop them interfering with the rest of the program.
329
330This scenario will mostly be applicable to code that is meant to be called
331from within destructors, asynchronous callbacks, and signal handlers.
332In such situations, where the code being called has little relation to the
333surrounding dynamic context, the main program needs to be insulated from
334errors in the called code, even if they can't be handled intelligently.
335It may also be useful to do this with code for C<__DIE__> or C<__WARN__>
336hooks, and C<tie> functions.
c07a80fd 337
338The G_KEEPERR flag is meant to be used in conjunction with G_EVAL in
4929bf7b 339I<call_*> functions that are used to implement such code. This flag
c07a80fd 340has no effect when G_EVAL is not used.
341
7ce09284
Z
342When G_KEEPERR is used, any error in the called code will terminate the
343call as usual, and the error will not propagate beyond the call (as usual
344for G_EVAL), but it will not go into C<$@>. Instead the error will be
345converted into a warning, prefixed with the string "\t(in cleanup)".
346This can be disabled using C<no warnings 'misc'>. If there is no error,
347C<$@> will not be cleared.
c07a80fd 348
349The G_KEEPERR flag was introduced in Perl version 5.002.
350
351See I<Using G_KEEPERR> for an example of a situation that warrants the
352use of this flag.
353
54310121 354=head2 Determining the Context
d1b91892
AD
355
356As mentioned above, you can determine the context of the currently
54310121 357executing subroutine in Perl with I<wantarray>. The equivalent test
358can be made in C by using the C<GIMME_V> macro, which returns
90fdbbb7 359C<G_ARRAY> if you have been called in a list context, C<G_SCALAR> if
7a2e2cd6 360in a scalar context, or C<G_VOID> if in a void context (i.e. the
54310121 361return value will not be used). An older version of this macro is
362called C<GIMME>; in a void context it returns C<G_SCALAR> instead of
363C<G_VOID>. An example of using the C<GIMME_V> macro is shown in
364section I<Using GIMME_V>.
d1b91892 365
a0d0e21e
LW
366=head1 EXAMPLES
367
368Enough of the definition talk, let's have a few examples.
369
d1b91892
AD
370Perl provides many macros to assist in accessing the Perl stack.
371Wherever possible, these macros should always be used when interfacing
5f05dabc 372to Perl internals. We hope this should make the code less vulnerable
d1b91892 373to any changes made to Perl in the future.
a0d0e21e 374
d1b91892 375Another point worth noting is that in the first series of examples I
4929bf7b 376have made use of only the I<call_pv> function. This has been done
d1b91892 377to keep the code simpler and ease you into the topic. Wherever
4929bf7b
GS
378possible, if the choice is between using I<call_pv> and
379I<call_sv>, you should always try to use I<call_sv>. See
380I<Using call_sv> for details.
a0d0e21e 381
d1b91892 382=head2 No Parameters, Nothing returned
a0d0e21e 383
d1b91892
AD
384This first trivial example will call a Perl subroutine, I<PrintUID>, to
385print out the UID of the process.
a0d0e21e 386
84f709e7
JH
387 sub PrintUID
388 {
4358a253 389 print "UID is $<\n";
a0d0e21e
LW
390 }
391
d1b91892 392and here is a C function to call it
a0d0e21e 393
d1b91892 394 static void
a0d0e21e
LW
395 call_PrintUID()
396 {
4358a253 397 dSP;
a0d0e21e 398
4358a253
SS
399 PUSHMARK(SP);
400 call_pv("PrintUID", G_DISCARD|G_NOARGS);
a0d0e21e
LW
401 }
402
d1b91892 403Simple, eh.
a0d0e21e 404
d1b91892 405A few points to note about this example.
a0d0e21e
LW
406
407=over 5
408
d1b91892 409=item 1.
a0d0e21e 410
924508f0 411Ignore C<dSP> and C<PUSHMARK(SP)> for now. They will be discussed in
d1b91892 412the next example.
a0d0e21e
LW
413
414=item 2.
415
d1b91892
AD
416We aren't passing any parameters to I<PrintUID> so G_NOARGS can be
417specified.
a0d0e21e 418
d1b91892 419=item 3.
a0d0e21e
LW
420
421We aren't interested in anything returned from I<PrintUID>, so
5f05dabc 422G_DISCARD is specified. Even if I<PrintUID> was changed to
a0d0e21e 423return some value(s), having specified G_DISCARD will mean that they
4929bf7b 424will be wiped by the time control returns from I<call_pv>.
a0d0e21e 425
d1b91892 426=item 4.
a0d0e21e 427
4929bf7b 428As I<call_pv> is being used, the Perl subroutine is specified as a
d1b91892
AD
429C string. In this case the subroutine name has been 'hard-wired' into the
430code.
a0d0e21e
LW
431
432=item 5.
433
d1b91892 434Because we specified G_DISCARD, it is not necessary to check the value
4929bf7b 435returned from I<call_pv>. It will always be 0.
a0d0e21e
LW
436
437=back
438
d1b91892 439=head2 Passing Parameters
a0d0e21e 440
d1b91892 441Now let's make a slightly more complex example. This time we want to
19799a22
GS
442call a Perl subroutine, C<LeftString>, which will take 2 parameters--a
443string ($s) and an integer ($n). The subroutine will simply
444print the first $n characters of the string.
a0d0e21e 445
d1b91892 446So the Perl subroutine would look like this
a0d0e21e 447
84f709e7
JH
448 sub LeftString
449 {
4358a253
SS
450 my($s, $n) = @_;
451 print substr($s, 0, $n), "\n";
a0d0e21e
LW
452 }
453
454The C function required to call I<LeftString> would look like this.
455
456 static void
457 call_LeftString(a, b)
4358a253
SS
458 char * a;
459 int b;
a0d0e21e 460 {
4358a253 461 dSP;
a0d0e21e 462
4358a253
SS
463 ENTER;
464 SAVETMPS;
9b6570b4 465
4358a253 466 PUSHMARK(SP);
a0d0e21e
LW
467 XPUSHs(sv_2mortal(newSVpv(a, 0)));
468 XPUSHs(sv_2mortal(newSViv(b)));
4358a253 469 PUTBACK;
a0d0e21e 470
4929bf7b 471 call_pv("LeftString", G_DISCARD);
9b6570b4 472
4358a253
SS
473 FREETMPS;
474 LEAVE;
a0d0e21e
LW
475 }
476
a0d0e21e
LW
477Here are a few notes on the C function I<call_LeftString>.
478
479=over 5
480
d1b91892 481=item 1.
a0d0e21e 482
d1b91892
AD
483Parameters are passed to the Perl subroutine using the Perl stack.
484This is the purpose of the code beginning with the line C<dSP> and
1e62ac33 485ending with the line C<PUTBACK>. The C<dSP> declares a local copy
924508f0
GS
486of the stack pointer. This local copy should B<always> be accessed
487as C<SP>.
a0d0e21e 488
d1b91892 489=item 2.
a0d0e21e
LW
490
491If you are going to put something onto the Perl stack, you need to know
19799a22 492where to put it. This is the purpose of the macro C<dSP>--it declares
d1b91892 493and initializes a I<local> copy of the Perl stack pointer.
a0d0e21e
LW
494
495All the other macros which will be used in this example require you to
d1b91892 496have used this macro.
a0d0e21e 497
d1b91892
AD
498The exception to this rule is if you are calling a Perl subroutine
499directly from an XSUB function. In this case it is not necessary to
19799a22 500use the C<dSP> macro explicitly--it will be declared for you
d1b91892 501automatically.
a0d0e21e 502
d1b91892 503=item 3.
a0d0e21e
LW
504
505Any parameters to be pushed onto the stack should be bracketed by the
d1b91892 506C<PUSHMARK> and C<PUTBACK> macros. The purpose of these two macros, in
5f05dabc 507this context, is to count the number of parameters you are
508pushing automatically. Then whenever Perl is creating the C<@_> array for the
d1b91892
AD
509subroutine, it knows how big to make it.
510
511The C<PUSHMARK> macro tells Perl to make a mental note of the current
512stack pointer. Even if you aren't passing any parameters (like the
513example shown in the section I<No Parameters, Nothing returned>) you
514must still call the C<PUSHMARK> macro before you can call any of the
4929bf7b 515I<call_*> functions--Perl still needs to know that there are no
d1b91892
AD
516parameters.
517
518The C<PUTBACK> macro sets the global copy of the stack pointer to be
4929bf7b 519the same as our local copy. If we didn't do this I<call_pv>
19799a22 520wouldn't know where the two parameters we pushed were--remember that
d1b91892
AD
521up to now all the stack pointer manipulation we have done is with our
522local copy, I<not> the global copy.
523
524=item 4.
525
a0d0e21e 526Next, we come to XPUSHs. This is where the parameters actually get
d1b91892
AD
527pushed onto the stack. In this case we are pushing a string and an
528integer.
a0d0e21e 529
54310121 530See L<perlguts/"XSUBs and the Argument Stack"> for details
d1b91892 531on how the XPUSH macros work.
a0d0e21e 532
087fe227 533=item 5.
a0d0e21e 534
9b6570b4
AB
535Because we created temporary values (by means of sv_2mortal() calls)
536we will have to tidy up the Perl stack and dispose of mortal SVs.
537
538This is the purpose of
539
4358a253
SS
540 ENTER;
541 SAVETMPS;
9b6570b4
AB
542
543at the start of the function, and
544
4358a253
SS
545 FREETMPS;
546 LEAVE;
9b6570b4
AB
547
548at the end. The C<ENTER>/C<SAVETMPS> pair creates a boundary for any
549temporaries we create. This means that the temporaries we get rid of
550will be limited to those which were created after these calls.
551
552The C<FREETMPS>/C<LEAVE> pair will get rid of any values returned by
553the Perl subroutine (see next example), plus it will also dump the
554mortal SVs we have created. Having C<ENTER>/C<SAVETMPS> at the
555beginning of the code makes sure that no other mortals are destroyed.
556
557Think of these macros as working a bit like using C<{> and C<}> in Perl
558to limit the scope of local variables.
559
560See the section I<Using Perl to dispose of temporaries> for details of
561an alternative to using these macros.
562
087fe227 563=item 6.
9b6570b4 564
087fe227
JA
565Finally, I<LeftString> can now be called via the I<call_pv> function.
566The only flag specified this time is G_DISCARD. Because we are passing
5672 parameters to the Perl subroutine this time, we have not specified
568G_NOARGS.
a0d0e21e
LW
569
570=back
571
d1b91892 572=head2 Returning a Scalar
a0d0e21e 573
d1b91892
AD
574Now for an example of dealing with the items returned from a Perl
575subroutine.
a0d0e21e 576
5f05dabc 577Here is a Perl subroutine, I<Adder>, that takes 2 integer parameters
d1b91892 578and simply returns their sum.
a0d0e21e 579
84f709e7
JH
580 sub Adder
581 {
4358a253
SS
582 my($a, $b) = @_;
583 $a + $b;
a0d0e21e
LW
584 }
585
5f05dabc 586Because we are now concerned with the return value from I<Adder>, the C
d1b91892 587function required to call it is now a bit more complex.
a0d0e21e
LW
588
589 static void
590 call_Adder(a, b)
4358a253
SS
591 int a;
592 int b;
a0d0e21e 593 {
4358a253
SS
594 dSP;
595 int count;
a0d0e21e 596
4358a253 597 ENTER;
a0d0e21e
LW
598 SAVETMPS;
599
4358a253 600 PUSHMARK(SP);
a0d0e21e
LW
601 XPUSHs(sv_2mortal(newSViv(a)));
602 XPUSHs(sv_2mortal(newSViv(b)));
4358a253 603 PUTBACK;
a0d0e21e 604
4929bf7b 605 count = call_pv("Adder", G_SCALAR);
a0d0e21e 606
4358a253 607 SPAGAIN;
a0d0e21e 608
d1b91892 609 if (count != 1)
4358a253 610 croak("Big trouble\n");
a0d0e21e 611
4358a253 612 printf ("The sum of %d and %d is %d\n", a, b, POPi);
a0d0e21e 613
4358a253
SS
614 PUTBACK;
615 FREETMPS;
616 LEAVE;
a0d0e21e
LW
617 }
618
a0d0e21e
LW
619Points to note this time are
620
621=over 5
622
54310121 623=item 1.
a0d0e21e 624
d1b91892
AD
625The only flag specified this time was G_SCALAR. That means the C<@_>
626array will be created and that the value returned by I<Adder> will
4929bf7b 627still exist after the call to I<call_pv>.
a0d0e21e 628
a0d0e21e
LW
629=item 2.
630
a0d0e21e
LW
631The purpose of the macro C<SPAGAIN> is to refresh the local copy of the
632stack pointer. This is necessary because it is possible that the memory
68dc0745 633allocated to the Perl stack has been reallocated whilst in the
4929bf7b 634I<call_pv> call.
a0d0e21e 635
d1b91892 636If you are making use of the Perl stack pointer in your code you must
54310121 637always refresh the local copy using SPAGAIN whenever you make use
4929bf7b 638of the I<call_*> functions or any other Perl internal function.
a0d0e21e 639
9b6570b4 640=item 3.
a0d0e21e 641
d1b91892 642Although only a single value was expected to be returned from I<Adder>,
4929bf7b 643it is still good practice to check the return code from I<call_pv>
d1b91892 644anyway.
a0d0e21e 645
d1b91892
AD
646Expecting a single value is not quite the same as knowing that there
647will be one. If someone modified I<Adder> to return a list and we
648didn't check for that possibility and take appropriate action the Perl
649stack would end up in an inconsistent state. That is something you
5f05dabc 650I<really> don't want to happen ever.
a0d0e21e 651
9b6570b4 652=item 4.
a0d0e21e 653
d1b91892
AD
654The C<POPi> macro is used here to pop the return value from the stack.
655In this case we wanted an integer, so C<POPi> was used.
a0d0e21e
LW
656
657
d1b91892
AD
658Here is the complete list of POP macros available, along with the types
659they return.
a0d0e21e 660
d1b91892
AD
661 POPs SV
662 POPp pointer
663 POPn double
664 POPi integer
665 POPl long
a0d0e21e 666
9b6570b4 667=item 5.
a0d0e21e 668
d1b91892
AD
669The final C<PUTBACK> is used to leave the Perl stack in a consistent
670state before exiting the function. This is necessary because when we
671popped the return value from the stack with C<POPi> it updated only our
672local copy of the stack pointer. Remember, C<PUTBACK> sets the global
673stack pointer to be the same as our local copy.
a0d0e21e
LW
674
675=back
676
677
d1b91892 678=head2 Returning a list of values
a0d0e21e 679
d1b91892
AD
680Now, let's extend the previous example to return both the sum of the
681parameters and the difference.
a0d0e21e 682
d1b91892 683Here is the Perl subroutine
a0d0e21e 684
84f709e7
JH
685 sub AddSubtract
686 {
4358a253
SS
687 my($a, $b) = @_;
688 ($a+$b, $a-$b);
a0d0e21e
LW
689 }
690
a0d0e21e
LW
691and this is the C function
692
693 static void
694 call_AddSubtract(a, b)
4358a253
SS
695 int a;
696 int b;
a0d0e21e 697 {
4358a253
SS
698 dSP;
699 int count;
a0d0e21e 700
4358a253 701 ENTER;
a0d0e21e
LW
702 SAVETMPS;
703
4358a253 704 PUSHMARK(SP);
a0d0e21e
LW
705 XPUSHs(sv_2mortal(newSViv(a)));
706 XPUSHs(sv_2mortal(newSViv(b)));
4358a253 707 PUTBACK;
a0d0e21e 708
4929bf7b 709 count = call_pv("AddSubtract", G_ARRAY);
a0d0e21e 710
4358a253 711 SPAGAIN;
a0d0e21e 712
d1b91892 713 if (count != 2)
4358a253 714 croak("Big trouble\n");
a0d0e21e 715
4358a253
SS
716 printf ("%d - %d = %d\n", a, b, POPi);
717 printf ("%d + %d = %d\n", a, b, POPi);
a0d0e21e 718
4358a253
SS
719 PUTBACK;
720 FREETMPS;
721 LEAVE;
a0d0e21e
LW
722 }
723
d1b91892
AD
724If I<call_AddSubtract> is called like this
725
4358a253 726 call_AddSubtract(7, 4);
d1b91892
AD
727
728then here is the output
729
730 7 - 4 = 3
731 7 + 4 = 11
a0d0e21e
LW
732
733Notes
734
735=over 5
736
737=item 1.
738
90fdbbb7 739We wanted list context, so G_ARRAY was used.
a0d0e21e
LW
740
741=item 2.
742
d1b91892
AD
743Not surprisingly C<POPi> is used twice this time because we were
744retrieving 2 values from the stack. The important thing to note is that
745when using the C<POP*> macros they come off the stack in I<reverse>
746order.
a0d0e21e
LW
747
748=back
749
d1b91892
AD
750=head2 Returning a list in a scalar context
751
752Say the Perl subroutine in the previous section was called in a scalar
753context, like this
754
755 static void
756 call_AddSubScalar(a, b)
4358a253
SS
757 int a;
758 int b;
d1b91892 759 {
4358a253
SS
760 dSP;
761 int count;
762 int i;
d1b91892 763
4358a253 764 ENTER;
d1b91892
AD
765 SAVETMPS;
766
4358a253 767 PUSHMARK(SP);
d1b91892
AD
768 XPUSHs(sv_2mortal(newSViv(a)));
769 XPUSHs(sv_2mortal(newSViv(b)));
4358a253 770 PUTBACK;
d1b91892 771
4929bf7b 772 count = call_pv("AddSubtract", G_SCALAR);
d1b91892 773
4358a253 774 SPAGAIN;
d1b91892 775
4358a253 776 printf ("Items Returned = %d\n", count);
d1b91892 777
4358a253
SS
778 for (i = 1; i <= count; ++i)
779 printf ("Value %d = %d\n", i, POPi);
d1b91892 780
4358a253
SS
781 PUTBACK;
782 FREETMPS;
783 LEAVE;
d1b91892
AD
784 }
785
786The other modification made is that I<call_AddSubScalar> will print the
787number of items returned from the Perl subroutine and their value (for
788simplicity it assumes that they are integer). So if
789I<call_AddSubScalar> is called
790
4358a253 791 call_AddSubScalar(7, 4);
d1b91892
AD
792
793then the output will be
794
795 Items Returned = 1
796 Value 1 = 3
797
798In this case the main point to note is that only the last item in the
54310121 799list is returned from the subroutine, I<AddSubtract> actually made it back to
d1b91892
AD
800I<call_AddSubScalar>.
801
802
803=head2 Returning Data from Perl via the parameter list
a0d0e21e
LW
804
805It is also possible to return values directly via the parameter list -
806whether it is actually desirable to do it is another matter entirely.
807
d1b91892
AD
808The Perl subroutine, I<Inc>, below takes 2 parameters and increments
809each directly.
a0d0e21e 810
84f709e7
JH
811 sub Inc
812 {
4358a253
SS
813 ++ $_[0];
814 ++ $_[1];
a0d0e21e
LW
815 }
816
817and here is a C function to call it.
818
819 static void
820 call_Inc(a, b)
4358a253
SS
821 int a;
822 int b;
a0d0e21e 823 {
4358a253
SS
824 dSP;
825 int count;
826 SV * sva;
827 SV * svb;
a0d0e21e 828
4358a253 829 ENTER;
a0d0e21e
LW
830 SAVETMPS;
831
4358a253
SS
832 sva = sv_2mortal(newSViv(a));
833 svb = sv_2mortal(newSViv(b));
a0d0e21e 834
4358a253 835 PUSHMARK(SP);
a0d0e21e
LW
836 XPUSHs(sva);
837 XPUSHs(svb);
4358a253 838 PUTBACK;
a0d0e21e 839
4929bf7b 840 count = call_pv("Inc", G_DISCARD);
a0d0e21e
LW
841
842 if (count != 0)
d1b91892 843 croak ("call_Inc: expected 0 values from 'Inc', got %d\n",
4358a253 844 count);
a0d0e21e 845
4358a253
SS
846 printf ("%d + 1 = %d\n", a, SvIV(sva));
847 printf ("%d + 1 = %d\n", b, SvIV(svb));
a0d0e21e 848
4358a253
SS
849 FREETMPS;
850 LEAVE;
a0d0e21e
LW
851 }
852
d1b91892 853To be able to access the two parameters that were pushed onto the stack
4929bf7b 854after they return from I<call_pv> it is necessary to make a note
19799a22 855of their addresses--thus the two variables C<sva> and C<svb>.
a0d0e21e 856
d1b91892
AD
857The reason this is necessary is that the area of the Perl stack which
858held them will very likely have been overwritten by something else by
4929bf7b 859the time control returns from I<call_pv>.
a0d0e21e
LW
860
861
862
863
d1b91892 864=head2 Using G_EVAL
a0d0e21e 865
d1b91892
AD
866Now an example using G_EVAL. Below is a Perl subroutine which computes
867the difference of its 2 parameters. If this would result in a negative
868result, the subroutine calls I<die>.
a0d0e21e 869
84f709e7
JH
870 sub Subtract
871 {
4358a253 872 my ($a, $b) = @_;
a0d0e21e 873
4358a253 874 die "death can be fatal\n" if $a < $b;
a0d0e21e 875
4358a253 876 $a - $b;
a0d0e21e
LW
877 }
878
879and some C to call it
880
881 static void
882 call_Subtract(a, b)
4358a253
SS
883 int a;
884 int b;
a0d0e21e 885 {
4358a253
SS
886 dSP;
887 int count;
a0d0e21e 888
4358a253 889 ENTER;
a0d0e21e
LW
890 SAVETMPS;
891
4358a253 892 PUSHMARK(SP);
a0d0e21e
LW
893 XPUSHs(sv_2mortal(newSViv(a)));
894 XPUSHs(sv_2mortal(newSViv(b)));
4358a253 895 PUTBACK;
a0d0e21e 896
4929bf7b 897 count = call_pv("Subtract", G_EVAL|G_SCALAR);
a0d0e21e 898
4358a253 899 SPAGAIN;
d1b91892
AD
900
901 /* Check the eval first */
9cde0e7f 902 if (SvTRUE(ERRSV))
d1b91892 903 {
1c5b513e 904 printf ("Uh oh - %s\n", SvPV_nolen(ERRSV));
4358a253 905 POPs;
d1b91892
AD
906 }
907 else
908 {
909 if (count != 1)
910 croak("call_Subtract: wanted 1 value from 'Subtract', got %d\n",
4358a253 911 count);
a0d0e21e 912
4358a253 913 printf ("%d - %d = %d\n", a, b, POPi);
d1b91892 914 }
a0d0e21e 915
4358a253
SS
916 PUTBACK;
917 FREETMPS;
918 LEAVE;
a0d0e21e
LW
919 }
920
921If I<call_Subtract> is called thus
922
d1b91892 923 call_Subtract(4, 5)
a0d0e21e
LW
924
925the following will be printed
926
d1b91892 927 Uh oh - death can be fatal
a0d0e21e
LW
928
929Notes
930
931=over 5
932
933=item 1.
934
d1b91892
AD
935We want to be able to catch the I<die> so we have used the G_EVAL
936flag. Not specifying this flag would mean that the program would
937terminate immediately at the I<die> statement in the subroutine
938I<Subtract>.
a0d0e21e
LW
939
940=item 2.
941
54310121 942The code
a0d0e21e 943
9cde0e7f 944 if (SvTRUE(ERRSV))
d1b91892 945 {
1c5b513e 946 printf ("Uh oh - %s\n", SvPV_nolen(ERRSV));
4358a253 947 POPs;
d1b91892 948 }
a0d0e21e 949
d1b91892 950is the direct equivalent of this bit of Perl
a0d0e21e 951
4358a253 952 print "Uh oh - $@\n" if $@;
a0d0e21e 953
9cde0e7f
GS
954C<PL_errgv> is a perl global of type C<GV *> that points to the
955symbol table entry containing the error. C<ERRSV> therefore
c07a80fd 956refers to the C equivalent of C<$@>.
957
d1b91892 958=item 3.
a0d0e21e 959
d1b91892 960Note that the stack is popped using C<POPs> in the block where
9cde0e7f 961C<SvTRUE(ERRSV)> is true. This is necessary because whenever a
4929bf7b 962I<call_*> function invoked with G_EVAL|G_SCALAR returns an error,
5f05dabc 963the top of the stack holds the value I<undef>. Because we want the
d1b91892
AD
964program to continue after detecting this error, it is essential that
965the stack is tidied up by removing the I<undef>.
a0d0e21e
LW
966
967=back
968
969
c07a80fd 970=head2 Using G_KEEPERR
971
972Consider this rather facetious example, where we have used an XS
973version of the call_Subtract example above inside a destructor:
974
975 package Foo;
84f709e7 976 sub new { bless {}, $_[0] }
54310121 977 sub Subtract {
84f709e7 978 my($a,$b) = @_;
4358a253 979 die "death can be fatal" if $a < $b;
84f709e7 980 $a - $b;
c07a80fd 981 }
84f709e7
JH
982 sub DESTROY { call_Subtract(5, 4); }
983 sub foo { die "foo dies"; }
c07a80fd 984
985 package main;
7ce09284
Z
986 {
987 my $foo = Foo->new;
988 eval { $foo->foo };
989 }
c07a80fd 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
7ce09284 994was cleaning up temporaries when exiting the outer braced block, and because
4929bf7b 995call_Subtract is implemented with I<call_pv> using the G_EVAL
c07a80fd 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
4929bf7b 999Appending the G_KEEPERR flag, so that the I<call_pv> call in
c07a80fd 1000call_Subtract reads:
1001
4929bf7b 1002 count = call_pv("Subtract", G_EVAL|G_SCALAR|G_KEEPERR);
c07a80fd 1003
1004will preserve the error and restore reliable error handling.
1005
4929bf7b 1006=head2 Using call_sv
a0d0e21e 1007
d1b91892
AD
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.
a0d0e21e
LW
1012
1013Consider the Perl code below
1014
84f709e7
JH
1015 sub fred
1016 {
4358a253 1017 print "Hello there\n";
d1b91892
AD
1018 }
1019
4358a253 1020 CallSubPV("fred");
d1b91892
AD
1021
1022Here is a snippet of XSUB which defines I<CallSubPV>.
1023
1024 void
1025 CallSubPV(name)
1026 char * name
1027 CODE:
4358a253
SS
1028 PUSHMARK(SP);
1029 call_pv(name, G_DISCARD|G_NOARGS);
a0d0e21e 1030
54310121 1031That is fine as far as it goes. The thing is, the Perl subroutine
5f05dabc 1032can be specified as only a string. For Perl 4 this was adequate,
d1b91892 1033but Perl 5 allows references to subroutines and anonymous subroutines.
4929bf7b 1034This is where I<call_sv> is useful.
d1b91892
AD
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
4929bf7b 1038I<call_sv> instead of I<call_pv>.
d1b91892
AD
1039
1040 void
1041 CallSubSV(name)
1042 SV * name
1043 CODE:
4358a253
SS
1044 PUSHMARK(SP);
1045 call_sv(name, G_DISCARD|G_NOARGS);
a0d0e21e 1046
5f05dabc 1047Because we are using an SV to call I<fred> the following can all be used
a0d0e21e 1048
4358a253
SS
1049 CallSubSV("fred");
1050 CallSubSV(\&fred);
1051 $ref = \&fred;
1052 CallSubSV($ref);
1053 CallSubSV( sub { print "Hello there\n" } );
a0d0e21e 1054
4929bf7b 1055As you can see, I<call_sv> gives you much greater flexibility in
d1b91892
AD
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
5f05dabc 1060be used later in the program, it not enough just to store a copy of the
d1b91892
AD
1061pointer to the SV. Say the code above had been like this
1062
4358a253 1063 static SV * rememberSub;
d1b91892
AD
1064
1065 void
1066 SaveSub1(name)
1067 SV * name
1068 CODE:
4358a253 1069 rememberSub = name;
d1b91892
AD
1070
1071 void
1072 CallSavedSub1()
1073 CODE:
4358a253
SS
1074 PUSHMARK(SP);
1075 call_sv(rememberSub, G_DISCARD|G_NOARGS);
a0d0e21e 1076
d1b91892
AD
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
a0d0e21e 1081
4358a253
SS
1082 SaveSub1(\&fred);
1083 CallSavedSub1();
a0d0e21e 1084
4358a253
SS
1085 SaveSub1( sub { print "Hello there\n" } );
1086 CallSavedSub1();
a0d0e21e 1087
d1b91892 1088By the time each of the C<SaveSub1> statements above have been executed,
54310121 1089the SV*s which corresponded to the parameters will no longer exist.
d1b91892 1090Expect an error message from Perl of the form
a0d0e21e 1091
d1b91892 1092 Can't use an undefined value as a subroutine reference at ...
a0d0e21e 1093
d1b91892 1094for each of the C<CallSavedSub1> lines.
a0d0e21e 1095
54310121 1096Similarly, with this code
a0d0e21e 1097
4358a253
SS
1098 $ref = \&fred;
1099 SaveSub1($ref);
1100 $ref = 47;
1101 CallSavedSub1();
a0d0e21e 1102
54310121 1103you can expect one of these messages (which you actually get is dependent on
1104the version of Perl you are using)
a0d0e21e 1105
d1b91892
AD
1106 Not a CODE reference at ...
1107 Undefined subroutine &main::47 called ...
a0d0e21e 1108
19799a22 1109The variable $ref may have referred to the subroutine C<fred>
d1b91892 1110whenever the call to C<SaveSub1> was made but by the time
5f05dabc 1111C<CallSavedSub1> gets called it now holds the number C<47>. Because we
d1b91892 1112saved only a pointer to the original SV in C<SaveSub1>, any changes to
19799a22 1113$ref will be tracked by the pointer C<rememberSub>. This means that
d1b91892
AD
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.
a0d0e21e 1118
d1b91892 1119A similar but more subtle problem is illustrated with this code
a0d0e21e 1120
4358a253
SS
1121 $ref = \&fred;
1122 SaveSub1($ref);
1123 $ref = \&joe;
1124 CallSavedSub1();
a0d0e21e 1125
d1b91892 1126This time whenever C<CallSavedSub1> get called it will execute the Perl
54310121 1127subroutine C<joe> (assuming it exists) rather than C<fred> as was
d1b91892 1128originally requested in the call to C<SaveSub1>.
a0d0e21e 1129
d1b91892
AD
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
a0d0e21e 1132
4358a253 1133 static SV * keepSub = (SV*)NULL;
d1b91892
AD
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 */
4358a253 1142 keepSub = newSVsv(name);
d1b91892
AD
1143 else
1144 /* Been here before, so overwrite */
4358a253 1145 SvSetSV(keepSub, name);
d1b91892
AD
1146
1147 void
1148 CallSavedSub2()
1149 CODE:
4358a253
SS
1150 PUSHMARK(SP);
1151 call_sv(keepSub, G_DISCARD|G_NOARGS);
d1b91892 1152
5f05dabc 1153To avoid creating a new SV every time C<SaveSub2> is called,
d1b91892
AD
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
4929bf7b 1161=head2 Using call_argv
d1b91892
AD
1162
1163Here is a Perl subroutine which prints whatever parameters are passed
1164to it.
1165
84f709e7
JH
1166 sub PrintList
1167 {
4358a253 1168 my(@list) = @_;
d1b91892 1169
84f709e7 1170 foreach (@list) { print "$_\n" }
d1b91892
AD
1171 }
1172
4929bf7b 1173and here is an example of I<call_argv> which will call
d1b91892
AD
1174I<PrintList>.
1175
4358a253 1176 static char * words[] = {"alpha", "beta", "gamma", "delta", NULL};
d1b91892
AD
1177
1178 static void
1179 call_PrintList()
1180 {
4358a253 1181 dSP;
d1b91892 1182
4358a253 1183 call_argv("PrintList", G_DISCARD, words);
d1b91892
AD
1184 }
1185
1186Note that it is not necessary to call C<PUSHMARK> in this instance.
4929bf7b 1187This is because I<call_argv> will do it for you.
d1b91892 1188
4929bf7b 1189=head2 Using call_method
a0d0e21e
LW
1190
1191Consider the following Perl code
1192
d1b91892 1193 {
4358a253 1194 package Mine;
84f709e7
JH
1195
1196 sub new
1197 {
4358a253 1198 my($type) = shift;
84f709e7
JH
1199 bless [@_]
1200 }
1201
1202 sub Display
1203 {
4358a253
SS
1204 my ($self, $index) = @_;
1205 print "$index: $$self[$index]\n";
84f709e7
JH
1206 }
1207
1208 sub PrintID
1209 {
4358a253
SS
1210 my($class) = @_;
1211 print "This is Class $class version 1.0\n";
84f709e7 1212 }
d1b91892
AD
1213 }
1214
5f05dabc 1215It implements just a very simple class to manage an array. Apart from
d1b91892 1216the constructor, C<new>, it declares methods, one static and one
5f05dabc 1217virtual. The static method, C<PrintID>, prints out simply the class
d1b91892
AD
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
797f796a 1221 $a = Mine->new('red', 'green', 'blue');
4358a253 1222 $a->Display(1);
797f796a 1223 Mine->PrintID;
a0d0e21e 1224
d1b91892 1225will print
a0d0e21e 1226
d1b91892 1227 1: green
54310121 1228 This is Class Mine version 1.0
a0d0e21e 1229
d1b91892
AD
1230Calling a Perl method from C is fairly straightforward. The following
1231things are required
a0d0e21e 1232
d1b91892
AD
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:
924508f0 1259 PUSHMARK(SP);
d1b91892 1260 XPUSHs(ref);
4358a253 1261 XPUSHs(sv_2mortal(newSViv(index)));
d1b91892
AD
1262 PUTBACK;
1263
4358a253 1264 call_method(method, G_DISCARD);
d1b91892
AD
1265
1266 void
1267 call_PrintID(class, method)
1268 char * class
1269 char * method
1270 CODE:
924508f0 1271 PUSHMARK(SP);
4358a253 1272 XPUSHs(sv_2mortal(newSVpv(class, 0)));
d1b91892
AD
1273 PUTBACK;
1274
4358a253 1275 call_method(method, G_DISCARD);
d1b91892
AD
1276
1277
1278So the methods C<PrintID> and C<Display> can be invoked like this
1279
797f796a 1280 $a = Mine->new('red', 'green', 'blue');
4358a253
SS
1281 call_Method($a, 'Display', 1);
1282 call_PrintID('Mine', 'PrintID');
d1b91892
AD
1283
1284The only thing to note is that in both the static and virtual methods,
19799a22 1285the method name is not passed via the stack--it is used as the first
4929bf7b 1286parameter to I<call_method>.
d1b91892 1287
54310121 1288=head2 Using GIMME_V
d1b91892 1289
54310121 1290Here is a trivial XSUB which prints the context in which it is
d1b91892
AD
1291currently executing.
1292
1293 void
1294 PrintContext()
1295 CODE:
54310121 1296 I32 gimme = GIMME_V;
1297 if (gimme == G_VOID)
4358a253 1298 printf ("Context is Void\n");
54310121 1299 else if (gimme == G_SCALAR)
4358a253 1300 printf ("Context is Scalar\n");
d1b91892 1301 else
4358a253 1302 printf ("Context is Array\n");
d1b91892
AD
1303
1304and here is some Perl to test it
1305
4358a253
SS
1306 PrintContext;
1307 $a = PrintContext;
1308 @a = PrintContext;
d1b91892
AD
1309
1310The output from that will be
1311
54310121 1312 Context is Void
d1b91892
AD
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
4929bf7b 1319(i.e., parameters passed on the stack to the I<call_*> function or
d1b91892
AD
1320values returned via the stack) have been freed by one of these methods
1321
1322=over 5
1323
1324=item *
1325
4929bf7b 1326specifying the G_DISCARD flag with I<call_*>.
d1b91892
AD
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
4358a253
SS
1339 ENTER;
1340 SAVETMPS;
d1b91892 1341 ...
4358a253
SS
1342 FREETMPS;
1343 LEAVE;
d1b91892
AD
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 ...
4929bf7b 1374 external library --> call_* --> perl
d1b91892 1375 |
4929bf7b 1376 perl <-- XSUB <-- external library <-- call_* <----+
d1b91892 1377
4929bf7b 1378After processing of the error using I<call_*> is completed,
d1b91892
AD
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 ...
4929bf7b 1391 event handler --> call_* --> perl
d1b91892 1392 |
4929bf7b 1393 event handler <-- call_* <----+
d1b91892 1394 ...
4929bf7b 1395 event handler --> call_* --> perl
d1b91892 1396 |
4929bf7b 1397 event handler <-- call_* <----+
d1b91892 1398 ...
4929bf7b 1399 event handler --> call_* --> perl
d1b91892 1400 |
4929bf7b 1401 event handler <-- call_* <----+
d1b91892
AD
1402
1403In this case the flow of control can consist of only the repeated
1404sequence
1405
4929bf7b 1406 event handler --> call_* --> perl
d1b91892 1407
54310121 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.
d1b91892
AD
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
5f05dabc 1414to dispose of your temporaries, control must drop back to the
d1b91892
AD
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
19799a22 1419eventually consume all the available memory in your system--kapow!
d1b91892 1420
19799a22 1421So here is the bottom line--if you are sure that control will revert
d1b91892 1422back to the enclosing Perl scope fairly quickly after the end of your
5f05dabc 1423callback, then it isn't absolutely necessary to dispose explicitly of
d1b91892
AD
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
4358a253 1442 register_fatal(cb1);
d1b91892
AD
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 {
4358a253
SS
1450 printf ("Fatal Error\n");
1451 exit(1);
d1b91892
AD
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 {
4358a253 1461 dSP;
d1b91892 1462
4358a253 1463 PUSHMARK(SP);
d1b91892
AD
1464
1465 /* Call the Perl sub to process the callback */
4358a253 1466 call_sv(callback, G_DISCARD);
d1b91892
AD
1467 }
1468
1469
1470 void
1471 register_fatal(fn)
1472 SV * fn
1473 CODE:
1474 /* Remember the Perl sub */
1475 if (callback == (SV*)NULL)
4358a253 1476 callback = newSVsv(fn);
d1b91892 1477 else
4358a253 1478 SvSetSV(callback, fn);
d1b91892
AD
1479
1480 /* register the callback with the external library */
4358a253 1481 register_fatal(cb1);
d1b91892
AD
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
4358a253 1487 register_fatal(\&pcb1);
d1b91892 1488
84f709e7
JH
1489 sub pcb1
1490 {
4358a253 1491 die "I'm dying...\n";
d1b91892
AD
1492 }
1493
1494The mapping between the C callback and the Perl equivalent is stored in
1495the global variable C<callback>.
1496
5f05dabc 1497This will be adequate if you ever need to have only one callback
d1b91892
AD
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
19799a22 1513function C<ProcessRead> with a file handle C<fh>--this assumes that it
d1b91892
AD
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)
4358a253
SS
1523 int fh;
1524 char * buffer;
d1b91892 1525 {
54310121 1526 ...
d1b91892
AD
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
4358a253 1534 static HV * Mapping = (HV*)NULL;
a0d0e21e 1535
d1b91892
AD
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)
4358a253 1543 Mapping = newHV();
d1b91892
AD
1544
1545 /* Save the fh -> callback mapping */
4358a253 1546 hv_store(Mapping, (char*)&fh, sizeof(fh), newSVsv(callback), 0);
d1b91892
AD
1547
1548 /* Register with the C Library */
4358a253 1549 asynch_read(fh, asynch_read_if);
d1b91892
AD
1550
1551and C<asynch_read_if> could look like this
1552
1553 static void
1554 asynch_read_if(fh, buffer)
4358a253
SS
1555 int fh;
1556 char * buffer;
d1b91892 1557 {
4358a253
SS
1558 dSP;
1559 SV ** sv;
d1b91892
AD
1560
1561 /* Get the callback associated with fh */
4358a253 1562 sv = hv_fetch(Mapping, (char*)&fh , sizeof(fh), FALSE);
d1b91892 1563 if (sv == (SV**)NULL)
4358a253 1564 croak("Internal error...\n");
d1b91892 1565
4358a253
SS
1566 PUSHMARK(SP);
1567 XPUSHs(sv_2mortal(newSViv(fh)));
1568 XPUSHs(sv_2mortal(newSVpv(buffer, 0)));
1569 PUTBACK;
d1b91892
AD
1570
1571 /* Call the Perl sub */
4358a253 1572 call_sv(*sv, G_DISCARD);
d1b91892
AD
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 */
4358a253 1583 (void) hv_delete(Mapping, (char*)&fh, sizeof(fh), G_DISCARD);
a0d0e21e 1584
d1b91892 1585 /* Now call the real asynch_close */
4358a253 1586 asynch_close(fh);
a0d0e21e 1587
d1b91892
AD
1588So the Perl interface would look like this
1589
84f709e7
JH
1590 sub callback1
1591 {
4358a253 1592 my($handle, $buffer) = @_;
d1b91892 1593 }
a0d0e21e 1594
d1b91892 1595 # Register the Perl callback
4358a253 1596 asynch_read($fh, \&callback1);
a0d0e21e 1597
4358a253 1598 asynch_close($fh);
d1b91892
AD
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)
4358a253 1611 char * buffer;
d1b91892
AD
1612 {
1613 ...
1614 }
a0d0e21e 1615
d1b91892
AD
1616Without the file handle there is no straightforward way to map from the
1617C callback to the Perl subroutine.
a0d0e21e 1618
54310121 1619In this case a possible way around this problem is to predefine a
d1b91892
AD
1620series of C functions to act as the interface to Perl, thus
1621
1622 #define MAX_CB 3
1623 #define NULL_HANDLE -1
4358a253 1624 typedef void (*FnMap)();
d1b91892
AD
1625
1626 struct MapStruct {
4358a253
SS
1627 FnMap Function;
1628 SV * PerlSub;
1629 int Handle;
1630 };
d1b91892 1631
4358a253
SS
1632 static void fn1();
1633 static void fn2();
1634 static void fn3();
d1b91892
AD
1635
1636 static struct MapStruct Map [MAX_CB] =
1637 {
1638 { fn1, NULL, NULL_HANDLE },
1639 { fn2, NULL, NULL_HANDLE },
1640 { fn3, NULL, NULL_HANDLE }
4358a253 1641 };
d1b91892
AD
1642
1643 static void
1644 Pcb(index, buffer)
4358a253
SS
1645 int index;
1646 char * buffer;
d1b91892 1647 {
4358a253 1648 dSP;
d1b91892 1649
4358a253
SS
1650 PUSHMARK(SP);
1651 XPUSHs(sv_2mortal(newSVpv(buffer, 0)));
1652 PUTBACK;
d1b91892
AD
1653
1654 /* Call the Perl sub */
4358a253 1655 call_sv(Map[index].PerlSub, G_DISCARD);
d1b91892
AD
1656 }
1657
1658 static void
1659 fn1(buffer)
4358a253 1660 char * buffer;
d1b91892 1661 {
4358a253 1662 Pcb(0, buffer);
d1b91892
AD
1663 }
1664
1665 static void
1666 fn2(buffer)
4358a253 1667 char * buffer;
d1b91892 1668 {
4358a253 1669 Pcb(1, buffer);
d1b91892
AD
1670 }
1671
1672 static void
1673 fn3(buffer)
4358a253 1674 char * buffer;
d1b91892 1675 {
4358a253 1676 Pcb(2, buffer);
d1b91892
AD
1677 }
1678
1679 void
1680 array_asynch_read(fh, callback)
1681 int fh
1682 SV * callback
1683 CODE:
4358a253
SS
1684 int index;
1685 int null_index = MAX_CB;
d1b91892
AD
1686
1687 /* Find the same handle or an empty entry */
4358a253 1688 for (index = 0; index < MAX_CB; ++index)
d1b91892
AD
1689 {
1690 if (Map[index].Handle == fh)
4358a253 1691 break;
d1b91892
AD
1692
1693 if (Map[index].Handle == NULL_HANDLE)
4358a253 1694 null_index = index;
d1b91892
AD
1695 }
1696
1697 if (index == MAX_CB && null_index == MAX_CB)
4358a253 1698 croak ("Too many callback functions registered\n");
d1b91892
AD
1699
1700 if (index == MAX_CB)
4358a253 1701 index = null_index;
d1b91892
AD
1702
1703 /* Save the file handle */
4358a253 1704 Map[index].Handle = fh;
d1b91892
AD
1705
1706 /* Remember the Perl sub */
1707 if (Map[index].PerlSub == (SV*)NULL)
4358a253 1708 Map[index].PerlSub = newSVsv(callback);
d1b91892 1709 else
4358a253 1710 SvSetSV(Map[index].PerlSub, callback);
d1b91892 1711
4358a253 1712 asynch_read(fh, Map[index].Function);
d1b91892
AD
1713
1714 void
1715 array_asynch_close(fh)
1716 int fh
1717 CODE:
4358a253 1718 int index;
d1b91892
AD
1719
1720 /* Find the file handle */
4358a253 1721 for (index = 0; index < MAX_CB; ++ index)
d1b91892 1722 if (Map[index].Handle == fh)
4358a253 1723 break;
d1b91892
AD
1724
1725 if (index == MAX_CB)
4358a253 1726 croak ("could not close fh %d\n", fh);
d1b91892 1727
4358a253
SS
1728 Map[index].Handle = NULL_HANDLE;
1729 SvREFCNT_dec(Map[index].PerlSub);
1730 Map[index].PerlSub = (SV*)NULL;
d1b91892 1731
4358a253 1732 asynch_close(fh);
d1b91892 1733
5f05dabc 1734In this case the functions C<fn1>, C<fn2>, and C<fn3> are used to
d1b91892 1735remember the Perl subroutine to be called. Each of the functions holds
4a6725af 1736a separate hard-wired index which is used in the function C<Pcb> to
d1b91892
AD
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
4a6725af 1744Secondly, there is a hard-wired limit (in this case 3) to the number of
d1b91892
AD
1745callbacks that can exist simultaneously. The only way to increase the
1746limit is by modifying the code to add more functions and then
54310121 1747recompiling. None the less, as long as the number of functions is
d1b91892
AD
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
a0d0e21e 1772
a0d0e21e
LW
1773
1774=head2 Alternate Stack Manipulation
1775
a0d0e21e 1776
d1b91892
AD
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
8e07c86e 1779macros and read the stack using the C<ST> macro (See L<perlxs> for a
d1b91892
AD
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)
4358a253
SS
1794 int a;
1795 int b;
d1b91892 1796 {
4358a253
SS
1797 dSP;
1798 I32 ax;
1799 int count;
d1b91892 1800
4358a253 1801 ENTER;
d1b91892
AD
1802 SAVETMPS;
1803
4358a253 1804 PUSHMARK(SP);
d1b91892
AD
1805 XPUSHs(sv_2mortal(newSViv(a)));
1806 XPUSHs(sv_2mortal(newSViv(b)));
4358a253 1807 PUTBACK;
d1b91892 1808
4929bf7b 1809 count = call_pv("AddSubtract", G_ARRAY);
d1b91892 1810
4358a253
SS
1811 SPAGAIN;
1812 SP -= count;
1813 ax = (SP - PL_stack_base) + 1;
d1b91892
AD
1814
1815 if (count != 2)
4358a253 1816 croak("Big trouble\n");
a0d0e21e 1817
4358a253
SS
1818 printf ("%d + %d = %d\n", a, b, SvIV(ST(0)));
1819 printf ("%d - %d = %d\n", a, b, SvIV(ST(1)));
d1b91892 1820
4358a253
SS
1821 PUTBACK;
1822 FREETMPS;
1823 LEAVE;
d1b91892
AD
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
4358a253
SS
1841 SPAGAIN;
1842 SP -= count;
1843 ax = (SP - PL_stack_base) + 1;
d1b91892
AD
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
54310121 1851first value returned by the Perl subroutine and C<ST(count-1)>
d1b91892
AD
1852refers to the last.
1853
1854=back
a0d0e21e 1855
8f183262
DM
1856=head2 Creating and calling an anonymous subroutine in C
1857
4929bf7b 1858As we've already shown, C<call_sv> can be used to invoke an
c2611fb3
GS
1859anonymous subroutine. However, our example showed a Perl script
1860invoking an XSUB to perform this operation. Let's see how it can be
8f183262
DM
1861done inside our C code:
1862
8f183262
DM
1863 ...
1864
4929bf7b 1865 SV *cvrv = eval_pv("sub { print 'You will not find me cluttering any namespace!' }", TRUE);
8f183262
DM
1866
1867 ...
1868
4929bf7b 1869 call_sv(cvrv, G_VOID|G_NOARGS);
8f183262 1870
4929bf7b
GS
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
4a4eefd0 1873L<perlapi/eval_pv>). Once this code reference is in hand, it
8f183262
DM
1874can be mixed in with all the previous examples we've shown.
1875
9850bf21
RH
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
ac036724 1892It is usual to pass parameters using global variables (typically
1893$_ for one parameter, or $a and $b for two parameters) rather
9850bf21
RH
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
82f35e8b 1900 dMULTICALL; /* Declare local variables */
9850bf21
RH
1901 I32 gimme = G_SCALAR; /* context of the call: G_SCALAR,
1902 * G_LIST, or G_VOID */
1903
82f35e8b
RH
1904 PUSH_MULTICALL(cv); /* Set up the context for calling cv,
1905 and set local vars appropriately */
9850bf21
RH
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
a0d0e21e
LW
1919=head1 SEE ALSO
1920
8e07c86e 1921L<perlxs>, L<perlguts>, L<perlembed>
a0d0e21e
LW
1922
1923=head1 AUTHOR
1924
0536e0eb 1925Paul Marquess
a0d0e21e 1926
d1b91892
AD
1927Special thanks to the following people who assisted in the creation of
1928the document.
a0d0e21e 1929
c07a80fd 1930Jeff Okamoto, Tim Bunce, Nick Gianniotis, Steve Kelem, Gurusamy Sarathy
1931and Larry Wall.
a0d0e21e
LW
1932
1933=head1 DATE
1934
137443ea 1935Version 1.3, 14th Apr 1997