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