-=head2 sendmsg and recvmsg
-
-We have all the other BSD socket functions but these. There are
-metaconfig units for these functions which can be added. To avoid these
-being new opcodes, a solution similar to the way C<sockatmark> was added
-would be preferable. (Autoload the C<IO::whatever> module.)
-
-=head2 Rewrite perlre documentation
-
-The new-style patterns need full documentation, and the whole document
-needs to be a lot clearer.
-
-=head2 Convert example code to IO::Handle filehandles
-
-=head2 Document Win32 choices
-
-=head2 Check new modules
-
-=head2 Make roffitall find pods and libs itself
-
-Simon Cozens has done some work on this but it needs a rethink.
-
-=head1 To do at some point
-
-These are ideas that have been regularly tossed around, that most
-people believe should be done maybe during 5.8.x
-
-=head2 Remove regular expression recursion
-
-Because the regular expression engine is recursive, badly designed
-expressions can lead to lots of recursion filling up the stack. Ilya
-claims that it is easy to convert the engine to being iterative, but
-this has still not yet been done. There may be a regular expression
-engine hit squad meeting at TPC5.
-
-=head2 Memory leaks after failed eval
-
-Perl will leak memory if you C<eval "hlagh hlagh hlagh hlagh">. This is
-partially because it attempts to build up an op tree for that code and
-doesn't properly free it. The same goes for non-syntactically-correct
-regular expressions. Hugo looked into this, but decided it needed a
-mark-and-sweep GC implementation.
-
-Alan notes that: The basic idea was to extend the parser token stack
-(C<YYSTYPE>) to include a type field so we knew what sort of thing each
-element of the stack was. The F<perly.c> code would then have to be
-postprocessed to record the type of each entry on the stack as it was
-created, and the parser patched so that it could unroll the stack
-properly on error.
-
-This is possible to do, but would be pretty messy to implement, as it
-would rely on even more sed hackery in F<perly.fixer>.
-
-=head2 bitfields in pack
-
-=head2 Cross compilation
-
-Make Perl buildable with a cross-compiler. This will play havoc with
-Configure, which needs to know how the target system will respond to
-its tests; maybe C<microperl> will be a good starting point here.
-(Indeed, Bart Schuller reports that he compiled up C<microperl> for
-the Agenda PDA and it works fine.) A really big spanner in the works
-is the bootstrapping build process of Perl: if the filesystem the
-target systems sees is not the same what the build host sees, various
-input, output, and (Perl) library files need to be copied back and forth.
-
-As of 5.8.0 Configure mostly works for cross-compilation
-(used successfully for iPAQ Linux), miniperl gets built,
-but then building DynaLoader (and other extensions) fails
-since MakeMaker knows nothing of cross-compilation.
-(See INSTALL/Cross-compilation for the state of things.)
-
-=head2 Perl preprocessor / macros
-
-Source filters help with this, but do not get us all the way. For
-instance, it should be possible to implement the C<??> operator somehow;
-source filters don't (quite) cut it.
-
-=head2 Perl lexer in Perl
-
-Damian Conway is planning to work on this, but it hasn't happened yet.
-
-=head2 Using POSIX calls internally
-
-When faced with a BSD vs. SysV -style interface to some library or
-system function, perl's roots show in that it typically prefers the BSD
-interface (but falls back to the SysV one). One example is getpgrp().
-Other examples include C<memcpy> vs. C<bcopy>. There are others, mostly in
-F<pp_sys.c>.
-
-Mostly, this item is a suggestion for which way to start a journey into
-an C<#ifdef> forest. It is not primarily a suggestion to eliminate any of
-the C<#ifdef> forests.
-
-POSIX calls are perhaps more likely to be portable to unexpected
-architectures. They are also perhaps more likely to be actively
-maintained by a current vendor. They are also perhaps more likely to be
-available in thread-safe versions, if appropriate.
-
-=head2 -i rename file when changed
-
-It's only necessary to rename a file when inplace editing when the file
-has changed. Detecting a change is perhaps the difficult bit.
-
-=head2 All ARGV input should act like E<lt>E<gt>
-
-eg C<read(ARGV, ...)> doesn't currently read across multiple files.
-
-=head2 Support for rerunning debugger
-
-There should be a way of restarting the debugger on demand.
-
-=head2 Test Suite for the Debugger
-
-The debugger is a complex piece of software and fixing something
-here may inadvertently break something else over there. To tame
-this chaotic behaviour, a test suite is necessary.
-
-=head2 my sub foo { }
-
-The basic principle is sound, but there are problems with the semantics
-of self-referential and mutually referential lexical subs: how to
-declare the subs?
-
-=head2 One-pass global destruction
-
-Sweeping away all the allocated memory in one go is a laudable goal, but
-it's difficult and in most cases, it's easier to let the memory get
-freed by exiting.
-
-=head2 Rewrite regexp parser
-
-There has been talk recently of rewriting the regular expression parser
-to produce an optree instead of a chain of opcodes; it's unclear whether
-or not this would be a win.
-
-=head2 Cache recently used regexps
-
-This is to speed up
-
- for my $re (@regexps) {
- $matched++ if /$re/
- }
-
-C<qr//> already gives us a way of saving compiled regexps, but it should
-be done automatically.
-
-=head2 Cross-compilation support
-
-Bart Schuller reports that using C<microperl> and a cross-compiler, he
-got Perl working on the Agenda PDA. However, one cannot build a full
-Perl because Configure needs to get the results for the target platform,
-for the host.
-
-=head2 Bit-shifting bitvectors
-
-Given:
-
- vec($v, 1000, 1) = 1;
-
-One should be able to do
-
- $v <<= 1;
-
-and have the 999'th bit set.
-
-Currently if you try with shift bitvectors you shift the NV/UV, instead
-of the bits in the PV. Not very logical.
-
-=head2 debugger pragma
-
-The debugger is implemented in Perl in F<perl5db.pl>; turning it into a
-pragma should be easy, but making it work lexically might be more
-difficult. Fiddling with C<$^P> would be necessary.
-
-=head2 use less pragma