The tasks we think are smaller or easier are listed first.
Anyone is welcome to work on any of these,
but it's a good idea to first contact perl5-porters@perl.org to avoid duplication of effort,
and to learn from any previous attempts.
By all means contact a pumpking privately first if you prefer.

Whilst patches to make the list shorter are most welcome,
ideas to add to the list are also encouraged.
Check the perl5-porters archives for past ideas,
and any discussion about them.
One set of archives may be found at http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/

What can we offer you in return?
Fame,
fortune,
and everlasting glory?
Maybe not,
but if your patch is incorporated,
then we'll add your name to the AUTHORS file,
which ships in the official distribution.
How many other programming languages offer you 1 line of immortality?

Known bugs in Perl are tracked by https://rt.perl.org/ (which also includes Perl 6).
A summary can be found at https://rt.perl.org/NoAuth/perl5/Overview.html.
It shows bugs classified by "type".
However,
the type of many of the bugs is "unknown".
This greatly lowers the chances of them getting fixed,
as the number of open bugs is overwhelming -- too many to wade through for someone to try to find the bugs in the parts of Perl that s/he knows well enough to try to fix.
This task involves going through these bugs and classifying them into one or more types.

When a bug report is filed,
it would be very helpful to have someone do a quick investigation to see if it is a real problem,
and to reply to the poster about it,
asking for example code that reproduces the problem.
Such code should be added to the test suite as TODO tests,
and the ticket should be classified by type.
To get started on this task,
look at the tickets that are marked as "New Issues" in https://rt.perl.org/NoAuth/perl5/Overview.html.

Many tests below t/ still generate TAP by "hand",
rather than using library functions.
As explained in "TESTING" in perlhack,
tests in t/ are written in a particular way to test that more complex constructions actually work before using them routinely.
Hence they don't use Test::More,
but instead there is an intentionally simpler library,
t/test.pl.
However,
quite a few tests in t/ have not been refactored to use it.
Refactoring any of these tests,
one at a time,
is a useful thing TODO.

The subdirectories base,
cmd,
comp and opbasic,
that contain the most basic tests,
should be excluded from this task.

The perldelta file accompanying each release summaries the major changes.
It's mostly manually generated currently,
but some of that could be automated with a bit of perl,
specifically the generation of

We should have tests for everything.
When all the core's modules are tested,
Schwern has promised to donate to $500 to TPF.
We may need volunteers to hold him upside down and shake vigorously in order to actually extract the cash.

Many individual tests in the test suite lack descriptions (or names,
or labels -- call them what you will).
Many files completely lack descriptions,
meaning that the only output you get is the test numbers.
If all tests had descriptions,
understanding what the tests are testing and why they sometimes fail would both get a whole lot easier.

perlbench seems impervious to any recent changes made to the perl core.
It would be useful to have a reasonable general benchmarking suite that roughly represented what current perl programs do,
and measurably reported whether tweaks to the core improve,
degrade or don't really affect performance,
to guide people attempting to optimise the guts of perl.
Gisle would welcome new tests for perlbench.
Steffen Schwingon would welcome help with Benchmark::Perl::Formance

As part of the "dists" plan,
anything that doesn't belong in the smallest perl distribution needs to be dual lifed.
Anything else can be too.
Figure out what changes would be needed to package that module and its tests up for CPAN,
and do so.
Test it with older perl releases,
and fix the problems you find.

To make a minimal perl distribution,
it's useful to look at t/lib/commonsense.t.

Ilya observed that use POSIX; eats memory like there's no tomorrow,
and at various times worked to cut it down.
There is probably still fat to cut out - for example POSIX passes Exporter some very memory hungry data structures.

The script makedef.pl that generates the list of exported symbols on platforms which need this.
Functions are declared in embed.fnc,
variables in intrpvar.h.
Quite a few of the functions and variables are conditionally declared there,
using #ifdef.
However,
makedef.pl doesn't understand the C macros,
so the rules about which symbols are present when is duplicated in the Perl code.
Writing things twice is bad,
m'kay.
It would be good to teach .pl to understand the conditional compilation,
and hence remove the duplication,
and the mistakes it has caused.

then use strict; isn't in force within the autoloaded subroutines. It would be more consistent (and less surprising) to arrange for all lexical pragmas in force at the __END__ block to be in force within each autoloaded subroutine.

