=head1 NAME
perltodo - Perl TO-DO List
=head1 DESCRIPTION
This is a list of wishes for Perl. The most up to date version of this file
is at http://perl5.git.perl.org/perl.git/blob_plain/HEAD:/pod/perltodo.pod
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
I 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
F file, which ships in the official distribution. How many other
programming languages offer you 1 line of immortality?
=head1 Tasks that only need Perl knowledge
=head2 Smartmatch design issues
In 5.10.0 the smartmatch operator C<~~> isn't working quite "right". But
before we can fix the implementation, we need to define what "right" is.
The first problem is that Robin Houston implemented the Perl 6 smart match
spec as of February 2006, when smart match was axiomatically symmetrical:
L
Since then the Perl 6 target moved, but the Perl 5 implementation did not.
So it would be useful for someone to compare the Perl 6 smartmatch table
as of February 2006 L
and the current table L
and tabulate the differences in Perl 6. The annotated view of changes is
L and the diff is
C
-- search for C<=head1 Smart matching>. (In theory F can generate that,
but in practice when I tried it hung forever, I assume "thinking")
With that done and published, someone (else) can then map any changed Perl 6
semantics back to Perl 5, based on how the existing semantics map to Perl 5:
L
There are also some questions that need answering:
=over 4
=item *
How do you negate one? (documentation issue)
http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/2008-01/msg00071.html
=item *
Array behaviors
http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/2007-12/msg00799.html
* Should smart matches be symmetrical? (Perl 6 says no)
* Other differences between Perl 5 and Perl 6 smart match?
=item *
Objects and smart match
http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/2007-12/msg00865.html
=back
=head2 Remove duplication of test setup.
Schwern notes, that there's duplication of code - lots and lots of tests have
some variation on the big block of C<$Is_Foo> checks. We can safely put this
into a file, change it to build an C<%Is> hash and require it. Maybe just put
it into F. Throw in the handy tainting subroutines.
=head2 POD -E HTML conversion in the core still sucks
Which is crazy given just how simple POD purports to be, and how simple HTML
can be. It's not actually I simple as it sounds, particularly with the
flexibility POD allows for C<=item>, but it would be good to improve the
visual appeal of the HTML generated, and to avoid it having any validation
errors. See also L, as the layout of installation tree
is needed to improve the cross-linking.
The addition of C and its related modules may make this task
easier to complete.
=head2 Parallel testing
(This probably impacts much more than the core: also the Test::Harness
and TAP::* modules on CPAN.)
All of the tests in F can now be run in parallel, if C<$ENV{TEST_JOBS}>
is set. However, tests within each directory in F and F are still
run in series, with directories run in parallel. This is an adequate
heuristic, but it might be possible to relax it further, and get more
throughput. Specifically, it would be good to audit all of F, and
make them use C.
=head2 Make Schwern poorer
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.
=head2 Improve the coverage of the core tests
Use Devel::Cover to ascertain the core modules's test coverage, then add
tests that are currently missing.
=head2 test B
A full test suite for the B module would be nice.
=head2 A decent benchmark
C 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.
=head2 fix tainting bugs
Fix the bugs revealed by running the test suite with the C<-t> switch (via
C).
=head2 Dual life everything
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
F.
=head2 Bundle dual life modules in ext/
For maintenance (and branch merging) reasons, it would be useful to move
some architecture-independent dual-life modules from lib/ to ext/, if this
has no negative impact on the build of perl itself.
=head2 POSIX memory footprint
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.
=head2 embed.pl/makedef.pl
There is a script F that generates several header files to prefix
all of Perl's symbols in a consistent way, to provide some semblance of
namespace support in C. Functions are declared in F, variables
in F. Quite a few of the functions and variables
are conditionally declared there, using C<#ifdef>. However, F
doesn't understand the C macros, so the rules about which symbols are present
when is duplicated in F. Writing things twice is bad, m'kay.
It would be good to teach C to understand the conditional
compilation, and hence remove the duplication, and the mistakes it has caused.
=head2 use strict; and AutoLoad
Currently if you write
package Whack;
use AutoLoader 'AUTOLOAD';
use strict;
1;
__END__
sub bloop {
print join (' ', No, strict, here), "!\n";
}
then C
would be roughly equivalent to:
do { local $"='|'; /\b(?:P)\b/ }
See L
for the discussion.
=head2 optional optimizer
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.
=head2 You WANT *how* many
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.
=head2 lexical aliases
Allow lexical aliases (maybe via the syntax C.
=head2 entersub XS vs Perl
At the moment pp_entersub is huge, and has code to deal with entering both
perl and XS subroutines. Subroutine implementations rarely change between
perl and XS at run time, so investigate using 2 ops to enter subs (one for
XS, one for perl) and swap between if a sub is redefined.
=head2 Self-ties
Self-ties are currently illegal because they caused too many segfaults. Maybe
the causes of these could be tracked down and self-ties on all types
reinstated.
=head2 Optimize away @_
The old perltodo notes "Look at the "reification" code in C".
=head2 Virtualize operating system access
Implement a set of "vtables" that virtualizes operating system access
(open(), mkdir(), unlink(), readdir(), getenv(), 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
(L is good reading at this point,
in fact, all of L is.)
This has actually already been implemented (but only for Win32),
take a look at F and F. 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.
What would this give us? One often-asked-for feature this would
enable is using Unicode for filenames, and other "names" like %ENV,
usernames, hostnames, and so forth.
(See L.)
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.
See also L"Extend PerlIO and PerlIO::Scalar">.
=head2 Investigate PADTMP hash pessimisation
The peephole optimiser converts constants used for hash key lookups to shared
hash key scalars. Under ithreads, something is undoing this work.
See http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/2007-09/msg00793.html
=head2 Store the current pad in the OP slab allocator
=for clarification
I hope that I got that "current pad" part correct
Currently we leak ops in various cases of parse failure. I suggested that we
could solve this by always using the op slab allocator, and walking it to
free ops. Dave comments that as some ops are already freed during optree
creation one would have to mark which ops are freed, and not double free them
when walking the slab. He notes that one problem with this is that for some ops
you have to know which pad was current at the time of allocation, which does
change. I suggested storing a pointer to the current pad in the memory allocated
for the slab, and swapping to a new slab each time the pad changes. Dave thinks
that this would work.
=head2 repack the optree
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. The slab allocator could be reused for this purpose. 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, 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.
See http://www.nntp.perl.org/group/perl.perl5.porters/2007/12/msg131975.html
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.
=head2 eliminate incorrect line numbers in warnings
This code
use warnings;
my $undef;
if ($undef == 3) {
} elsif ($undef == 0) {
}
used to produce this output:
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 C and the C, hence C still
reports that the currently executing line is line 4. The solution was to inject
a nextstate OPs for each C, 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 C (although the C 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 optimiser (potentially combined with L) 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 C), 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 L, 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)
=head2 optimize tail-calls
Tail-calls present an opportunity for broadly applicable optimization;
anywhere that C<< 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.
=head1 Big projects
Tasks that will get your name mentioned in the description of the "Highlights
of 5.12"
=head2 make ithreads more robust
Generally make ithreads more robust. See also L
This task is incremental - even a little bit of work on it will help, and
will be greatly appreciated.
One bit would be to write the missing code in sv.c:Perl_dirp_dup.
Fix Perl_sv_dup, et al so that threads can return objects.
=head2 iCOW
Sarathy and Arthur have a proposal for an improved Copy On Write which
specifically will be able to COW new ithreads. If this can be implemented
it would be a good thing.
=head2 (?{...}) closures in regexps
Fix (or rewrite) the implementation of the C(?{...})/> closures.
=head2 A re-entrant regexp engine
This will allow the use of a regex from inside (?{ }), (??{ }) and
(?(?{ })|) constructs.
=head2 Add class set operations to regexp engine
Apparently these are quite useful. Anyway, Jeffery Friedl wants them.
demerphq has this on his todo list, but right at the bottom.