xref: /openbsd/gnu/usr.bin/perl/pod/perlhacktips.pod (revision 264ca280)
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, 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 data 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 = *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 'A', but not 0x41.  You can
279safely say '\n', but not \012.  If a character doesn't have a trivial
280input form, you should add it to the list in
281F<regen/unicode_constants.pl>, and have Perl create #defines for you,
282based on the current platform.
283
284Also, the range 'A' - 'Z' in ASCII is an unbroken sequence of 26 upper
285case alphabetic characters.  That is not true in EBCDIC.  Nor for 'a' to
286'z'.  But '0' - '9' is an unbroken range in both systems.  Don't assume
287anything about other ranges.
288
289Many of the comments in the existing code ignore the possibility of
290EBCDIC, and may be wrong therefore, even if the code works.  This is
291actually a tribute to the successful transparent insertion of being
292able to handle EBCDIC without having to change pre-existing code.
293
294UTF-8 and UTF-EBCDIC are two different encodings used to represent
295Unicode code points as sequences of bytes.  Macros  with the same names
296(but different definitions) in C<utf8.h> and C<utfebcdic.h> are used to
297allow the calling code to think that there is only one such encoding.
298This is almost always referred to as C<utf8>, but it means the EBCDIC
299version as well.  Again, comments in the code may well be wrong even if
300the code itself is right.  For example, the concept of C<invariant
301characters> differs between ASCII and EBCDIC.  On ASCII platforms, only
302characters that do not have the high-order bit set (i.e.  whose ordinals
303are strict ASCII, 0 - 127) are invariant, and the documentation and
304comments in the code may assume that, often referring to something
305like, say, C<hibit>.  The situation differs and is not so simple on
306EBCDIC machines, but as long as the code itself uses the
307C<NATIVE_IS_INVARIANT()> macro appropriately, it works, even if the
308comments are wrong.
309
310=item *
311
312Assuming the character set is just ASCII
313
314ASCII is a 7 bit encoding, but bytes have 8 bits in them.  The 128 extra
315characters have different meanings depending on the locale.  Absent a
316locale, currently these extra characters are generally considered to be
317unassigned, and this has presented some problems.  This is being changed
318starting in 5.12 so that these characters will be considered to be
319Latin-1 (ISO-8859-1).
320
321=item *
322
323Mixing #define and #ifdef
324
325  #define BURGLE(x) ... \
326  #ifdef BURGLE_OLD_STYLE        /* BAD */
327  ... do it the old way ... \
328  #else
329  ... do it the new way ... \
330  #endif
331
332You cannot portably "stack" cpp directives.  For example in the above
333you need two separate BURGLE() #defines, one for each #ifdef branch.
334
335=item *
336
337Adding non-comment stuff after #endif or #else
338
339  #ifdef SNOSH
340  ...
341  #else !SNOSH    /* BAD */
342  ...
343  #endif SNOSH    /* BAD */
344
345The #endif and #else cannot portably have anything non-comment after
346them.  If you want to document what is going (which is a good idea
347especially if the branches are long), use (C) comments:
348
349  #ifdef SNOSH
350  ...
351  #else /* !SNOSH */
352  ...
353  #endif /* SNOSH */
354
355The gcc option C<-Wendif-labels> warns about the bad variant (by
356default on starting from Perl 5.9.4).
357
358=item *
359
360Having a comma after the last element of an enum list
361
362  enum color {
363    CERULEAN,
364    CHARTREUSE,
365    CINNABAR,     /* BAD */
366  };
367
368is not portable.  Leave out the last comma.
369
370Also note that whether enums are implicitly morphable to ints varies
371between compilers, you might need to (int).
372
373=item *
374
375Using //-comments
376
377  // This function bamfoodles the zorklator.   /* BAD */
378
379That is C99 or C++.  Perl is C89.  Using the //-comments is silently
380allowed by many C compilers but cranking up the ANSI C89 strictness
381(which we like to do) causes the compilation to fail.
382
383=item *
384
385Mixing declarations and code
386
387  void zorklator()
388  {
389    int n = 3;
390    set_zorkmids(n);    /* BAD */
391    int q = 4;
392
393That is C99 or C++.  Some C compilers allow that, but you shouldn't.
394
395The gcc option C<-Wdeclaration-after-statements> scans for such
396problems (by default on starting from Perl 5.9.4).
397
398=item *
399
400Introducing variables inside for()
401
402  for(int i = ...; ...; ...) {    /* BAD */
403
404That is C99 or C++.  While it would indeed be awfully nice to have that
405also in C89, to limit the scope of the loop variable, alas, we cannot.
406
407=item *
408
409Mixing signed char pointers with unsigned char pointers
410
411  int foo(char *s) { ... }
412  ...
413  unsigned char *t = ...; /* Or U8* t = ... */
414  foo(t);   /* BAD */
415
416While this is legal practice, it is certainly dubious, and downright
417fatal in at least one platform: for example VMS cc considers this a
418fatal error.  One cause for people often making this mistake is that a
419"naked char" and therefore dereferencing a "naked char pointer" have an
420undefined signedness: it depends on the compiler and the flags of the
421compiler and the underlying platform whether the result is signed or
422unsigned.  For this very same reason using a 'char' as an array index is
423bad.
424
425=item *
426
427Macros that have string constants and their arguments as substrings of
428the string constants
429
430  #define FOO(n) printf("number = %d\n", n)    /* BAD */
431  FOO(10);
432
433Pre-ANSI semantics for that was equivalent to
434
435  printf("10umber = %d\10");
436
437which is probably not what you were expecting.  Unfortunately at least
438one reasonably common and modern C compiler does "real backward
439compatibility" here, in AIX that is what still happens even though the
440rest of the AIX compiler is very happily C89.
441
442=item *
443
444Using printf formats for non-basic C types
445
446   IV i = ...;
447   printf("i = %d\n", i);    /* BAD */
448
449While this might by accident work in some platform (where IV happens to
450be an C<int>), in general it cannot.  IV might be something larger.  Even
451worse the situation is with more specific types (defined by Perl's
452configuration step in F<config.h>):
453
454   Uid_t who = ...;
455   printf("who = %d\n", who);    /* BAD */
456
457The problem here is that Uid_t might be not only not C<int>-wide but it
458might also be unsigned, in which case large uids would be printed as
459negative values.
460
461There is no simple solution to this because of printf()'s limited
462intelligence, but for many types the right format is available as with
463either 'f' or '_f' suffix, for example:
464
465   IVdf /* IV in decimal */
466   UVxf /* UV is hexadecimal */
467
468   printf("i = %"IVdf"\n", i); /* The IVdf is a string constant. */
469
470   Uid_t_f /* Uid_t in decimal */
471
472   printf("who = %"Uid_t_f"\n", who);
473
474Or you can try casting to a "wide enough" type:
475
476   printf("i = %"IVdf"\n", (IV)something_very_small_and_signed);
477
478Also remember that the C<%p> format really does require a void pointer:
479
480   U8* p = ...;
481   printf("p = %p\n", (void*)p);
482
483The gcc option C<-Wformat> scans for such problems.
484
485=item *
486
487Blindly using variadic macros
488
489gcc has had them for a while with its own syntax, and C99 brought them
490with a standardized syntax.  Don't use the former, and use the latter
491only if the HAS_C99_VARIADIC_MACROS is defined.
492
493=item *
494
495Blindly passing va_list
496
497Not all platforms support passing va_list to further varargs (stdarg)
498functions.  The right thing to do is to copy the va_list using the
499Perl_va_copy() if the NEED_VA_COPY is defined.
500
501=item *
502
503Using gcc statement expressions
504
505   val = ({...;...;...});    /* BAD */
506
507While a nice extension, it's not portable.  The Perl code does
508admittedly use them if available to gain some extra speed (essentially
509as a funky form of inlining), but you shouldn't.
510
511=item *
512
513Binding together several statements in a macro
514
515Use the macros STMT_START and STMT_END.
516
517   STMT_START {
518      ...
519   } STMT_END
520
521=item *
522
523Testing for operating systems or versions when should be testing for
524features
525
526  #ifdef __FOONIX__    /* BAD */
527  foo = quux();
528  #endif
529
530Unless you know with 100% certainty that quux() is only ever available
531for the "Foonix" operating system B<and> that is available B<and>
532correctly working for B<all> past, present, B<and> future versions of
533"Foonix", the above is very wrong.  This is more correct (though still
534not perfect, because the below is a compile-time check):
535
536  #ifdef HAS_QUUX
537  foo = quux();
538  #endif
539
540How does the HAS_QUUX become defined where it needs to be?  Well, if
541Foonix happens to be Unixy enough to be able to run the Configure
542script, and Configure has been taught about detecting and testing
543quux(), the HAS_QUUX will be correctly defined.  In other platforms, the
544corresponding configuration step will hopefully do the same.
545
546In a pinch, if you cannot wait for Configure to be educated, or if you
547have a good hunch of where quux() might be available, you can
548temporarily try the following:
549
550  #if (defined(__FOONIX__) || defined(__BARNIX__))
551  # define HAS_QUUX
552  #endif
553
554  ...
555
556  #ifdef HAS_QUUX
557  foo = quux();
558  #endif
559
560But in any case, try to keep the features and operating systems
561separate.
562
563=item *
564
565Assuming the contents of static memory pointed to by the return values
566of Perl wrappers for C library functions doesn't change.  Many C library
567functions return pointers to static storage that can be overwritten by
568subsequent calls to the same or related functions.  Perl has
569light-weight wrappers for some of these functions, and which don't make
570copies of the static memory.  A good example is the interface to the
571environment variables that are in effect for the program.  Perl has
572C<PerlEnv_getenv> to get values from the environment.  But the return is
573a pointer to static memory in the C library.  If you are using the value
574to immediately test for something, that's fine, but if you save the
575value and expect it to be unchanged by later processing, you would be
576wrong, but perhaps you wouldn't know it because different C library
577implementations behave differently, and the one on the platform you're
578testing on might work for your situation.  But on some platforms, a
579subsequent call to C<PerlEnv_getenv> or related function WILL overwrite
580the memory that your first call points to.  This has led to some
581hard-to-debug problems.  Do a L<perlapi/savepv> to make a copy, thus
582avoiding these problems.  You will have to free the copy when you're
583done to avoid memory leaks.  If you don't have control over when it gets
584freed, you'll need to make the copy in a mortal scalar, like so:
585
586 if ((s = PerlEnv_getenv("foo") == NULL) {
587    ... /* handle NULL case */
588 }
589 else {
590     s = SvPVX(sv_2mortal(newSVpv(s, 0)));
591 }
592
593The above example works only if C<"s"> is C<NUL>-terminated; otherwise
594you have to pass its length to C<newSVpv>.
595
596=back
597
598=head2 Problematic System Interfaces
599
600=over 4
601
602=item *
603
604malloc(0), realloc(0), calloc(0, 0) are non-portable.  To be portable
605allocate at least one byte.  (In general you should rarely need to work
606at this low level, but instead use the various malloc wrappers.)
607
608=item *
609
610snprintf() - the return type is unportable.  Use my_snprintf() instead.
611
612=back
613
614=head2 Security problems
615
616Last but not least, here are various tips for safer coding.
617See also L<perlclib> for libc/stdio replacements one should use.
618
619=over 4
620
621=item *
622
623Do not use gets()
624
625Or we will publicly ridicule you.  Seriously.
626
627=item *
628
629Do not use tmpfile()
630
631Use mkstemp() instead.
632
633=item *
634
635Do not use strcpy() or strcat() or strncpy() or strncat()
636
637Use my_strlcpy() and my_strlcat() instead: they either use the native
638implementation, or Perl's own implementation (borrowed from the public
639domain implementation of INN).
640
641=item *
642
643Do not use sprintf() or vsprintf()
644
645If you really want just plain byte strings, use my_snprintf() and
646my_vsnprintf() instead, which will try to use snprintf() and
647vsnprintf() if those safer APIs are available.  If you want something
648fancier than a plain byte string, use
649L<C<Perl_form>()|perlapi/form> or SVs and
650L<C<Perl_sv_catpvf()>|perlapi/sv_catpvf>.
651
652Note that glibc C<printf()>, C<sprintf()>, etc. are buggy before glibc
653version 2.17.  They won't allow a C<%.s> format with a precision to
654create a string that isn't valid UTF-8 if the current underlying locale
655of the program is UTF-8.  What happens is that the C<%s> and its operand are
656simply skipped without any notice.
657L<https://sourceware.org/bugzilla/show_bug.cgi?id=6530>.
658
659=back
660
661=head1 DEBUGGING
662
663You can compile a special debugging version of Perl, which allows you
664to use the C<-D> option of Perl to tell more about what Perl is doing.
665But sometimes there is no alternative than to dive in with a debugger,
666either to see the stack trace of a core dump (very useful in a bug
667report), or trying to figure out what went wrong before the core dump
668happened, or how did we end up having wrong or unexpected results.
669
670=head2 Poking at Perl
671
672To really poke around with Perl, you'll probably want to build Perl for
673debugging, like this:
674
675    ./Configure -d -D optimize=-g
676    make
677
678C<-g> is a flag to the C compiler to have it produce debugging
679information which will allow us to step through a running program, and
680to see in which C function we are at (without the debugging information
681we might see only the numerical addresses of the functions, which is
682not very helpful).
683
684F<Configure> will also turn on the C<DEBUGGING> compilation symbol
685which enables all the internal debugging code in Perl.  There are a
686whole bunch of things you can debug with this: L<perlrun> lists them
687all, and the best way to find out about them is to play about with
688them.  The most useful options are probably
689
690    l  Context (loop) stack processing
691    t  Trace execution
692    o  Method and overloading resolution
693    c  String/numeric conversions
694
695Some of the functionality of the debugging code can be achieved using
696XS modules.
697
698    -Dr => use re 'debug'
699    -Dx => use O 'Debug'
700
701=head2 Using a source-level debugger
702
703If the debugging output of C<-D> doesn't help you, it's time to step
704through perl's execution with a source-level debugger.
705
706=over 3
707
708=item *
709
710We'll use C<gdb> for our examples here; the principles will apply to
711any debugger (many vendors call their debugger C<dbx>), but check the
712manual of the one you're using.
713
714=back
715
716To fire up the debugger, type
717
718    gdb ./perl
719
720Or if you have a core dump:
721
722    gdb ./perl core
723
724You'll want to do that in your Perl source tree so the debugger can
725read the source code.  You should see the copyright message, followed by
726the prompt.
727
728    (gdb)
729
730C<help> will get you into the documentation, but here are the most
731useful commands:
732
733=over 3
734
735=item * run [args]
736
737Run the program with the given arguments.
738
739=item * break function_name
740
741=item * break source.c:xxx
742
743Tells the debugger that we'll want to pause execution when we reach
744either the named function (but see L<perlguts/Internal Functions>!) or
745the given line in the named source file.
746
747=item * step
748
749Steps through the program a line at a time.
750
751=item * next
752
753Steps through the program a line at a time, without descending into
754functions.
755
756=item * continue
757
758Run until the next breakpoint.
759
760=item * finish
761
762Run until the end of the current function, then stop again.
763
764=item * 'enter'
765
766Just pressing Enter will do the most recent operation again - it's a
767blessing when stepping through miles of source code.
768
769=item * ptype
770
771Prints the C definition of the argument given.
772
773  (gdb) ptype PL_op
774  type = struct op {
775      OP *op_next;
776      OP *op_sibling;
777      OP *(*op_ppaddr)(void);
778      PADOFFSET op_targ;
779      unsigned int op_type : 9;
780      unsigned int op_opt : 1;
781      unsigned int op_slabbed : 1;
782      unsigned int op_savefree : 1;
783      unsigned int op_static : 1;
784      unsigned int op_folded : 1;
785      unsigned int op_spare : 2;
786      U8 op_flags;
787      U8 op_private;
788  } *
789
790=item * print
791
792Execute the given C code and print its results.  B<WARNING>: Perl makes
793heavy use of macros, and F<gdb> does not necessarily support macros
794(see later L</"gdb macro support">).  You'll have to substitute them
795yourself, or to invoke cpp on the source code files (see L</"The .i
796Targets">) So, for instance, you can't say
797
798    print SvPV_nolen(sv)
799
800but you have to say
801
802    print Perl_sv_2pv_nolen(sv)
803
804=back
805
806You may find it helpful to have a "macro dictionary", which you can
807produce by saying C<cpp -dM perl.c | sort>.  Even then, F<cpp> won't
808recursively apply those macros for you.
809
810=head2 gdb macro support
811
812Recent versions of F<gdb> have fairly good macro support, but in order
813to use it you'll need to compile perl with macro definitions included
814in the debugging information.  Using F<gcc> version 3.1, this means
815configuring with C<-Doptimize=-g3>.  Other compilers might use a
816different switch (if they support debugging macros at all).
817
818=head2 Dumping Perl Data Structures
819
820One way to get around this macro hell is to use the dumping functions
821in F<dump.c>; these work a little like an internal
822L<Devel::Peek|Devel::Peek>, but they also cover OPs and other
823structures that you can't get at from Perl.  Let's take an example.
824We'll use the C<$a = $b + $c> we used before, but give it a bit of
825context: C<$b = "6XXXX"; $c = 2.3;>.  Where's a good place to stop and
826poke around?
827
828What about C<pp_add>, the function we examined earlier to implement the
829C<+> operator:
830
831    (gdb) break Perl_pp_add
832    Breakpoint 1 at 0x46249f: file pp_hot.c, line 309.
833
834Notice we use C<Perl_pp_add> and not C<pp_add> - see
835L<perlguts/Internal Functions>.  With the breakpoint in place, we can
836run our program:
837
838    (gdb) run -e '$b = "6XXXX"; $c = 2.3; $a = $b + $c'
839
840Lots of junk will go past as gdb reads in the relevant source files and
841libraries, and then:
842
843    Breakpoint 1, Perl_pp_add () at pp_hot.c:309
844    309         dSP; dATARGET; tryAMAGICbin(add,opASSIGN);
845    (gdb) step
846    311           dPOPTOPnnrl_ul;
847    (gdb)
848
849We looked at this bit of code before, and we said that
850C<dPOPTOPnnrl_ul> arranges for two C<NV>s to be placed into C<left> and
851C<right> - let's slightly expand it:
852
853 #define dPOPTOPnnrl_ul  NV right = POPn; \
854                         SV *leftsv = TOPs; \
855                         NV left = USE_LEFT(leftsv) ? SvNV(leftsv) : 0.0
856
857C<POPn> takes the SV from the top of the stack and obtains its NV
858either directly (if C<SvNOK> is set) or by calling the C<sv_2nv>
859function.  C<TOPs> takes the next SV from the top of the stack - yes,
860C<POPn> uses C<TOPs> - but doesn't remove it.  We then use C<SvNV> to
861get the NV from C<leftsv> in the same way as before - yes, C<POPn> uses
862C<SvNV>.
863
864Since we don't have an NV for C<$b>, we'll have to use C<sv_2nv> to
865convert it.  If we step again, we'll find ourselves there:
866
867    (gdb) step
868    Perl_sv_2nv (sv=0xa0675d0) at sv.c:1669
869    1669        if (!sv)
870    (gdb)
871
872We can now use C<Perl_sv_dump> to investigate the SV:
873
874    (gdb) print Perl_sv_dump(sv)
875    SV = PV(0xa057cc0) at 0xa0675d0
876    REFCNT = 1
877    FLAGS = (POK,pPOK)
878    PV = 0xa06a510 "6XXXX"\0
879    CUR = 5
880    LEN = 6
881    $1 = void
882
883We know we're going to get C<6> from this, so let's finish the
884subroutine:
885
886    (gdb) finish
887    Run till exit from #0  Perl_sv_2nv (sv=0xa0675d0) at sv.c:1671
888    0x462669 in Perl_pp_add () at pp_hot.c:311
889    311           dPOPTOPnnrl_ul;
890
891We can also dump out this op: the current op is always stored in
892C<PL_op>, and we can dump it with C<Perl_op_dump>.  This'll give us
893similar output to L<B::Debug|B::Debug>.
894
895    (gdb) print Perl_op_dump(PL_op)
896    {
897    13  TYPE = add  ===> 14
898        TARG = 1
899        FLAGS = (SCALAR,KIDS)
900        {
901            TYPE = null  ===> (12)
902              (was rv2sv)
903            FLAGS = (SCALAR,KIDS)
904            {
905    11          TYPE = gvsv  ===> 12
906                FLAGS = (SCALAR)
907                GV = main::b
908            }
909        }
910
911# finish this later #
912
913=head2 Using gdb to look at specific parts of a program
914
915With the example above, you knew to look for C<Perl_pp_add>, but what if
916there were multiple calls to it all over the place, or you didn't know what
917the op was you were looking for?
918
919One way to do this is to inject a rare call somewhere near what you're looking
920for.  For example, you could add C<study> before your method:
921
922    study;
923
924And in gdb do:
925
926    (gdb) break Perl_pp_study
927
928And then step until you hit what you're
929looking for.  This works well in a loop
930if you want to only break at certain iterations:
931
932    for my $c (1..100) {
933        study if $c == 50;
934    }
935
936=head2 Using gdb to look at what the parser/lexer are doing
937
938If you want to see what perl is doing when parsing/lexing your code, you can
939use C<BEGIN {}>:
940
941    print "Before\n";
942    BEGIN { study; }
943    print "After\n";
944
945And in gdb:
946
947    (gdb) break Perl_pp_study
948
949If you want to see what the parser/lexer is doing inside of C<if> blocks and
950the like you need to be a little trickier:
951
952    if ($a && $b && do { BEGIN { study } 1 } && $c) { ... }
953
954=head1 SOURCE CODE STATIC ANALYSIS
955
956Various tools exist for analysing C source code B<statically>, as
957opposed to B<dynamically>, that is, without executing the code.  It is
958possible to detect resource leaks, undefined behaviour, type
959mismatches, portability problems, code paths that would cause illegal
960memory accesses, and other similar problems by just parsing the C code
961and looking at the resulting graph, what does it tell about the
962execution and data flows.  As a matter of fact, this is exactly how C
963compilers know to give warnings about dubious code.
964
965=head2 lint, splint
966
967The good old C code quality inspector, C<lint>, is available in several
968platforms, but please be aware that there are several different
969implementations of it by different vendors, which means that the flags
970are not identical across different platforms.
971
972There is a lint variant called C<splint> (Secure Programming Lint)
973available from http://www.splint.org/ that should compile on any
974Unix-like platform.
975
976There are C<lint> and <splint> targets in Makefile, but you may have to
977diddle with the flags (see above).
978
979=head2 Coverity
980
981Coverity (http://www.coverity.com/) is a product similar to lint and as
982a testbed for their product they periodically check several open source
983projects, and they give out accounts to open source developers to the
984defect databases.
985
986=head2 cpd (cut-and-paste detector)
987
988The cpd tool detects cut-and-paste coding.  If one instance of the
989cut-and-pasted code changes, all the other spots should probably be
990changed, too.  Therefore such code should probably be turned into a
991subroutine or a macro.
992
993cpd (http://pmd.sourceforge.net/cpd.html) is part of the pmd project
994(http://pmd.sourceforge.net/).  pmd was originally written for static
995analysis of Java code, but later the cpd part of it was extended to
996parse also C and C++.
997
998Download the pmd-bin-X.Y.zip () from the SourceForge site, extract the
999pmd-X.Y.jar from it, and then run that on source code thusly:
1000
1001  java -cp pmd-X.Y.jar net.sourceforge.pmd.cpd.CPD \
1002   --minimum-tokens 100 --files /some/where/src --language c > cpd.txt
1003
1004You may run into memory limits, in which case you should use the -Xmx
1005option:
1006
1007  java -Xmx512M ...
1008
1009=head2 gcc warnings
1010
1011Though much can be written about the inconsistency and coverage
1012problems of gcc warnings (like C<-Wall> not meaning "all the warnings",
1013or some common portability problems not being covered by C<-Wall>, or
1014C<-ansi> and C<-pedantic> both being a poorly defined collection of
1015warnings, and so forth), gcc is still a useful tool in keeping our
1016coding nose clean.
1017
1018The C<-Wall> is by default on.
1019
1020The C<-ansi> (and its sidekick, C<-pedantic>) would be nice to be on
1021always, but unfortunately they are not safe on all platforms, they can
1022for example cause fatal conflicts with the system headers (Solaris
1023being a prime example).  If Configure C<-Dgccansipedantic> is used, the
1024C<cflags> frontend selects C<-ansi -pedantic> for the platforms where
1025they are known to be safe.
1026
1027Starting from Perl 5.9.4 the following extra flags are added:
1028
1029=over 4
1030
1031=item *
1032
1033C<-Wendif-labels>
1034
1035=item *
1036
1037C<-Wextra>
1038
1039=item *
1040
1041C<-Wdeclaration-after-statement>
1042
1043=back
1044
1045The following flags would be nice to have but they would first need
1046their own Augean stablemaster:
1047
1048=over 4
1049
1050=item *
1051
1052C<-Wpointer-arith>
1053
1054=item *
1055
1056C<-Wshadow>
1057
1058=item *
1059
1060C<-Wstrict-prototypes>
1061
1062=back
1063
1064The C<-Wtraditional> is another example of the annoying tendency of gcc
1065to bundle a lot of warnings under one switch (it would be impossible to
1066deploy in practice because it would complain a lot) but it does contain
1067some warnings that would be beneficial to have available on their own,
1068such as the warning about string constants inside macros containing the
1069macro arguments: this behaved differently pre-ANSI than it does in
1070ANSI, and some C compilers are still in transition, AIX being an
1071example.
1072
1073=head2 Warnings of other C compilers
1074
1075Other C compilers (yes, there B<are> other C compilers than gcc) often
1076have their "strict ANSI" or "strict ANSI with some portability
1077extensions" modes on, like for example the Sun Workshop has its C<-Xa>
1078mode on (though implicitly), or the DEC (these days, HP...) has its
1079C<-std1> mode on.
1080
1081=head1 MEMORY DEBUGGERS
1082
1083B<NOTE 1>: Running under older memory debuggers such as Purify,
1084valgrind or Third Degree greatly slows down the execution: seconds
1085become minutes, minutes become hours.  For example as of Perl 5.8.1, the
1086ext/Encode/t/Unicode.t takes extraordinarily long to complete under
1087e.g. Purify, Third Degree, and valgrind.  Under valgrind it takes more
1088than six hours, even on a snappy computer.  The said test must be doing
1089something that is quite unfriendly for memory debuggers.  If you don't
1090feel like waiting, that you can simply kill away the perl process.
1091Roughly valgrind slows down execution by factor 10, AddressSanitizer by
1092factor 2.
1093
1094B<NOTE 2>: To minimize the number of memory leak false alarms (see
1095L</PERL_DESTRUCT_LEVEL> for more information), you have to set the
1096environment variable PERL_DESTRUCT_LEVEL to 2.  For example, like this:
1097
1098    env PERL_DESTRUCT_LEVEL=2 valgrind ./perl -Ilib ...
1099
1100B<NOTE 3>: There are known memory leaks when there are compile-time
1101errors within eval or require, seeing C<S_doeval> in the call stack is
1102a good sign of these.  Fixing these leaks is non-trivial, unfortunately,
1103but they must be fixed eventually.
1104
1105B<NOTE 4>: L<DynaLoader> will not clean up after itself completely
1106unless Perl is built with the Configure option
1107C<-Accflags=-DDL_UNLOAD_ALL_AT_EXIT>.
1108
1109=head2 valgrind
1110
1111The valgrind tool can be used to find out both memory leaks and illegal
1112heap memory accesses.  As of version 3.3.0, Valgrind only supports Linux
1113on x86, x86-64 and PowerPC and Darwin (OS X) on x86 and x86-64).  The
1114special "test.valgrind" target can be used to run the tests under
1115valgrind.  Found errors and memory leaks are logged in files named
1116F<testfile.valgrind>.
1117
1118Valgrind also provides a cachegrind tool, invoked on perl as:
1119
1120    VG_OPTS=--tool=cachegrind make test.valgrind
1121
1122As system libraries (most notably glibc) are also triggering errors,
1123valgrind allows to suppress such errors using suppression files.  The
1124default suppression file that comes with valgrind already catches a lot
1125of them.  Some additional suppressions are defined in F<t/perl.supp>.
1126
1127To get valgrind and for more information see
1128
1129    http://valgrind.org/
1130
1131=head2 AddressSanitizer
1132
1133AddressSanitizer is a clang and gcc extension, included in clang since
1134v3.1 and gcc since v4.8.  It checks illegal heap pointers, global
1135pointers, stack pointers and use after free errors, and is fast enough
1136that you can easily compile your debugging or optimized perl with it.
1137It does not check memory leaks though.  AddressSanitizer is available
1138for Linux, Mac OS X and soon on Windows.
1139
1140To build perl with AddressSanitizer, your Configure invocation should
1141look like:
1142
1143    sh Configure -des -Dcc=clang \
1144       -Accflags=-faddress-sanitizer -Aldflags=-faddress-sanitizer \
1145       -Alddlflags=-shared\ -faddress-sanitizer
1146
1147where these arguments mean:
1148
1149=over 4
1150
1151=item * -Dcc=clang
1152
1153This should be replaced by the full path to your clang executable if it
1154is not in your path.
1155
1156=item * -Accflags=-faddress-sanitizer
1157
1158Compile perl and extensions sources with AddressSanitizer.
1159
1160=item * -Aldflags=-faddress-sanitizer
1161
1162Link the perl executable with AddressSanitizer.
1163
1164=item * -Alddlflags=-shared\ -faddress-sanitizer
1165
1166Link dynamic extensions with AddressSanitizer.  You must manually
1167specify C<-shared> because using C<-Alddlflags=-shared> will prevent
1168Configure from setting a default value for C<lddlflags>, which usually
1169contains C<-shared> (at least on Linux).
1170
1171=back
1172
1173See also
1174L<http://code.google.com/p/address-sanitizer/wiki/AddressSanitizer>.
1175
1176
1177=head1 PROFILING
1178
1179Depending on your platform there are various ways of profiling Perl.
1180
1181There are two commonly used techniques of profiling executables:
1182I<statistical time-sampling> and I<basic-block counting>.
1183
1184The first method takes periodically samples of the CPU program counter,
1185and since the program counter can be correlated with the code generated
1186for functions, we get a statistical view of in which functions the
1187program is spending its time.  The caveats are that very small/fast
1188functions have lower probability of showing up in the profile, and that
1189periodically interrupting the program (this is usually done rather
1190frequently, in the scale of milliseconds) imposes an additional
1191overhead that may skew the results.  The first problem can be alleviated
1192by running the code for longer (in general this is a good idea for
1193profiling), the second problem is usually kept in guard by the
1194profiling tools themselves.
1195
1196The second method divides up the generated code into I<basic blocks>.
1197Basic blocks are sections of code that are entered only in the
1198beginning and exited only at the end.  For example, a conditional jump
1199starts a basic block.  Basic block profiling usually works by
1200I<instrumenting> the code by adding I<enter basic block #nnnn>
1201book-keeping code to the generated code.  During the execution of the
1202code the basic block counters are then updated appropriately.  The
1203caveat is that the added extra code can skew the results: again, the
1204profiling tools usually try to factor their own effects out of the
1205results.
1206
1207=head2 Gprof Profiling
1208
1209I<gprof> is a profiling tool available in many Unix platforms which
1210uses I<statistical time-sampling>.  You can build a profiled version of
1211F<perl> by compiling using gcc with the flag C<-pg>.  Either edit
1212F<config.sh> or re-run F<Configure>.  Running the profiled version of
1213Perl will create an output file called F<gmon.out> which contains the
1214profiling data collected during the execution.
1215
1216quick hint:
1217
1218    $ sh Configure -des -Dusedevel -Accflags='-pg' \
1219        -Aldflags='-pg' -Alddlflags='-pg -shared' \
1220        && make perl
1221    $ ./perl ... # creates gmon.out in current directory
1222    $ gprof ./perl > out
1223    $ less out
1224
1225(you probably need to add C<-shared> to the <-Alddlflags> line until RT
1226#118199 is resolved)
1227
1228The F<gprof> tool can then display the collected data in various ways.
1229Usually F<gprof> understands the following options:
1230
1231=over 4
1232
1233=item * -a
1234
1235Suppress statically defined functions from the profile.
1236
1237=item * -b
1238
1239Suppress the verbose descriptions in the profile.
1240
1241=item * -e routine
1242
1243Exclude the given routine and its descendants from the profile.
1244
1245=item * -f routine
1246
1247Display only the given routine and its descendants in the profile.
1248
1249=item * -s
1250
1251Generate a summary file called F<gmon.sum> which then may be given to
1252subsequent gprof runs to accumulate data over several runs.
1253
1254=item * -z
1255
1256Display routines that have zero usage.
1257
1258=back
1259
1260For more detailed explanation of the available commands and output
1261formats, see your own local documentation of F<gprof>.
1262
1263=head2 GCC gcov Profiling
1264
1265I<basic block profiling> is officially available in gcc 3.0 and later.
1266You can build a profiled version of F<perl> by compiling using gcc with
1267the flags C<-fprofile-arcs -ftest-coverage>.  Either edit F<config.sh>
1268or re-run F<Configure>.
1269
1270quick hint:
1271
1272    $ sh Configure -des -Dusedevel -Doptimize='-g' \
1273        -Accflags='-fprofile-arcs -ftest-coverage' \
1274        -Aldflags='-fprofile-arcs -ftest-coverage' \
1275        -Alddlflags='-fprofile-arcs -ftest-coverage -shared' \
1276        && make perl
1277    $ rm -f regexec.c.gcov regexec.gcda
1278    $ ./perl ...
1279    $ gcov regexec.c
1280    $ less regexec.c.gcov
1281
1282(you probably need to add C<-shared> to the <-Alddlflags> line until RT
1283#118199 is resolved)
1284
1285Running the profiled version of Perl will cause profile output to be
1286generated.  For each source file an accompanying F<.gcda> file will be
1287created.
1288
1289To display the results you use the I<gcov> utility (which should be
1290installed if you have gcc 3.0 or newer installed).  F<gcov> is run on
1291source code files, like this
1292
1293    gcov sv.c
1294
1295which will cause F<sv.c.gcov> to be created.  The F<.gcov> files contain
1296the source code annotated with relative frequencies of execution
1297indicated by "#" markers.  If you want to generate F<.gcov> files for
1298all profiled object files, you can run something like this:
1299
1300    for file in `find . -name \*.gcno`
1301    do sh -c "cd `dirname $file` && gcov `basename $file .gcno`"
1302    done
1303
1304Useful options of F<gcov> include C<-b> which will summarise the basic
1305block, branch, and function call coverage, and C<-c> which instead of
1306relative frequencies will use the actual counts.  For more information
1307on the use of F<gcov> and basic block profiling with gcc, see the
1308latest GNU CC manual.  As of gcc 4.8, this is at
1309L<http://gcc.gnu.org/onlinedocs/gcc/Gcov-Intro.html#Gcov-Intro>
1310
1311=head1 MISCELLANEOUS TRICKS
1312
1313=head2 PERL_DESTRUCT_LEVEL
1314
1315If you want to run any of the tests yourself manually using e.g.
1316valgrind, please note that by default perl B<does not> explicitly
1317cleanup all the memory it has allocated (such as global memory arenas)
1318but instead lets the exit() of the whole program "take care" of such
1319allocations, also known as "global destruction of objects".
1320
1321There is a way to tell perl to do complete cleanup: set the environment
1322variable PERL_DESTRUCT_LEVEL to a non-zero value.  The t/TEST wrapper
1323does set this to 2, and this is what you need to do too, if you don't
1324want to see the "global leaks": For example, for running under valgrind
1325
1326	env PERL_DESTRUCT_LEVEL=2 valgrind ./perl -Ilib t/foo/bar.t
1327
1328(Note: the mod_perl apache module uses also this environment variable
1329for its own purposes and extended its semantics.  Refer to the mod_perl
1330documentation for more information.  Also, spawned threads do the
1331equivalent of setting this variable to the value 1.)
1332
1333If, at the end of a run you get the message I<N scalars leaked>, you
1334can recompile with C<-DDEBUG_LEAKING_SCALARS>, which will cause the
1335addresses of all those leaked SVs to be dumped along with details as to
1336where each SV was originally allocated.  This information is also
1337displayed by Devel::Peek.  Note that the extra details recorded with
1338each SV increases memory usage, so it shouldn't be used in production
1339environments.  It also converts C<new_SV()> from a macro into a real
1340function, so you can use your favourite debugger to discover where
1341those pesky SVs were allocated.
1342
1343If you see that you're leaking memory at runtime, but neither valgrind
1344nor C<-DDEBUG_LEAKING_SCALARS> will find anything, you're probably
1345leaking SVs that are still reachable and will be properly cleaned up
1346during destruction of the interpreter.  In such cases, using the C<-Dm>
1347switch can point you to the source of the leak.  If the executable was
1348built with C<-DDEBUG_LEAKING_SCALARS>, C<-Dm> will output SV
1349allocations in addition to memory allocations.  Each SV allocation has a
1350distinct serial number that will be written on creation and destruction
1351of the SV.  So if you're executing the leaking code in a loop, you need
1352to look for SVs that are created, but never destroyed between each
1353cycle.  If such an SV is found, set a conditional breakpoint within
1354C<new_SV()> and make it break only when C<PL_sv_serial> is equal to the
1355serial number of the leaking SV.  Then you will catch the interpreter in
1356exactly the state where the leaking SV is allocated, which is
1357sufficient in many cases to find the source of the leak.
1358
1359As C<-Dm> is using the PerlIO layer for output, it will by itself
1360allocate quite a bunch of SVs, which are hidden to avoid recursion.  You
1361can bypass the PerlIO layer if you use the SV logging provided by
1362C<-DPERL_MEM_LOG> instead.
1363
1364=head2 PERL_MEM_LOG
1365
1366If compiled with C<-DPERL_MEM_LOG>, both memory and SV allocations go
1367through logging functions, which is handy for breakpoint setting.
1368
1369Unless C<-DPERL_MEM_LOG_NOIMPL> is also compiled, the logging functions
1370read $ENV{PERL_MEM_LOG} to determine whether to log the event, and if
1371so how:
1372
1373    $ENV{PERL_MEM_LOG} =~ /m/		Log all memory ops
1374    $ENV{PERL_MEM_LOG} =~ /s/		Log all SV ops
1375    $ENV{PERL_MEM_LOG} =~ /t/		include timestamp in Log
1376    $ENV{PERL_MEM_LOG} =~ /^(\d+)/	write to FD given (default is 2)
1377
1378Memory logging is somewhat similar to C<-Dm> but is independent of
1379C<-DDEBUGGING>, and at a higher level; all uses of Newx(), Renew(), and
1380Safefree() are logged with the caller's source code file and line
1381number (and C function name, if supported by the C compiler).  In
1382contrast, C<-Dm> is directly at the point of C<malloc()>.  SV logging is
1383similar.
1384
1385Since the logging doesn't use PerlIO, all SV allocations are logged and
1386no extra SV allocations are introduced by enabling the logging.  If
1387compiled with C<-DDEBUG_LEAKING_SCALARS>, the serial number for each SV
1388allocation is also logged.
1389
1390=head2 DDD over gdb
1391
1392Those debugging perl with the DDD frontend over gdb may find the
1393following useful:
1394
1395You can extend the data conversion shortcuts menu, so for example you
1396can display an SV's IV value with one click, without doing any typing.
1397To do that simply edit ~/.ddd/init file and add after:
1398
1399  ! Display shortcuts.
1400  Ddd*gdbDisplayShortcuts: \
1401  /t ()   // Convert to Bin\n\
1402  /d ()   // Convert to Dec\n\
1403  /x ()   // Convert to Hex\n\
1404  /o ()   // Convert to Oct(\n\
1405
1406the following two lines:
1407
1408  ((XPV*) (())->sv_any )->xpv_pv  // 2pvx\n\
1409  ((XPVIV*) (())->sv_any )->xiv_iv // 2ivx
1410
1411so now you can do ivx and pvx lookups or you can plug there the sv_peek
1412"conversion":
1413
1414  Perl_sv_peek(my_perl, (SV*)()) // sv_peek
1415
1416(The my_perl is for threaded builds.)  Just remember that every line,
1417but the last one, should end with \n\
1418
1419Alternatively edit the init file interactively via: 3rd mouse button ->
1420New Display -> Edit Menu
1421
1422Note: you can define up to 20 conversion shortcuts in the gdb section.
1423
1424=head2 Poison
1425
1426If you see in a debugger a memory area mysteriously full of 0xABABABAB
1427or 0xEFEFEFEF, you may be seeing the effect of the Poison() macros, see
1428L<perlclib>.
1429
1430=head2 Read-only optrees
1431
1432Under ithreads the optree is read only.  If you want to enforce this, to
1433check for write accesses from buggy code, compile with
1434C<-Accflags=-DPERL_DEBUG_READONLY_OPS>
1435to enable code that allocates op memory
1436via C<mmap>, and sets it read-only when it is attached to a subroutine.
1437Any write access to an op results in a C<SIGBUS> and abort.
1438
1439This code is intended for development only, and may not be portable
1440even to all Unix variants.  Also, it is an 80% solution, in that it
1441isn't able to make all ops read only.  Specifically it does not apply to
1442op slabs belonging to C<BEGIN> blocks.
1443
1444However, as an 80% solution it is still effective, as it has caught
1445bugs in the past.
1446
1447=head2 When is a bool not a bool?
1448
1449On pre-C99 compilers, C<bool> is defined as equivalent to C<char>.
1450Consequently assignment of any larger type to a C<bool> is unsafe and may
1451be truncated.  The C<cBOOL> macro exists to cast it correctly.
1452
1453On those platforms and compilers where C<bool> really is a boolean (C++,
1454C99), it is easy to forget the cast.  You can force C<bool> to be a C<char>
1455by compiling with C<-Accflags=-DPERL_BOOL_AS_CHAR>.  You may also wish to
1456run C<Configure> with something like
1457
1458    -Accflags='-Wconversion -Wno-sign-conversion -Wno-shorten-64-to-32'
1459
1460or your compiler's equivalent to make it easier to spot any unsafe truncations
1461that show up.
1462
1463=head2 The .i Targets
1464
1465You can expand the macros in a F<foo.c> file by saying
1466
1467    make foo.i
1468
1469which will expand the macros using cpp.  Don't be scared by the
1470results.
1471
1472=head1 AUTHOR
1473
1474This document was originally written by Nathan Torkington, and is
1475maintained by the perl5-porters mailing list.
1476