The installman script is slow. All it is doing text processing, which we're told is something Perl is good at. So it would be nice to know what it is doing that is taking so much CPU, and where possible address it.

Sometimes bugs get fixed as a side effect of something else, and the bug remains open because no one realizes that it has been fixed. Ideally, every open bug should have a TODO test in the core test suite.

If you run perl's tests with the TEST_ARGS environment variable set to -deparse (e.g., run TEST=-deparse make test), each test file will be deparsed and the deparsed output will be run. Currently there are many failures, which ought to be fixed. There is in Porting/deparse-skips.txt a list of tests known to fail, but it is out of date. Updating it would also help.

This is an incremental task. Every small bit helps. It is also a task that may never end. As new tests are added, they tickle corner cases that B::Deparse cannot yet handle correctly.

This task may need a bit of perl guts knowledge. But what changes need to be made is usually easy to see by dumping op trees with B::Concise:

$ ./perl -Ilib -MO=Concise -e 'foo(); print @_; die $$_'

and adjusting B::Deparse to handle whatever you see B::Concise produce. This is also a good way to learn how perl's op trees work.

There is an install.html target in the Makefile. It's marked as "experimental". It would be good to get this tested, make it work reliably, and remove the "experimental" tag. This would include

Checking that cross linking between various parts of the documentation works. In particular that links work between the modules (files with POD in lib/) and the core documentation (files in pod/)

Improving the code that split perlfunc into chunks, preferably with general case code added to Pod::Functions that could be used elsewhere.

Challenges here are correctly identifying the groups of functions that go together, and making the right named external cross-links point to the right page. Currently this works reasonably well in the general case, and correctly parses two or more =items giving the different parameter lists for the same function, such used by substr. However it fails completely where different functions are listed as a sequence of =items but share the same description. All the functions from getpwnam to endprotoent have individual stub pages, with only the page for endservent holding the description common to all. Likewise q, qq and qw have stub pages, instead of sharing the body of qx.

Note also the current code isn't ideal with the two forms of select, mushing them both into one select.html with the two descriptions run together. Fixing this may well be a special case.

Be able to install them. This would probably need a configure test to see how the system does compressed man pages (same directory/different directory? same filename/different filename), as well as tweaking the installman script to compress as necessary.

Make it easy for anyone to run Devel::Cover on the core's tests. The steps to do this manually are roughly

do a normal Configure, but include Devel::Cover as a module to install (see INSTALL for how to do this)

make perl

cd t; HARNESS_PERL_SWITCHES=-MDevel::Cover ./perl -I../lib harness

Process the resulting Devel::Cover database

This just give you the coverage of the .pms. To also get the C level coverage you need to

Additionally tell Configure to use the appropriate C compiler flags for gcov

make perl.gcov

(instead of make perl)

