X-Git-Url: http://git.vpit.fr/?a=blobdiff_plain;f=lib%2FB%2FRecDeparse.pm;h=4df9dffb441b183da5acd8a67e64507b6e6f3d76;hb=7dfb54498a29abb83ba502c4f7dfae65d090aecf;hp=a9ace562920d0a516f32958bcc93b4f41f35e9a6;hpb=055d88b751d7e3d19bb94c3d734bbfcedee19276;p=perl%2Fmodules%2FB-RecDeparse.git diff --git a/lib/B/RecDeparse.pm b/lib/B/RecDeparse.pm index a9ace56..4df9dff 100644 --- a/lib/B/RecDeparse.pm +++ b/lib/B/RecDeparse.pm @@ -1,6 +1,6 @@ package B::RecDeparse; -use 5.008; +use 5.008001; use strict; use warnings; @@ -17,33 +17,48 @@ B::RecDeparse - Deparse recursively into subroutines. =head1 VERSION -Version 0.04 +Version 0.07 =cut -our $VERSION = '0.04'; +our $VERSION = '0.07'; =head1 SYNOPSIS - perl -MO=RecDeparse,deparse,[@B__Deparse_opts],level,-1 [ -e '...' | bleh.pl ] + # Deparse recursively a Perl one-liner : + $ perl -MO=RecDeparse,deparse,@B__Deparse_opts,level,-1 -e '...' - # Or as a module : + # Or a complete Perl script : + $ perl -MO=RecDeparse,deparse,@B__Deparse_opts,level,-1 x.pl + + # Or a single code reference : use B::RecDeparse; - my $brd = B::RecDeparse->new(deparse => [ @b__deparse_opts ], level => $level); + my $brd = B::RecDeparse->new( + deparse => \@B__Deparse_opts, + level => $level, + ); my $code = $brd->coderef2text(sub { ... }); =head1 DESCRIPTION This module extends L by making it recursively replace subroutine calls encountered when deparsing. -Please refer to L documentation for what to do and how to do it. Besides the constructor syntax, everything should work the same for the two modules. +Please refer to L documentation for what to do and how to do it. +Besides the constructor syntax, everything should work the same for the two modules. =head1 METHODS -=head2 C<< new < deparse => [ @B__Deparse_opts ], level => $level > >> +=head2 C + + my $brd = B::RecDeparse->new( + deparse => \@B__Deparse_opts, + level => $level, + ); -The L object constructor. You can specify the underlying L constructor arguments by passing a string or an array reference as the value of the C key. The C option expects an integer that specifies how many levels of recursions are allowed : C<-1> means infinite while C<0> means none and match L behaviour. +The L object constructor. +You can specify the underlying L constructor arguments by passing a string or an array reference as the value of the C key. +The C option expects an integer that specifies how many levels of recursions are allowed : C<-1> means infinite while C<0> means none and match L behaviour. =cut @@ -180,10 +195,12 @@ sub pp_gv { my $gv = $self->gv_or_padgv($_[0]); my $name = $gv->NAME; + my $cv = $gv->CV; my $seen = $self->{brd_seen}; my $body; - if ($self->{brd_sub} <= 0 || !$self->_recurse || $seen->{$name}) { + if (!$self->{brd_sub} or !$self->_recurse or $seen->{$name} or !$$cv + or !$cv->isa('B::CV') or $cv->ROOT->isa('B::NULL')) { $body = $self->SUPER::pp_gv(@_); } else { $body = do { @@ -202,19 +219,37 @@ sub pp_gv { return $body; } -=head2 C +=pod + +The following functions and methods from L are reimplemented by this module : + +=over 4 + +=item * + +C -=head2 C +=item * -=head2 C +C -=head2 C +=item * -=head2 C +C -=head2 C +=item * -Functions and methods from L reimplemented by this module. Never call them directly. +C + +=item * + +C + +=item * + +C + +=back Otherwise, L inherits all methods from L. @@ -224,6 +259,8 @@ An object-oriented module shouldn't export any function, and so does this one. =head1 DEPENDENCIES +L 5.8.1. + L (standard since perl 5), L (since perl 5.00307) and L (since perl 5.005). =head1 AUTHOR @@ -234,7 +271,8 @@ You can contact me by mail or on C (vincent). =head1 BUGS -Please report any bugs or feature requests to C, or through the web interface at L. I will be notified, and then you'll automatically be notified of progress on your bug as I make changes. +Please report any bugs or feature requests to C, or through the web interface at L. +I will be notified, and then you'll automatically be notified of progress on your bug as I make changes. =head1 SUPPORT @@ -246,7 +284,7 @@ Tests code coverage report is available at L