3 perlguts - Perl's Internal Functions
7 This document attempts to describe some of the internal functions of the
8 Perl executable. It is far from complete and probably contains many errors.
9 Please refer any questions or comments to the author below.
15 Perl has three typedefs that handle Perl's three main data types:
21 Each typedef has specific routines that manipulate the various data types.
23 =head2 What is an "IV"?
25 Perl uses a special typedef IV which is a simple integer type that is
26 guaranteed to be large enough to hold a pointer (as well as an integer).
28 Perl also uses two special typedefs, I32 and I16, which will always be at
29 least 32-bits and 16-bits long, respectively.
31 =head2 Working with SVs
33 An SV can be created and loaded with one command. There are four types of
34 values that can be loaded: an integer value (IV), a double (NV), a string,
35 (PV), and another scalar (SV).
41 SV* newSVpv(char*, int);
42 SV* newSVpvn(char*, int);
43 SV* newSVpvf(const char*, ...);
46 To change the value of an *already-existing* SV, there are seven routines:
48 void sv_setiv(SV*, IV);
49 void sv_setuv(SV*, UV);
50 void sv_setnv(SV*, double);
51 void sv_setpv(SV*, char*);
52 void sv_setpvn(SV*, char*, int)
53 void sv_setpvf(SV*, const char*, ...);
54 void sv_setsv(SV*, SV*);
56 Notice that you can choose to specify the length of the string to be
57 assigned by using C<sv_setpvn>, C<newSVpvn>, or C<newSVpv>, or you may
58 allow Perl to calculate the length by using C<sv_setpv> or by specifying
59 0 as the second argument to C<newSVpv>. Be warned, though, that Perl will
60 determine the string's length by using C<strlen>, which depends on the
61 string terminating with a NUL character. The arguments of C<sv_setpvf>
62 are processed like C<sprintf>, and the formatted output becomes the value.
63 The C<sv_set*()> functions are not generic enough to operate on values
64 that have "magic". See L<Magic Virtual Tables> later in this document.
66 All SVs that will contain strings should, but need not, be terminated
67 with a NUL character. If it is not NUL-terminated there is a risk of
68 core dumps and corruptions from code which passes the string to C
69 functions or system calls which expect a NUL-terminated string.
70 Perl's own functions typically add a trailing NUL for this reason.
71 Nevertheless, you should be very careful when you pass a string stored
72 in an SV to a C function or system call.
74 To access the actual value that an SV points to, you can use the macros:
80 which will automatically coerce the actual scalar type into an IV, double,
83 In the C<SvPV> macro, the length of the string returned is placed into the
84 variable C<len> (this is a macro, so you do I<not> use C<&len>). If you do not
85 care what the length of the data is, use the global variable C<na>. Remember,
86 however, that Perl allows arbitrary strings of data that may both contain
87 NULs and might not be terminated by a NUL.
89 If you want to know if the scalar value is TRUE, you can use:
93 Although Perl will automatically grow strings for you, if you need to force
94 Perl to allocate more memory for your SV, you can use the macro
96 SvGROW(SV*, STRLEN newlen)
98 which will determine if more memory needs to be allocated. If so, it will
99 call the function C<sv_grow>. Note that C<SvGROW> can only increase, not
100 decrease, the allocated memory of an SV and that it does not automatically
101 add a byte for the a trailing NUL (perl's own string functions typically do
102 C<SvGROW(sv, len + 1)>).
104 If you have an SV and want to know what kind of data Perl thinks is stored
105 in it, you can use the following macros to check the type of SV you have.
111 You can get and set the current length of the string stored in an SV with
112 the following macros:
115 SvCUR_set(SV*, I32 val)
117 You can also get a pointer to the end of the string stored in the SV
122 But note that these last three macros are valid only if C<SvPOK()> is true.
124 If you want to append something to the end of string stored in an C<SV*>,
125 you can use the following functions:
127 void sv_catpv(SV*, char*);
128 void sv_catpvn(SV*, char*, int);
129 void sv_catpvf(SV*, const char*, ...);
130 void sv_catsv(SV*, SV*);
132 The first function calculates the length of the string to be appended by
133 using C<strlen>. In the second, you specify the length of the string
134 yourself. The third function processes its arguments like C<sprintf> and
135 appends the formatted output. The fourth function extends the string
136 stored in the first SV with the string stored in the second SV. It also
137 forces the second SV to be interpreted as a string. The C<sv_cat*()>
138 functions are not generic enough to operate on values that have "magic".
139 See L<Magic Virtual Tables> later in this document.
141 If you know the name of a scalar variable, you can get a pointer to its SV
142 by using the following:
144 SV* perl_get_sv("package::varname", FALSE);
146 This returns NULL if the variable does not exist.
148 If you want to know if this variable (or any other SV) is actually C<defined>,
153 The scalar C<undef> value is stored in an SV instance called C<sv_undef>. Its
154 address can be used whenever an C<SV*> is needed.
156 There are also the two values C<sv_yes> and C<sv_no>, which contain Boolean
157 TRUE and FALSE values, respectively. Like C<sv_undef>, their addresses can
158 be used whenever an C<SV*> is needed.
160 Do not be fooled into thinking that C<(SV *) 0> is the same as C<&sv_undef>.
164 if (I-am-to-return-a-real-value) {
165 sv = sv_2mortal(newSViv(42));
169 This code tries to return a new SV (which contains the value 42) if it should
170 return a real value, or undef otherwise. Instead it has returned a NULL
171 pointer which, somewhere down the line, will cause a segmentation violation,
172 bus error, or just weird results. Change the zero to C<&sv_undef> in the first
173 line and all will be well.
175 To free an SV that you've created, call C<SvREFCNT_dec(SV*)>. Normally this
176 call is not necessary (see L<Reference Counts and Mortality>).
178 =head2 What's Really Stored in an SV?
180 Recall that the usual method of determining the type of scalar you have is
181 to use C<Sv*OK> macros. Because a scalar can be both a number and a string,
182 usually these macros will always return TRUE and calling the C<Sv*V>
183 macros will do the appropriate conversion of string to integer/double or
184 integer/double to string.
186 If you I<really> need to know if you have an integer, double, or string
187 pointer in an SV, you can use the following three macros instead:
193 These will tell you if you truly have an integer, double, or string pointer
194 stored in your SV. The "p" stands for private.
196 In general, though, it's best to use the C<Sv*V> macros.
198 =head2 Working with AVs
200 There are two ways to create and load an AV. The first method creates an
205 The second method both creates the AV and initially populates it with SVs:
207 AV* av_make(I32 num, SV **ptr);
209 The second argument points to an array containing C<num> C<SV*>'s. Once the
210 AV has been created, the SVs can be destroyed, if so desired.
212 Once the AV has been created, the following operations are possible on AVs:
214 void av_push(AV*, SV*);
217 void av_unshift(AV*, I32 num);
219 These should be familiar operations, with the exception of C<av_unshift>.
220 This routine adds C<num> elements at the front of the array with the C<undef>
221 value. You must then use C<av_store> (described below) to assign values
222 to these new elements.
224 Here are some other functions:
227 SV** av_fetch(AV*, I32 key, I32 lval);
228 SV** av_store(AV*, I32 key, SV* val);
230 The C<av_len> function returns the highest index value in array (just
231 like $#array in Perl). If the array is empty, -1 is returned. The
232 C<av_fetch> function returns the value at index C<key>, but if C<lval>
233 is non-zero, then C<av_fetch> will store an undef value at that index.
234 The C<av_store> function stores the value C<val> at index C<key>, and does
235 not increment the reference count of C<val>. Thus the caller is responsible
236 for taking care of that, and if C<av_store> returns NULL, the caller will
237 have to decrement the reference count to avoid a memory leak. Note that
238 C<av_fetch> and C<av_store> both return C<SV**>'s, not C<SV*>'s as their
243 void av_extend(AV*, I32 key);
245 The C<av_clear> function deletes all the elements in the AV* array, but
246 does not actually delete the array itself. The C<av_undef> function will
247 delete all the elements in the array plus the array itself. The
248 C<av_extend> function extends the array so that it contains C<key>
249 elements. If C<key> is less than the current length of the array, then
252 If you know the name of an array variable, you can get a pointer to its AV
253 by using the following:
255 AV* perl_get_av("package::varname", FALSE);
257 This returns NULL if the variable does not exist.
259 See L<Understanding the Magic of Tied Hashes and Arrays> for more
260 information on how to use the array access functions on tied arrays.
262 =head2 Working with HVs
264 To create an HV, you use the following routine:
268 Once the HV has been created, the following operations are possible on HVs:
270 SV** hv_store(HV*, char* key, U32 klen, SV* val, U32 hash);
271 SV** hv_fetch(HV*, char* key, U32 klen, I32 lval);
273 The C<klen> parameter is the length of the key being passed in (Note that
274 you cannot pass 0 in as a value of C<klen> to tell Perl to measure the
275 length of the key). The C<val> argument contains the SV pointer to the
276 scalar being stored, and C<hash> is the precomputed hash value (zero if
277 you want C<hv_store> to calculate it for you). The C<lval> parameter
278 indicates whether this fetch is actually a part of a store operation, in
279 which case a new undefined value will be added to the HV with the supplied
280 key and C<hv_fetch> will return as if the value had already existed.
282 Remember that C<hv_store> and C<hv_fetch> return C<SV**>'s and not just
283 C<SV*>. To access the scalar value, you must first dereference the return
284 value. However, you should check to make sure that the return value is
285 not NULL before dereferencing it.
287 These two functions check if a hash table entry exists, and deletes it.
289 bool hv_exists(HV*, char* key, U32 klen);
290 SV* hv_delete(HV*, char* key, U32 klen, I32 flags);
292 If C<flags> does not include the C<G_DISCARD> flag then C<hv_delete> will
293 create and return a mortal copy of the deleted value.
295 And more miscellaneous functions:
300 Like their AV counterparts, C<hv_clear> deletes all the entries in the hash
301 table but does not actually delete the hash table. The C<hv_undef> deletes
302 both the entries and the hash table itself.
304 Perl keeps the actual data in linked list of structures with a typedef of HE.
305 These contain the actual key and value pointers (plus extra administrative
306 overhead). The key is a string pointer; the value is an C<SV*>. However,
307 once you have an C<HE*>, to get the actual key and value, use the routines
310 I32 hv_iterinit(HV*);
311 /* Prepares starting point to traverse hash table */
312 HE* hv_iternext(HV*);
313 /* Get the next entry, and return a pointer to a
314 structure that has both the key and value */
315 char* hv_iterkey(HE* entry, I32* retlen);
316 /* Get the key from an HE structure and also return
317 the length of the key string */
318 SV* hv_iterval(HV*, HE* entry);
319 /* Return a SV pointer to the value of the HE
321 SV* hv_iternextsv(HV*, char** key, I32* retlen);
322 /* This convenience routine combines hv_iternext,
323 hv_iterkey, and hv_iterval. The key and retlen
324 arguments are return values for the key and its
325 length. The value is returned in the SV* argument */
327 If you know the name of a hash variable, you can get a pointer to its HV
328 by using the following:
330 HV* perl_get_hv("package::varname", FALSE);
332 This returns NULL if the variable does not exist.
334 The hash algorithm is defined in the C<PERL_HASH(hash, key, klen)> macro:
340 hash = hash * 33 + *s++;
342 See L<Understanding the Magic of Tied Hashes and Arrays> for more
343 information on how to use the hash access functions on tied hashes.
345 =head2 Hash API Extensions
347 Beginning with version 5.004, the following functions are also supported:
349 HE* hv_fetch_ent (HV* tb, SV* key, I32 lval, U32 hash);
350 HE* hv_store_ent (HV* tb, SV* key, SV* val, U32 hash);
352 bool hv_exists_ent (HV* tb, SV* key, U32 hash);
353 SV* hv_delete_ent (HV* tb, SV* key, I32 flags, U32 hash);
355 SV* hv_iterkeysv (HE* entry);
357 Note that these functions take C<SV*> keys, which simplifies writing
358 of extension code that deals with hash structures. These functions
359 also allow passing of C<SV*> keys to C<tie> functions without forcing
360 you to stringify the keys (unlike the previous set of functions).
362 They also return and accept whole hash entries (C<HE*>), making their
363 use more efficient (since the hash number for a particular string
364 doesn't have to be recomputed every time). See L<API LISTING> later in
365 this document for detailed descriptions.
367 The following macros must always be used to access the contents of hash
368 entries. Note that the arguments to these macros must be simple
369 variables, since they may get evaluated more than once. See
370 L<API LISTING> later in this document for detailed descriptions of these
373 HePV(HE* he, STRLEN len)
377 HeSVKEY_force(HE* he)
378 HeSVKEY_set(HE* he, SV* sv)
380 These two lower level macros are defined, but must only be used when
381 dealing with keys that are not C<SV*>s:
386 Note that both C<hv_store> and C<hv_store_ent> do not increment the
387 reference count of the stored C<val>, which is the caller's responsibility.
388 If these functions return a NULL value, the caller will usually have to
389 decrement the reference count of C<val> to avoid a memory leak.
393 References are a special type of scalar that point to other data types
394 (including references).
396 To create a reference, use either of the following functions:
398 SV* newRV_inc((SV*) thing);
399 SV* newRV_noinc((SV*) thing);
401 The C<thing> argument can be any of an C<SV*>, C<AV*>, or C<HV*>. The
402 functions are identical except that C<newRV_inc> increments the reference
403 count of the C<thing>, while C<newRV_noinc> does not. For historical
404 reasons, C<newRV> is a synonym for C<newRV_inc>.
406 Once you have a reference, you can use the following macro to dereference
411 then call the appropriate routines, casting the returned C<SV*> to either an
412 C<AV*> or C<HV*>, if required.
414 To determine if an SV is a reference, you can use the following macro:
418 To discover what type of value the reference refers to, use the following
419 macro and then check the return value.
423 The most useful types that will be returned are:
432 SVt_PVGV Glob (possible a file handle)
433 SVt_PVMG Blessed or Magical Scalar
435 See the sv.h header file for more details.
437 =head2 Blessed References and Class Objects
439 References are also used to support object-oriented programming. In the
440 OO lexicon, an object is simply a reference that has been blessed into a
441 package (or class). Once blessed, the programmer may now use the reference
442 to access the various methods in the class.
444 A reference can be blessed into a package with the following function:
446 SV* sv_bless(SV* sv, HV* stash);
448 The C<sv> argument must be a reference. The C<stash> argument specifies
449 which class the reference will belong to. See
450 L<Stashes and Globs> for information on converting class names into stashes.
452 /* Still under construction */
454 Upgrades rv to reference if not already one. Creates new SV for rv to
455 point to. If C<classname> is non-null, the SV is blessed into the specified
456 class. SV is returned.
458 SV* newSVrv(SV* rv, char* classname);
460 Copies integer or double into an SV whose reference is C<rv>. SV is blessed
461 if C<classname> is non-null.
463 SV* sv_setref_iv(SV* rv, char* classname, IV iv);
464 SV* sv_setref_nv(SV* rv, char* classname, NV iv);
466 Copies the pointer value (I<the address, not the string!>) into an SV whose
467 reference is rv. SV is blessed if C<classname> is non-null.
469 SV* sv_setref_pv(SV* rv, char* classname, PV iv);
471 Copies string into an SV whose reference is C<rv>. Set length to 0 to let
472 Perl calculate the string length. SV is blessed if C<classname> is non-null.
474 SV* sv_setref_pvn(SV* rv, char* classname, PV iv, int length);
476 int sv_isa(SV* sv, char* name);
477 int sv_isobject(SV* sv);
479 =head2 Creating New Variables
481 To create a new Perl variable with an undef value which can be accessed from
482 your Perl script, use the following routines, depending on the variable type.
484 SV* perl_get_sv("package::varname", TRUE);
485 AV* perl_get_av("package::varname", TRUE);
486 HV* perl_get_hv("package::varname", TRUE);
488 Notice the use of TRUE as the second parameter. The new variable can now
489 be set, using the routines appropriate to the data type.
491 There are additional macros whose values may be bitwise OR'ed with the
492 C<TRUE> argument to enable certain extra features. Those bits are:
494 GV_ADDMULTI Marks the variable as multiply defined, thus preventing the
495 "Name <varname> used only once: possible typo" warning.
496 GV_ADDWARN Issues the warning "Had to create <varname> unexpectedly" if
497 the variable did not exist before the function was called.
499 If you do not specify a package name, the variable is created in the current
502 =head2 Reference Counts and Mortality
504 Perl uses an reference count-driven garbage collection mechanism. SVs,
505 AVs, or HVs (xV for short in the following) start their life with a
506 reference count of 1. If the reference count of an xV ever drops to 0,
507 then it will be destroyed and its memory made available for reuse.
509 This normally doesn't happen at the Perl level unless a variable is
510 undef'ed or the last variable holding a reference to it is changed or
511 overwritten. At the internal level, however, reference counts can be
512 manipulated with the following macros:
514 int SvREFCNT(SV* sv);
515 SV* SvREFCNT_inc(SV* sv);
516 void SvREFCNT_dec(SV* sv);
518 However, there is one other function which manipulates the reference
519 count of its argument. The C<newRV_inc> function, you will recall,
520 creates a reference to the specified argument. As a side effect,
521 it increments the argument's reference count. If this is not what
522 you want, use C<newRV_noinc> instead.
524 For example, imagine you want to return a reference from an XSUB function.
525 Inside the XSUB routine, you create an SV which initially has a reference
526 count of one. Then you call C<newRV_inc>, passing it the just-created SV.
527 This returns the reference as a new SV, but the reference count of the
528 SV you passed to C<newRV_inc> has been incremented to two. Now you
529 return the reference from the XSUB routine and forget about the SV.
530 But Perl hasn't! Whenever the returned reference is destroyed, the
531 reference count of the original SV is decreased to one and nothing happens.
532 The SV will hang around without any way to access it until Perl itself
533 terminates. This is a memory leak.
535 The correct procedure, then, is to use C<newRV_noinc> instead of
536 C<newRV_inc>. Then, if and when the last reference is destroyed,
537 the reference count of the SV will go to zero and it will be destroyed,
538 stopping any memory leak.
540 There are some convenience functions available that can help with the
541 destruction of xVs. These functions introduce the concept of "mortality".
542 An xV that is mortal has had its reference count marked to be decremented,
543 but not actually decremented, until "a short time later". Generally the
544 term "short time later" means a single Perl statement, such as a call to
545 an XSUB function. The actual determinant for when mortal xVs have their
546 reference count decremented depends on two macros, SAVETMPS and FREETMPS.
547 See L<perlcall> and L<perlxs> for more details on these macros.
549 "Mortalization" then is at its simplest a deferred C<SvREFCNT_dec>.
550 However, if you mortalize a variable twice, the reference count will
551 later be decremented twice.
553 You should be careful about creating mortal variables. Strange things
554 can happen if you make the same value mortal within multiple contexts,
555 or if you make a variable mortal multiple times.
557 To create a mortal variable, use the functions:
561 SV* sv_mortalcopy(SV*)
563 The first call creates a mortal SV, the second converts an existing
564 SV to a mortal SV (and thus defers a call to C<SvREFCNT_dec>), and the
565 third creates a mortal copy of an existing SV.
567 The mortal routines are not just for SVs -- AVs and HVs can be
568 made mortal by passing their address (type-casted to C<SV*>) to the
569 C<sv_2mortal> or C<sv_mortalcopy> routines.
571 =head2 Stashes and Globs
573 A "stash" is a hash that contains all of the different objects that
574 are contained within a package. Each key of the stash is a symbol
575 name (shared by all the different types of objects that have the same
576 name), and each value in the hash table is a GV (Glob Value). This GV
577 in turn contains references to the various objects of that name,
578 including (but not limited to) the following:
588 There is a single stash called "defstash" that holds the items that exist
589 in the "main" package. To get at the items in other packages, append the
590 string "::" to the package name. The items in the "Foo" package are in
591 the stash "Foo::" in defstash. The items in the "Bar::Baz" package are
592 in the stash "Baz::" in "Bar::"'s stash.
594 To get the stash pointer for a particular package, use the function:
596 HV* gv_stashpv(char* name, I32 create)
597 HV* gv_stashsv(SV*, I32 create)
599 The first function takes a literal string, the second uses the string stored
600 in the SV. Remember that a stash is just a hash table, so you get back an
601 C<HV*>. The C<create> flag will create a new package if it is set.
603 The name that C<gv_stash*v> wants is the name of the package whose symbol table
604 you want. The default package is called C<main>. If you have multiply nested
605 packages, pass their names to C<gv_stash*v>, separated by C<::> as in the Perl
608 Alternately, if you have an SV that is a blessed reference, you can find
609 out the stash pointer by using:
611 HV* SvSTASH(SvRV(SV*));
613 then use the following to get the package name itself:
615 char* HvNAME(HV* stash);
617 If you need to bless or re-bless an object you can use the following
620 SV* sv_bless(SV*, HV* stash)
622 where the first argument, an C<SV*>, must be a reference, and the second
623 argument is a stash. The returned C<SV*> can now be used in the same way
626 For more information on references and blessings, consult L<perlref>.
628 =head2 Double-Typed SVs
630 Scalar variables normally contain only one type of value, an integer,
631 double, pointer, or reference. Perl will automatically convert the
632 actual scalar data from the stored type into the requested type.
634 Some scalar variables contain more than one type of scalar data. For
635 example, the variable C<$!> contains either the numeric value of C<errno>
636 or its string equivalent from either C<strerror> or C<sys_errlist[]>.
638 To force multiple data values into an SV, you must do two things: use the
639 C<sv_set*v> routines to add the additional scalar type, then set a flag
640 so that Perl will believe it contains more than one type of data. The
641 four macros to set the flags are:
648 The particular macro you must use depends on which C<sv_set*v> routine
649 you called first. This is because every C<sv_set*v> routine turns on
650 only the bit for the particular type of data being set, and turns off
653 For example, to create a new Perl variable called "dberror" that contains
654 both the numeric and descriptive string error values, you could use the
658 extern char *dberror_list;
660 SV* sv = perl_get_sv("dberror", TRUE);
661 sv_setiv(sv, (IV) dberror);
662 sv_setpv(sv, dberror_list[dberror]);
665 If the order of C<sv_setiv> and C<sv_setpv> had been reversed, then the
666 macro C<SvPOK_on> would need to be called instead of C<SvIOK_on>.
668 =head2 Magic Variables
670 [This section still under construction. Ignore everything here. Post no
671 bills. Everything not permitted is forbidden.]
673 Any SV may be magical, that is, it has special features that a normal
674 SV does not have. These features are stored in the SV structure in a
675 linked list of C<struct magic>'s, typedef'ed to C<MAGIC>.
688 Note this is current as of patchlevel 0, and could change at any time.
690 =head2 Assigning Magic
692 Perl adds magic to an SV using the sv_magic function:
694 void sv_magic(SV* sv, SV* obj, int how, char* name, I32 namlen);
696 The C<sv> argument is a pointer to the SV that is to acquire a new magical
699 If C<sv> is not already magical, Perl uses the C<SvUPGRADE> macro to
700 set the C<SVt_PVMG> flag for the C<sv>. Perl then continues by adding
701 it to the beginning of the linked list of magical features. Any prior
702 entry of the same type of magic is deleted. Note that this can be
703 overridden, and multiple instances of the same type of magic can be
704 associated with an SV.
706 The C<name> and C<namlen> arguments are used to associate a string with
707 the magic, typically the name of a variable. C<namlen> is stored in the
708 C<mg_len> field and if C<name> is non-null and C<namlen> >= 0 a malloc'd
709 copy of the name is stored in C<mg_ptr> field.
711 The sv_magic function uses C<how> to determine which, if any, predefined
712 "Magic Virtual Table" should be assigned to the C<mg_virtual> field.
713 See the "Magic Virtual Table" section below. The C<how> argument is also
714 stored in the C<mg_type> field.
716 The C<obj> argument is stored in the C<mg_obj> field of the C<MAGIC>
717 structure. If it is not the same as the C<sv> argument, the reference
718 count of the C<obj> object is incremented. If it is the same, or if
719 the C<how> argument is "#", or if it is a NULL pointer, then C<obj> is
720 merely stored, without the reference count being incremented.
722 There is also a function to add magic to an C<HV>:
724 void hv_magic(HV *hv, GV *gv, int how);
726 This simply calls C<sv_magic> and coerces the C<gv> argument into an C<SV>.
728 To remove the magic from an SV, call the function sv_unmagic:
730 void sv_unmagic(SV *sv, int type);
732 The C<type> argument should be equal to the C<how> value when the C<SV>
733 was initially made magical.
735 =head2 Magic Virtual Tables
737 The C<mg_virtual> field in the C<MAGIC> structure is a pointer to a
738 C<MGVTBL>, which is a structure of function pointers and stands for
739 "Magic Virtual Table" to handle the various operations that might be
740 applied to that variable.
742 The C<MGVTBL> has five pointers to the following routine types:
744 int (*svt_get)(SV* sv, MAGIC* mg);
745 int (*svt_set)(SV* sv, MAGIC* mg);
746 U32 (*svt_len)(SV* sv, MAGIC* mg);
747 int (*svt_clear)(SV* sv, MAGIC* mg);
748 int (*svt_free)(SV* sv, MAGIC* mg);
750 This MGVTBL structure is set at compile-time in C<perl.h> and there are
751 currently 19 types (or 21 with overloading turned on). These different
752 structures contain pointers to various routines that perform additional
753 actions depending on which function is being called.
755 Function pointer Action taken
756 ---------------- ------------
757 svt_get Do something after the value of the SV is retrieved.
758 svt_set Do something after the SV is assigned a value.
759 svt_len Report on the SV's length.
760 svt_clear Clear something the SV represents.
761 svt_free Free any extra storage associated with the SV.
763 For instance, the MGVTBL structure called C<vtbl_sv> (which corresponds
764 to an C<mg_type> of '\0') contains:
766 { magic_get, magic_set, magic_len, 0, 0 }
768 Thus, when an SV is determined to be magical and of type '\0', if a get
769 operation is being performed, the routine C<magic_get> is called. All
770 the various routines for the various magical types begin with C<magic_>.
772 The current kinds of Magic Virtual Tables are:
774 mg_type MGVTBL Type of magic
775 ------- ------ ----------------------------
776 \0 vtbl_sv Special scalar variable
777 A vtbl_amagic %OVERLOAD hash
778 a vtbl_amagicelem %OVERLOAD hash element
779 c (none) Holds overload table (AMT) on stash
780 B vtbl_bm Boyer-Moore (fast string search)
782 e vtbl_envelem %ENV hash element
783 f vtbl_fm Formline ('compiled' format)
784 g vtbl_mglob m//g target / study()ed string
785 I vtbl_isa @ISA array
786 i vtbl_isaelem @ISA array element
787 k vtbl_nkeys scalar(keys()) lvalue
788 L (none) Debugger %_<filename
789 l vtbl_dbline Debugger %_<filename element
790 o vtbl_collxfrm Locale transformation
791 P vtbl_pack Tied array or hash
792 p vtbl_packelem Tied array or hash element
793 q vtbl_packelem Tied scalar or handle
795 s vtbl_sigelem %SIG hash element
796 t vtbl_taint Taintedness
797 U vtbl_uvar Available for use by extensions
798 v vtbl_vec vec() lvalue
799 x vtbl_substr substr() lvalue
800 y vtbl_defelem Shadow "foreach" iterator variable /
801 smart parameter vivification
802 * vtbl_glob GV (typeglob)
803 # vtbl_arylen Array length ($#ary)
804 . vtbl_pos pos() lvalue
805 ~ (none) Available for use by extensions
807 When an uppercase and lowercase letter both exist in the table, then the
808 uppercase letter is used to represent some kind of composite type (a list
809 or a hash), and the lowercase letter is used to represent an element of
812 The '~' and 'U' magic types are defined specifically for use by
813 extensions and will not be used by perl itself. Extensions can use
814 '~' magic to 'attach' private information to variables (typically
815 objects). This is especially useful because there is no way for
816 normal perl code to corrupt this private information (unlike using
817 extra elements of a hash object).
819 Similarly, 'U' magic can be used much like tie() to call a C function
820 any time a scalar's value is used or changed. The C<MAGIC>'s
821 C<mg_ptr> field points to a C<ufuncs> structure:
824 I32 (*uf_val)(IV, SV*);
825 I32 (*uf_set)(IV, SV*);
829 When the SV is read from or written to, the C<uf_val> or C<uf_set>
830 function will be called with C<uf_index> as the first arg and a
831 pointer to the SV as the second.
833 Note that because multiple extensions may be using '~' or 'U' magic,
834 it is important for extensions to take extra care to avoid conflict.
835 Typically only using the magic on objects blessed into the same class
836 as the extension is sufficient. For '~' magic, it may also be
837 appropriate to add an I32 'signature' at the top of the private data
840 Also note that the C<sv_set*()> and C<sv_cat*()> functions described
841 earlier do B<not> invoke 'set' magic on their targets. This must
842 be done by the user either by calling the C<SvSETMAGIC()> macro after
843 calling these functions, or by using one of the C<sv_set*_mg()> or
844 C<sv_cat*_mg()> functions. Similarly, generic C code must call the
845 C<SvGETMAGIC()> macro to invoke any 'get' magic if they use an SV
846 obtained from external sources in functions that don't handle magic.
847 L<API LISTING> later in this document identifies such functions.
848 For example, calls to the C<sv_cat*()> functions typically need to be
849 followed by C<SvSETMAGIC()>, but they don't need a prior C<SvGETMAGIC()>
850 since their implementation handles 'get' magic.
854 MAGIC* mg_find(SV*, int type); /* Finds the magic pointer of that type */
856 This routine returns a pointer to the C<MAGIC> structure stored in the SV.
857 If the SV does not have that magical feature, C<NULL> is returned. Also,
858 if the SV is not of type SVt_PVMG, Perl may core dump.
860 int mg_copy(SV* sv, SV* nsv, char* key, STRLEN klen);
862 This routine checks to see what types of magic C<sv> has. If the mg_type
863 field is an uppercase letter, then the mg_obj is copied to C<nsv>, but
864 the mg_type field is changed to be the lowercase letter.
866 =head2 Understanding the Magic of Tied Hashes and Arrays
868 Tied hashes and arrays are magical beasts of the 'P' magic type.
870 WARNING: As of the 5.004 release, proper usage of the array and hash
871 access functions requires understanding a few caveats. Some
872 of these caveats are actually considered bugs in the API, to be fixed
873 in later releases, and are bracketed with [MAYCHANGE] below. If
874 you find yourself actually applying such information in this section, be
875 aware that the behavior may change in the future, umm, without warning.
877 The C<av_store> function, when given a tied array argument, merely
878 copies the magic of the array onto the value to be "stored", using
879 C<mg_copy>. It may also return NULL, indicating that the value did not
880 actually need to be stored in the array. [MAYCHANGE] After a call to
881 C<av_store> on a tied array, the caller will usually need to call
882 C<mg_set(val)> to actually invoke the perl level "STORE" method on the
883 TIEARRAY object. If C<av_store> did return NULL, a call to
884 C<SvREFCNT_dec(val)> will also be usually necessary to avoid a memory
887 The previous paragraph is applicable verbatim to tied hash access using the
888 C<hv_store> and C<hv_store_ent> functions as well.
890 C<av_fetch> and the corresponding hash functions C<hv_fetch> and
891 C<hv_fetch_ent> actually return an undefined mortal value whose magic
892 has been initialized using C<mg_copy>. Note the value so returned does not
893 need to be deallocated, as it is already mortal. [MAYCHANGE] But you will
894 need to call C<mg_get()> on the returned value in order to actually invoke
895 the perl level "FETCH" method on the underlying TIE object. Similarly,
896 you may also call C<mg_set()> on the return value after possibly assigning
897 a suitable value to it using C<sv_setsv>, which will invoke the "STORE"
898 method on the TIE object. [/MAYCHANGE]
901 In other words, the array or hash fetch/store functions don't really
902 fetch and store actual values in the case of tied arrays and hashes. They
903 merely call C<mg_copy> to attach magic to the values that were meant to be
904 "stored" or "fetched". Later calls to C<mg_get> and C<mg_set> actually
905 do the job of invoking the TIE methods on the underlying objects. Thus
906 the magic mechanism currently implements a kind of lazy access to arrays
909 Currently (as of perl version 5.004), use of the hash and array access
910 functions requires the user to be aware of whether they are operating on
911 "normal" hashes and arrays, or on their tied variants. The API may be
912 changed to provide more transparent access to both tied and normal data
913 types in future versions.
916 You would do well to understand that the TIEARRAY and TIEHASH interfaces
917 are mere sugar to invoke some perl method calls while using the uniform hash
918 and array syntax. The use of this sugar imposes some overhead (typically
919 about two to four extra opcodes per FETCH/STORE operation, in addition to
920 the creation of all the mortal variables required to invoke the methods).
921 This overhead will be comparatively small if the TIE methods are themselves
922 substantial, but if they are only a few statements long, the overhead
923 will not be insignificant.
925 =head2 Localizing changes
927 Perl has a very handy construction
934 This construction is I<approximately> equivalent to
943 The biggest difference is that the first construction would
944 reinstate the initial value of $var, irrespective of how control exits
945 the block: C<goto>, C<return>, C<die>/C<eval> etc. It is a little bit
946 more efficient as well.
948 There is a way to achieve a similar task from C via Perl API: create a
949 I<pseudo-block>, and arrange for some changes to be automatically
950 undone at the end of it, either explicit, or via a non-local exit (via
951 die()). A I<block>-like construct is created by a pair of
952 C<ENTER>/C<LEAVE> macros (see L<perlcall/EXAMPLE/"Returning a
953 Scalar">). Such a construct may be created specially for some
954 important localized task, or an existing one (like boundaries of
955 enclosing Perl subroutine/block, or an existing pair for freeing TMPs)
956 may be used. (In the second case the overhead of additional
957 localization must be almost negligible.) Note that any XSUB is
958 automatically enclosed in an C<ENTER>/C<LEAVE> pair.
960 Inside such a I<pseudo-block> the following service is available:
964 =item C<SAVEINT(int i)>
966 =item C<SAVEIV(IV i)>
968 =item C<SAVEI32(I32 i)>
970 =item C<SAVELONG(long i)>
972 These macros arrange things to restore the value of integer variable
973 C<i> at the end of enclosing I<pseudo-block>.
979 These macros arrange things to restore the value of pointers C<s> and
980 C<p>. C<s> must be a pointer of a type which survives conversion to
981 C<SV*> and back, C<p> should be able to survive conversion to C<char*>
984 =item C<SAVEFREESV(SV *sv)>
986 The refcount of C<sv> would be decremented at the end of
987 I<pseudo-block>. This is similar to C<sv_2mortal>, which should (?) be
990 =item C<SAVEFREEOP(OP *op)>
992 The C<OP *> is op_free()ed at the end of I<pseudo-block>.
994 =item C<SAVEFREEPV(p)>
996 The chunk of memory which is pointed to by C<p> is Safefree()ed at the
997 end of I<pseudo-block>.
999 =item C<SAVECLEARSV(SV *sv)>
1001 Clears a slot in the current scratchpad which corresponds to C<sv> at
1002 the end of I<pseudo-block>.
1004 =item C<SAVEDELETE(HV *hv, char *key, I32 length)>
1006 The key C<key> of C<hv> is deleted at the end of I<pseudo-block>. The
1007 string pointed to by C<key> is Safefree()ed. If one has a I<key> in
1008 short-lived storage, the corresponding string may be reallocated like
1011 SAVEDELETE(defstash, savepv(tmpbuf), strlen(tmpbuf));
1013 =item C<SAVEDESTRUCTOR(f,p)>
1015 At the end of I<pseudo-block> the function C<f> is called with the
1016 only argument (of type C<void*>) C<p>.
1018 =item C<SAVESTACK_POS()>
1020 The current offset on the Perl internal stack (cf. C<SP>) is restored
1021 at the end of I<pseudo-block>.
1025 The following API list contains functions, thus one needs to
1026 provide pointers to the modifiable data explicitly (either C pointers,
1027 or Perlish C<GV *>s). Where the above macros take C<int>, a similar
1028 function takes C<int *>.
1032 =item C<SV* save_scalar(GV *gv)>
1034 Equivalent to Perl code C<local $gv>.
1036 =item C<AV* save_ary(GV *gv)>
1038 =item C<HV* save_hash(GV *gv)>
1040 Similar to C<save_scalar>, but localize C<@gv> and C<%gv>.
1042 =item C<void save_item(SV *item)>
1044 Duplicates the current value of C<SV>, on the exit from the current
1045 C<ENTER>/C<LEAVE> I<pseudo-block> will restore the value of C<SV>
1046 using the stored value.
1048 =item C<void save_list(SV **sarg, I32 maxsarg)>
1050 A variant of C<save_item> which takes multiple arguments via an array
1051 C<sarg> of C<SV*> of length C<maxsarg>.
1053 =item C<SV* save_svref(SV **sptr)>
1055 Similar to C<save_scalar>, but will reinstate a C<SV *>.
1057 =item C<void save_aptr(AV **aptr)>
1059 =item C<void save_hptr(HV **hptr)>
1061 Similar to C<save_svref>, but localize C<AV *> and C<HV *>.
1065 The C<Alias> module implements localization of the basic types within the
1066 I<caller's scope>. People who are interested in how to localize things in
1067 the containing scope should take a look there too.
1071 =head2 XSUBs and the Argument Stack
1073 The XSUB mechanism is a simple way for Perl programs to access C subroutines.
1074 An XSUB routine will have a stack that contains the arguments from the Perl
1075 program, and a way to map from the Perl data structures to a C equivalent.
1077 The stack arguments are accessible through the C<ST(n)> macro, which returns
1078 the C<n>'th stack argument. Argument 0 is the first argument passed in the
1079 Perl subroutine call. These arguments are C<SV*>, and can be used anywhere
1082 Most of the time, output from the C routine can be handled through use of
1083 the RETVAL and OUTPUT directives. However, there are some cases where the
1084 argument stack is not already long enough to handle all the return values.
1085 An example is the POSIX tzname() call, which takes no arguments, but returns
1086 two, the local time zone's standard and summer time abbreviations.
1088 To handle this situation, the PPCODE directive is used and the stack is
1089 extended using the macro:
1093 where C<sp> is the stack pointer, and C<num> is the number of elements the
1094 stack should be extended by.
1096 Now that there is room on the stack, values can be pushed on it using the
1097 macros to push IVs, doubles, strings, and SV pointers respectively:
1104 And now the Perl program calling C<tzname>, the two values will be assigned
1107 ($standard_abbrev, $summer_abbrev) = POSIX::tzname;
1109 An alternate (and possibly simpler) method to pushing values on the stack is
1117 These macros automatically adjust the stack for you, if needed. Thus, you
1118 do not need to call C<EXTEND> to extend the stack.
1120 For more information, consult L<perlxs> and L<perlxstut>.
1122 =head2 Calling Perl Routines from within C Programs
1124 There are four routines that can be used to call a Perl subroutine from
1125 within a C program. These four are:
1127 I32 perl_call_sv(SV*, I32);
1128 I32 perl_call_pv(char*, I32);
1129 I32 perl_call_method(char*, I32);
1130 I32 perl_call_argv(char*, I32, register char**);
1132 The routine most often used is C<perl_call_sv>. The C<SV*> argument
1133 contains either the name of the Perl subroutine to be called, or a
1134 reference to the subroutine. The second argument consists of flags
1135 that control the context in which the subroutine is called, whether
1136 or not the subroutine is being passed arguments, how errors should be
1137 trapped, and how to treat return values.
1139 All four routines return the number of arguments that the subroutine returned
1142 When using any of these routines (except C<perl_call_argv>), the programmer
1143 must manipulate the Perl stack. These include the following macros and
1157 For a detailed description of calling conventions from C to Perl,
1158 consult L<perlcall>.
1160 =head2 Memory Allocation
1162 It is suggested that you use the version of malloc that is distributed
1163 with Perl. It keeps pools of various sizes of unallocated memory in
1164 order to satisfy allocation requests more quickly. However, on some
1165 platforms, it may cause spurious malloc or free errors.
1167 New(x, pointer, number, type);
1168 Newc(x, pointer, number, type, cast);
1169 Newz(x, pointer, number, type);
1171 These three macros are used to initially allocate memory.
1173 The first argument C<x> was a "magic cookie" that was used to keep track
1174 of who called the macro, to help when debugging memory problems. However,
1175 the current code makes no use of this feature (most Perl developers now
1176 use run-time memory checkers), so this argument can be any number.
1178 The second argument C<pointer> should be the name of a variable that will
1179 point to the newly allocated memory.
1181 The third and fourth arguments C<number> and C<type> specify how many of
1182 the specified type of data structure should be allocated. The argument
1183 C<type> is passed to C<sizeof>. The final argument to C<Newc>, C<cast>,
1184 should be used if the C<pointer> argument is different from the C<type>
1187 Unlike the C<New> and C<Newc> macros, the C<Newz> macro calls C<memzero>
1188 to zero out all the newly allocated memory.
1190 Renew(pointer, number, type);
1191 Renewc(pointer, number, type, cast);
1194 These three macros are used to change a memory buffer size or to free a
1195 piece of memory no longer needed. The arguments to C<Renew> and C<Renewc>
1196 match those of C<New> and C<Newc> with the exception of not needing the
1197 "magic cookie" argument.
1199 Move(source, dest, number, type);
1200 Copy(source, dest, number, type);
1201 Zero(dest, number, type);
1203 These three macros are used to move, copy, or zero out previously allocated
1204 memory. The C<source> and C<dest> arguments point to the source and
1205 destination starting points. Perl will move, copy, or zero out C<number>
1206 instances of the size of the C<type> data structure (using the C<sizeof>
1211 The most recent development releases of Perl has been experimenting with
1212 removing Perl's dependency on the "normal" standard I/O suite and allowing
1213 other stdio implementations to be used. This involves creating a new
1214 abstraction layer that then calls whichever implementation of stdio Perl
1215 was compiled with. All XSUBs should now use the functions in the PerlIO
1216 abstraction layer and not make any assumptions about what kind of stdio
1219 For a complete description of the PerlIO abstraction, consult L<perlapio>.
1221 =head2 Putting a C value on Perl stack
1223 A lot of opcodes (this is an elementary operation in the internal perl
1224 stack machine) put an SV* on the stack. However, as an optimization
1225 the corresponding SV is (usually) not recreated each time. The opcodes
1226 reuse specially assigned SVs (I<target>s) which are (as a corollary)
1227 not constantly freed/created.
1229 Each of the targets is created only once (but see
1230 L<Scratchpads and recursion> below), and when an opcode needs to put
1231 an integer, a double, or a string on stack, it just sets the
1232 corresponding parts of its I<target> and puts the I<target> on stack.
1234 The macro to put this target on stack is C<PUSHTARG>, and it is
1235 directly used in some opcodes, as well as indirectly in zillions of
1236 others, which use it via C<(X)PUSH[pni]>.
1240 The question remains on when the SVs which are I<target>s for opcodes
1241 are created. The answer is that they are created when the current unit --
1242 a subroutine or a file (for opcodes for statements outside of
1243 subroutines) -- is compiled. During this time a special anonymous Perl
1244 array is created, which is called a scratchpad for the current
1247 A scratchpad keeps SVs which are lexicals for the current unit and are
1248 targets for opcodes. One can deduce that an SV lives on a scratchpad
1249 by looking on its flags: lexicals have C<SVs_PADMY> set, and
1250 I<target>s have C<SVs_PADTMP> set.
1252 The correspondence between OPs and I<target>s is not 1-to-1. Different
1253 OPs in the compile tree of the unit can use the same target, if this
1254 would not conflict with the expected life of the temporary.
1256 =head2 Scratchpads and recursion
1258 In fact it is not 100% true that a compiled unit contains a pointer to
1259 the scratchpad AV. In fact it contains a pointer to an AV of
1260 (initially) one element, and this element is the scratchpad AV. Why do
1261 we need an extra level of indirection?
1263 The answer is B<recursion>, and maybe (sometime soon) B<threads>. Both
1264 these can create several execution pointers going into the same
1265 subroutine. For the subroutine-child not write over the temporaries
1266 for the subroutine-parent (lifespan of which covers the call to the
1267 child), the parent and the child should have different
1268 scratchpads. (I<And> the lexicals should be separate anyway!)
1270 So each subroutine is born with an array of scratchpads (of length 1).
1271 On each entry to the subroutine it is checked that the current
1272 depth of the recursion is not more than the length of this array, and
1273 if it is, new scratchpad is created and pushed into the array.
1275 The I<target>s on this scratchpad are C<undef>s, but they are already
1276 marked with correct flags.
1278 =head1 Compiled code
1282 Here we describe the internal form your code is converted to by
1283 Perl. Start with a simple example:
1287 This is converted to a tree similar to this one:
1295 (but slightly more complicated). This tree reflect the way Perl
1296 parsed your code, but has nothing to do with the execution order.
1297 There is an additional "thread" going through the nodes of the tree
1298 which shows the order of execution of the nodes. In our simplified
1299 example above it looks like:
1301 $b ---> $c ---> + ---> $a ---> assign-to
1303 But with the actual compile tree for C<$a = $b + $c> it is different:
1304 some nodes I<optimized away>. As a corollary, though the actual tree
1305 contains more nodes than our simplified example, the execution order
1306 is the same as in our example.
1308 =head2 Examining the tree
1310 If you have your perl compiled for debugging (usually done with C<-D
1311 optimize=-g> on C<Configure> command line), you may examine the
1312 compiled tree by specifying C<-Dx> on the Perl command line. The
1313 output takes several lines per node, and for C<$b+$c> it looks like
1318 FLAGS = (SCALAR,KIDS)
1320 TYPE = null ===> (4)
1322 FLAGS = (SCALAR,KIDS)
1324 3 TYPE = gvsv ===> 4
1330 TYPE = null ===> (5)
1332 FLAGS = (SCALAR,KIDS)
1334 4 TYPE = gvsv ===> 5
1340 This tree has 5 nodes (one per C<TYPE> specifier), only 3 of them are
1341 not optimized away (one per number in the left column). The immediate
1342 children of the given node correspond to C<{}> pairs on the same level
1343 of indentation, thus this listing corresponds to the tree:
1351 The execution order is indicated by C<===E<gt>> marks, thus it is C<3
1352 4 5 6> (node C<6> is not included into above listing), i.e.,
1353 C<gvsv gvsv add whatever>.
1355 =head2 Compile pass 1: check routines
1357 The tree is created by the I<pseudo-compiler> while yacc code feeds it
1358 the constructions it recognizes. Since yacc works bottom-up, so does
1359 the first pass of perl compilation.
1361 What makes this pass interesting for perl developers is that some
1362 optimization may be performed on this pass. This is optimization by
1363 so-called I<check routines>. The correspondence between node names
1364 and corresponding check routines is described in F<opcode.pl> (do not
1365 forget to run C<make regen_headers> if you modify this file).
1367 A check routine is called when the node is fully constructed except
1368 for the execution-order thread. Since at this time there is no
1369 back-links to the currently constructed node, one can do most any
1370 operation to the top-level node, including freeing it and/or creating
1371 new nodes above/below it.
1373 The check routine returns the node which should be inserted into the
1374 tree (if the top-level node was not modified, check routine returns
1377 By convention, check routines have names C<ck_*>. They are usually
1378 called from C<new*OP> subroutines (or C<convert>) (which in turn are
1379 called from F<perly.y>).
1381 =head2 Compile pass 1a: constant folding
1383 Immediately after the check routine is called the returned node is
1384 checked for being compile-time executable. If it is (the value is
1385 judged to be constant) it is immediately executed, and a I<constant>
1386 node with the "return value" of the corresponding subtree is
1387 substituted instead. The subtree is deleted.
1389 If constant folding was not performed, the execution-order thread is
1392 =head2 Compile pass 2: context propagation
1394 When a context for a part of compile tree is known, it is propagated
1395 down through the tree. Aat this time the context can have 5 values
1396 (instead of 2 for runtime context): void, boolean, scalar, list, and
1397 lvalue. In contrast with the pass 1 this pass is processed from top
1398 to bottom: a node's context determines the context for its children.
1400 Additional context-dependent optimizations are performed at this time.
1401 Since at this moment the compile tree contains back-references (via
1402 "thread" pointers), nodes cannot be free()d now. To allow
1403 optimized-away nodes at this stage, such nodes are null()ified instead
1404 of free()ing (i.e. their type is changed to OP_NULL).
1406 =head2 Compile pass 3: peephole optimization
1408 After the compile tree for a subroutine (or for an C<eval> or a file)
1409 is created, an additional pass over the code is performed. This pass
1410 is neither top-down or bottom-up, but in the execution order (with
1411 additional compilications for conditionals). These optimizations are
1412 done in the subroutine peep(). Optimizations performed at this stage
1413 are subject to the same restrictions as in the pass 2.
1417 This is a listing of functions, macros, flags, and variables that may be
1418 useful to extension writers or that may be found while reading other
1420 The sort order of the listing is case insensitive, with any
1421 occurrences of '_' ignored for the the purpose of sorting.
1427 Clears an array, making it empty. Does not free the memory used by the
1430 void av_clear (AV* ar)
1434 Pre-extend an array. The C<key> is the index to which the array should be
1437 void av_extend (AV* ar, I32 key)
1441 Returns the SV at the specified index in the array. The C<key> is the
1442 index. If C<lval> is set then the fetch will be part of a store. Check
1443 that the return value is non-null before dereferencing it to a C<SV*>.
1445 See L<Understanding the Magic of Tied Hashes and Arrays> for more
1446 information on how to use this function on tied arrays.
1448 SV** av_fetch (AV* ar, I32 key, I32 lval)
1456 Returns the highest index in the array. Returns -1 if the array is empty.
1462 Creates a new AV and populates it with a list of SVs. The SVs are copied
1463 into the array, so they may be freed after the call to av_make. The new AV
1464 will have a reference count of 1.
1466 AV* av_make (I32 size, SV** svp)
1470 Pops an SV off the end of the array. Returns C<&sv_undef> if the array is
1477 Pushes an SV onto the end of the array. The array will grow automatically
1478 to accommodate the addition.
1480 void av_push (AV* ar, SV* val)
1484 Shifts an SV off the beginning of the array.
1486 SV* av_shift (AV* ar)
1490 Stores an SV in an array. The array index is specified as C<key>. The
1491 return value will be NULL if the operation failed or if the value did not
1492 need to be actually stored within the array (as in the case of tied arrays).
1493 Otherwise it can be dereferenced to get the original C<SV*>. Note that the
1494 caller is responsible for suitably incrementing the reference count of C<val>
1495 before the call, and decrementing it if the function returned NULL.
1497 See L<Understanding the Magic of Tied Hashes and Arrays> for more
1498 information on how to use this function on tied arrays.
1500 SV** av_store (AV* ar, I32 key, SV* val)
1504 Undefines the array. Frees the memory used by the array itself.
1506 void av_undef (AV* ar)
1510 Unshift the given number of C<undef> values onto the beginning of the
1511 array. The array will grow automatically to accommodate the addition.
1512 You must then use C<av_store> to assign values to these new elements.
1514 void av_unshift (AV* ar, I32 num)
1518 Variable which is setup by C<xsubpp> to indicate the class name for a C++ XS
1519 constructor. This is always a C<char*>. See C<THIS> and
1520 L<perlxs/"Using XS With C++">.
1524 The XSUB-writer's interface to the C C<memcpy> function. The C<s> is the
1525 source, C<d> is the destination, C<n> is the number of items, and C<t> is
1526 the type. May fail on overlapping copies. See also C<Move>.
1528 void Copy( s, d, n, t )
1532 This is the XSUB-writer's interface to Perl's C<die> function. Use this
1533 function the same way you use the C C<printf> function. See C<warn>.
1537 Returns the stash of the CV.
1539 HV* CvSTASH( SV* sv )
1543 When Perl is run in debugging mode, with the B<-d> switch, this SV is a
1544 boolean which indicates whether subs are being single-stepped.
1545 Single-stepping is automatically turned on after every step. This is the C
1546 variable which corresponds to Perl's $DB::single variable. See C<DBsub>.
1550 When Perl is run in debugging mode, with the B<-d> switch, this GV contains
1551 the SV which holds the name of the sub being debugged. This is the C
1552 variable which corresponds to Perl's $DB::sub variable. See C<DBsingle>.
1553 The sub name can be found by
1555 SvPV( GvSV( DBsub ), na )
1559 Trace variable used when Perl is run in debugging mode, with the B<-d>
1560 switch. This is the C variable which corresponds to Perl's $DB::trace
1561 variable. See C<DBsingle>.
1565 Declare a stack marker variable, C<mark>, for the XSUB. See C<MARK> and
1570 Saves the original stack mark for the XSUB. See C<ORIGMARK>.
1574 The C variable which corresponds to Perl's $^W warning variable.
1578 Declares a stack pointer variable, C<sp>, for the XSUB. See C<SP>.
1582 Sets up stack and mark pointers for an XSUB, calling dSP and dMARK. This is
1583 usually handled automatically by C<xsubpp>. Declares the C<items> variable
1584 to indicate the number of items on the stack.
1588 Sets up the C<ix> variable for an XSUB which has aliases. This is usually
1589 handled automatically by C<xsubpp>.
1593 Opening bracket on a callback. See C<LEAVE> and L<perlcall>.
1599 Used to extend the argument stack for an XSUB's return values.
1605 Analyses the string in order to make fast searches on it using fbm_instr() --
1606 the Boyer-Moore algorithm.
1608 void fbm_compile(SV* sv)
1612 Returns the location of the SV in the string delimited by C<str> and
1613 C<strend>. It returns C<Nullch> if the string can't be found. The
1614 C<sv> does not have to be fbm_compiled, but the search will not be as
1617 char* fbm_instr(char *str, char *strend, SV *sv)
1621 Closing bracket for temporaries on a callback. See C<SAVETMPS> and
1628 Used to indicate array context. See C<GIMME_V>, C<GIMME> and L<perlcall>.
1632 Indicates that arguments returned from a callback should be discarded. See
1637 Used to force a Perl C<eval> wrapper around a callback. See L<perlcall>.
1641 A backward-compatible version of C<GIMME_V> which can only return
1642 C<G_SCALAR> or C<G_ARRAY>; in a void context, it returns C<G_SCALAR>.
1646 The XSUB-writer's equivalent to Perl's C<wantarray>. Returns
1647 C<G_VOID>, C<G_SCALAR> or C<G_ARRAY> for void, scalar or array
1648 context, respectively.
1652 Indicates that no arguments are being sent to a callback. See L<perlcall>.
1656 Used to indicate scalar context. See C<GIMME_V>, C<GIMME>, and L<perlcall>.
1660 Returns the glob with the given C<name> and a defined subroutine or
1661 C<NULL>. The glob lives in the given C<stash>, or in the stashes
1662 accessable via @ISA and @<UNIVERSAL>.
1664 The argument C<level> should be either 0 or -1. If C<level==0>, as a
1665 side-effect creates a glob with the given C<name> in the given
1666 C<stash> which in the case of success contains an alias for the
1667 subroutine, and sets up caching info for this glob. Similarly for all
1668 the searched stashes.
1670 This function grants C<"SUPER"> token as a postfix of the stash name.
1672 The GV returned from C<gv_fetchmeth> may be a method cache entry,
1673 which is not visible to Perl code. So when calling C<perl_call_sv>,
1674 you should not use the GV directly; instead, you should use the
1675 method's CV, which can be obtained from the GV with the C<GvCV> macro.
1677 GV* gv_fetchmeth (HV* stash, char* name, STRLEN len, I32 level)
1679 =item gv_fetchmethod
1681 =item gv_fetchmethod_autoload
1683 Returns the glob which contains the subroutine to call to invoke the
1684 method on the C<stash>. In fact in the presense of autoloading this may
1685 be the glob for "AUTOLOAD". In this case the corresponding variable
1686 $AUTOLOAD is already setup.
1688 The third parameter of C<gv_fetchmethod_autoload> determines whether AUTOLOAD
1689 lookup is performed if the given method is not present: non-zero means
1690 yes, look for AUTOLOAD; zero means no, don't look for AUTOLOAD. Calling
1691 C<gv_fetchmethod> is equivalent to calling C<gv_fetchmethod_autoload> with a
1692 non-zero C<autoload> parameter.
1694 These functions grant C<"SUPER"> token as a prefix of the method name.
1696 Note that if you want to keep the returned glob for a long time, you
1697 need to check for it being "AUTOLOAD", since at the later time the call
1698 may load a different subroutine due to $AUTOLOAD changing its value.
1699 Use the glob created via a side effect to do this.
1701 These functions have the same side-effects and as C<gv_fetchmeth> with
1702 C<level==0>. C<name> should be writable if contains C<':'> or C<'\''>.
1703 The warning against passing the GV returned by C<gv_fetchmeth> to
1704 C<perl_call_sv> apply equally to these functions.
1706 GV* gv_fetchmethod (HV* stash, char* name)
1707 GV* gv_fetchmethod_autoload (HV* stash, char* name, I32 autoload)
1711 Used to indicate void context. See C<GIMME_V> and L<perlcall>.
1715 Returns a pointer to the stash for a specified package. If C<create> is set
1716 then the package will be created if it does not already exist. If C<create>
1717 is not set and the package does not exist then NULL is returned.
1719 HV* gv_stashpv (char* name, I32 create)
1723 Returns a pointer to the stash for a specified package. See C<gv_stashpv>.
1725 HV* gv_stashsv (SV* sv, I32 create)
1729 Return the SV from the GV.
1733 This flag, used in the length slot of hash entries and magic
1734 structures, specifies the structure contains a C<SV*> pointer where a
1735 C<char*> pointer is to be expected. (For information only--not to be used).
1739 Returns the computed hash stored in the hash entry.
1745 Returns the actual pointer stored in the key slot of the hash entry.
1746 The pointer may be either C<char*> or C<SV*>, depending on the value of
1747 C<HeKLEN()>. Can be assigned to. The C<HePV()> or C<HeSVKEY()> macros
1748 are usually preferable for finding the value of a key.
1754 If this is negative, and amounts to C<HEf_SVKEY>, it indicates the entry
1755 holds an C<SV*> key. Otherwise, holds the actual length of the key.
1756 Can be assigned to. The C<HePV()> macro is usually preferable for finding
1763 Returns the key slot of the hash entry as a C<char*> value, doing any
1764 necessary dereferencing of possibly C<SV*> keys. The length of
1765 the string is placed in C<len> (this is a macro, so do I<not> use
1766 C<&len>). If you do not care about what the length of the key is,
1767 you may use the global variable C<na>. Remember though, that hash
1768 keys in perl are free to contain embedded nulls, so using C<strlen()>
1769 or similar is not a good way to find the length of hash keys.
1770 This is very similar to the C<SvPV()> macro described elsewhere in
1773 char* HePV(HE* he, STRLEN len)
1777 Returns the key as an C<SV*>, or C<Nullsv> if the hash entry
1778 does not contain an C<SV*> key.
1784 Returns the key as an C<SV*>. Will create and return a temporary
1785 mortal C<SV*> if the hash entry contains only a C<char*> key.
1787 HeSVKEY_force(HE* he)
1791 Sets the key to a given C<SV*>, taking care to set the appropriate flags
1792 to indicate the presence of an C<SV*> key, and returns the same C<SV*>.
1794 HeSVKEY_set(HE* he, SV* sv)
1798 Returns the value slot (type C<SV*>) stored in the hash entry.
1804 Clears a hash, making it empty.
1806 void hv_clear (HV* tb)
1808 =item hv_delayfree_ent
1810 Releases a hash entry, such as while iterating though the hash, but
1811 delays actual freeing of key and value until the end of the current
1812 statement (or thereabouts) with C<sv_2mortal>. See C<hv_iternext>
1815 void hv_delayfree_ent (HV* hv, HE* entry)
1819 Deletes a key/value pair in the hash. The value SV is removed from the hash
1820 and returned to the caller. The C<klen> is the length of the key. The
1821 C<flags> value will normally be zero; if set to G_DISCARD then NULL will be
1824 SV* hv_delete (HV* tb, char* key, U32 klen, I32 flags)
1828 Deletes a key/value pair in the hash. The value SV is removed from the hash
1829 and returned to the caller. The C<flags> value will normally be zero; if set
1830 to G_DISCARD then NULL will be returned. C<hash> can be a valid precomputed
1831 hash value, or 0 to ask for it to be computed.
1833 SV* hv_delete_ent (HV* tb, SV* key, I32 flags, U32 hash)
1837 Returns a boolean indicating whether the specified hash key exists. The
1838 C<klen> is the length of the key.
1840 bool hv_exists (HV* tb, char* key, U32 klen)
1844 Returns a boolean indicating whether the specified hash key exists. C<hash>
1845 can be a valid precomputed hash value, or 0 to ask for it to be computed.
1847 bool hv_exists_ent (HV* tb, SV* key, U32 hash)
1851 Returns the SV which corresponds to the specified key in the hash. The
1852 C<klen> is the length of the key. If C<lval> is set then the fetch will be
1853 part of a store. Check that the return value is non-null before
1854 dereferencing it to a C<SV*>.
1856 See L<Understanding the Magic of Tied Hashes and Arrays> for more
1857 information on how to use this function on tied hashes.
1859 SV** hv_fetch (HV* tb, char* key, U32 klen, I32 lval)
1863 Returns the hash entry which corresponds to the specified key in the hash.
1864 C<hash> must be a valid precomputed hash number for the given C<key>, or
1865 0 if you want the function to compute it. IF C<lval> is set then the
1866 fetch will be part of a store. Make sure the return value is non-null
1867 before accessing it. The return value when C<tb> is a tied hash
1868 is a pointer to a static location, so be sure to make a copy of the
1869 structure if you need to store it somewhere.
1871 See L<Understanding the Magic of Tied Hashes and Arrays> for more
1872 information on how to use this function on tied hashes.
1874 HE* hv_fetch_ent (HV* tb, SV* key, I32 lval, U32 hash)
1878 Releases a hash entry, such as while iterating though the hash. See
1879 C<hv_iternext> and C<hv_delayfree_ent>.
1881 void hv_free_ent (HV* hv, HE* entry)
1885 Prepares a starting point to traverse a hash table.
1887 I32 hv_iterinit (HV* tb)
1889 Note that hv_iterinit I<currently> returns the number of I<buckets> in
1890 the hash and I<not> the number of keys (as indicated in the Advanced
1891 Perl Programming book). This may change in future. Use the HvKEYS(hv)
1892 macro to find the number of keys in a hash.
1896 Returns the key from the current position of the hash iterator. See
1899 char* hv_iterkey (HE* entry, I32* retlen)
1903 Returns the key as an C<SV*> from the current position of the hash
1904 iterator. The return value will always be a mortal copy of the
1905 key. Also see C<hv_iterinit>.
1907 SV* hv_iterkeysv (HE* entry)
1911 Returns entries from a hash iterator. See C<hv_iterinit>.
1913 HE* hv_iternext (HV* tb)
1917 Performs an C<hv_iternext>, C<hv_iterkey>, and C<hv_iterval> in one
1920 SV* hv_iternextsv (HV* hv, char** key, I32* retlen)
1924 Returns the value from the current position of the hash iterator. See
1927 SV* hv_iterval (HV* tb, HE* entry)
1931 Adds magic to a hash. See C<sv_magic>.
1933 void hv_magic (HV* hv, GV* gv, int how)
1937 Returns the package name of a stash. See C<SvSTASH>, C<CvSTASH>.
1939 char* HvNAME (HV* stash)
1943 Stores an SV in a hash. The hash key is specified as C<key> and C<klen> is
1944 the length of the key. The C<hash> parameter is the precomputed hash
1945 value; if it is zero then Perl will compute it. The return value will be
1946 NULL if the operation failed or if the value did not need to be actually
1947 stored within the hash (as in the case of tied hashes). Otherwise it can
1948 be dereferenced to get the original C<SV*>. Note that the caller is
1949 responsible for suitably incrementing the reference count of C<val>
1950 before the call, and decrementing it if the function returned NULL.
1952 See L<Understanding the Magic of Tied Hashes and Arrays> for more
1953 information on how to use this function on tied hashes.
1955 SV** hv_store (HV* tb, char* key, U32 klen, SV* val, U32 hash)
1959 Stores C<val> in a hash. The hash key is specified as C<key>. The C<hash>
1960 parameter is the precomputed hash value; if it is zero then Perl will
1961 compute it. The return value is the new hash entry so created. It will be
1962 NULL if the operation failed or if the value did not need to be actually
1963 stored within the hash (as in the case of tied hashes). Otherwise the
1964 contents of the return value can be accessed using the C<He???> macros
1965 described here. Note that the caller is responsible for suitably
1966 incrementing the reference count of C<val> before the call, and decrementing
1967 it if the function returned NULL.
1969 See L<Understanding the Magic of Tied Hashes and Arrays> for more
1970 information on how to use this function on tied hashes.
1972 HE* hv_store_ent (HV* tb, SV* key, SV* val, U32 hash)
1978 void hv_undef (HV* tb)
1982 Returns a boolean indicating whether the C C<char> is an ascii alphanumeric
1985 int isALNUM (char c)
1989 Returns a boolean indicating whether the C C<char> is an ascii alphabetic
1992 int isALPHA (char c)
1996 Returns a boolean indicating whether the C C<char> is an ascii digit.
1998 int isDIGIT (char c)
2002 Returns a boolean indicating whether the C C<char> is a lowercase character.
2004 int isLOWER (char c)
2008 Returns a boolean indicating whether the C C<char> is whitespace.
2010 int isSPACE (char c)
2014 Returns a boolean indicating whether the C C<char> is an uppercase character.
2016 int isUPPER (char c)
2020 Variable which is setup by C<xsubpp> to indicate the number of items on the
2021 stack. See L<perlxs/"Variable-length Parameter Lists">.
2025 Variable which is setup by C<xsubpp> to indicate which of an XSUB's aliases
2026 was used to invoke it. See L<perlxs/"The ALIAS: Keyword">.
2030 Closing bracket on a callback. See C<ENTER> and L<perlcall>.
2034 =item looks_like_number
2036 Test if an the content of an SV looks like a number (or is a number).
2038 int looks_like_number(SV*)
2043 Stack marker variable for the XSUB. See C<dMARK>.
2047 Clear something magical that the SV represents. See C<sv_magic>.
2049 int mg_clear (SV* sv)
2053 Copies the magic from one SV to another. See C<sv_magic>.
2055 int mg_copy (SV *, SV *, char *, STRLEN)
2059 Finds the magic pointer for type matching the SV. See C<sv_magic>.
2061 MAGIC* mg_find (SV* sv, int type)
2065 Free any magic storage used by the SV. See C<sv_magic>.
2067 int mg_free (SV* sv)
2071 Do magic after a value is retrieved from the SV. See C<sv_magic>.
2077 Report on the SV's length. See C<sv_magic>.
2083 Turns on the magical status of an SV. See C<sv_magic>.
2085 void mg_magical (SV* sv)
2089 Do magic after a value is assigned to the SV. See C<sv_magic>.
2095 The XSUB-writer's interface to the C C<memmove> function. The C<s> is the
2096 source, C<d> is the destination, C<n> is the number of items, and C<t> is
2097 the type. Can do overlapping moves. See also C<Copy>.
2099 void Move( s, d, n, t )
2103 A variable which may be used with C<SvPV> to tell Perl to calculate the
2108 The XSUB-writer's interface to the C C<malloc> function.
2110 void* New( x, void *ptr, int size, type )
2114 Creates a new AV. The reference count is set to 1.
2120 The XSUB-writer's interface to the C C<malloc> function, with cast.
2122 void* Newc( x, void *ptr, int size, type, cast )
2126 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }>
2127 which is eligible for inlining at compile-time.
2129 void newCONSTSUB(HV* stash, char* name, SV* sv)
2133 Creates a new HV. The reference count is set to 1.
2139 Creates an RV wrapper for an SV. The reference count for the original SV is
2142 SV* newRV_inc (SV* ref)
2144 For historical reasons, "newRV" is a synonym for "newRV_inc".
2148 Creates an RV wrapper for an SV. The reference count for the original
2149 SV is B<not> incremented.
2151 SV* newRV_noinc (SV* ref)
2155 Creates a new SV. A non-zero C<len> parameter indicates the number of
2156 bytes of preallocated string space the SV should have. An extra byte
2157 for a tailing NUL is also reserved. (SvPOK is not set for the SV even
2158 if string space is allocated.) The reference count for the new SV is
2159 set to 1. C<id> is an integer id between 0 and 1299 (used to identify
2162 SV* NEWSV (int id, STRLEN len)
2166 Creates a new SV and copies an integer into it. The reference count for the
2173 Creates a new SV and copies a double into it. The reference count for the
2180 Creates a new SV and copies a string into it. The reference count for the
2181 SV is set to 1. If C<len> is zero then Perl will compute the length.
2183 SV* newSVpv (char* s, STRLEN len)
2187 Creates a new SV an initialize it with the string formatted like
2190 SV* newSVpvf(const char* pat, ...);
2194 Creates a new SV and copies a string into it. The reference count for the
2195 SV is set to 1. If C<len> is zero then Perl will create a zero length
2198 SV* newSVpvn (char* s, STRLEN len)
2202 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
2203 it will be upgraded to one. If C<classname> is non-null then the new SV will
2204 be blessed in the specified package. The new SV is returned and its
2205 reference count is 1.
2207 SV* newSVrv (SV* rv, char* classname)
2211 Creates a new SV which is an exact duplicate of the original SV.
2213 SV* newSVsv (SV* old)
2217 Used by C<xsubpp> to hook up XSUBs as Perl subs.
2221 Used by C<xsubpp> to hook up XSUBs as Perl subs. Adds Perl prototypes to
2226 The XSUB-writer's interface to the C C<malloc> function. The allocated
2227 memory is zeroed with C<memzero>.
2229 void* Newz( x, void *ptr, int size, type )
2237 Null character pointer.
2253 The original stack mark for the XSUB. See C<dORIGMARK>.
2257 Allocates a new Perl interpreter. See L<perlembed>.
2259 =item perl_call_argv
2261 Performs a callback to the specified Perl sub. See L<perlcall>.
2263 I32 perl_call_argv (char* subname, I32 flags, char** argv)
2265 =item perl_call_method
2267 Performs a callback to the specified Perl method. The blessed object must
2268 be on the stack. See L<perlcall>.
2270 I32 perl_call_method (char* methname, I32 flags)
2274 Performs a callback to the specified Perl sub. See L<perlcall>.
2276 I32 perl_call_pv (char* subname, I32 flags)
2280 Performs a callback to the Perl sub whose name is in the SV. See
2283 I32 perl_call_sv (SV* sv, I32 flags)
2285 =item perl_construct
2287 Initializes a new Perl interpreter. See L<perlembed>.
2291 Shuts down a Perl interpreter. See L<perlembed>.
2295 Tells Perl to C<eval> the string in the SV.
2297 I32 perl_eval_sv (SV* sv, I32 flags)
2301 Tells Perl to C<eval> the given string and return an SV* result.
2303 SV* perl_eval_pv (char* p, I32 croak_on_error)
2307 Releases a Perl interpreter. See L<perlembed>.
2311 Returns the AV of the specified Perl array. If C<create> is set and the
2312 Perl variable does not exist then it will be created. If C<create> is not
2313 set and the variable does not exist then NULL is returned.
2315 AV* perl_get_av (char* name, I32 create)
2319 Returns the CV of the specified Perl sub. If C<create> is set and the Perl
2320 variable does not exist then it will be created. If C<create> is not
2321 set and the variable does not exist then NULL is returned.
2323 CV* perl_get_cv (char* name, I32 create)
2327 Returns the HV of the specified Perl hash. If C<create> is set and the Perl
2328 variable does not exist then it will be created. If C<create> is not
2329 set and the variable does not exist then NULL is returned.
2331 HV* perl_get_hv (char* name, I32 create)
2335 Returns the SV of the specified Perl scalar. If C<create> is set and the
2336 Perl variable does not exist then it will be created. If C<create> is not
2337 set and the variable does not exist then NULL is returned.
2339 SV* perl_get_sv (char* name, I32 create)
2343 Tells a Perl interpreter to parse a Perl script. See L<perlembed>.
2345 =item perl_require_pv
2347 Tells Perl to C<require> a module.
2349 void perl_require_pv (char* pv)
2353 Tells a Perl interpreter to run. See L<perlembed>.
2357 Pops an integer off the stack.
2363 Pops a long off the stack.
2369 Pops a string off the stack.
2375 Pops a double off the stack.
2381 Pops an SV off the stack.
2387 Opening bracket for arguments on a callback. See C<PUTBACK> and L<perlcall>.
2393 Push an integer onto the stack. The stack must have room for this element.
2394 Handles 'set' magic. See C<XPUSHi>.
2400 Push a double onto the stack. The stack must have room for this element.
2401 Handles 'set' magic. See C<XPUSHn>.
2403 void PUSHn(double d)
2407 Push a string onto the stack. The stack must have room for this element.
2408 The C<len> indicates the length of the string. Handles 'set' magic. See
2411 void PUSHp(char *c, int len )
2415 Push an SV onto the stack. The stack must have room for this element. Does
2416 not handle 'set' magic. See C<XPUSHs>.
2422 Push an unsigned integer onto the stack. The stack must have room for
2423 this element. See C<XPUSHu>.
2425 void PUSHu(unsigned int d)
2430 Closing bracket for XSUB arguments. This is usually handled by C<xsubpp>.
2431 See C<PUSHMARK> and L<perlcall> for other uses.
2437 The XSUB-writer's interface to the C C<realloc> function.
2439 void* Renew( void *ptr, int size, type )
2443 The XSUB-writer's interface to the C C<realloc> function, with cast.
2445 void* Renewc( void *ptr, int size, type, cast )
2449 Variable which is setup by C<xsubpp> to hold the return value for an XSUB.
2450 This is always the proper type for the XSUB.
2451 See L<perlxs/"The RETVAL Variable">.
2455 The XSUB-writer's interface to the C C<free> function.
2459 The XSUB-writer's interface to the C C<malloc> function.
2463 The XSUB-writer's interface to the C C<realloc> function.
2467 Copy a string to a safe spot. This does not use an SV.
2469 char* savepv (char* sv)
2473 Copy a string to a safe spot. The C<len> indicates number of bytes to
2474 copy. This does not use an SV.
2476 char* savepvn (char* sv, I32 len)
2480 Opening bracket for temporaries on a callback. See C<FREETMPS> and
2487 Stack pointer. This is usually handled by C<xsubpp>. See C<dSP> and
2492 Refetch the stack pointer. Used after a callback. See L<perlcall>.
2498 Used to access elements on the XSUB's stack.
2504 Test two strings to see if they are equal. Returns true or false.
2506 int strEQ( char *s1, char *s2 )
2510 Test two strings to see if the first, C<s1>, is greater than or equal to the
2511 second, C<s2>. Returns true or false.
2513 int strGE( char *s1, char *s2 )
2517 Test two strings to see if the first, C<s1>, is greater than the second,
2518 C<s2>. Returns true or false.
2520 int strGT( char *s1, char *s2 )
2524 Test two strings to see if the first, C<s1>, is less than or equal to the
2525 second, C<s2>. Returns true or false.
2527 int strLE( char *s1, char *s2 )
2531 Test two strings to see if the first, C<s1>, is less than the second,
2532 C<s2>. Returns true or false.
2534 int strLT( char *s1, char *s2 )
2538 Test two strings to see if they are different. Returns true or false.
2540 int strNE( char *s1, char *s2 )
2544 Test two strings to see if they are equal. The C<len> parameter indicates
2545 the number of bytes to compare. Returns true or false.
2547 int strnEQ( char *s1, char *s2 )
2551 Test two strings to see if they are different. The C<len> parameter
2552 indicates the number of bytes to compare. Returns true or false.
2554 int strnNE( char *s1, char *s2, int len )
2558 Marks an SV as mortal. The SV will be destroyed when the current context
2561 SV* sv_2mortal (SV* sv)
2565 Blesses an SV into a specified package. The SV must be an RV. The package
2566 must be designated by its stash (see C<gv_stashpv()>). The reference count
2567 of the SV is unaffected.
2569 SV* sv_bless (SV* sv, HV* stash)
2573 Concatenates the string onto the end of the string which is in the SV.
2574 Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
2576 void sv_catpv (SV* sv, char* ptr)
2580 Like C<sv_catpv>, but also handles 'set' magic.
2582 void sv_catpvn (SV* sv, char* ptr)
2586 Concatenates the string onto the end of the string which is in the SV. The
2587 C<len> indicates number of bytes to copy. Handles 'get' magic, but not
2588 'set' magic. See C<sv_catpvn_mg>.
2590 void sv_catpvn (SV* sv, char* ptr, STRLEN len)
2594 Like C<sv_catpvn>, but also handles 'set' magic.
2596 void sv_catpvn_mg (SV* sv, char* ptr, STRLEN len)
2600 Processes its arguments like C<sprintf> and appends the formatted output
2601 to an SV. Handles 'get' magic, but not 'set' magic. C<SvSETMAGIC()> must
2602 typically be called after calling this function to handle 'set' magic.
2604 void sv_catpvf (SV* sv, const char* pat, ...)
2608 Like C<sv_catpvf>, but also handles 'set' magic.
2610 void sv_catpvf_mg (SV* sv, const char* pat, ...)
2614 Concatenates the string from SV C<ssv> onto the end of the string in SV
2615 C<dsv>. Handles 'get' magic, but not 'set' magic. See C<sv_catsv_mg>.
2617 void sv_catsv (SV* dsv, SV* ssv)
2621 Like C<sv_catsv>, but also handles 'set' magic.
2623 void sv_catsv_mg (SV* dsv, SV* ssv)
2627 Efficient removal of characters from the beginning of the string
2628 buffer. SvPOK(sv) must be true and the C<ptr> must be a pointer to
2629 somewhere inside the string buffer. The C<ptr> becomes the first
2630 character of the adjusted string.
2632 void sv_chop(SV* sv, char *ptr)
2637 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
2638 string in C<sv1> is less than, equal to, or greater than the string in
2641 I32 sv_cmp (SV* sv1, SV* sv2)
2645 Returns the length of the string which is in the SV. See C<SvLEN>.
2651 Set the length of the string which is in the SV. See C<SvCUR>.
2653 void SvCUR_set (SV* sv, int val )
2657 Auto-decrement of the value in the SV.
2659 void sv_dec (SV* sv)
2661 =item sv_derived_from
2663 Returns a boolean indicating whether the SV is a subclass of the
2666 int sv_derived_from(SV* sv, char* class)
2670 Returns a pointer to the last character in the string which is in the SV.
2671 See C<SvCUR>. Access the character as
2677 Returns a boolean indicating whether the strings in the two SVs are
2680 I32 sv_eq (SV* sv1, SV* sv2)
2684 Invokes C<mg_get> on an SV if it has 'get' magic. This macro evaluates
2685 its argument more than once.
2687 void SvGETMAGIC( SV *sv )
2691 Expands the character buffer in the SV so that it has room for the
2692 indicated number of bytes (remember to reserve space for an extra
2693 trailing NUL character). Calls C<sv_grow> to perform the expansion if
2694 necessary. Returns a pointer to the character buffer.
2696 char* SvGROW( SV* sv, int len )
2700 Expands the character buffer in the SV. This will use C<sv_unref> and will
2701 upgrade the SV to C<SVt_PV>. Returns a pointer to the character buffer.
2706 Auto-increment of the value in the SV.
2708 void sv_inc (SV* sv)
2712 Inserts a string at the specified offset/length within the SV.
2713 Similar to the Perl substr() function.
2715 void sv_insert(SV *sv, STRLEN offset, STRLEN len,
2716 char *str, STRLEN strlen)
2720 Returns a boolean indicating whether the SV contains an integer.
2726 Unsets the IV status of an SV.
2728 void SvIOK_off (SV* sv)
2732 Tells an SV that it is an integer.
2734 void SvIOK_on (SV* sv)
2738 Tells an SV that it is an integer and disables all other OK bits.
2740 void SvIOK_only (SV* sv)
2744 Returns a boolean indicating whether the SV contains an integer. Checks the
2745 B<private> setting. Use C<SvIOK>.
2751 Returns a boolean indicating whether the SV is blessed into the specified
2752 class. This does not know how to check for subtype, so it doesn't work in
2753 an inheritance relationship.
2755 int sv_isa (SV* sv, char* name)
2759 Returns a boolean indicating whether the SV is an RV pointing to a blessed
2760 object. If the SV is not an RV, or if the object is not blessed, then this
2763 int sv_isobject (SV* sv)
2767 Returns the integer which is in the SV.
2773 Returns the integer which is stored in the SV.
2779 Returns the size of the string buffer in the SV. See C<SvCUR>.
2785 Returns the length of the string in the SV. Use C<SvCUR>.
2787 STRLEN sv_len (SV* sv)
2791 Adds magic to an SV.
2793 void sv_magic (SV* sv, SV* obj, int how, char* name, I32 namlen)
2797 Creates a new SV which is a copy of the original SV. The new SV is marked
2800 SV* sv_mortalcopy (SV* oldsv)
2804 Creates a new SV which is mortal. The reference count of the SV is set to 1.
2806 SV* sv_newmortal (void)
2810 Returns a boolean indicating whether the SV contains a number, integer or
2817 Unsets the NV/IV status of an SV.
2819 void SvNIOK_off (SV* sv)
2823 Returns a boolean indicating whether the SV contains a number, integer or
2824 double. Checks the B<private> setting. Use C<SvNIOK>.
2826 int SvNIOKp (SV* SV)
2830 This is the C<false> SV. See C<sv_yes>. Always refer to this as C<&sv_no>.
2834 Returns a boolean indicating whether the SV contains a double.
2840 Unsets the NV status of an SV.
2842 void SvNOK_off (SV* sv)
2846 Tells an SV that it is a double.
2848 void SvNOK_on (SV* sv)
2852 Tells an SV that it is a double and disables all other OK bits.
2854 void SvNOK_only (SV* sv)
2858 Returns a boolean indicating whether the SV contains a double. Checks the
2859 B<private> setting. Use C<SvNOK>.
2865 Returns the double which is stored in the SV.
2867 double SvNV (SV* sv)
2871 Returns the double which is stored in the SV.
2873 double SvNVX (SV* sv)
2877 Returns a boolean indicating whether the value is an SV.
2883 Returns a boolean indicating whether the SvIVX is a valid offset value
2884 for the SvPVX. This hack is used internally to speed up removal of
2885 characters from the beginning of a SvPV. When SvOOK is true, then the
2886 start of the allocated string buffer is really (SvPVX - SvIVX).
2892 Returns a boolean indicating whether the SV contains a character string.
2898 Unsets the PV status of an SV.
2900 void SvPOK_off (SV* sv)
2904 Tells an SV that it is a string.
2906 void SvPOK_on (SV* sv)
2910 Tells an SV that it is a string and disables all other OK bits.
2912 void SvPOK_only (SV* sv)
2916 Returns a boolean indicating whether the SV contains a character string.
2917 Checks the B<private> setting. Use C<SvPOK>.
2923 Returns a pointer to the string in the SV, or a stringified form of the SV
2924 if the SV does not contain a string. If C<len> is C<na> then Perl will
2925 handle the length on its own. Handles 'get' magic.
2927 char* SvPV (SV* sv, int len )
2931 Like <SvPV> but will force the SV into becoming a string (SvPOK). You
2932 want force if you are going to update the SvPVX directly.
2934 char* SvPV_force(SV* sv, int len)
2939 Returns a pointer to the string in the SV. The SV must contain a string.
2941 char* SvPVX (SV* sv)
2945 Returns the value of the object's reference count.
2947 int SvREFCNT (SV* sv)
2951 Decrements the reference count of the given SV.
2953 void SvREFCNT_dec (SV* sv)
2957 Increments the reference count of the given SV.
2959 void SvREFCNT_inc (SV* sv)
2963 Tests if the SV is an RV.
2969 Unsets the RV status of an SV.
2971 void SvROK_off (SV* sv)
2975 Tells an SV that it is an RV.
2977 void SvROK_on (SV* sv)
2981 Dereferences an RV to return the SV.
2987 Invokes C<mg_set> on an SV if it has 'set' magic. This macro evaluates
2988 its argument more than once.
2990 void SvSETMAGIC( SV *sv )
2994 Copies an integer into the given SV. Does not handle 'set' magic.
2997 void sv_setiv (SV* sv, IV num)
3001 Like C<sv_setiv>, but also handles 'set' magic.
3003 void sv_setiv_mg (SV* sv, IV num)
3007 Copies a double into the given SV. Does not handle 'set' magic.
3010 void sv_setnv (SV* sv, double num)
3014 Like C<sv_setnv>, but also handles 'set' magic.
3016 void sv_setnv_mg (SV* sv, double num)
3020 Copies a string into an SV. The string must be null-terminated.
3021 Does not handle 'set' magic. See C<sv_setpv_mg>.
3023 void sv_setpv (SV* sv, char* ptr)
3027 Like C<sv_setpv>, but also handles 'set' magic.
3029 void sv_setpv_mg (SV* sv, char* ptr)
3033 Copies an integer into the given SV, also updating its string value.
3034 Does not handle 'set' magic. See C<sv_setpviv_mg>.
3036 void sv_setpviv (SV* sv, IV num)
3040 Like C<sv_setpviv>, but also handles 'set' magic.
3042 void sv_setpviv_mg (SV* sv, IV num)
3046 Copies a string into an SV. The C<len> parameter indicates the number of
3047 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
3049 void sv_setpvn (SV* sv, char* ptr, STRLEN len)
3053 Like C<sv_setpvn>, but also handles 'set' magic.
3055 void sv_setpvn_mg (SV* sv, char* ptr, STRLEN len)
3059 Processes its arguments like C<sprintf> and sets an SV to the formatted
3060 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
3062 void sv_setpvf (SV* sv, const char* pat, ...)
3066 Like C<sv_setpvf>, but also handles 'set' magic.
3068 void sv_setpvf_mg (SV* sv, const char* pat, ...)
3072 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
3073 argument will be upgraded to an RV. That RV will be modified to point to
3074 the new SV. The C<classname> argument indicates the package for the
3075 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
3076 will be returned and will have a reference count of 1.
3078 SV* sv_setref_iv (SV *rv, char *classname, IV iv)
3082 Copies a double into a new SV, optionally blessing the SV. The C<rv>
3083 argument will be upgraded to an RV. That RV will be modified to point to
3084 the new SV. The C<classname> argument indicates the package for the
3085 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
3086 will be returned and will have a reference count of 1.
3088 SV* sv_setref_nv (SV *rv, char *classname, double nv)
3092 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
3093 argument will be upgraded to an RV. That RV will be modified to point to
3094 the new SV. If the C<pv> argument is NULL then C<sv_undef> will be placed
3095 into the SV. The C<classname> argument indicates the package for the
3096 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
3097 will be returned and will have a reference count of 1.
3099 SV* sv_setref_pv (SV *rv, char *classname, void* pv)
3101 Do not use with integral Perl types such as HV, AV, SV, CV, because those
3102 objects will become corrupted by the pointer copy process.
3104 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
3108 Copies a string into a new SV, optionally blessing the SV. The length of the
3109 string must be specified with C<n>. The C<rv> argument will be upgraded to
3110 an RV. That RV will be modified to point to the new SV. The C<classname>
3111 argument indicates the package for the blessing. Set C<classname> to
3112 C<Nullch> to avoid the blessing. The new SV will be returned and will have
3113 a reference count of 1.
3115 SV* sv_setref_pvn (SV *rv, char *classname, char* pv, I32 n)
3117 Note that C<sv_setref_pv> copies the pointer while this copies the string.
3121 Calls C<sv_setsv> if dsv is not the same as ssv. May evaluate arguments
3124 void SvSetSV (SV* dsv, SV* ssv)
3126 =item SvSetSV_nosteal
3128 Calls a non-destructive version of C<sv_setsv> if dsv is not the same as ssv.
3129 May evaluate arguments more than once.
3131 void SvSetSV_nosteal (SV* dsv, SV* ssv)
3135 Copies the contents of the source SV C<ssv> into the destination SV C<dsv>.
3136 The source SV may be destroyed if it is mortal. Does not handle 'set' magic.
3137 See the macro forms C<SvSetSV>, C<SvSetSV_nosteal> and C<sv_setsv_mg>.
3139 void sv_setsv (SV* dsv, SV* ssv)
3143 Like C<sv_setsv>, but also handles 'set' magic.
3145 void sv_setsv_mg (SV* dsv, SV* ssv)
3149 Copies an unsigned integer into the given SV. Does not handle 'set' magic.
3152 void sv_setuv (SV* sv, UV num)
3156 Like C<sv_setuv>, but also handles 'set' magic.
3158 void sv_setuv_mg (SV* sv, UV num)
3162 Returns the stash of the SV.
3164 HV* SvSTASH (SV* sv)
3168 Taints an SV if tainting is enabled
3170 void SvTAINT (SV* sv)
3174 Checks to see if an SV is tainted. Returns TRUE if it is, FALSE if not.
3176 int SvTAINTED (SV* sv)
3180 Untaints an SV. Be I<very> careful with this routine, as it short-circuits
3181 some of Perl's fundamental security features. XS module authors should
3182 not use this function unless they fully understand all the implications
3183 of unconditionally untainting the value. Untainting should be done in
3184 the standard perl fashion, via a carefully crafted regexp, rather than
3185 directly untainting variables.
3187 void SvTAINTED_off (SV* sv)
3191 Marks an SV as tainted.
3193 void SvTAINTED_on (SV* sv)
3197 Integer type flag for scalars. See C<svtype>.
3201 Pointer type flag for scalars. See C<svtype>.
3205 Type flag for arrays. See C<svtype>.
3209 Type flag for code refs. See C<svtype>.
3213 Type flag for hashes. See C<svtype>.
3217 Type flag for blessed scalars. See C<svtype>.
3221 Double type flag for scalars. See C<svtype>.
3225 Returns a boolean indicating whether Perl would evaluate the SV as true or
3226 false, defined or undefined. Does not handle 'get' magic.
3232 Returns the type of the SV. See C<svtype>.
3234 svtype SvTYPE (SV* sv)
3238 An enum of flags for Perl types. These are found in the file B<sv.h> in the
3239 C<svtype> enum. Test these flags with the C<SvTYPE> macro.
3243 This is the C<undef> SV. Always refer to this as C<&sv_undef>.
3247 Unsets the RV status of the SV, and decrements the reference count of
3248 whatever was being referenced by the RV. This can almost be thought of
3249 as a reversal of C<newSVrv>. See C<SvROK_off>.
3251 void sv_unref (SV* sv)
3255 Used to upgrade an SV to a more complex form. Uses C<sv_upgrade> to perform
3256 the upgrade if necessary. See C<svtype>.
3258 bool SvUPGRADE (SV* sv, svtype mt)
3262 Upgrade an SV to a more complex form. Use C<SvUPGRADE>. See C<svtype>.
3266 Tells an SV to use C<ptr> to find its string value. Normally the string is
3267 stored inside the SV but sv_usepvn allows the SV to use an outside string.
3268 The C<ptr> should point to memory that was allocated by C<malloc>. The
3269 string length, C<len>, must be supplied. This function will realloc the
3270 memory pointed to by C<ptr>, so that pointer should not be freed or used by
3271 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
3272 See C<sv_usepvn_mg>.
3274 void sv_usepvn (SV* sv, char* ptr, STRLEN len)
3278 Like C<sv_usepvn>, but also handles 'set' magic.
3280 void sv_usepvn_mg (SV* sv, char* ptr, STRLEN len)
3284 Returns the unsigned integer which is in the SV.
3290 Returns the unsigned integer which is stored in the SV.
3296 This is the C<true> SV. See C<sv_no>. Always refer to this as C<&sv_yes>.
3300 Variable which is setup by C<xsubpp> to designate the object in a C++ XSUB.
3301 This is always the proper type for the C++ object. See C<CLASS> and
3302 L<perlxs/"Using XS With C++">.
3306 Converts the specified character to lowercase.
3308 int toLOWER (char c)
3312 Converts the specified character to uppercase.
3314 int toUPPER (char c)
3318 This is the XSUB-writer's interface to Perl's C<warn> function. Use this
3319 function the same way you use the C C<printf> function. See C<croak()>.
3323 Push an integer onto the stack, extending the stack if necessary. Handles
3324 'set' magic. See C<PUSHi>.
3330 Push a double onto the stack, extending the stack if necessary. Handles 'set'
3331 magic. See C<PUSHn>.
3337 Push a string onto the stack, extending the stack if necessary. The C<len>
3338 indicates the length of the string. Handles 'set' magic. See C<PUSHp>.
3340 XPUSHp(char *c, int len)
3344 Push an SV onto the stack, extending the stack if necessary. Does not
3345 handle 'set' magic. See C<PUSHs>.
3351 Push an unsigned integer onto the stack, extending the stack if
3352 necessary. See C<PUSHu>.
3356 Macro to declare an XSUB and its C parameter list. This is handled by
3361 Return from XSUB, indicating number of items on the stack. This is usually
3362 handled by C<xsubpp>.
3366 =item XSRETURN_EMPTY
3368 Return an empty list from an XSUB immediately.
3374 Return an integer from an XSUB immediately. Uses C<XST_mIV>.
3380 Return C<&sv_no> from an XSUB immediately. Uses C<XST_mNO>.
3386 Return an double from an XSUB immediately. Uses C<XST_mNV>.
3392 Return a copy of a string from an XSUB immediately. Uses C<XST_mPV>.
3394 XSRETURN_PV(char *v)
3396 =item XSRETURN_UNDEF
3398 Return C<&sv_undef> from an XSUB immediately. Uses C<XST_mUNDEF>.
3404 Return C<&sv_yes> from an XSUB immediately. Uses C<XST_mYES>.
3410 Place an integer into the specified position C<i> on the stack. The value is
3411 stored in a new mortal SV.
3413 XST_mIV( int i, IV v )
3417 Place a double into the specified position C<i> on the stack. The value is
3418 stored in a new mortal SV.
3420 XST_mNV( int i, NV v )
3424 Place C<&sv_no> into the specified position C<i> on the stack.
3430 Place a copy of a string into the specified position C<i> on the stack. The
3431 value is stored in a new mortal SV.
3433 XST_mPV( int i, char *v )
3437 Place C<&sv_undef> into the specified position C<i> on the stack.
3443 Place C<&sv_yes> into the specified position C<i> on the stack.
3449 The version identifier for an XS module. This is usually handled
3450 automatically by C<ExtUtils::MakeMaker>. See C<XS_VERSION_BOOTCHECK>.
3452 =item XS_VERSION_BOOTCHECK
3454 Macro to verify that a PM module's $VERSION variable matches the XS module's
3455 C<XS_VERSION> variable. This is usually handled automatically by
3456 C<xsubpp>. See L<perlxs/"The VERSIONCHECK: Keyword">.
3460 The XSUB-writer's interface to the C C<memzero> function. The C<d> is the
3461 destination, C<n> is the number of items, and C<t> is the type.
3463 void Zero( d, n, t )
3469 Until May 1997, this document was maintained by Jeff Okamoto
3470 <okamoto@corp.hp.com>. It is now maintained as part of Perl itself.
3472 With lots of help and suggestions from Dean Roehrich, Malcolm Beattie,
3473 Andreas Koenig, Paul Hudson, Ilya Zakharevich, Paul Marquess, Neil
3474 Bowers, Matthew Green, Tim Bunce, Spider Boardman, Ulrich Pfeifer,
3475 Stephen McCamant, and Gurusamy Sarathy.
3477 API Listing originally by Dean Roehrich <roehrich@cray.com>.