1=head1 NAME 2 3todo - Perl TO-DO list 4 5=head1 DESCRIPTION 6 7This is a list of wishes for Perl. The most up to date version of this file 8is at L<https://github.com/Perl/perl5/blob/blead/Porting/todo.pod>. 9 10The tasks we think are smaller or easier are listed first. Anyone is welcome 11to work on any of these, but it's a good idea to first contact 12I<perl5-porters@perl.org> to avoid duplication of effort, and to learn from 13any previous attempts. By all means contact the Steering Council privately 14first if you prefer. 15 16Whilst patches to make the list shorter are most welcome, ideas to add to 17the list are also encouraged. Check the perl5-porters archives for past 18ideas, and any discussion about them. One set of archives may be found at 19L<http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/> 20 21What can we offer you in return? Fame, fortune, and everlasting glory? Maybe 22not, but if your patch is incorporated, then we'll add your name to the 23F<AUTHORS> file, which ships in the official distribution. How many other 24programming languages offer you 1 line of immortality? 25 26=head1 Tasks that only need Perl knowledge 27 28=head2 Label bug tickets by type 29 30Known bugs in Perl are tracked by L<https://github.com/Perl/perl5/issues>. 31It shows bugs and can be filtered by assigned labels. However, many are 32L<unlabeled|https://github.com/Perl/perl5/issues?q=is%3Aopen+is%3Aissue+no%3Alabel> 33or have the label L<"Needs Triage"|https://github.com/Perl/perl5/issues?q=is%3Aopen+is%3Aissue+label%3A%22Needs+Triage%22>. 34This greatly lowers the chances of them getting 35fixed, as the number of open bugs is overwhelming -- too many to wade 36through for someone to try to find the bugs in the parts of 37Perl that s/he knows well enough to try to fix. This task involves 38going through these bugs and assigning one or more labels, and removing the 39"Needs Triage" label if present. 40 41=head2 Ongoing: investigate new bug reports 42 43When a bug report is filed, it would be very helpful to have someone do 44a quick investigation to see if it is a real problem, and to reply to 45the poster about it, asking for example code that reproduces the 46problem. Such code should be added to the test suite as TODO tests, and 47the ticket should be classified by type. To get started on this task, 48look at the issues with no comments at 49L<https://github.com/Perl/perl5/issues?q=is%3Aopen+is%3Aissue+comments%3A0>. 50 51=head2 Migrate t/ from custom TAP generation 52 53Many tests below F<t/> still generate TAP by "hand", rather than using library 54functions. As explained in L<perlhack/TESTING>, tests in F<t/> are 55written in a particular way to test that more complex constructions actually 56work before using them routinely. Hence they don't use C<Test::More>, but 57instead there is an intentionally simpler library, F<t/test.pl>. However, 58quite a few tests in F<t/> have not been refactored to use it. Refactoring 59any of these tests, one at a time, is a useful thing TODO. 60 61The subdirectories F<base>, F<cmd>, F<comp> and F<opbasic>, that contain the 62most basic tests, should be excluded from this task. 63 64=head2 Automate perldelta generation 65 66The perldelta file accompanying each release summaries the major changes. 67It's mostly manually generated currently, but some of that could be 68automated with a bit of perl, specifically the generation of 69 70=over 71 72=item Modules and Pragmata 73 74=item New Documentation 75 76=item New Tests 77 78=back 79 80See L<how_to_write_a_perldelta> for details. 81 82=head2 Make Schwern poorer 83 84We should have tests for everything. When all the core's modules are tested, 85Schwern has promised to donate to $500 to TPF. We may need volunteers to 86hold him upside down and shake vigorously in order to actually extract the 87cash. 88 89=head2 Write descriptions for all tests 90 91Many individual tests in the test suite lack descriptions (or names, or labels 92-- call them what you will). Many files completely lack descriptions, meaning 93that the only output you get is the test numbers. If all tests had 94descriptions, understanding what the tests are testing and why they sometimes 95fail would both get a whole lot easier. 96 97=head2 Improve the coverage of the core tests 98 99Use Devel::Cover to ascertain the core modules' test coverage, then add 100tests that are currently missing. 101 102=head2 test B 103 104A full test suite for the B module would be nice. 105 106=head2 A decent benchmark 107 108C<perlbench> seems impervious to any recent changes made to the perl core. It 109would be useful to have a reasonable general benchmarking suite that roughly 110represented what current perl programs do, and measurably reported whether 111tweaks to the core improve, degrade or don't really affect performance, to 112guide people attempting to optimise the guts of perl. Gisle would welcome 113new tests for perlbench. Steffen Schwingon would welcome help with 114L<Benchmark::Perl::Formance> 115 116=head2 fix tainting bugs 117 118Fix the bugs revealed by running the test suite with the C<-t> switch. 119Setting the TEST_ARGS environment variable to C<-taintwarn> will accomplish 120this. 121 122=head2 Dual life everything 123 124As part of the "dists" plan, anything that doesn't belong in the smallest perl 125distribution needs to be dual lifed. Anything else can be too. Figure out what 126changes would be needed to package that module and its tests up for CPAN, and 127do so. Test it with older perl releases, and fix the problems you find. 128 129To make a minimal perl distribution, it's useful to look at 130F<t/lib/commonsense.t>. 131 132=head2 POSIX memory footprint 133 134Ilya observed that use POSIX; eats memory like there's no tomorrow, and at 135various times worked to cut it down. There is probably still fat to cut out - 136for example POSIX passes Exporter some very memory hungry data structures. 137 138=head2 makedef.pl and conditional compilation 139 140The script F<makedef.pl> that generates the list of exported symbols on 141platforms which need this. Functions are declared in F<embed.fnc>, variables 142in F<intrpvar.h>. Quite a few of the functions and variables are conditionally 143declared there, using C<#ifdef>. However, F<makedef.pl> doesn't understand the 144C macros, so the rules about which symbols are present when is duplicated in 145the Perl code. Writing things twice is bad, m'kay. It would be good to teach 146F<.pl> to understand the conditional compilation, and hence remove the 147duplication, and the mistakes it has caused. 148 149=head2 use strict; and AutoLoad 150 151Currently if you write 152 153 package Whack; 154 use AutoLoader 'AUTOLOAD'; 155 use strict; 156 1; 157 __END__ 158 sub bloop { 159 print join (' ', No, strict, here), "!\n"; 160 } 161 162then C<use strict;> isn't in force within the autoloaded subroutines. It would 163be more consistent (and less surprising) to arrange for all lexical pragmas 164in force at the __END__ block to be in force within each autoloaded subroutine. 165 166There's a similar problem with SelfLoader. 167 168=head2 profile installman 169 170The F<installman> script is slow. All it is doing text processing, which we're 171told is something Perl is good at. So it would be nice to know what it is doing 172that is taking so much CPU, and where possible address it. 173 174=head2 enable lexical enabling/disabling of individual warnings 175 176Currently, warnings can only be enabled or disabled by category. There 177are times when it would be useful to quash a single warning, not a 178whole category. 179 180=head2 document diagnostics 181 182Many diagnostic messages are not currently documented. The list is at the end 183of t/porting/diag.t. 184 185=head2 Write TODO tests for open bugs 186 187Sometimes bugs get fixed as a side effect of something else, and 188the bug remains open because no one realizes that it has been fixed. 189Ideally, every open bug should have a TODO test in the core test suite. 190 191=head2 deparse warnings nicely 192 193Currently Deparse punts on deparsing the bitmask for warnings, which it 194dumps uglily as-is. Try running this: 195 196 $ ./perl -Ilib -MO=Deparse -e 'use warnings "pipe"; die' 197 198Deparse.pm could use the package variables in warnings.pm that warnings.pm 199itself uses to convert the list passed to it into a bitfield. Deparse just 200needs to reverse that. 201 202=head2 test and fix Deparse with perl's test suite 203 204If you run perl's tests with the TEST_ARGS environment variable set to 205C<-deparse> (e.g., run C<TEST=-deparse make test>), each test file will be 206deparsed and the deparsed output will be run. Currently there are many 207failures, which ought to be fixed. There is in F<Porting/deparse-skips.txt> 208a list of tests known to fail, but it is out of date. Updating it would 209also help. 210 211This is an incremental task. Every small bit helps. It is also a task that 212may never end. As new tests are added, they tickle corner cases that 213B::Deparse cannot yet handle correctly. 214 215This task I<may> need a bit of perl guts knowledge. But what changes need 216to be made is usually easy to see by dumping op trees with B::Concise: 217 218 $ ./perl -Ilib -MO=Concise -e 'foo(); print @_; die $$_' 219 220and adjusting B::Deparse to handle whatever you see B::Concise produce. 221This is also a good way to I<learn> how perl's op trees work. 222 223=head1 Tasks that need a little sysadmin-type knowledge 224 225Or if you prefer, tasks that you would learn from, and broaden your skills 226base... 227 228=head2 make HTML install work 229 230There is an C<install.html> target in the Makefile. It's marked as 231"experimental". It would be good to get this tested, make it work reliably, and 232remove the "experimental" tag. This would include 233 234=over 4 235 236=item 1 237 238Checking that cross linking between various parts of the documentation works. 239In particular that links work between the modules (files with POD in F<lib/>) 240and the core documentation (files in F<pod/>) 241 242=item 2 243 244Improving the code that split C<perlfunc> into chunks, preferably with 245general case code added to L<Pod::Functions> that could be used elsewhere. 246 247Challenges here are correctly identifying the groups of functions that go 248together, and making the right named external cross-links point to the right 249page. Currently this works reasonably well in the general case, and correctly 250parses two or more C<=items> giving the different parameter lists for the 251same function, such used by C<substr>. However it fails completely where 252I<different> functions are listed as a sequence of C<=items> but share the 253same description. All the functions from C<getpwnam> to C<endprotoent> have 254individual stub pages, with only the page for C<endservent> holding the 255description common to all. Likewise C<q>, C<qq> and C<qw> have stub pages, 256instead of sharing the body of C<qx>. 257 258Note also the current code isn't ideal with the two forms of C<select>, mushing 259them both into one F<select.html> with the two descriptions run together. 260Fixing this may well be a special case. 261 262=back 263 264=head2 compressed man pages 265 266Be able to install them. This would probably need a configure test to see how 267the system does compressed man pages (same directory/different directory? 268same filename/different filename), as well as tweaking the F<installman> script 269to compress as necessary. 270 271=head2 Add a code coverage target to the Makefile 272 273Make it easy for anyone to run Devel::Cover on the core's tests. The steps 274to do this manually are roughly 275 276=over 4 277 278=item * 279 280do a normal C<Configure>, but include Devel::Cover as a module to install 281(see L<INSTALL> for how to do this) 282 283=item * 284 285 make perl 286 287=item * 288 289 cd t; HARNESS_PERL_SWITCHES=-MDevel::Cover ./perl -I../lib harness 290 291=item * 292 293Process the resulting Devel::Cover database 294 295=back 296 297This just give you the coverage of the F<.pm>s. To also get the C level 298coverage you need to 299 300=over 4 301 302=item * 303 304Additionally tell C<Configure> to use the appropriate C compiler flags for 305C<gcov> 306 307=item * 308 309 make perl.gcov 310 311(instead of C<make perl>) 312 313=item * 314 315After running the tests run C<gcov> to generate all the F<.gcov> files. 316(Including down in the subdirectories of F<ext/> 317 318=item * 319 320(From the top level perl directory) run C<gcov2perl> on all the C<.gcov> files 321to get their stats into the cover_db directory. 322 323=item * 324 325Then process the Devel::Cover database 326 327=back 328 329It would be good to add a single switch to C<Configure> to specify that you 330wanted to perform perl level coverage, and another to specify C level 331coverage, and have C<Configure> and the F<Makefile> do all the right things 332automatically. 333 334=head2 Make Config.pm cope with differences between built and installed perl 335 336Quite often vendors ship a perl binary compiled with their (pay-for) 337compilers. People install a free compiler, such as gcc. To work out how to 338build extensions, Perl interrogates C<%Config>, so in this situation 339C<%Config> describes compilers that aren't there, and extension building 340fails. This forces people into choosing between re-compiling perl themselves 341using the compiler they have, or only using modules that the vendor ships. 342 343It would be good to find a way teach C<Config.pm> about the installation setup, 344possibly involving probing at install time or later, so that the C<%Config> in 345a binary distribution better describes the installed machine, when the 346installed machine differs from the build machine in some significant way. 347 348=head2 linker specification files 349 350Some platforms mandate that you provide a list of a shared library's external 351symbols to the linker, so the core already has the infrastructure in place to 352do this for generating shared perl libraries. Florian Ragwitz has been working 353to offer this for the GNU toolchain, to allow Unix users to test that the 354export list is correct, and to build a perl that does not pollute the global 355namespace with private symbols, and will fail in the same way as msvc or mingw 356builds or when using PERL_DL_NONLAZY=1. See the branch smoke-me/rafl/ld_export 357 358=head2 Cross-compile support 359 360We get requests for "how to cross compile Perl". The vast majority of these 361seem to be for a couple of scenarios: 362 363=over 4 364 365=item * 366 367Platforms that could build natively using F<./Configure> (I<e.g.> Linux or 368NetBSD on MIPS or ARM) but people want to use a beefier machine (and on the 369same OS) to build more easily. 370 371=item * 372 373Platforms that can't build natively, but no (significant) porting changes 374are needed to our current source code. Prime example of this is Android. 375 376=back 377 378There are several scripts and tools for cross-compiling perl for other 379platforms. However, these are somewhat inconsistent and scattered across the 380codebase, none are documented well, none are clearly flexible enough to 381be confident that they can support any TARGET/HOST platform pair other than 382that which they were developed on, and it's not clear how bitrotted they are. 383 384For example, C<Configure> understands C<-Dusecrosscompile> option. This option 385arranges for building C<miniperl> for TARGET machine, so this C<miniperl> is 386assumed then to be copied to TARGET machine and used as a replacement of 387full C<perl> executable. This code is almost 10 years old. Meanwhile, the 388F<Cross/> directory contains two different approaches for cross compiling to 389ARM Linux targets, relying on hand curated F<config.sh> files, but that code 390is getting on for 5 years old, and requires insider knowledge of perl's 391build system to draft a F<config.sh> for a new platform. 392 393Jess Robinson has submitted a grant to TPF to work on cleaning this up. 394 395=head2 Split "linker" from "compiler" 396 397Right now, Configure probes for two commands, and sets two variables: 398 399=over 4 400 401=item * C<cc> (in F<cc.U>) 402 403This variable holds the name of a command to execute a C compiler which 404can resolve multiple global references that happen to have the same 405name. Usual values are F<cc> and F<gcc>. 406Fervent ANSI compilers may be called F<c89>. AIX has F<xlc>. 407 408=item * C<ld> (in F<dlsrc.U>) 409 410This variable indicates the program to be used to link 411libraries for dynamic loading. On some systems, it is F<ld>. 412On ELF systems, it should be C<$cc>. Mostly, we'll try to respect 413the hint file setting. 414 415=back 416 417There is an implicit historical assumption from around Perl5.000alpha 418something, that C<$cc> is also the correct command for linking object files 419together to make an executable. This may be true on Unix, but it's not true 420on other platforms, and there are a maze of work arounds in other places (such 421as F<Makefile.SH>) to cope with this. 422 423Ideally, we should create a new variable to hold the name of the executable 424linker program, probe for it in F<Configure>, and centralise all the special 425case logic there or in hints files. 426 427A small bikeshed issue remains - what to call it, given that C<$ld> is already 428taken (arguably for the wrong thing now, but on SunOS 4.1 it is the command 429for creating dynamically-loadable modules) and C<$link> could be confused with 430the Unix command line executable of the same name, which does something 431completely different. Andy Dougherty makes the counter argument "In parrot, I 432tried to call the command used to link object files and libraries into an 433executable F<link>, since that's what my vaguely-remembered DOS and VMS 434experience suggested. I don't think any real confusion has ensued, so it's 435probably a reasonable name for perl5 to use." 436 437"Alas, I've always worried that introducing it would make things worse, 438since now the module building utilities would have to look for 439C<$Config{link}> and institute a fall-back plan if it weren't found." 440Although I can see that as confusing, given that C<$Config{d_link}> is true 441when (hard) links are available. 442 443=head2 Configure Windows using PowerShell 444 445Currently, Windows uses hard-coded config files based to build the 446config.h for compiling Perl. Makefiles are also hard-coded and need to be 447hand edited prior to building Perl. While this makes it easy to create a perl.exe 448that works across multiple Windows versions, being able to accurately 449configure a perl.exe for a specific Windows versions and VS C++ would be 450a nice enhancement. With PowerShell available on Windows XP and up, this 451may now be possible. Step 1 might be to investigate whether this is possible 452and use this to clean up our current makefile situation. Step 2 would be to 453see if there would be a way to use our existing metaconfig units to configure a 454Windows Perl or whether we go in a separate direction and make it so. Of 455course, we all know what step 3 is. 456 457=head1 Tasks that need a little C knowledge 458 459These tasks would need a little C knowledge, but don't need any specific 460background or experience with XS, or how the Perl interpreter works 461 462=head2 Weed out needless PERL_UNUSED_ARG 463 464The C code uses the macro C<PERL_UNUSED_ARG> to stop compilers warning about 465unused arguments. Often the arguments can't be removed, as there is an 466external constraint that determines the prototype of the function, so this 467approach is valid. However, there are some cases where C<PERL_UNUSED_ARG> 468could be removed. Specifically 469 470=over 4 471 472=item * 473 474The prototypes of (nearly all) static functions can be changed 475 476=item * 477 478Unused arguments generated by short cut macros are wasteful - the short cut 479macro used can be changed. 480 481=back 482 483=head2 -Duse32bit* 484 485Natively 64-bit systems need neither -Duse64bitint nor -Duse64bitall. 486On these systems, it might be the default compilation mode, and there 487is currently no guarantee that passing no use64bitall option to the 488Configure process will build a 32bit perl. Implementing -Duse32bit* 489options would be nice for perl 5.36.1. 490 491=head2 Profile Perl - am I hot or not? 492 493The Perl source code is stable enough that it makes sense to profile it, 494identify and optimise the hotspots. It would be good to measure the 495performance of the Perl interpreter using free tools such as cachegrind, 496gprof, and dtrace, and work to reduce the bottlenecks they reveal. 497 498As part of this, the idea of F<pp_hot.c> is that it contains the I<hot> ops, 499the ops that are most commonly used. The idea is that by grouping them, their 500object code will be adjacent in the executable, so they have a greater chance 501of already being in the CPU cache (or swapped in) due to being near another op 502already in use. 503 504Except that it's not clear if these really are the most commonly used ops. So 505as part of exercising your skills with coverage and profiling tools you might 506want to determine what ops I<really> are the most commonly used. And in turn 507suggest evictions and promotions to achieve a better F<pp_hot.c>. 508 509One piece of Perl code that might make a good testbed is F<installman>. 510 511=head2 Use secure CRT functions when building with VC8 on Win32 512 513Visual C++ 2005 (VC++ 8.x) deprecated a number of CRT functions on the basis 514that they were "unsafe" and introduced differently named secure versions of 515them as replacements, e.g. instead of writing 516 517 FILE* f = fopen(__FILE__, "r"); 518 519one should now write 520 521 FILE* f; 522 errno_t err = fopen_s(&f, __FILE__, "r"); 523 524Currently, the warnings about these deprecations have been disabled by adding 525-D_CRT_SECURE_NO_DEPRECATE to the CFLAGS. It would be nice to remove that 526warning suppressant and actually make use of the new secure CRT functions. 527 528There is also a similar issue with POSIX CRT function names like fileno having 529been deprecated in favour of ISO C++ conformant names like _fileno. These 530warnings are also currently suppressed by adding -D_CRT_NONSTDC_NO_DEPRECATE. It 531might be nice to do as Microsoft suggest here too, although, unlike the secure 532functions issue, there is presumably little or no benefit in this case. 533 534=head2 Fix POSIX::access() and chdir() on Win32 535 536These functions currently take no account of DACLs and therefore do not behave 537correctly in situations where access is restricted by DACLs (as opposed to the 538read-only attribute). 539 540Furthermore, POSIX::access() behaves differently for directories having the 541read-only attribute set depending on what CRT library is being used. For 542example, the _access() function in the VC7 CRT (wrongly) claims that 543such directories are not writable, whereas in fact all directories are writable 544unless access is denied by DACLs. (In the case of directories, the read-only 545attribute actually only means that the directory cannot be deleted.) This CRT 546bug is fixed in the VC8 and VC9 CRTs (but, of course, the directory may still 547not actually be writable if access is indeed denied by DACLs). 548 549For the chdir() issue, see ActiveState bug #74552: 550L<http://bugs.activestate.com/show_bug.cgi?id=74552> 551 552Therefore, DACLs should be checked both for consistency across CRTs and for 553the correct answer. 554 555(Note that perl's -w operator should not be modified to check DACLs. It has 556been written so that it reflects the state of the read-only attribute, even 557for directories (whatever CRT is being used), for symmetry with chmod().) 558 559=head2 Arenas for GPs? For MAGIC? 560 561C<struct gp> and C<struct magic> are both currently allocated by C<malloc>. 562It might be a speed or memory saving to change to using arenas. Or it might 563not. It would need some suitable benchmarking first. In particular, C<GP>s 564can probably be changed with minimal compatibility impact (probably nothing 565outside of the core, or even outside of F<gv.c> allocates them), but they 566probably aren't allocated/deallocated often enough for a speed saving. Whereas 567C<MAGIC> is allocated/deallocated more often, but in turn, is also something 568more externally visible, so changing the rules here may bite external code. 569 570=head2 Shared arenas 571 572Several SV body structs are now the same size, notably PVMG and PVGV, PVAV and 573PVHV, and PVCV and PVFM. It should be possible to allocate and return same 574sized bodies from the same actual arena, rather than maintaining one arena for 575each. This could save 4-6K per thread, of memory no longer tied up in the 576not-yet-allocated part of an arena. 577 578 579=head1 Tasks that need a knowledge of XS 580 581These tasks would need C knowledge, and roughly the level of knowledge of 582the perl API that comes from writing modules that use XS to interface to 583C. 584 585=head2 Write an XS cookbook 586 587Create pod/perlxscookbook.pod with short, task-focused 'recipes' in XS that 588demonstrate common tasks and good practices. (Some of these might be 589extracted from perlguts.) The target audience should be XS novices, who need 590more examples than perlguts but something less overwhelming than perlapi. 591Recipes should provide "one pretty good way to do it" instead of TIMTOWTDI. 592 593Rather than focusing on interfacing Perl to C libraries, such a cookbook 594should probably focus on how to optimize Perl routines by re-writing them 595in XS. This will likely be more motivating to those who mostly work in 596Perl but are looking to take the next step into XS. 597 598Deconstructing and explaining some simpler XS modules could be one way to 599bootstrap a cookbook. (List::Util? Class::XSAccessor? Tree::Ternary_XS?) 600Another option could be deconstructing the implementation of some simpler 601functions in op.c. 602 603=head2 Document how XSUBs can use C<cv_set_call_checker> to inline themselves as OPs 604 605For a simple XSUB, often the subroutine dispatch takes more time than the 606XSUB itself. v5.14.0 now allows XSUBs to register a function which will be 607called when the parser is finished building an C<entersub> op which calls 608them. 609 610Registration is done with C<Perl_cv_set_call_checker>, is documented at the 611API level in L<perlapi>, and L<perl5140delta/Custom per-subroutine check hooks> 612notes that it can be used to inline a subroutine, by replacing it with a 613custom op. However there is no further detail of the code needed to do this. 614It would be useful to add one or more annotated examples of how to create 615XSUBs that inline. 616 617This should provide a measurable speed up to simple XSUBs inside 618tight loops. Initially one would have to write the OP alternative 619implementation by hand, but it's likely that this should be reasonably 620straightforward for the type of XSUB that would benefit the most. Longer 621term, once the run-time implementation is proven, it should be possible to 622progressively update ExtUtils::ParseXS to generate OP implementations for 623some XSUBs. 624 625=head2 Document how XS modules can install lexical subs 626 627There is an example in XS::APItest (look for C<lexical_import> in 628F<ext/XS-APItest/APItest.xs>). The documentation could be based on it. 629 630=head2 Remove the use of SVs as temporaries in dump.c 631 632F<dump.c> contains debugging routines to dump out the contains of perl data 633structures, such as C<SV>s, C<AV>s and C<HV>s. Currently, the dumping code 634B<uses> C<SV>s for its temporary buffers, which was a logical initial 635implementation choice, as they provide ready made memory handling. 636 637However, they also lead to a lot of confusion when it happens that what you're 638trying to debug is seen by the code in F<dump.c>, correctly or incorrectly, as 639a temporary scalar it can use for a temporary buffer. It's also not possible 640to dump scalars before the interpreter is properly set up, such as during 641ithreads cloning. It would be good to progressively replace the use of scalars 642as string accumulation buffers with something much simpler, directly allocated 643by C<malloc>. The F<dump.c> code is (or should be) only producing 7 bit 644US-ASCII, so output character sets are not an issue. 645 646Producing and proving an internal simple buffer allocation would make it easier 647to re-write the internals of the PerlIO subsystem to avoid using C<SV>s for 648B<its> buffers, use of which can cause problems similar to those of F<dump.c>, 649at similar times. 650 651=head2 safely supporting POSIX SA_SIGINFO 652 653Some years ago Jarkko supplied patches to provide support for the POSIX 654SA_SIGINFO feature in Perl, passing the extra data to the Perl signal handler. 655 656Unfortunately, it only works with "unsafe" signals, because under safe 657signals, by the time Perl gets to run the signal handler, the extra 658information has been lost. Moreover, it's not easy to store it somewhere, 659as you can't call mutexs, or do anything else fancy, from inside a signal 660handler. 661 662So it strikes me that we could provide safe SA_SIGINFO support 663 664=over 4 665 666=item 1 667 668Provide global variables for two file descriptors 669 670=item 2 671 672When the first request is made via C<sigaction> for C<SA_SIGINFO>, create a 673pipe, store the reader in one, the writer in the other 674 675=item 3 676 677In the "safe" signal handler (C<Perl_csighandler()>/C<S_raise_signal()>), if 678the C<siginfo_t> pointer non-C<NULL>, and the writer file handle is open, 679 680=over 8 681 682=item 1 683 684serialise signal number, C<struct siginfo_t> (or at least the parts we care 685about) into a small auto char buff 686 687=item 2 688 689C<write()> that (non-blocking) to the writer fd 690 691=over 12 692 693=item 1 694 695if it writes 100%, flag the signal in a counter of "signals on the pipe" akin 696to the current per-signal-number counts 697 698=item 2 699 700if it writes 0%, assume the pipe is full. Flag the data as lost? 701 702=item 3 703 704if it writes partially, croak a panic, as your OS is broken. 705 706=back 707 708=back 709 710=item 4 711 712in the regular C<PERL_ASYNC_CHECK()> processing, if there are "signals on 713the pipe", read the data out, deserialise, build the Perl structures on 714the stack (code in C<Perl_sighandler()>, the "unsafe" handler), and call as 715usual. 716 717=back 718 719I think that this gets us decent C<SA_SIGINFO> support, without the current risk 720of running Perl code inside the signal handler context. (With all the dangers 721of things like C<malloc> corruption that that currently offers us) 722 723For more information see the thread starting with this message: 724L<http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/2008-03/msg00305.html> 725 726=head2 autovivification 727 728Make all autovivification consistent w.r.t LVALUE/RVALUE and strict/no strict; 729 730This task is incremental - even a little bit of work on it will help. 731 732=head2 Unicode in Filenames 733 734chdir, chmod, chown, chroot, exec, glob, link, lstat, mkdir, open, 735opendir, qx, readdir, readlink, rename, rmdir, stat, symlink, sysopen, 736system, truncate, unlink, utime, -X. All these could potentially accept 737Unicode filenames either as input or output (and in the case of system 738and qx Unicode in general, as input or output to/from the shell). 739Whether a filesystem - an operating system pair understands Unicode in 740filenames varies. 741 742Known combinations that have some level of understanding include 743Microsoft NTFS, Apple HFS+ (In Mac OS 9 and X) and Apple UFS (in Mac 744OS X), NFS v4 is rumored to be Unicode, and of course Plan 9. How to 745create Unicode filenames, what forms of Unicode are accepted and used 746(UCS-2, UTF-16, UTF-8), what (if any) is the normalization form used, 747and so on, varies. Finding the right level of interfacing to Perl 748requires some thought. Remember that an OS does not implicate a 749filesystem. 750 751(The Windows -C command flag "wide API support" has been at least 752temporarily retired in 5.8.1, and the -C has been repurposed, see 753L<perlrun>.) 754 755Most probably the right way to do this would be this: 756L</"Virtualize operating system access">. 757 758=head2 Unicode in %ENV 759 760Currently the %ENV entries are always byte strings. 761See L</"Virtualize operating system access">. 762 763(See github issue gh12161 for information on Win32's handling of %ENV, 764which was fixed to work with native ANSI codepage characters in the 765environment, but still doesn't work with other characters outside of 766that codepage present in the environment.) 767 768=head2 Unicode and glob() 769 770Currently glob patterns and filenames returned from File::Glob::glob() 771are always byte strings. See L</"Virtualize operating system access">. 772 773=head2 use less 'memory' 774 775Investigate trade offs to switch out perl's choices on memory usage. 776Particularly perl should be able to give memory back. 777 778This task is incremental - even a little bit of work on it will help. 779 780=head2 Re-implement C<:unique> in a way that is actually thread-safe 781 782The old implementation made bad assumptions on several levels. A good 90% 783solution might be just to make C<:unique> work to share the string buffer 784of SvPVs. That way large constant strings can be shared between ithreads, 785such as the configuration information in F<Config>. 786 787=head2 Make tainting consistent 788 789Tainting would be easier to use if it didn't take documented shortcuts and 790allow taint to "leak" everywhere within an expression. 791 792=head2 readpipe(LIST) 793 794system() accepts a LIST syntax (and a PROGRAM LIST syntax) to avoid 795running a shell. readpipe() (the function behind qx//) could be similarly 796extended. Note that changing readpipe() itself may not be the solution, as 797it currently has unary precedence, and allowing a list would change the 798precedence. 799 800=head2 Audit the code for destruction ordering assumptions 801 802Change 25773 notes 803 804 /* Need to check SvMAGICAL, as during global destruction it may be that 805 AvARYLEN(av) has been freed before av, and hence the SvANY() pointer 806 is now part of the linked list of SV heads, rather than pointing to 807 the original body. */ 808 /* FIXME - audit the code for other bugs like this one. */ 809 810adding the C<SvMAGICAL> check to 811 812 if (AvARYLEN(av) && SvMAGICAL(AvARYLEN(av))) { 813 MAGIC *mg = mg_find (AvARYLEN(av), PERL_MAGIC_arylen); 814 815Go through the core and look for similar assumptions that SVs have particular 816types, as all bets are off during global destruction. 817 818=head2 Extend PerlIO and PerlIO::Scalar 819 820PerlIO::Scalar doesn't know how to truncate(). Implementing this 821would require extending the PerlIO vtable. 822 823Similarly the PerlIO vtable doesn't know about formats (write()), or 824about stat(), or chmod()/chown(), utime(), or flock(). 825 826(For PerlIO::Scalar it's hard to see what e.g. mode bits or ownership 827would mean.) 828 829PerlIO doesn't do directories or symlinks, either: mkdir(), rmdir(), 830opendir(), closedir(), seekdir(), rewinddir(), glob(); symlink(), 831readlink(). 832 833See also L</"Virtualize operating system access">. 834 835=head2 Organize error messages 836 837Perl's diagnostics (error messages, see L<perldiag>) could use 838reorganizing and formalizing so that each error message has its 839stable-for-all-eternity unique id, categorized by severity, type, and 840subsystem. (The error messages would be listed in a datafile outside 841of the Perl source code, and the source code would only refer to the 842messages by the id.) This clean-up and regularizing should apply 843for all croak() messages. 844 845This would enable all sorts of things: easier translation/localization 846of the messages (though please do keep in mind the caveats of 847L<Locale::Maketext> about too straightforward approaches to 848translation), filtering by severity, and instead of grepping for a 849particular error message one could look for a stable error id. (Of 850course, changing the error messages by default would break all the 851existing software depending on some particular error message...) 852 853This kind of functionality is known as I<message catalogs>. Look for 854inspiration for example in the catgets() system, possibly even use it 855if available-- but B<only> if available, all platforms will B<not> 856have catgets(). 857 858For the really pure at heart, consider extending this item to cover 859also the warning messages (see L<warnings>, F<regen/warnings.pl>). 860 861=head1 Tasks that need a knowledge of the interpreter 862 863These tasks would need C knowledge, and knowledge of how the interpreter works, 864or a willingness to learn. 865 866=head2 fix refaliasing with nested and recursive subroutines 867 868Currently aliasing lexical variables via reference only applies to the 869current subroutine, and does not propagate to inner closures, nor does 870aliasing of outer variables within closures propagate to the outer 871subroutine. This is because each subroutine has its own lexical pad and the 872aliasing works by changing which SV the pad points to. 873 874One possible way to fix this would be to create new ops for accessing 875variables that are closed over. So C<my $x; sub {$x}> would use a new op 876type, say C<padoutsv>, instead of the C<padsv> currently used in the 877sub. That new op would possibly check a flag or some such and see if it 878needs to fetch the variable from an outer pad. If we follow this approach, 879it should be possible at compile time to detect cases where the more 880complex C<padoutsv> op is unnecessary and revert back to the simpler, 881faster C<padsv>. There would need to be corresponding ops for arrays, 882hashes, and subs, too. 883 884There is also a related issue with recursion and C<state> variables. A 885subroutine actually has a list of lexical pads, each one used at a 886different recursion level. If a C<state> variable is aliased to another 887variable after a recursive call to the same subroutine, that higher call 888depth will not see the effect of aliasing, because the second pad will have 889been created already. Similarly, aliasing a state variable within a 890recursive call will not affect outer calls, even though all call depths are 891supposed to share the same C<state> variables. 892 893Both of these bugs affect C<foreach> aliasing, too. 894 895=head2 forbid labels with keyword names 896 897Currently C<goto keyword> "computes" the label value: 898 899 $ perl -e 'goto print' 900 Can't find label 1 at -e line 1. 901 902It is controversial if the right way to avoid the confusion is to forbid 903labels with keyword names, or if it would be better to always treat 904bareword expressions after a "goto" as a label and never as a keyword. 905 906=head2 truncate() prototype 907 908The prototype of truncate() is currently C<$$>. It should probably 909be C<*$> instead. (This is changed in F<regen/opcodes>.) 910 911=head2 error reporting of [$a ; $b] 912 913Using C<;> inside brackets is a syntax error, and we don't propose to change 914that by giving it any meaning. However, it's not reported very helpfully: 915 916 $ perl -e '$a = [$b; $c];' 917 syntax error at -e line 1, near "$b;" 918 syntax error at -e line 1, near "$c]" 919 Execution of -e aborted due to compilation errors. 920 921It should be possible to hook into the tokeniser or the lexer, so that when a 922C<;> is parsed where it is not legal as a statement terminator (ie inside 923C<{}> used as a hashref, C<[]> or C<()>) it issues an error something like 924I<';' isn't legal inside an expression - if you need multiple statements use a 925do {...} block>. See the thread starting at 926L<http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/2008-09/msg00573.html> 927 928=head2 strict as warnings 929 930See L<http://markmail.org/message/vbrupaslr3bybmvk>, where Joshua ben Jore 931writes: I've been of the opinion that everything strict.pm does ought to be 932able to considered just warnings that have been promoted to 'FATAL'. 933 934=head2 lexicals used only once 935 936This warns: 937 938 $ perl -we '$pie = 42' 939 Name "main::pie" used only once: possible typo at -e line 1. 940 941This does not: 942 943 $ perl -we 'my $pie = 42' 944 945Logically all lexicals used only once should warn, if the user asks for 946warnings. An unworked ticket (gh3073) was open for many years for this 947discrepancy. 948 949=head2 state variable initialization in list context 950 951Currently this is illegal: 952 953 state ($a, $b) = foo(); 954 955In Raku, C<state ($a) = foo();> and C<(state $a) = foo();> have different 956semantics, which is tricky to implement in Perl 5 as currently they produce 957the same opcode trees. The Raku design is firm, so it would be good to 958implement the necessary code in Perl 5. There are comments in 959C<Perl_newASSIGNOP()> that show the code paths taken by various assignment 960constructions involving state variables. 961 962=head2 A does() built-in 963 964Like ref(), only useful. It would call the C<DOES> method on objects; it 965would also tell whether something can be dereferenced as an 966array/hash/etc., or used as a regexp, etc. 967L<http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/2007-03/msg00481.html> 968 969=head2 Tied filehandles and write() don't mix 970 971There is no method on tied filehandles to allow them to be called back by 972formats. 973 974=head2 Propagate compilation hints to the debugger 975 976Currently a debugger started with -dE on the command-line doesn't see the 977features enabled by -E. More generally hints (C<$^H> and C<%^H>) aren't 978propagated to the debugger. Probably it would be a good thing to propagate 979hints from the innermost non-C<DB::> scope: this would make code eval'ed 980in the debugger see the features (and strictures, etc.) currently in 981scope. 982 983=head2 Attach/detach debugger from running program 984 985The old perltodo notes "With C<gdb>, you can attach the debugger to a running 986program if you pass the process ID. It would be good to do this with the Perl 987debugger on a running Perl program, although I'm not sure how it would be 988done." ssh and screen do this with named pipes in /tmp. Maybe we can too. 989 990=head2 regexp optimizer optional 991 992The regexp optimizer is not optional. It should be configurable to be optional 993and to allow its performance to be measured and its bugs to be easily 994demonstrated. 995 996=head2 C</w> regex modifier 997 998That flag would enable to match whole words, and also to interpolate 999arrays as alternations. With it, C<m/P/w> would be roughly equivalent to: 1000 1001 do { local $"='|'; m/\b(?:P)\b/ } 1002 1003See 1004L<http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/2007-01/msg00400.html> 1005for the discussion. 1006 1007=head2 optional optimizer 1008 1009Make the peephole optimizer optional. Currently it performs two tasks as 1010it walks the optree - genuine peephole optimisations, and necessary fixups of 1011ops. It would be good to find an efficient way to switch out the 1012optimisations whilst keeping the fixups. 1013 1014=head2 You WANT *how* many 1015 1016Currently contexts are void, scalar and list. split has a special mechanism in 1017place to pass in the number of return values wanted. It would be useful to 1018have a general mechanism for this, backwards compatible and little speed hit. 1019This would allow proposals such as short circuiting sort to be implemented 1020as a module on CPAN. 1021 1022=head2 Self-ties 1023 1024Self-ties are currently illegal because they caused too many segfaults. Maybe 1025the causes of these could be tracked down and self-ties on all types 1026reinstated. 1027 1028=head2 Optimize away @_ 1029 1030The old perltodo notes "Look at the "reification" code in C<av.c>". 1031 1032=head2 Virtualize operating system access 1033 1034Implement a set of "vtables" that virtualizes operating system access 1035(chdir(), chmod(), dbmopen(), getenv(), glob(), link(), mkdir(), open(), 1036opendir(), readdir(), rename(), rmdir(), stat(), sysopen(), uname(), 1037unlink(), etc.). At the very least these interfaces should take SVs as 1038"name" arguments instead of bare char pointers; probably the most 1039flexible and extensible way would be for the Perl-facing interfaces to 1040accept HVs. The system needs to be per-operating-system and 1041per-file-system hookable/filterable, preferably both from XS and Perl 1042level (L<perlport/"Files and Filesystems"> is good reading at this 1043point, in fact, all of L<perlport> is.) 1044 1045This has actually already been implemented (but only for Win32), 1046take a look at F<iperlsys.h> and F<win32/perlhost.h>. While all Win32 1047variants go through a set of "vtables" for operating system access, 1048non-Win32 systems currently go straight for the POSIX/Unix-style 1049system/library call. Similar system as for Win32 should be 1050implemented for all platforms. The existing Win32 implementation 1051probably does not need to survive alongside this proposed new 1052implementation, the approaches could be merged. 1053 1054What would this give us? One often-asked-for feature this would 1055enable is using Unicode for filenames, and other "names" like %ENV, 1056usernames, hostnames, and so forth. 1057(See L<perlunicode/"When Unicode Does Not Happen">.) 1058 1059But this kind of virtualization would also allow for things like 1060virtual filesystems, virtual networks, and "sandboxes" (though as long 1061as dynamic loading of random object code is allowed, not very safe 1062sandboxes since external code of course know not of Perl's vtables). 1063An example of a smaller "sandbox" is that this feature can be used to 1064implement per-thread working directories: Win32 already does this. 1065 1066See also L</"Extend PerlIO and PerlIO::Scalar">. 1067 1068=head2 repack the optree 1069 1070B<Note:> This entry was written in reference to the I<old> slab allocator, 1071removed in commit 7aef8e5bd14. 1072 1073Repacking the optree after execution order is determined could allow 1074removal of NULL ops, and optimal ordering of OPs with respect to cache-line 1075filling. I think that 1076the best way to do this is to make it an optional step just before the 1077completed optree is attached to anything else, and to use the slab allocator 1078unchanged--but allocate a single slab the right size, avoiding partial 1079slabs--, so that freeing ops is identical whether or not this step runs. 1080Note that the slab allocator allocates ops downwards in memory, so one would 1081have to actually "allocate" the ops in reverse-execution order to get them 1082contiguous in memory in execution order. 1083 1084See 1085L<http://www.nntp.perl.org/group/perl.perl5.porters/2007/12/msg131975.html> 1086 1087Note that running this copy, and then freeing all the old location ops would 1088cause their slabs to be freed, which would eliminate possible memory wastage if 1089the previous suggestion is implemented, and we swap slabs more frequently. 1090 1091=head2 eliminate incorrect line numbers in warnings 1092 1093This code 1094 1095 use warnings; 1096 my $undef; 1097 1098 if ($undef == 3) { 1099 } elsif ($undef == 0) { 1100 } 1101 1102used to produce this output: 1103 1104 Use of uninitialized value in numeric eq (==) at wrong.pl line 4. 1105 Use of uninitialized value in numeric eq (==) at wrong.pl line 4. 1106 1107where the line of the second warning was misreported - it should be line 5. 1108Rafael fixed this - the problem arose because there was no nextstate OP 1109between the execution of the C<if> and the C<elsif>, hence C<PL_curcop> still 1110reports that the currently executing line is line 4. The solution was to inject 1111a nextstate OPs for each C<elsif>, although it turned out that the nextstate 1112OP needed to be a nulled OP, rather than a live nextstate OP, else other line 1113numbers became misreported. (Jenga!) 1114 1115The problem is more general than C<elsif> (although the C<elsif> case is the 1116most common and the most confusing). Ideally this code 1117 1118 use warnings; 1119 my $undef; 1120 1121 my $a = $undef + 1; 1122 my $b 1123 = $undef 1124 + 1; 1125 1126would produce this output 1127 1128 Use of uninitialized value $undef in addition (+) at wrong.pl line 4. 1129 Use of uninitialized value $undef in addition (+) at wrong.pl line 7. 1130 1131(rather than lines 4 and 5), but this would seem to require every OP to carry 1132(at least) line number information. 1133 1134What might work is to have an optional line number in memory just before the 1135BASEOP structure, with a flag bit in the op to say whether it's present. 1136Initially during compile every OP would carry its line number. Then add a late 1137pass to the optimizer (potentially combined with L</repack the optree>) which 1138looks at the two ops on every edge of the graph of the execution path. If 1139the line number changes, flags the destination OP with this information. 1140Once all paths are traced, replace every op with the flag with a 1141nextstate-light op (that just updates C<PL_curcop>), which in turn then passes 1142control on to the true op. All ops would then be replaced by variants that 1143do not store the line number. (Which, logically, why it would work best in 1144conjunction with L</repack the optree>, as that is already copying/reallocating 1145all the OPs) 1146 1147(Although I should note that we're not certain that doing this for the general 1148case is worth it) 1149 1150=head2 optimize tail-calls 1151 1152Tail-calls present an opportunity for broadly applicable optimization; 1153anywhere that C<< return foo(...) >> is called, the outer return can 1154be replaced by a goto, and foo will return directly to the outer 1155caller, saving (conservatively) 25% of perl's call&return cost, which 1156is relatively higher than in C. The scheme language is known to do 1157this heavily. B::Concise provides good insight into where this 1158optimization is possible, ie anywhere entersub,leavesub op-sequence 1159occurs. 1160 1161 perl -MO=Concise,-exec,a,b,-main -e 'sub a{ 1 }; sub b {a()}; b(2)' 1162 1163Bottom line on this is probably a new pp_tailcall function which 1164combines the code in pp_entersub, pp_leavesub. This should probably 1165be done 1st in XS, and using B::Generate to patch the new OP into the 1166optrees. 1167 1168=head2 Revisit the regex super-linear cache code 1169 1170Perl executes regexes using the traditional backtracking algorithm, which 1171makes it possible to implement a variety of powerful pattern-matching 1172features (like embedded code blocks), at the cost of taking exponential time 1173to run on some pathological patterns. The exponential-time problem is 1174mitigated by the I<super-linear cache>, which detects when we're processing 1175such a pathological pattern, and does some additional bookkeeping to avoid 1176much of the work. However, that code has bit-rotted a little; some patterns 1177don't make as much use of it as they should. The proposal is to analyse 1178where the current cache code has problems, and extend it to cover those cases. 1179 1180See also 1181L<http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/2013-01/msg00339.html> 1182 1183=head1 Big projects 1184 1185Tasks that will get your name mentioned in the description of the "Highlights 1186of 5.36.1" 1187 1188=head2 make ithreads more robust 1189 1190Generally make ithreads more robust. 1191 1192This task is incremental - even a little bit of work on it will help, and 1193will be greatly appreciated. 1194 1195One bit would be to determine how to clone directory handles on systems 1196without a C<fchdir> function (in sv.c:Perl_dirp_dup). 1197 1198Fix Perl_sv_dup, et al so that threads can return objects. 1199 1200=head1 Tasks for microperl 1201 1202 1203[ Each and every one of these may be obsolete, but they were listed 1204 in the old Todo.micro file] 1205 1206=head2 do away with fork/exec/wait? 1207 1208(system, popen should be enough?) 1209 1210=head2 some of the uconfig.sh really needs to be probed (using cc) in buildtime: 1211 1212(uConfigure? :-) native datatype widths and endianness come to mind 1213 1214