xref: /openbsd-src/gnu/usr.bin/perl/pod/perlhacktips.pod (revision 897fc685943471cf985a0fe38ba076ea6fe74fa5)
1
2=encoding utf8
3
4=for comment
5Consistent formatting of this file is achieved with:
6  perl ./Porting/podtidy pod/perlhacktips.pod
7
8=head1 NAME
9
10perlhacktips - Tips for Perl core C code hacking
11
12=head1 DESCRIPTION
13
14This document will help you learn the best way to go about hacking on
15the Perl core C code.  It covers common problems, debugging, profiling,
16and more.
17
18If you haven't read L<perlhack> and L<perlhacktut> yet, you might want
19to do that first.
20
21=head1 COMMON PROBLEMS
22
23Perl source plays by ANSI C89 rules: no C99 (or C++) extensions.  In
24some cases we have to take pre-ANSI requirements into consideration.
25You don't care about some particular platform having broken Perl? I
26hear there is still a strong demand for J2EE programmers.
27
28=head2 Perl environment problems
29
30=over 4
31
32=item *
33
34Not compiling with threading
35
36Compiling with threading (-Duseithreads) completely rewrites the
37function prototypes of Perl.  You better try your changes with that.
38Related to this is the difference between "Perl_-less" and "Perl_-ly"
39APIs, for example:
40
41  Perl_sv_setiv(aTHX_ ...);
42  sv_setiv(...);
43
44The first one explicitly passes in the context, which is needed for
45e.g. threaded builds.  The second one does that implicitly; do not get
46them mixed.  If you are not passing in a aTHX_, you will need to do a
47dTHX (or a dVAR) as the first thing in the function.
48
49See L<perlguts/"How multiple interpreters and concurrency are
50supported"> for further discussion about context.
51
52=item *
53
54Not compiling with -DDEBUGGING
55
56The DEBUGGING define exposes more code to the compiler, therefore more
57ways for things to go wrong.  You should try it.
58
59=item *
60
61Introducing (non-read-only) globals
62
63Do not introduce any modifiable globals, truly global or file static.
64They are bad form and complicate multithreading and other forms of
65concurrency.  The right way is to introduce them as new interpreter
66variables, see F<intrpvar.h> (at the very end for binary
67compatibility).
68
69Introducing read-only (const) globals is okay, as long as you verify
70with e.g. C<nm libperl.a|egrep -v ' [TURtr] '> (if your C<nm> has
71BSD-style output) that the data you added really is read-only.  (If it
72is, it shouldn't show up in the output of that command.)
73
74If you want to have static strings, make them constant:
75
76  static const char etc[] = "...";
77
78If you want to have arrays of constant strings, note carefully the
79right combination of C<const>s:
80
81    static const char * const yippee[] =
82        {"hi", "ho", "silver"};
83
84There is a way to completely hide any modifiable globals (they are all
85moved to heap), the compilation setting
86C<-DPERL_GLOBAL_STRUCT_PRIVATE>.  It is not normally used, but can be
87used for testing, read more about it in L<perlguts/"Background and
88PERL_IMPLICIT_CONTEXT">.
89
90=item *
91
92Not exporting your new function
93
94Some platforms (Win32, AIX, VMS, OS/2, to name a few) require any
95function that is part of the public API (the shared Perl library) to be
96explicitly marked as exported.  See the discussion about F<embed.pl> in
97L<perlguts>.
98
99=item *
100
101Exporting your new function
102
103The new shiny result of either genuine new functionality or your
104arduous refactoring is now ready and correctly exported.  So what could
105possibly go wrong?
106
107Maybe simply that your function did not need to be exported in the
108first place.  Perl has a long and not so glorious history of exporting
109functions that it should not have.
110
111If the function is used only inside one source code file, make it
112static.  See the discussion about F<embed.pl> in L<perlguts>.
113
114If the function is used across several files, but intended only for
115Perl's internal use (and this should be the common case), do not export
116it to the public API.  See the discussion about F<embed.pl> in
117L<perlguts>.
118
119=back
120
121=head2 Portability problems
122
123The following are common causes of compilation and/or execution
124failures, not common to Perl as such.  The C FAQ is good bedtime
125reading.  Please test your changes with as many C compilers and
126platforms as possible; we will, anyway, and it's nice to save oneself
127from public embarrassment.
128
129If using gcc, you can add the C<-std=c89> option which will hopefully
130catch most of these unportabilities.  (However it might also catch
131incompatibilities in your system's header files.)
132
133Use the Configure C<-Dgccansipedantic> flag to enable the gcc C<-ansi
134-pedantic> flags which enforce stricter ANSI rules.
135
136If using the C<gcc -Wall> note that not all the possible warnings (like
137C<-Wunitialized>) are given unless you also compile with C<-O>.
138
139Note that if using gcc, starting from Perl 5.9.5 the Perl core source
140code files (the ones at the top level of the source code distribution,
141but not e.g. the extensions under ext/) are automatically compiled with
142as many as possible of the C<-std=c89>, C<-ansi>, C<-pedantic>, and a
143selection of C<-W> flags (see cflags.SH).
144
145Also study L<perlport> carefully to avoid any bad assumptions about the
146operating system, filesystems, character set, and so forth.
147
148You may once in a while try a "make microperl" to see whether we can
149still compile Perl with just the bare minimum of interfaces.  (See
150README.micro.)
151
152Do not assume an operating system indicates a certain compiler.
153
154=over 4
155
156=item *
157
158Casting pointers to integers or casting integers to pointers
159
160    void castaway(U8* p)
161    {
162      IV i = p;
163
164or
165
166    void castaway(U8* p)
167    {
168      IV i = (IV)p;
169
170Both are bad, and broken, and unportable.  Use the PTR2IV() macro that
171does it right.  (Likewise, there are PTR2UV(), PTR2NV(), INT2PTR(), and
172NUM2PTR().)
173
174=item *
175
176Casting between function pointers and data pointers
177
178Technically speaking casting between function pointers and data
179pointers is unportable and undefined, but practically speaking it seems
180to work, but you should use the FPTR2DPTR() and DPTR2FPTR() macros.
181Sometimes you can also play games with unions.
182
183=item *
184
185Assuming sizeof(int) == sizeof(long)
186
187There are platforms where longs are 64 bits, and platforms where ints
188are 64 bits, and while we are out to shock you, even platforms where
189shorts are 64 bits.  This is all legal according to the C standard.  (In
190other words, "long long" is not a portable way to specify 64 bits, and
191"long long" is not even guaranteed to be any wider than "long".)
192
193Instead, use the definitions IV, UV, IVSIZE, I32SIZE, and so forth.
194Avoid things like I32 because they are B<not> guaranteed to be
195I<exactly> 32 bits, they are I<at least> 32 bits, nor are they
196guaranteed to be B<int> or B<long>.  If you really explicitly need
19764-bit variables, use I64 and U64, but only if guarded by HAS_QUAD.
198
199=item *
200
201Assuming one can dereference any type of pointer for any type of data
202
203  char *p = ...;
204  long pony = *(long *)p;    /* BAD */
205
206Many platforms, quite rightly so, will give you a core dump instead of
207a pony if the p happens not to be correctly aligned.
208
209=item *
210
211Lvalue casts
212
213  (int)*p = ...;    /* BAD */
214
215Simply not portable.  Get your lvalue to be of the right type, or maybe
216use temporary variables, or dirty tricks with unions.
217
218=item *
219
220Assume B<anything> about structs (especially the ones you don't
221control, like the ones coming from the system headers)
222
223=over 8
224
225=item *
226
227That a certain field exists in a struct
228
229=item *
230
231That no other fields exist besides the ones you know of
232
233=item *
234
235That a field is of certain signedness, sizeof, or type
236
237=item *
238
239That the fields are in a certain order
240
241=over 8
242
243=item *
244
245While C guarantees the ordering specified in the struct definition,
246between different platforms the definitions might differ
247
248=back
249
250=item *
251
252That the sizeof(struct) or the alignments are the same everywhere
253
254=over 8
255
256=item *
257
258There might be padding bytes between the fields to align the fields -
259the bytes can be anything
260
261=item *
262
263Structs are required to be aligned to the maximum alignment required by
264the fields - which for native types is for usually equivalent to
265sizeof() of the field
266
267=back
268
269=back
270
271=item *
272
273Assuming the character set is ASCIIish
274
275Perl can compile and run under EBCDIC platforms.  See L<perlebcdic>.
276This is transparent for the most part, but because the character sets
277differ, you shouldn't use numeric (decimal, octal, nor hex) constants
278to refer to characters.  You can safely say C<'A'>, but not C<0x41>.
279You can safely say C<'\n'>, but not C<\012>.  However, you can use
280macros defined in F<utf8.h> to specify any code point portably.
281C<LATIN1_TO_NATIVE(0xDF)> is going to be the code point that means
282LATIN SMALL LETTER SHARP S on whatever platform you are running on (on
283ASCII platforms it compiles without adding any extra code, so there is
284zero performance hit on those).  The acceptable inputs to
285C<LATIN1_TO_NATIVE> are from C<0x00> through C<0xFF>.  If your input
286isn't guaranteed to be in that range, use C<UNICODE_TO_NATIVE> instead.
287C<NATIVE_TO_LATIN1> and C<NATIVE_TO_UNICODE> translate the opposite
288direction.
289
290If you need the string representation of a character that doesn't have a
291mnemonic name in C, you should add it to the list in
292F<regen/unicode_constants.pl>, and have Perl create C<#define>'s for you,
293based on the current platform.
294
295Note that the C<isI<FOO>> and C<toI<FOO>> macros in F<handy.h> work
296properly on native code points and strings.
297
298Also, the range 'A' - 'Z' in ASCII is an unbroken sequence of 26 upper
299case alphabetic characters.  That is not true in EBCDIC.  Nor for 'a' to
300'z'.  But '0' - '9' is an unbroken range in both systems.  Don't assume
301anything about other ranges.  (Note that special handling of ranges in
302regular expression patterns and transliterations makes it appear to Perl
303code that the aforementioned ranges are all unbroken.)
304
305Many of the comments in the existing code ignore the possibility of
306EBCDIC, and may be wrong therefore, even if the code works.  This is
307actually a tribute to the successful transparent insertion of being
308able to handle EBCDIC without having to change pre-existing code.
309
310UTF-8 and UTF-EBCDIC are two different encodings used to represent
311Unicode code points as sequences of bytes.  Macros  with the same names
312(but different definitions) in F<utf8.h> and F<utfebcdic.h> are used to
313allow the calling code to think that there is only one such encoding.
314This is almost always referred to as C<utf8>, but it means the EBCDIC
315version as well.  Again, comments in the code may well be wrong even if
316the code itself is right.  For example, the concept of UTF-8 C<invariant
317characters> differs between ASCII and EBCDIC.  On ASCII platforms, only
318characters that do not have the high-order bit set (i.e.  whose ordinals
319are strict ASCII, 0 - 127) are invariant, and the documentation and
320comments in the code may assume that, often referring to something
321like, say, C<hibit>.  The situation differs and is not so simple on
322EBCDIC machines, but as long as the code itself uses the
323C<NATIVE_IS_INVARIANT()> macro appropriately, it works, even if the
324comments are wrong.
325
326As noted in L<perlhack/TESTING>, when writing test scripts, the file
327F<t/charset_tools.pl> contains some helpful functions for writing tests
328valid on both ASCII and EBCDIC platforms.  Sometimes, though, a test
329can't use a function and it's inconvenient to have different test
330versions depending on the platform.  There are 20 code points that are
331the same in all 4 character sets currently recognized by Perl (the 3
332EBCDIC code pages plus ISO 8859-1 (ASCII/Latin1)).  These can be used in
333such tests, though there is a small possibility that Perl will become
334available in yet another character set, breaking your test.  All but one
335of these code points are C0 control characters.  The most significant
336controls that are the same are C<\0>, C<\r>, and C<\N{VT}> (also
337specifiable as C<\cK>, C<\x0B>, C<\N{U+0B}>, or C<\013>).  The single
338non-control is U+00B6 PILCROW SIGN.  The controls that are the same have
339the same bit pattern in all 4 character sets, regardless of the UTF8ness
340of the string containing them.  The bit pattern for U+B6 is the same in
341all 4 for non-UTF8 strings, but differs in each when its containing
342string is UTF-8 encoded.  The only other code points that have some sort
343of sameness across all 4 character sets are the pair 0xDC and 0xFC.
344Together these represent upper- and lowercase LATIN LETTER U WITH
345DIAERESIS, but which is upper and which is lower may be reversed: 0xDC
346is the capital in Latin1 and 0xFC is the small letter, while 0xFC is the
347capital in EBCDIC and 0xDC is the small one.  This factoid may be
348exploited in writing case insensitive tests that are the same across all
3494 character sets.
350
351=item *
352
353Assuming the character set is just ASCII
354
355ASCII is a 7 bit encoding, but bytes have 8 bits in them.  The 128 extra
356characters have different meanings depending on the locale.  Absent a
357locale, currently these extra characters are generally considered to be
358unassigned, and this has presented some problems.  This has being
359changed starting in 5.12 so that these characters can be considered to
360be Latin-1 (ISO-8859-1).
361
362=item *
363
364Mixing #define and #ifdef
365
366  #define BURGLE(x) ... \
367  #ifdef BURGLE_OLD_STYLE        /* BAD */
368  ... do it the old way ... \
369  #else
370  ... do it the new way ... \
371  #endif
372
373You cannot portably "stack" cpp directives.  For example in the above
374you need two separate BURGLE() #defines, one for each #ifdef branch.
375
376=item *
377
378Adding non-comment stuff after #endif or #else
379
380  #ifdef SNOSH
381  ...
382  #else !SNOSH    /* BAD */
383  ...
384  #endif SNOSH    /* BAD */
385
386The #endif and #else cannot portably have anything non-comment after
387them.  If you want to document what is going (which is a good idea
388especially if the branches are long), use (C) comments:
389
390  #ifdef SNOSH
391  ...
392  #else /* !SNOSH */
393  ...
394  #endif /* SNOSH */
395
396The gcc option C<-Wendif-labels> warns about the bad variant (by
397default on starting from Perl 5.9.4).
398
399=item *
400
401Having a comma after the last element of an enum list
402
403  enum color {
404    CERULEAN,
405    CHARTREUSE,
406    CINNABAR,     /* BAD */
407  };
408
409is not portable.  Leave out the last comma.
410
411Also note that whether enums are implicitly morphable to ints varies
412between compilers, you might need to (int).
413
414=item *
415
416Using //-comments
417
418  // This function bamfoodles the zorklator.   /* BAD */
419
420That is C99 or C++.  Perl is C89.  Using the //-comments is silently
421allowed by many C compilers but cranking up the ANSI C89 strictness
422(which we like to do) causes the compilation to fail.
423
424=item *
425
426Mixing declarations and code
427
428  void zorklator()
429  {
430    int n = 3;
431    set_zorkmids(n);    /* BAD */
432    int q = 4;
433
434That is C99 or C++.  Some C compilers allow that, but you shouldn't.
435
436The gcc option C<-Wdeclaration-after-statements> scans for such
437problems (by default on starting from Perl 5.9.4).
438
439=item *
440
441Introducing variables inside for()
442
443  for(int i = ...; ...; ...) {    /* BAD */
444
445That is C99 or C++.  While it would indeed be awfully nice to have that
446also in C89, to limit the scope of the loop variable, alas, we cannot.
447
448=item *
449
450Mixing signed char pointers with unsigned char pointers
451
452  int foo(char *s) { ... }
453  ...
454  unsigned char *t = ...; /* Or U8* t = ... */
455  foo(t);   /* BAD */
456
457While this is legal practice, it is certainly dubious, and downright
458fatal in at least one platform: for example VMS cc considers this a
459fatal error.  One cause for people often making this mistake is that a
460"naked char" and therefore dereferencing a "naked char pointer" have an
461undefined signedness: it depends on the compiler and the flags of the
462compiler and the underlying platform whether the result is signed or
463unsigned.  For this very same reason using a 'char' as an array index is
464bad.
465
466=item *
467
468Macros that have string constants and their arguments as substrings of
469the string constants
470
471  #define FOO(n) printf("number = %d\n", n)    /* BAD */
472  FOO(10);
473
474Pre-ANSI semantics for that was equivalent to
475
476  printf("10umber = %d\10");
477
478which is probably not what you were expecting.  Unfortunately at least
479one reasonably common and modern C compiler does "real backward
480compatibility" here, in AIX that is what still happens even though the
481rest of the AIX compiler is very happily C89.
482
483=item *
484
485Using printf formats for non-basic C types
486
487   IV i = ...;
488   printf("i = %d\n", i);    /* BAD */
489
490While this might by accident work in some platform (where IV happens to
491be an C<int>), in general it cannot.  IV might be something larger.  Even
492worse the situation is with more specific types (defined by Perl's
493configuration step in F<config.h>):
494
495   Uid_t who = ...;
496   printf("who = %d\n", who);    /* BAD */
497
498The problem here is that Uid_t might be not only not C<int>-wide but it
499might also be unsigned, in which case large uids would be printed as
500negative values.
501
502There is no simple solution to this because of printf()'s limited
503intelligence, but for many types the right format is available as with
504either 'f' or '_f' suffix, for example:
505
506   IVdf /* IV in decimal */
507   UVxf /* UV is hexadecimal */
508
509   printf("i = %"IVdf"\n", i); /* The IVdf is a string constant. */
510
511   Uid_t_f /* Uid_t in decimal */
512
513   printf("who = %"Uid_t_f"\n", who);
514
515Or you can try casting to a "wide enough" type:
516
517   printf("i = %"IVdf"\n", (IV)something_very_small_and_signed);
518
519Also remember that the C<%p> format really does require a void pointer:
520
521   U8* p = ...;
522   printf("p = %p\n", (void*)p);
523
524The gcc option C<-Wformat> scans for such problems.
525
526=item *
527
528Blindly using variadic macros
529
530gcc has had them for a while with its own syntax, and C99 brought them
531with a standardized syntax.  Don't use the former, and use the latter
532only if the HAS_C99_VARIADIC_MACROS is defined.
533
534=item *
535
536Blindly passing va_list
537
538Not all platforms support passing va_list to further varargs (stdarg)
539functions.  The right thing to do is to copy the va_list using the
540Perl_va_copy() if the NEED_VA_COPY is defined.
541
542=item *
543
544Using gcc statement expressions
545
546   val = ({...;...;...});    /* BAD */
547
548While a nice extension, it's not portable.  The Perl code does
549admittedly use them if available to gain some extra speed (essentially
550as a funky form of inlining), but you shouldn't.
551
552=item *
553
554Binding together several statements in a macro
555
556Use the macros STMT_START and STMT_END.
557
558   STMT_START {
559      ...
560   } STMT_END
561
562=item *
563
564Testing for operating systems or versions when should be testing for
565features
566
567  #ifdef __FOONIX__    /* BAD */
568  foo = quux();
569  #endif
570
571Unless you know with 100% certainty that quux() is only ever available
572for the "Foonix" operating system B<and> that is available B<and>
573correctly working for B<all> past, present, B<and> future versions of
574"Foonix", the above is very wrong.  This is more correct (though still
575not perfect, because the below is a compile-time check):
576
577  #ifdef HAS_QUUX
578  foo = quux();
579  #endif
580
581How does the HAS_QUUX become defined where it needs to be?  Well, if
582Foonix happens to be Unixy enough to be able to run the Configure
583script, and Configure has been taught about detecting and testing
584quux(), the HAS_QUUX will be correctly defined.  In other platforms, the
585corresponding configuration step will hopefully do the same.
586
587In a pinch, if you cannot wait for Configure to be educated, or if you
588have a good hunch of where quux() might be available, you can
589temporarily try the following:
590
591  #if (defined(__FOONIX__) || defined(__BARNIX__))
592  # define HAS_QUUX
593  #endif
594
595  ...
596
597  #ifdef HAS_QUUX
598  foo = quux();
599  #endif
600
601But in any case, try to keep the features and operating systems
602separate.
603
604A good resource on the predefined macros for various operating
605systems, compilers, and so forth is
606L<http://sourceforge.net/p/predef/wiki/Home/>
607
608=item *
609
610Assuming the contents of static memory pointed to by the return values
611of Perl wrappers for C library functions doesn't change.  Many C library
612functions return pointers to static storage that can be overwritten by
613subsequent calls to the same or related functions.  Perl has
614light-weight wrappers for some of these functions, and which don't make
615copies of the static memory.  A good example is the interface to the
616environment variables that are in effect for the program.  Perl has
617C<PerlEnv_getenv> to get values from the environment.  But the return is
618a pointer to static memory in the C library.  If you are using the value
619to immediately test for something, that's fine, but if you save the
620value and expect it to be unchanged by later processing, you would be
621wrong, but perhaps you wouldn't know it because different C library
622implementations behave differently, and the one on the platform you're
623testing on might work for your situation.  But on some platforms, a
624subsequent call to C<PerlEnv_getenv> or related function WILL overwrite
625the memory that your first call points to.  This has led to some
626hard-to-debug problems.  Do a L<perlapi/savepv> to make a copy, thus
627avoiding these problems.  You will have to free the copy when you're
628done to avoid memory leaks.  If you don't have control over when it gets
629freed, you'll need to make the copy in a mortal scalar, like so:
630
631 if ((s = PerlEnv_getenv("foo") == NULL) {
632    ... /* handle NULL case */
633 }
634 else {
635     s = SvPVX(sv_2mortal(newSVpv(s, 0)));
636 }
637
638The above example works only if C<"s"> is C<NUL>-terminated; otherwise
639you have to pass its length to C<newSVpv>.
640
641=back
642
643=head2 Problematic System Interfaces
644
645=over 4
646
647=item *
648
649malloc(0), realloc(0), calloc(0, 0) are non-portable.  To be portable
650allocate at least one byte.  (In general you should rarely need to work
651at this low level, but instead use the various malloc wrappers.)
652
653=item *
654
655snprintf() - the return type is unportable.  Use my_snprintf() instead.
656
657=back
658
659=head2 Security problems
660
661Last but not least, here are various tips for safer coding.
662See also L<perlclib> for libc/stdio replacements one should use.
663
664=over 4
665
666=item *
667
668Do not use gets()
669
670Or we will publicly ridicule you.  Seriously.
671
672=item *
673
674Do not use tmpfile()
675
676Use mkstemp() instead.
677
678=item *
679
680Do not use strcpy() or strcat() or strncpy() or strncat()
681
682Use my_strlcpy() and my_strlcat() instead: they either use the native
683implementation, or Perl's own implementation (borrowed from the public
684domain implementation of INN).
685
686=item *
687
688Do not use sprintf() or vsprintf()
689
690If you really want just plain byte strings, use my_snprintf() and
691my_vsnprintf() instead, which will try to use snprintf() and
692vsnprintf() if those safer APIs are available.  If you want something
693fancier than a plain byte string, use
694L<C<Perl_form>()|perlapi/form> or SVs and
695L<C<Perl_sv_catpvf()>|perlapi/sv_catpvf>.
696
697Note that glibc C<printf()>, C<sprintf()>, etc. are buggy before glibc
698version 2.17.  They won't allow a C<%.s> format with a precision to
699create a string that isn't valid UTF-8 if the current underlying locale
700of the program is UTF-8.  What happens is that the C<%s> and its operand are
701simply skipped without any notice.
702L<https://sourceware.org/bugzilla/show_bug.cgi?id=6530>.
703
704=item *
705
706Do not use atoi()
707
708Use grok_atoUV() instead.  atoi() has ill-defined behavior on overflows,
709and cannot be used for incremental parsing.  It is also affected by locale,
710which is bad.
711
712=item *
713
714Do not use strtol() or strtoul()
715
716Use grok_atoUV() instead.  strtol() or strtoul() (or their IV/UV-friendly
717macro disguises, Strtol() and Strtoul(), or Atol() and Atoul() are
718affected by locale, which is bad.
719
720=back
721
722=head1 DEBUGGING
723
724You can compile a special debugging version of Perl, which allows you
725to use the C<-D> option of Perl to tell more about what Perl is doing.
726But sometimes there is no alternative than to dive in with a debugger,
727either to see the stack trace of a core dump (very useful in a bug
728report), or trying to figure out what went wrong before the core dump
729happened, or how did we end up having wrong or unexpected results.
730
731=head2 Poking at Perl
732
733To really poke around with Perl, you'll probably want to build Perl for
734debugging, like this:
735
736    ./Configure -d -D optimize=-g
737    make
738
739C<-g> is a flag to the C compiler to have it produce debugging
740information which will allow us to step through a running program, and
741to see in which C function we are at (without the debugging information
742we might see only the numerical addresses of the functions, which is
743not very helpful).
744
745F<Configure> will also turn on the C<DEBUGGING> compilation symbol
746which enables all the internal debugging code in Perl.  There are a
747whole bunch of things you can debug with this: L<perlrun> lists them
748all, and the best way to find out about them is to play about with
749them.  The most useful options are probably
750
751    l  Context (loop) stack processing
752    t  Trace execution
753    o  Method and overloading resolution
754    c  String/numeric conversions
755
756Some of the functionality of the debugging code can be achieved using
757XS modules.
758
759    -Dr => use re 'debug'
760    -Dx => use O 'Debug'
761
762=head2 Using a source-level debugger
763
764If the debugging output of C<-D> doesn't help you, it's time to step
765through perl's execution with a source-level debugger.
766
767=over 3
768
769=item *
770
771We'll use C<gdb> for our examples here; the principles will apply to
772any debugger (many vendors call their debugger C<dbx>), but check the
773manual of the one you're using.
774
775=back
776
777To fire up the debugger, type
778
779    gdb ./perl
780
781Or if you have a core dump:
782
783    gdb ./perl core
784
785You'll want to do that in your Perl source tree so the debugger can
786read the source code.  You should see the copyright message, followed by
787the prompt.
788
789    (gdb)
790
791C<help> will get you into the documentation, but here are the most
792useful commands:
793
794=over 3
795
796=item * run [args]
797
798Run the program with the given arguments.
799
800=item * break function_name
801
802=item * break source.c:xxx
803
804Tells the debugger that we'll want to pause execution when we reach
805either the named function (but see L<perlguts/Internal Functions>!) or
806the given line in the named source file.
807
808=item * step
809
810Steps through the program a line at a time.
811
812=item * next
813
814Steps through the program a line at a time, without descending into
815functions.
816
817=item * continue
818
819Run until the next breakpoint.
820
821=item * finish
822
823Run until the end of the current function, then stop again.
824
825=item * 'enter'
826
827Just pressing Enter will do the most recent operation again - it's a
828blessing when stepping through miles of source code.
829
830=item * ptype
831
832Prints the C definition of the argument given.
833
834  (gdb) ptype PL_op
835  type = struct op {
836      OP *op_next;
837      OP *op_sibparent;
838      OP *(*op_ppaddr)(void);
839      PADOFFSET op_targ;
840      unsigned int op_type : 9;
841      unsigned int op_opt : 1;
842      unsigned int op_slabbed : 1;
843      unsigned int op_savefree : 1;
844      unsigned int op_static : 1;
845      unsigned int op_folded : 1;
846      unsigned int op_spare : 2;
847      U8 op_flags;
848      U8 op_private;
849  } *
850
851=item * print
852
853Execute the given C code and print its results.  B<WARNING>: Perl makes
854heavy use of macros, and F<gdb> does not necessarily support macros
855(see later L</"gdb macro support">).  You'll have to substitute them
856yourself, or to invoke cpp on the source code files (see L</"The .i
857Targets">) So, for instance, you can't say
858
859    print SvPV_nolen(sv)
860
861but you have to say
862
863    print Perl_sv_2pv_nolen(sv)
864
865=back
866
867You may find it helpful to have a "macro dictionary", which you can
868produce by saying C<cpp -dM perl.c | sort>.  Even then, F<cpp> won't
869recursively apply those macros for you.
870
871=head2 gdb macro support
872
873Recent versions of F<gdb> have fairly good macro support, but in order
874to use it you'll need to compile perl with macro definitions included
875in the debugging information.  Using F<gcc> version 3.1, this means
876configuring with C<-Doptimize=-g3>.  Other compilers might use a
877different switch (if they support debugging macros at all).
878
879=head2 Dumping Perl Data Structures
880
881One way to get around this macro hell is to use the dumping functions
882in F<dump.c>; these work a little like an internal
883L<Devel::Peek|Devel::Peek>, but they also cover OPs and other
884structures that you can't get at from Perl.  Let's take an example.
885We'll use the C<$a = $b + $c> we used before, but give it a bit of
886context: C<$b = "6XXXX"; $c = 2.3;>.  Where's a good place to stop and
887poke around?
888
889What about C<pp_add>, the function we examined earlier to implement the
890C<+> operator:
891
892    (gdb) break Perl_pp_add
893    Breakpoint 1 at 0x46249f: file pp_hot.c, line 309.
894
895Notice we use C<Perl_pp_add> and not C<pp_add> - see
896L<perlguts/Internal Functions>.  With the breakpoint in place, we can
897run our program:
898
899    (gdb) run -e '$b = "6XXXX"; $c = 2.3; $a = $b + $c'
900
901Lots of junk will go past as gdb reads in the relevant source files and
902libraries, and then:
903
904    Breakpoint 1, Perl_pp_add () at pp_hot.c:309
905    309         dSP; dATARGET; tryAMAGICbin(add,opASSIGN);
906    (gdb) step
907    311           dPOPTOPnnrl_ul;
908    (gdb)
909
910We looked at this bit of code before, and we said that
911C<dPOPTOPnnrl_ul> arranges for two C<NV>s to be placed into C<left> and
912C<right> - let's slightly expand it:
913
914 #define dPOPTOPnnrl_ul  NV right = POPn; \
915                         SV *leftsv = TOPs; \
916                         NV left = USE_LEFT(leftsv) ? SvNV(leftsv) : 0.0
917
918C<POPn> takes the SV from the top of the stack and obtains its NV
919either directly (if C<SvNOK> is set) or by calling the C<sv_2nv>
920function.  C<TOPs> takes the next SV from the top of the stack - yes,
921C<POPn> uses C<TOPs> - but doesn't remove it.  We then use C<SvNV> to
922get the NV from C<leftsv> in the same way as before - yes, C<POPn> uses
923C<SvNV>.
924
925Since we don't have an NV for C<$b>, we'll have to use C<sv_2nv> to
926convert it.  If we step again, we'll find ourselves there:
927
928    (gdb) step
929    Perl_sv_2nv (sv=0xa0675d0) at sv.c:1669
930    1669        if (!sv)
931    (gdb)
932
933We can now use C<Perl_sv_dump> to investigate the SV:
934
935    (gdb) print Perl_sv_dump(sv)
936    SV = PV(0xa057cc0) at 0xa0675d0
937    REFCNT = 1
938    FLAGS = (POK,pPOK)
939    PV = 0xa06a510 "6XXXX"\0
940    CUR = 5
941    LEN = 6
942    $1 = void
943
944We know we're going to get C<6> from this, so let's finish the
945subroutine:
946
947    (gdb) finish
948    Run till exit from #0  Perl_sv_2nv (sv=0xa0675d0) at sv.c:1671
949    0x462669 in Perl_pp_add () at pp_hot.c:311
950    311           dPOPTOPnnrl_ul;
951
952We can also dump out this op: the current op is always stored in
953C<PL_op>, and we can dump it with C<Perl_op_dump>.  This'll give us
954similar output to L<B::Debug|B::Debug>.
955
956    (gdb) print Perl_op_dump(PL_op)
957    {
958    13  TYPE = add  ===> 14
959        TARG = 1
960        FLAGS = (SCALAR,KIDS)
961        {
962            TYPE = null  ===> (12)
963              (was rv2sv)
964            FLAGS = (SCALAR,KIDS)
965            {
966    11          TYPE = gvsv  ===> 12
967                FLAGS = (SCALAR)
968                GV = main::b
969            }
970        }
971
972# finish this later #
973
974=head2 Using gdb to look at specific parts of a program
975
976With the example above, you knew to look for C<Perl_pp_add>, but what if
977there were multiple calls to it all over the place, or you didn't know what
978the op was you were looking for?
979
980One way to do this is to inject a rare call somewhere near what you're looking
981for.  For example, you could add C<study> before your method:
982
983    study;
984
985And in gdb do:
986
987    (gdb) break Perl_pp_study
988
989And then step until you hit what you're
990looking for.  This works well in a loop
991if you want to only break at certain iterations:
992
993    for my $c (1..100) {
994        study if $c == 50;
995    }
996
997=head2 Using gdb to look at what the parser/lexer are doing
998
999If you want to see what perl is doing when parsing/lexing your code, you can
1000use C<BEGIN {}>:
1001
1002    print "Before\n";
1003    BEGIN { study; }
1004    print "After\n";
1005
1006And in gdb:
1007
1008    (gdb) break Perl_pp_study
1009
1010If you want to see what the parser/lexer is doing inside of C<if> blocks and
1011the like you need to be a little trickier:
1012
1013    if ($a && $b && do { BEGIN { study } 1 } && $c) { ... }
1014
1015=head1 SOURCE CODE STATIC ANALYSIS
1016
1017Various tools exist for analysing C source code B<statically>, as
1018opposed to B<dynamically>, that is, without executing the code.  It is
1019possible to detect resource leaks, undefined behaviour, type
1020mismatches, portability problems, code paths that would cause illegal
1021memory accesses, and other similar problems by just parsing the C code
1022and looking at the resulting graph, what does it tell about the
1023execution and data flows.  As a matter of fact, this is exactly how C
1024compilers know to give warnings about dubious code.
1025
1026=head2 lint, splint
1027
1028The good old C code quality inspector, C<lint>, is available in several
1029platforms, but please be aware that there are several different
1030implementations of it by different vendors, which means that the flags
1031are not identical across different platforms.
1032
1033There is a lint variant called C<splint> (Secure Programming Lint)
1034available from http://www.splint.org/ that should compile on any
1035Unix-like platform.
1036
1037There are C<lint> and <splint> targets in Makefile, but you may have to
1038diddle with the flags (see above).
1039
1040=head2 Coverity
1041
1042Coverity (http://www.coverity.com/) is a product similar to lint and as
1043a testbed for their product they periodically check several open source
1044projects, and they give out accounts to open source developers to the
1045defect databases.
1046
1047There is Coverity setup for the perl5 project:
1048L<https://scan.coverity.com/projects/perl5>
1049
1050=head2 HP-UX cadvise (Code Advisor)
1051
1052HP has a C/C++ static analyzer product for HP-UX caller Code Advisor.
1053(Link not given here because the URL is horribly long and seems horribly
1054unstable; use the search engine of your choice to find it.)  The use of
1055the C<cadvise_cc> recipe with C<Configure ... -Dcc=./cadvise_cc>
1056(see cadvise "User Guide") is recommended; as is the use of C<+wall>.
1057
1058=head2 cpd (cut-and-paste detector)
1059
1060The cpd tool detects cut-and-paste coding.  If one instance of the
1061cut-and-pasted code changes, all the other spots should probably be
1062changed, too.  Therefore such code should probably be turned into a
1063subroutine or a macro.
1064
1065cpd (http://pmd.sourceforge.net/cpd.html) is part of the pmd project
1066(http://pmd.sourceforge.net/).  pmd was originally written for static
1067analysis of Java code, but later the cpd part of it was extended to
1068parse also C and C++.
1069
1070Download the pmd-bin-X.Y.zip () from the SourceForge site, extract the
1071pmd-X.Y.jar from it, and then run that on source code thusly:
1072
1073  java -cp pmd-X.Y.jar net.sourceforge.pmd.cpd.CPD \
1074   --minimum-tokens 100 --files /some/where/src --language c > cpd.txt
1075
1076You may run into memory limits, in which case you should use the -Xmx
1077option:
1078
1079  java -Xmx512M ...
1080
1081=head2 gcc warnings
1082
1083Though much can be written about the inconsistency and coverage
1084problems of gcc warnings (like C<-Wall> not meaning "all the warnings",
1085or some common portability problems not being covered by C<-Wall>, or
1086C<-ansi> and C<-pedantic> both being a poorly defined collection of
1087warnings, and so forth), gcc is still a useful tool in keeping our
1088coding nose clean.
1089
1090The C<-Wall> is by default on.
1091
1092The C<-ansi> (and its sidekick, C<-pedantic>) would be nice to be on
1093always, but unfortunately they are not safe on all platforms, they can
1094for example cause fatal conflicts with the system headers (Solaris
1095being a prime example).  If Configure C<-Dgccansipedantic> is used, the
1096C<cflags> frontend selects C<-ansi -pedantic> for the platforms where
1097they are known to be safe.
1098
1099Starting from Perl 5.9.4 the following extra flags are added:
1100
1101=over 4
1102
1103=item *
1104
1105C<-Wendif-labels>
1106
1107=item *
1108
1109C<-Wextra>
1110
1111=item *
1112
1113C<-Wdeclaration-after-statement>
1114
1115=back
1116
1117The following flags would be nice to have but they would first need
1118their own Augean stablemaster:
1119
1120=over 4
1121
1122=item *
1123
1124C<-Wpointer-arith>
1125
1126=item *
1127
1128C<-Wshadow>
1129
1130=item *
1131
1132C<-Wstrict-prototypes>
1133
1134=back
1135
1136The C<-Wtraditional> is another example of the annoying tendency of gcc
1137to bundle a lot of warnings under one switch (it would be impossible to
1138deploy in practice because it would complain a lot) but it does contain
1139some warnings that would be beneficial to have available on their own,
1140such as the warning about string constants inside macros containing the
1141macro arguments: this behaved differently pre-ANSI than it does in
1142ANSI, and some C compilers are still in transition, AIX being an
1143example.
1144
1145=head2 Warnings of other C compilers
1146
1147Other C compilers (yes, there B<are> other C compilers than gcc) often
1148have their "strict ANSI" or "strict ANSI with some portability
1149extensions" modes on, like for example the Sun Workshop has its C<-Xa>
1150mode on (though implicitly), or the DEC (these days, HP...) has its
1151C<-std1> mode on.
1152
1153=head1 MEMORY DEBUGGERS
1154
1155B<NOTE 1>: Running under older memory debuggers such as Purify,
1156valgrind or Third Degree greatly slows down the execution: seconds
1157become minutes, minutes become hours.  For example as of Perl 5.8.1, the
1158ext/Encode/t/Unicode.t takes extraordinarily long to complete under
1159e.g. Purify, Third Degree, and valgrind.  Under valgrind it takes more
1160than six hours, even on a snappy computer.  The said test must be doing
1161something that is quite unfriendly for memory debuggers.  If you don't
1162feel like waiting, that you can simply kill away the perl process.
1163Roughly valgrind slows down execution by factor 10, AddressSanitizer by
1164factor 2.
1165
1166B<NOTE 2>: To minimize the number of memory leak false alarms (see
1167L</PERL_DESTRUCT_LEVEL> for more information), you have to set the
1168environment variable PERL_DESTRUCT_LEVEL to 2.  For example, like this:
1169
1170    env PERL_DESTRUCT_LEVEL=2 valgrind ./perl -Ilib ...
1171
1172B<NOTE 3>: There are known memory leaks when there are compile-time
1173errors within eval or require, seeing C<S_doeval> in the call stack is
1174a good sign of these.  Fixing these leaks is non-trivial, unfortunately,
1175but they must be fixed eventually.
1176
1177B<NOTE 4>: L<DynaLoader> will not clean up after itself completely
1178unless Perl is built with the Configure option
1179C<-Accflags=-DDL_UNLOAD_ALL_AT_EXIT>.
1180
1181=head2 valgrind
1182
1183The valgrind tool can be used to find out both memory leaks and illegal
1184heap memory accesses.  As of version 3.3.0, Valgrind only supports Linux
1185on x86, x86-64 and PowerPC and Darwin (OS X) on x86 and x86-64.  The
1186special "test.valgrind" target can be used to run the tests under
1187valgrind.  Found errors and memory leaks are logged in files named
1188F<testfile.valgrind> and by default output is displayed inline.
1189
1190Example usage:
1191
1192    make test.valgrind
1193
1194Since valgrind adds significant overhead, tests will take much longer to
1195run.  The valgrind tests support being run in parallel to help with this:
1196
1197    TEST_JOBS=9 make test.valgrind
1198
1199Note that the above two invocations will be very verbose as reachable
1200memory and leak-checking is enabled by default.  If you want to just see
1201pure errors, try:
1202
1203    VG_OPTS='-q --leak-check=no --show-reachable=no' TEST_JOBS=9 \
1204        make test.valgrind
1205
1206Valgrind also provides a cachegrind tool, invoked on perl as:
1207
1208    VG_OPTS=--tool=cachegrind make test.valgrind
1209
1210As system libraries (most notably glibc) are also triggering errors,
1211valgrind allows to suppress such errors using suppression files.  The
1212default suppression file that comes with valgrind already catches a lot
1213of them.  Some additional suppressions are defined in F<t/perl.supp>.
1214
1215To get valgrind and for more information see
1216
1217    http://valgrind.org/
1218
1219=head2 AddressSanitizer
1220
1221AddressSanitizer is a clang and gcc extension, included in clang since
1222v3.1 and gcc since v4.8.  It checks illegal heap pointers, global
1223pointers, stack pointers and use after free errors, and is fast enough
1224that you can easily compile your debugging or optimized perl with it.
1225It does not check memory leaks though.  AddressSanitizer is available
1226for Linux, Mac OS X and soon on Windows.
1227
1228To build perl with AddressSanitizer, your Configure invocation should
1229look like:
1230
1231    sh Configure -des -Dcc=clang \
1232       -Accflags=-faddress-sanitizer -Aldflags=-faddress-sanitizer \
1233       -Alddlflags=-shared\ -faddress-sanitizer
1234
1235where these arguments mean:
1236
1237=over 4
1238
1239=item * -Dcc=clang
1240
1241This should be replaced by the full path to your clang executable if it
1242is not in your path.
1243
1244=item * -Accflags=-faddress-sanitizer
1245
1246Compile perl and extensions sources with AddressSanitizer.
1247
1248=item * -Aldflags=-faddress-sanitizer
1249
1250Link the perl executable with AddressSanitizer.
1251
1252=item * -Alddlflags=-shared\ -faddress-sanitizer
1253
1254Link dynamic extensions with AddressSanitizer.  You must manually
1255specify C<-shared> because using C<-Alddlflags=-shared> will prevent
1256Configure from setting a default value for C<lddlflags>, which usually
1257contains C<-shared> (at least on Linux).
1258
1259=back
1260
1261See also
1262L<http://code.google.com/p/address-sanitizer/wiki/AddressSanitizer>.
1263
1264
1265=head1 PROFILING
1266
1267Depending on your platform there are various ways of profiling Perl.
1268
1269There are two commonly used techniques of profiling executables:
1270I<statistical time-sampling> and I<basic-block counting>.
1271
1272The first method takes periodically samples of the CPU program counter,
1273and since the program counter can be correlated with the code generated
1274for functions, we get a statistical view of in which functions the
1275program is spending its time.  The caveats are that very small/fast
1276functions have lower probability of showing up in the profile, and that
1277periodically interrupting the program (this is usually done rather
1278frequently, in the scale of milliseconds) imposes an additional
1279overhead that may skew the results.  The first problem can be alleviated
1280by running the code for longer (in general this is a good idea for
1281profiling), the second problem is usually kept in guard by the
1282profiling tools themselves.
1283
1284The second method divides up the generated code into I<basic blocks>.
1285Basic blocks are sections of code that are entered only in the
1286beginning and exited only at the end.  For example, a conditional jump
1287starts a basic block.  Basic block profiling usually works by
1288I<instrumenting> the code by adding I<enter basic block #nnnn>
1289book-keeping code to the generated code.  During the execution of the
1290code the basic block counters are then updated appropriately.  The
1291caveat is that the added extra code can skew the results: again, the
1292profiling tools usually try to factor their own effects out of the
1293results.
1294
1295=head2 Gprof Profiling
1296
1297I<gprof> is a profiling tool available in many Unix platforms which
1298uses I<statistical time-sampling>.  You can build a profiled version of
1299F<perl> by compiling using gcc with the flag C<-pg>.  Either edit
1300F<config.sh> or re-run F<Configure>.  Running the profiled version of
1301Perl will create an output file called F<gmon.out> which contains the
1302profiling data collected during the execution.
1303
1304quick hint:
1305
1306    $ sh Configure -des -Dusedevel -Accflags='-pg' \
1307        -Aldflags='-pg' -Alddlflags='-pg -shared' \
1308        && make perl
1309    $ ./perl ... # creates gmon.out in current directory
1310    $ gprof ./perl > out
1311    $ less out
1312
1313(you probably need to add C<-shared> to the <-Alddlflags> line until RT
1314#118199 is resolved)
1315
1316The F<gprof> tool can then display the collected data in various ways.
1317Usually F<gprof> understands the following options:
1318
1319=over 4
1320
1321=item * -a
1322
1323Suppress statically defined functions from the profile.
1324
1325=item * -b
1326
1327Suppress the verbose descriptions in the profile.
1328
1329=item * -e routine
1330
1331Exclude the given routine and its descendants from the profile.
1332
1333=item * -f routine
1334
1335Display only the given routine and its descendants in the profile.
1336
1337=item * -s
1338
1339Generate a summary file called F<gmon.sum> which then may be given to
1340subsequent gprof runs to accumulate data over several runs.
1341
1342=item * -z
1343
1344Display routines that have zero usage.
1345
1346=back
1347
1348For more detailed explanation of the available commands and output
1349formats, see your own local documentation of F<gprof>.
1350
1351=head2 GCC gcov Profiling
1352
1353I<basic block profiling> is officially available in gcc 3.0 and later.
1354You can build a profiled version of F<perl> by compiling using gcc with
1355the flags C<-fprofile-arcs -ftest-coverage>.  Either edit F<config.sh>
1356or re-run F<Configure>.
1357
1358quick hint:
1359
1360    $ sh Configure -des -Dusedevel -Doptimize='-g' \
1361        -Accflags='-fprofile-arcs -ftest-coverage' \
1362        -Aldflags='-fprofile-arcs -ftest-coverage' \
1363        -Alddlflags='-fprofile-arcs -ftest-coverage -shared' \
1364        && make perl
1365    $ rm -f regexec.c.gcov regexec.gcda
1366    $ ./perl ...
1367    $ gcov regexec.c
1368    $ less regexec.c.gcov
1369
1370(you probably need to add C<-shared> to the <-Alddlflags> line until RT
1371#118199 is resolved)
1372
1373Running the profiled version of Perl will cause profile output to be
1374generated.  For each source file an accompanying F<.gcda> file will be
1375created.
1376
1377To display the results you use the I<gcov> utility (which should be
1378installed if you have gcc 3.0 or newer installed).  F<gcov> is run on
1379source code files, like this
1380
1381    gcov sv.c
1382
1383which will cause F<sv.c.gcov> to be created.  The F<.gcov> files contain
1384the source code annotated with relative frequencies of execution
1385indicated by "#" markers.  If you want to generate F<.gcov> files for
1386all profiled object files, you can run something like this:
1387
1388    for file in `find . -name \*.gcno`
1389    do sh -c "cd `dirname $file` && gcov `basename $file .gcno`"
1390    done
1391
1392Useful options of F<gcov> include C<-b> which will summarise the basic
1393block, branch, and function call coverage, and C<-c> which instead of
1394relative frequencies will use the actual counts.  For more information
1395on the use of F<gcov> and basic block profiling with gcc, see the
1396latest GNU CC manual.  As of gcc 4.8, this is at
1397L<http://gcc.gnu.org/onlinedocs/gcc/Gcov-Intro.html#Gcov-Intro>
1398
1399=head1 MISCELLANEOUS TRICKS
1400
1401=head2 PERL_DESTRUCT_LEVEL
1402
1403If you want to run any of the tests yourself manually using e.g.
1404valgrind, please note that by default perl B<does not> explicitly
1405cleanup all the memory it has allocated (such as global memory arenas)
1406but instead lets the exit() of the whole program "take care" of such
1407allocations, also known as "global destruction of objects".
1408
1409There is a way to tell perl to do complete cleanup: set the environment
1410variable PERL_DESTRUCT_LEVEL to a non-zero value.  The t/TEST wrapper
1411does set this to 2, and this is what you need to do too, if you don't
1412want to see the "global leaks": For example, for running under valgrind
1413
1414    env PERL_DESTRUCT_LEVEL=2 valgrind ./perl -Ilib t/foo/bar.t
1415
1416(Note: the mod_perl apache module uses also this environment variable
1417for its own purposes and extended its semantics.  Refer to the mod_perl
1418documentation for more information.  Also, spawned threads do the
1419equivalent of setting this variable to the value 1.)
1420
1421If, at the end of a run you get the message I<N scalars leaked>, you
1422can recompile with C<-DDEBUG_LEAKING_SCALARS>, which will cause the
1423addresses of all those leaked SVs to be dumped along with details as to
1424where each SV was originally allocated.  This information is also
1425displayed by Devel::Peek.  Note that the extra details recorded with
1426each SV increases memory usage, so it shouldn't be used in production
1427environments.  It also converts C<new_SV()> from a macro into a real
1428function, so you can use your favourite debugger to discover where
1429those pesky SVs were allocated.
1430
1431If you see that you're leaking memory at runtime, but neither valgrind
1432nor C<-DDEBUG_LEAKING_SCALARS> will find anything, you're probably
1433leaking SVs that are still reachable and will be properly cleaned up
1434during destruction of the interpreter.  In such cases, using the C<-Dm>
1435switch can point you to the source of the leak.  If the executable was
1436built with C<-DDEBUG_LEAKING_SCALARS>, C<-Dm> will output SV
1437allocations in addition to memory allocations.  Each SV allocation has a
1438distinct serial number that will be written on creation and destruction
1439of the SV.  So if you're executing the leaking code in a loop, you need
1440to look for SVs that are created, but never destroyed between each
1441cycle.  If such an SV is found, set a conditional breakpoint within
1442C<new_SV()> and make it break only when C<PL_sv_serial> is equal to the
1443serial number of the leaking SV.  Then you will catch the interpreter in
1444exactly the state where the leaking SV is allocated, which is
1445sufficient in many cases to find the source of the leak.
1446
1447As C<-Dm> is using the PerlIO layer for output, it will by itself
1448allocate quite a bunch of SVs, which are hidden to avoid recursion.  You
1449can bypass the PerlIO layer if you use the SV logging provided by
1450C<-DPERL_MEM_LOG> instead.
1451
1452=head2 PERL_MEM_LOG
1453
1454If compiled with C<-DPERL_MEM_LOG> (C<-Accflags=-DPERL_MEM_LOG>), both
1455memory and SV allocations go through logging functions, which is
1456handy for breakpoint setting.
1457
1458Unless C<-DPERL_MEM_LOG_NOIMPL> (C<-Accflags=-DPERL_MEM_LOG_NOIMPL>) is
1459also compiled, the logging functions read $ENV{PERL_MEM_LOG} to
1460determine whether to log the event, and if so how:
1461
1462    $ENV{PERL_MEM_LOG} =~ /m/           Log all memory ops
1463    $ENV{PERL_MEM_LOG} =~ /s/           Log all SV ops
1464    $ENV{PERL_MEM_LOG} =~ /t/           include timestamp in Log
1465    $ENV{PERL_MEM_LOG} =~ /^(\d+)/      write to FD given (default is 2)
1466
1467Memory logging is somewhat similar to C<-Dm> but is independent of
1468C<-DDEBUGGING>, and at a higher level; all uses of Newx(), Renew(), and
1469Safefree() are logged with the caller's source code file and line
1470number (and C function name, if supported by the C compiler).  In
1471contrast, C<-Dm> is directly at the point of C<malloc()>.  SV logging is
1472similar.
1473
1474Since the logging doesn't use PerlIO, all SV allocations are logged and
1475no extra SV allocations are introduced by enabling the logging.  If
1476compiled with C<-DDEBUG_LEAKING_SCALARS>, the serial number for each SV
1477allocation is also logged.
1478
1479=head2 DDD over gdb
1480
1481Those debugging perl with the DDD frontend over gdb may find the
1482following useful:
1483
1484You can extend the data conversion shortcuts menu, so for example you
1485can display an SV's IV value with one click, without doing any typing.
1486To do that simply edit ~/.ddd/init file and add after:
1487
1488  ! Display shortcuts.
1489  Ddd*gdbDisplayShortcuts: \
1490  /t ()   // Convert to Bin\n\
1491  /d ()   // Convert to Dec\n\
1492  /x ()   // Convert to Hex\n\
1493  /o ()   // Convert to Oct(\n\
1494
1495the following two lines:
1496
1497  ((XPV*) (())->sv_any )->xpv_pv  // 2pvx\n\
1498  ((XPVIV*) (())->sv_any )->xiv_iv // 2ivx
1499
1500so now you can do ivx and pvx lookups or you can plug there the sv_peek
1501"conversion":
1502
1503  Perl_sv_peek(my_perl, (SV*)()) // sv_peek
1504
1505(The my_perl is for threaded builds.)  Just remember that every line,
1506but the last one, should end with \n\
1507
1508Alternatively edit the init file interactively via: 3rd mouse button ->
1509New Display -> Edit Menu
1510
1511Note: you can define up to 20 conversion shortcuts in the gdb section.
1512
1513=head2 C backtrace
1514
1515On some platforms Perl supports retrieving the C level backtrace
1516(similar to what symbolic debuggers like gdb do).
1517
1518The backtrace returns the stack trace of the C call frames,
1519with the symbol names (function names), the object names (like "perl"),
1520and if it can, also the source code locations (file:line).
1521
1522The supported platforms are Linux, and OS X (some *BSD might
1523work at least partly, but they have not yet been tested).
1524
1525This feature hasn't been tested with multiple threads, but it will
1526only show the backtrace of the thread doing the backtracing.
1527
1528The feature needs to be enabled with C<Configure -Dusecbacktrace>.
1529
1530The C<-Dusecbacktrace> also enables keeping the debug information when
1531compiling/linking (often: C<-g>).  Many compilers/linkers do support
1532having both optimization and keeping the debug information.  The debug
1533information is needed for the symbol names and the source locations.
1534
1535Static functions might not be visible for the backtrace.
1536
1537Source code locations, even if available, can often be missing or
1538misleading if the compiler has e.g. inlined code.  Optimizer can
1539make matching the source code and the object code quite challenging.
1540
1541=over 4
1542
1543=item Linux
1544
1545You B<must> have the BFD (-lbfd) library installed, otherwise C<perl> will
1546fail to link.  The BFD is usually distributed as part of the GNU binutils.
1547
1548Summary: C<Configure ... -Dusecbacktrace>
1549and you need C<-lbfd>.
1550
1551=item OS X
1552
1553The source code locations are supported B<only> if you have
1554the Developer Tools installed.  (BFD is B<not> needed.)
1555
1556Summary: C<Configure ... -Dusecbacktrace>
1557and installing the Developer Tools would be good.
1558
1559=back
1560
1561Optionally, for trying out the feature, you may want to enable
1562automatic dumping of the backtrace just before a warning or croak (die)
1563message is emitted, by adding C<-Accflags=-DUSE_C_BACKTRACE_ON_ERROR>
1564for Configure.
1565
1566Unless the above additional feature is enabled, nothing about the
1567backtrace functionality is visible, except for the Perl/XS level.
1568
1569Furthermore, even if you have enabled this feature to be compiled,
1570you need to enable it in runtime with an environment variable:
1571C<PERL_C_BACKTRACE_ON_ERROR=10>.  It must be an integer higher
1572than zero, telling the desired frame count.
1573
1574Retrieving the backtrace from Perl level (using for example an XS
1575extension) would be much less exciting than one would hope: normally
1576you would see C<runops>, C<entersub>, and not much else.  This API is
1577intended to be called B<from within> the Perl implementation, not from
1578Perl level execution.
1579
1580The C API for the backtrace is as follows:
1581
1582=over 4
1583
1584=item get_c_backtrace
1585
1586=item free_c_backtrace
1587
1588=item get_c_backtrace_dump
1589
1590=item dump_c_backtrace
1591
1592=back
1593
1594=head2 Poison
1595
1596If you see in a debugger a memory area mysteriously full of 0xABABABAB
1597or 0xEFEFEFEF, you may be seeing the effect of the Poison() macros, see
1598L<perlclib>.
1599
1600=head2 Read-only optrees
1601
1602Under ithreads the optree is read only.  If you want to enforce this, to
1603check for write accesses from buggy code, compile with
1604C<-Accflags=-DPERL_DEBUG_READONLY_OPS>
1605to enable code that allocates op memory
1606via C<mmap>, and sets it read-only when it is attached to a subroutine.
1607Any write access to an op results in a C<SIGBUS> and abort.
1608
1609This code is intended for development only, and may not be portable
1610even to all Unix variants.  Also, it is an 80% solution, in that it
1611isn't able to make all ops read only.  Specifically it does not apply to
1612op slabs belonging to C<BEGIN> blocks.
1613
1614However, as an 80% solution it is still effective, as it has caught
1615bugs in the past.
1616
1617=head2 When is a bool not a bool?
1618
1619On pre-C99 compilers, C<bool> is defined as equivalent to C<char>.
1620Consequently assignment of any larger type to a C<bool> is unsafe and may
1621be truncated.  The C<cBOOL> macro exists to cast it correctly.
1622
1623On those platforms and compilers where C<bool> really is a boolean (C++,
1624C99), it is easy to forget the cast.  You can force C<bool> to be a C<char>
1625by compiling with C<-Accflags=-DPERL_BOOL_AS_CHAR>.  You may also wish to
1626run C<Configure> with something like
1627
1628    -Accflags='-Wconversion -Wno-sign-conversion -Wno-shorten-64-to-32'
1629
1630or your compiler's equivalent to make it easier to spot any unsafe truncations
1631that show up.
1632
1633=head2 The .i Targets
1634
1635You can expand the macros in a F<foo.c> file by saying
1636
1637    make foo.i
1638
1639which will expand the macros using cpp.  Don't be scared by the
1640results.
1641
1642=head1 AUTHOR
1643
1644This document was originally written by Nathan Torkington, and is
1645maintained by the perl5-porters mailing list.
1646