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