Leaked source code of windows server 2003
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

1957 lines
56 KiB

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