After running the tests run gcov to generate all the .gcov files. (Including down in the subdirectories of ext/

(From the top level perl directory) run gcov2perl on all the .gcov files to get their stats into the cover_db directory.

Then process the Devel::Cover database

It would be good to add a single switch to Configure to specify that you wanted to perform perl level coverage, and another to specify C level coverage, and have Configure and the Makefile do all the right things automatically.

Quite often vendors ship a perl binary compiled with their (pay-for) compilers. People install a free compiler, such as gcc. To work out how to build extensions, Perl interrogates %Config, so in this situation %Config describes compilers that aren't there, and extension building fails. This forces people into choosing between re-compiling perl themselves using the compiler they have, or only using modules that the vendor ships.

It would be good to find a way teach Config.pm about the installation setup, possibly involving probing at install time or later, so that the %Config in a binary distribution better describes the installed machine, when the installed machine differs from the build machine in some significant way.

Some platforms mandate that you provide a list of a shared library's external symbols to the linker, so the core already has the infrastructure in place to do this for generating shared perl libraries. Florian Ragwitz has been working to offer this for the GNU toolchain, to allow Unix users to test that the export list is correct, and to build a perl that does not pollute the global namespace with private symbols, and will fail in the same way as msvc or mingw builds or when using PERL_DL_NONLAZY=1. See the branch smoke-me/rafl/ld_export

We get requests for "how to cross compile Perl". The vast majority of these seem to be for a couple of scenarios:

Platforms that could build natively using ./Configure (e.g. Linux or NetBSD on MIPS or ARM) but people want to use a beefier machine (and on the same OS) to build more easily.

Platforms that can't build natively, but no (significant) porting changes are needed to our current source code. Prime example of this is Android.

There are several scripts and tools for cross-compiling perl for other platforms. However, these are somewhat inconsistent and scattered across the codebase, none are documented well, none are clearly flexible enough to be confident that they can support any TARGET/HOST platform pair other than that which they were developed on, and it's not clear how bitrotted they are.

For example, Configure understands -Dusecrosscompile option. This option arranges for building miniperl for TARGET machine, so this miniperl is assumed then to be copied to TARGET machine and used as a replacement of full perl executable. This code is almost 10 years old. Meanwhile, the Cross/ directory contains two different approaches for cross compiling to ARM Linux targets, relying on hand curated config.sh files, but that code is getting on for 5 years old, and requires insider knowledge of perl's build system to draft a config.sh for a new platform.

Jess Robinson has submitted a grant to TPF to work on cleaning this up.

This variable holds the name of a command to execute a C compiler which can resolve multiple global references that happen to have the same name. Usual values are cc and gcc. Fervent ANSI compilers may be called c89. AIX has xlc.

ld (in dlsrc.U)

This variable indicates the program to be used to link libraries for dynamic loading. On some systems, it is ld. On ELF systems, it should be $cc. Mostly, we'll try to respect the hint file setting.

There is an implicit historical assumption from around Perl5.000alpha something, that $cc is also the correct command for linking object files together to make an executable. This may be true on Unix, but it's not true on other platforms, and there are a maze of work arounds in other places (such as Makefile.SH) to cope with this.

Ideally, we should create a new variable to hold the name of the executable linker program, probe for it in Configure, and centralise all the special case logic there or in hints files.

A small bikeshed issue remains - what to call it, given that $ld is already taken (arguably for the wrong thing now, but on SunOS 4.1 it is the command for creating dynamically-loadable modules) and $link could be confused with the Unix command line executable of the same name, which does something completely different. Andy Dougherty makes the counter argument "In parrot, I tried to call the command used to link object files and libraries into an executable link, since that's what my vaguely-remembered DOS and VMS experience suggested. I don't think any real confusion has ensued, so it's probably a reasonable name for perl5 to use."

"Alas, I've always worried that introducing it would make things worse, since now the module building utilities would have to look for $Config{link} and institute a fall-back plan if it weren't found." Although I can see that as confusing, given that $Config{d_link} is true when (hard) links are available.

Currently, Windows uses hard-coded config files based to build the config.h for compiling Perl. Makefiles are also hard-coded and need to be hand edited prior to building Perl. While this makes it easy to create a perl.exe that works across multiple Windows versions, being able to accurately configure a perl.exe for a specific Windows versions and VS C++ would be a nice enhancement. With PowerShell available on Windows XP and up, this may now be possible. Step 1 might be to investigate whether this is possible and use this to clean up our current makefile situation. Step 2 would be to see if there would be a way to use our existing metaconfig units to configure a Windows Perl or whether we go in a separate direction and make it so. Of course, we all know what step 3 is.

The C code uses the macro PERL_UNUSED_ARG to stop compilers warning about unused arguments. Often the arguments can't be removed, as there is an external constraint that determines the prototype of the function, so this approach is valid. However, there are some cases where PERL_UNUSED_ARG could be removed. Specifically

The prototypes of (nearly all) static functions can be changed

Unused arguments generated by short cut macros are wasteful - the short cut macro used can be changed.

Natively 64-bit systems need neither -Duse64bitint nor -Duse64bitall. On these systems, it might be the default compilation mode, and there is currently no guarantee that passing no use64bitall option to the Configure process will build a 32bit perl. Implementing -Duse32bit* options would be nice for perl 5.26.1.

The Perl source code is stable enough that it makes sense to profile it, identify and optimise the hotspots. It would be good to measure the performance of the Perl interpreter using free tools such as cachegrind, gprof, and dtrace, and work to reduce the bottlenecks they reveal.

As part of this, the idea of pp_hot.c is that it contains the hot ops, the ops that are most commonly used. The idea is that by grouping them, their object code will be adjacent in the executable, so they have a greater chance of already being in the CPU cache (or swapped in) due to being near another op already in use.

Except that it's not clear if these really are the most commonly used ops. So as part of exercising your skills with coverage and profiling tools you might want to determine what ops really are the most commonly used. And in turn suggest evictions and promotions to achieve a better pp_hot.c.

Visual C++ 2005 (VC++ 8.x) deprecated a number of CRT functions on the basis that they were "unsafe" and introduced differently named secure versions of them as replacements, e.g. instead of writing

FILE* f = fopen(__FILE__, "r");

one should now write

FILE* f;
errno_t err = fopen_s(&f, __FILE__, "r");

Currently, the warnings about these deprecations have been disabled by adding -D_CRT_SECURE_NO_DEPRECATE to the CFLAGS. It would be nice to remove that warning suppressant and actually make use of the new secure CRT functions.

There is also a similar issue with POSIX CRT function names like fileno having been deprecated in favour of ISO C++ conformant names like _fileno. These warnings are also currently suppressed by adding -D_CRT_NONSTDC_NO_DEPRECATE. It might be nice to do as Microsoft suggest here too, although, unlike the secure functions issue, there is presumably little or no benefit in this case.

These functions currently take no account of DACLs and therefore do not behave correctly in situations where access is restricted by DACLs (as opposed to the read-only attribute).

Furthermore, POSIX::access() behaves differently for directories having the read-only attribute set depending on what CRT library is being used. For example, the _access() function in the VC6 and VC7 CRTs (wrongly) claim that such directories are not writable, whereas in fact all directories are writable unless access is denied by DACLs. (In the case of directories, the read-only attribute actually only means that the directory cannot be deleted.) This CRT bug is fixed in the VC8 and VC9 CRTs (but, of course, the directory may still not actually be writable if access is indeed denied by DACLs).

Therefore, DACLs should be checked both for consistency across CRTs and for the correct answer.

(Note that perl's -w operator should not be modified to check DACLs. It has been written so that it reflects the state of the read-only attribute, even for directories (whatever CRT is being used), for symmetry with chmod().)

struct gp and struct magic are both currently allocated by malloc. It might be a speed or memory saving to change to using arenas. Or it might not. It would need some suitable benchmarking first. In particular, GPs can probably be changed with minimal compatibility impact (probably nothing outside of the core, or even outside of gv.c allocates them), but they probably aren't allocated/deallocated often enough for a speed saving. Whereas MAGIC is allocated/deallocated more often, but in turn, is also something more externally visible, so changing the rules here may bite external code.

Several SV body structs are now the same size, notably PVMG and PVGV, PVAV and PVHV, and PVCV and PVFM. It should be possible to allocate and return same sized bodies from the same actual arena, rather than maintaining one arena for each. This could save 4-6K per thread, of memory no longer tied up in the not-yet-allocated part of an arena.

Create pod/perlxscookbook.pod with short, task-focused 'recipes' in XS that demonstrate common tasks and good practices. (Some of these might be extracted from perlguts.) The target audience should be XS novices, who need more examples than perlguts but something less overwhelming than perlapi. Recipes should provide "one pretty good way to do it" instead of TIMTOWTDI.

Rather than focusing on interfacing Perl to C libraries, such a cookbook should probably focus on how to optimize Perl routines by re-writing them in XS. This will likely be more motivating to those who mostly work in Perl but are looking to take the next step into XS.

Deconstructing and explaining some simpler XS modules could be one way to bootstrap a cookbook. (List::Util? Class::XSAccessor? Tree::Ternary_XS?) Another option could be deconstructing the implementation of some simpler functions in op.c.

For a simple XSUB, often the subroutine dispatch takes more time than the XSUB itself. v5.14.0 now allows XSUBs to register a function which will be called when the parser is finished building an entersub op which calls them.

Registration is done with Perl_cv_set_call_checker, is documented at the API level in perlapi, and "Custom per-subroutine check hooks" in perl5140delta notes that it can be used to inline a subroutine, by replacing it with a custom op. However there is no further detail of the code needed to do this. It would be useful to add one or more annotated examples of how to create XSUBs that inline.

This should provide a measurable speed up to simple XSUBs inside tight loops. Initially one would have to write the OP alternative implementation by hand, but it's likely that this should be reasonably straightforward for the type of XSUB that would benefit the most. Longer term, once the run-time implementation is proven, it should be possible to progressively update ExtUtils::ParseXS to generate OP implementations for some XSUBs.

dump.c contains debugging routines to dump out the contains of perl data structures, such as SVs, AVs and HVs. Currently, the dumping code usesSVs for its temporary buffers, which was a logical initial implementation choice, as they provide ready made memory handling.

However, they also lead to a lot of confusion when it happens that what you're trying to debug is seen by the code in dump.c, correctly or incorrectly, as a temporary scalar it can use for a temporary buffer. It's also not possible to dump scalars before the interpreter is properly set up, such as during ithreads cloning. It would be good to progressively replace the use of scalars as string accumulation buffers with something much simpler, directly allocated by malloc. The dump.c code is (or should be) only producing 7 bit US-ASCII, so output character sets are not an issue.

Producing and proving an internal simple buffer allocation would make it easier to re-write the internals of the PerlIO subsystem to avoid using SVs for its buffers, use of which can cause problems similar to those of dump.c, at similar times.

Some years ago Jarkko supplied patches to provide support for the POSIX SA_SIGINFO feature in Perl, passing the extra data to the Perl signal handler.

Unfortunately, it only works with "unsafe" signals, because under safe signals, by the time Perl gets to run the signal handler, the extra information has been lost. Moreover, it's not easy to store it somewhere, as you can't call mutexs, or do anything else fancy, from inside a signal handler.

So it strikes me that we could provide safe SA_SIGINFO support

Provide global variables for two file descriptors

When the first request is made via sigaction for SA_SIGINFO, create a pipe, store the reader in one, the writer in the other

In the "safe" signal handler (Perl_csighandler()/S_raise_signal()), if the siginfo_t pointer non-NULL, and the writer file handle is open,

serialise signal number, struct siginfo_t (or at least the parts we care about) into a small auto char buff

write() that (non-blocking) to the writer fd

if it writes 100%, flag the signal in a counter of "signals on the pipe" akin to the current per-signal-number counts

if it writes 0%, assume the pipe is full. Flag the data as lost?

if it writes partially, croak a panic, as your OS is broken.

in the regular PERL_ASYNC_CHECK() processing, if there are "signals on the pipe", read the data out, deserialise, build the Perl structures on the stack (code in Perl_sighandler(), the "unsafe" handler), and call as usual.

I think that this gets us decent SA_SIGINFO support, without the current risk of running Perl code inside the signal handler context. (With all the dangers of things like malloc corruption that that currently offers us)

Known combinations that have some level of understanding include Microsoft NTFS, Apple HFS+ (In Mac OS 9 and X) and Apple UFS (in Mac OS X), NFS v4 is rumored to be Unicode, and of course Plan 9. How to create Unicode filenames, what forms of Unicode are accepted and used (UCS-2, UTF-16, UTF-8), what (if any) is the normalization form used, and so on, varies. Finding the right level of interfacing to Perl requires some thought. Remember that an OS does not implicate a filesystem.

(The Windows -C command flag "wide API support" has been at least temporarily retired in 5.8.1, and the -C has been repurposed, see perlrun.)

(See RT ticket #113536 for information on Win32's handling of %ENV, which was fixed to work with native ANSI codepage characters in the environment, but still doesn't work with other characters outside of that codepage present in the environment.)

The old implementation made bad assumptions on several levels. A good 90% solution might be just to make :unique work to share the string buffer of SvPVs. That way large constant strings can be shared between ithreads, such as the configuration information in Config.

system() accepts a LIST syntax (and a PROGRAM LIST syntax) to avoid running a shell. readpipe() (the function behind qx//) could be similarly extended. Note that changing readpipe() itself may not be the solution, as it currently has unary precedence, and allowing a list would change the precedence.

/* Need to check SvMAGICAL, as during global destruction it may be that
AvARYLEN(av) has been freed before av, and hence the SvANY() pointer
is now part of the linked list of SV heads, rather than pointing to
the original body. */
/* FIXME - audit the code for other bugs like this one. */

Perl's diagnostics (error messages, see perldiag) could use reorganizing and formalizing so that each error message has its stable-for-all-eternity unique id, categorized by severity, type, and subsystem. (The error messages would be listed in a datafile outside of the Perl source code, and the source code would only refer to the messages by the id.) This clean-up and regularizing should apply for all croak() messages.

This would enable all sorts of things: easier translation/localization of the messages (though please do keep in mind the caveats of Locale::Maketext about too straightforward approaches to translation), filtering by severity, and instead of grepping for a particular error message one could look for a stable error id. (Of course, changing the error messages by default would break all the existing software depending on some particular error message...)

This kind of functionality is known as message catalogs. Look for inspiration for example in the catgets() system, possibly even use it if available-- but only if available, all platforms will not have catgets().

For the really pure at heart, consider extending this item to cover also the warning messages (see warnings, regen/warnings.pl).

Currently aliasing lexical variables via reference only applies to the current subroutine, and does not propagate to inner closures, nor does aliasing of outer variables within closures propagate to the outer subroutine. This is because each subroutine has its own lexical pad and the aliasing works by changing which SV the pad points to.

One possible way to fix this would be to create new ops for accessing variables that are closed over. So my $x; sub {$x} would use a new op type, say padoutsv, instead of the padsv currently used in the sub. That new op would possibly check a flag or some such and see if it needs to fetch the variable from an outer pad. If we follow this approach, it should be possible at compile time to detect cases where the more complex padoutsv op is unnecessary and revert back to the simpler, faster padsv. There would need to be corresponding ops for arrays, hashes, and subs, too.

There is also a related issue with recursion and state variables. A subroutine actually has a list of lexical pads, each one used at a different recursion level. If a state variable is aliased to another variable after a recursive call to the same subroutine, that higher call depth will not see the effect of aliasing, because the second pad will have been created already. Similarly, aliasing a state variable within a recursive call will not affect outer calls, even though all call depths are supposed to share the same state variables.

It is controversial if the right way to avoid the confusion is to forbid labels with keyword names, or if it would be better to always treat bareword expressions after a "goto" as a label and never as a keyword.

It should be possible to hook into the tokeniser or the lexer, so that when a ; is parsed where it is not legal as a statement terminator (ie inside {} used as a hashref, [] or ()) it issues an error something like ';' isn't legal inside an expression - if you need multiple statements use a do {...} block. See the thread starting at http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/2008-09/msg00573.html

The handling of Unicode is unclean in many places. In the regex engine there are especially many problems. The swash data structure could be replaced my something better. Inversion lists and maps are likely candidates. The whole Unicode database could be placed in-core for a huge speed-up. Only minimal work was done on the optimizer when utf8 was added, with the result that the synthetic start class often will fail to narrow down the possible choices when given non-Latin1 input. Karl Williamson has been working on this - talk to him.

In Perl 6, state ($a) = foo(); and (state $a) = foo(); have different semantics, which is tricky to implement in Perl 5 as currently they produce the same opcode trees. The Perl 6 design is firm, so it would be good to implement the necessary code in Perl 5. There are comments in Perl_newASSIGNOP() that show the code paths taken by various assignment constructions involving state variables.

Currently a debugger started with -dE on the command-line doesn't see the features enabled by -E. More generally hints ($^H and %^H) aren't propagated to the debugger. Probably it would be a good thing to propagate hints from the innermost non-DB:: scope: this would make code eval'ed in the debugger see the features (and strictures, etc.) currently in scope.

The old perltodo notes "With gdb, you can attach the debugger to a running program if you pass the process ID. It would be good to do this with the Perl debugger on a running Perl program, although I'm not sure how it would be done." ssh and screen do this with named pipes in /tmp. Maybe we can too.

Make the peephole optimizer optional. Currently it performs two tasks as it walks the optree - genuine peephole optimisations, and necessary fixups of ops. It would be good to find an efficient way to switch out the optimisations whilst keeping the fixups.

Currently contexts are void, scalar and list. split has a special mechanism in place to pass in the number of return values wanted. It would be useful to have a general mechanism for this, backwards compatible and little speed hit. This would allow proposals such as short circuiting sort to be implemented as a module on CPAN.

Implement a set of "vtables" that virtualizes operating system access (chdir(), chmod(), dbmopen(), getenv(), glob(), link(), mkdir(), open(), opendir(), readdir(), rename(), rmdir(), stat(), sysopen(), uname(), unlink(), etc.) At the very least these interfaces should take SVs as "name" arguments instead of bare char pointers; probably the most flexible and extensible way would be for the Perl-facing interfaces to accept HVs. The system needs to be per-operating-system and per-file-system hookable/filterable, preferably both from XS and Perl level ("Files and Filesystems" in perlport is good reading at this point, in fact, all of perlport is.)

This has actually already been implemented (but only for Win32), take a look at iperlsys.h and win32/perlhost.h. While all Win32 variants go through a set of "vtables" for operating system access, non-Win32 systems currently go straight for the POSIX/Unix-style system/library call. Similar system as for Win32 should be implemented for all platforms. The existing Win32 implementation probably does not need to survive alongside this proposed new implementation, the approaches could be merged.

But this kind of virtualization would also allow for things like virtual filesystems, virtual networks, and "sandboxes" (though as long as dynamic loading of random object code is allowed, not very safe sandboxes since external code of course know not of Perl's vtables). An example of a smaller "sandbox" is that this feature can be used to implement per-thread working directories: Win32 already does this.

Note: This entry was written in reference to the old slab allocator, removed in commit 7aef8e5bd14.

Repacking the optree after execution order is determined could allow removal of NULL ops, and optimal ordering of OPs with respect to cache-line filling. I think that the best way to do this is to make it an optional step just before the completed optree is attached to anything else, and to use the slab allocator unchanged--but allocate a single slab the right size, avoiding partial slabs--, so that freeing ops is identical whether or not this step runs. Note that the slab allocator allocates ops downwards in memory, so one would have to actually "allocate" the ops in reverse-execution order to get them contiguous in memory in execution order.

Note that running this copy, and then freeing all the old location ops would cause their slabs to be freed, which would eliminate possible memory wastage if the previous suggestion is implemented, and we swap slabs more frequently.

Use of uninitialized value in numeric eq (==) at wrong.pl line 4.
Use of uninitialized value in numeric eq (==) at wrong.pl line 4.

where the line of the second warning was misreported - it should be line 5. Rafael fixed this - the problem arose because there was no nextstate OP between the execution of the if and the elsif, hence PL_curcop still reports that the currently executing line is line 4. The solution was to inject a nextstate OPs for each elsif, although it turned out that the nextstate OP needed to be a nulled OP, rather than a live nextstate OP, else other line numbers became misreported. (Jenga!)

The problem is more general than elsif (although the elsif case is the most common and the most confusing). Ideally this code

use warnings;
my $undef;
my $a = $undef + 1;
my $b
= $undef
+ 1;

would produce this output

Use of uninitialized value $undef in addition (+) at wrong.pl line 4.
Use of uninitialized value $undef in addition (+) at wrong.pl line 7.

(rather than lines 4 and 5), but this would seem to require every OP to carry (at least) line number information.

What might work is to have an optional line number in memory just before the BASEOP structure, with a flag bit in the op to say whether it's present. Initially during compile every OP would carry its line number. Then add a late pass to the optimizer (potentially combined with "repack the optree") which looks at the two ops on every edge of the graph of the execution path. If the line number changes, flags the destination OP with this information. Once all paths are traced, replace every op with the flag with a nextstate-light op (that just updates PL_curcop), which in turn then passes control on to the true op. All ops would then be replaced by variants that do not store the line number. (Which, logically, why it would work best in conjunction with "repack the optree", as that is already copying/reallocating all the OPs)

(Although I should note that we're not certain that doing this for the general case is worth it)

Tail-calls present an opportunity for broadly applicable optimization; anywhere that return foo(...) is called, the outer return can be replaced by a goto, and foo will return directly to the outer caller, saving (conservatively) 25% of perl's call&return cost, which is relatively higher than in C. The scheme language is known to do this heavily. B::Concise provides good insight into where this optimization is possible, ie anywhere entersub,leavesub op-sequence occurs.

perl -MO=Concise,-exec,a,b,-main -e 'sub a{ 1 }; sub b {a()}; b(2)'

Bottom line on this is probably a new pp_tailcall function which combines the code in pp_entersub, pp_leavesub. This should probably be done 1st in XS, and using B::Generate to patch the new OP into the optrees.

Perl executes regexes using the traditional backtracking algorithm, which makes it possible to implement a variety of powerful pattern-matching features (like embedded code blocks), at the cost of taking exponential time to run on some pathological patterns. The exponential-time problem is mitigated by the super-linear cache, which detects when we're processing such a pathological pattern, and does some additional bookkeeping to avoid much of the work. However, that code has bit-rotted a little; some patterns don't make as much use of it as they should. The proposal is to analyse where the current cache code has problems, and extend it to cover those cases.