dslinux/user/perl/ext/Devel/Peek Changes Makefile.PL Peek.pm Peek.xs
cayenne
dslinux_cayenne at user.in-berlin.de
Mon Dec 4 17:59:21 CET 2006
Update of /cvsroot/dslinux/dslinux/user/perl/ext/Devel/Peek
In directory antilope:/tmp/cvs-serv17422/ext/Devel/Peek
Added Files:
Changes Makefile.PL Peek.pm Peek.xs
Log Message:
Adding fresh perl source to HEAD to branch from
--- NEW FILE: Peek.pm ---
# Devel::Peek - A data debugging tool for the XS programmer
# The documentation is after the __END__
package Devel::Peek;
$VERSION = '1.03';
$XS_VERSION = $VERSION;
$VERSION = eval $VERSION;
require Exporter;
use XSLoader ();
@ISA = qw(Exporter);
@EXPORT = qw(Dump mstat DeadCode DumpArray DumpWithOP DumpProg
fill_mstats mstats_fillhash mstats2hash runops_debug debug_flags);
@EXPORT_OK = qw(SvREFCNT SvREFCNT_inc SvREFCNT_dec CvGV);
%EXPORT_TAGS = ('ALL' => [@EXPORT, @EXPORT_OK]);
XSLoader::load 'Devel::Peek';
sub import {
my $c = shift;
my $ops_rx = qr/^:opd(=[stP]*)?\b/;
my @db = grep m/$ops_rx/, @_;
@_ = grep !m/$ops_rx/, @_;
if (@db) {
die "Too many :opd options" if @db > 1;
runops_debug(1);
my $flags = ($db[0] =~ m/$ops_rx/ and $1);
$flags = 'st' unless defined $flags;
my $f = 0;
$f |= 2 if $flags =~ /s/;
$f |= 8 if $flags =~ /t/;
$f |= 64 if $flags =~ /P/;
$^D |= $f if $f;
}
unshift @_, $c;
goto &Exporter::import;
}
sub DumpWithOP ($;$) {
local($Devel::Peek::dump_ops)=1;
my $depth = @_ > 1 ? $_[1] : 4 ;
Dump($_[0],$depth);
}
$D_flags = 'psltocPmfrxuLHXDSTR';
sub debug_flags (;$) {
my $out = "";
for my $i (0 .. length($D_flags)-1) {
$out .= substr $D_flags, $i, 1 if $^D & (1<<$i);
}
my $arg = shift;
my $num = $arg;
if (defined $arg and $arg =~ /\D/) {
die "unknown flags in debug_flags()" if $arg =~ /[^-$D_flags]/;
my ($on,$off) = split /-/, "$arg-";
$num = $^D;
$num |= (1<<index($D_flags, $_)) for split //, $on;
$num &= ~(1<<index($D_flags, $_)) for split //, $off;
}
$^D = $num if defined $arg;
$out
}
1;
__END__
=head1 NAME
Devel::Peek - A data debugging tool for the XS programmer
=head1 SYNOPSIS
use Devel::Peek;
Dump( $a );
Dump( $a, 5 );
DumpArray( 5, $a, $b, ... );
mstat "Point 5";
use Devel::Peek ':opd=st';
=head1 DESCRIPTION
Devel::Peek contains functions which allows raw Perl datatypes to be
manipulated from a Perl script. This is used by those who do XS programming
to check that the data they are sending from C to Perl looks as they think
it should look. The trick, then, is to know what the raw datatype is
supposed to look like when it gets to Perl. This document offers some tips
and hints to describe good and bad raw data.
It is very possible that this document will fall far short of being useful
to the casual reader. The reader is expected to understand the material in
the first few sections of L<perlguts>.
Devel::Peek supplies a C<Dump()> function which can dump a raw Perl
datatype, and C<mstat("marker")> function to report on memory usage
(if perl is compiled with corresponding option). The function
DeadCode() provides statistics on the data "frozen" into inactive
C<CV>. Devel::Peek also supplies C<SvREFCNT()>, C<SvREFCNT_inc()>, and
C<SvREFCNT_dec()> which can query, increment, and decrement reference
counts on SVs. This document will take a passive, and safe, approach
to data debugging and for that it will describe only the C<Dump()>
function.
Function C<DumpArray()> allows dumping of multiple values (useful when you
need to analyze returns of functions).
The global variable $Devel::Peek::pv_limit can be set to limit the
number of character printed in various string values. Setting it to 0
means no limit.
If C<use Devel::Peek> directive has a C<:opd=FLAGS> argument,
this switches on debugging of opcode dispatch. C<FLAGS> should be a
combination of C<s>, C<t>, and C<P> (see B<-D> flags in L<perlrun>).
C<:opd> is a shortcut for C<:opd=st>.
=head2 Runtime debugging
C<CvGV($cv)> return one of the globs associated to a subroutine reference $cv.
debug_flags() returns a string representation of C<$^D> (similar to
what is allowed for B<-D> flag). When called with a numeric argument,
sets $^D to the corresponding value. When called with an argument of
the form C<"flags-flags">, set on/off bits of C<$^D> corresponding to
letters before/after C<->. (The returned value is for C<$^D> before
the modification.)
runops_debug() returns true if the current I<opcode dispatcher> is the
debugging one. When called with an argument, switches to debugging or
non-debugging dispatcher depending on the argument (active for
newly-entered subs/etc only). (The returned value is for the dispatcher before the modification.)
=head2 Memory footprint debugging
When perl is compiled with support for memory footprint debugging
(default with Perl's malloc()), Devel::Peek provides an access to this API.
Use mstat() function to emit a memory state statistic to the terminal.
For more information on the format of output of mstat() see
L<perldebguts/Using C<$ENV{PERL_DEBUG_MSTATS}>>.
Three additional functions allow access to this statistic from Perl.
First, use C<mstats_fillhash(%hash)> to get the information contained
in the output of mstat() into %hash. The field of this hash are
minbucket nbuckets sbrk_good sbrk_slack sbrked_remains sbrks start_slack
topbucket topbucket_ev topbucket_odd total total_chain total_sbrk totfree
Two additional fields C<free>, C<used> contain array references which
provide per-bucket count of free and used chunks. Two other fields
C<mem_size>, C<available_size> contain array references which provide
the information about the allocated size and usable size of chunks in
each bucket. Again, see L<perldebguts/Using C<$ENV{PERL_DEBUG_MSTATS}>>
for details.
Keep in mind that only the first several "odd-numbered" buckets are
used, so the information on size of the "odd-numbered" buckets which are
not used is probably meaningless.
The information in
mem_size available_size minbucket nbuckets
is the property of a particular build of perl, and does not depend on
the current process. If you do not provide the optional argument to
the functions mstats_fillhash(), fill_mstats(), mstats2hash(), then
the information in fields C<mem_size>, C<available_size> is not
updated.
C<fill_mstats($buf)> is a much cheaper call (both speedwise and
memory-wise) which collects the statistic into $buf in
machine-readable form. At a later moment you may need to call
C<mstats2hash($buf, %hash)> to use this information to fill %hash.
All three APIs C<fill_mstats($buf)>, C<mstats_fillhash(%hash)>, and
C<mstats2hash($buf, %hash)> are designed to allocate no memory if used
I<the second time> on the same $buf and/or %hash.
So, if you want to collect memory info in a cycle, you may call
$#buf = 999;
fill_mstats($_) for @buf;
mstats_fillhash(%report, 1); # Static info too
foreach (@buf) {
# Do something...
fill_mstats $_; # Collect statistic
}
foreach (@buf) {
mstats2hash($_, %report); # Preserve static info
# Do something with %report
}
=head1 EXAMPLES
The following examples don't attempt to show everything as that would be a
monumental task, and, frankly, we don't want this manpage to be an internals
document for Perl. The examples do demonstrate some basics of the raw Perl
datatypes, and should suffice to get most determined people on their way.
There are no guidewires or safety nets, nor blazed trails, so be prepared to
travel alone from this point and on and, if at all possible, don't fall into
the quicksand (it's bad for business).
Oh, one final bit of advice: take L<perlguts> with you. When you return we
expect to see it well-thumbed.
=head2 A simple scalar string
Let's begin by looking a simple scalar which is holding a string.
use Devel::Peek;
$a = "hello";
Dump $a;
The output:
SV = PVIV(0xbc288)
REFCNT = 1
FLAGS = (POK,pPOK)
IV = 0
PV = 0xb2048 "hello"\0
CUR = 5
LEN = 6
This says C<$a> is an SV, a scalar. The scalar is a PVIV, a string.
Its reference count is 1. It has the C<POK> flag set, meaning its
current PV field is valid. Because POK is set we look at the PV item
to see what is in the scalar. The \0 at the end indicate that this
PV is properly NUL-terminated.
If the FLAGS had been IOK we would look
at the IV item. CUR indicates the number of characters in the PV.
LEN indicates the number of bytes requested for the PV (one more than
CUR, in this case, because LEN includes an extra byte for the
end-of-string marker).
=head2 A simple scalar number
If the scalar contains a number the raw SV will be leaner.
use Devel::Peek;
$a = 42;
Dump $a;
The output:
SV = IV(0xbc818)
REFCNT = 1
FLAGS = (IOK,pIOK)
IV = 42
This says C<$a> is an SV, a scalar. The scalar is an IV, a number. Its
reference count is 1. It has the C<IOK> flag set, meaning it is currently
being evaluated as a number. Because IOK is set we look at the IV item to
see what is in the scalar.
=head2 A simple scalar with an extra reference
If the scalar from the previous example had an extra reference:
use Devel::Peek;
$a = 42;
$b = \$a;
Dump $a;
The output:
SV = IV(0xbe860)
REFCNT = 2
FLAGS = (IOK,pIOK)
IV = 42
Notice that this example differs from the previous example only in its
reference count. Compare this to the next example, where we dump C<$b>
instead of C<$a>.
=head2 A reference to a simple scalar
This shows what a reference looks like when it references a simple scalar.
use Devel::Peek;
$a = 42;
$b = \$a;
Dump $b;
The output:
SV = RV(0xf041c)
REFCNT = 1
FLAGS = (ROK)
RV = 0xbab08
SV = IV(0xbe860)
REFCNT = 2
FLAGS = (IOK,pIOK)
IV = 42
Starting from the top, this says C<$b> is an SV. The scalar is an RV, a
reference. It has the C<ROK> flag set, meaning it is a reference. Because
ROK is set we have an RV item rather than an IV or PV. Notice that Dump
follows the reference and shows us what C<$b> was referencing. We see the
same C<$a> that we found in the previous example.
Note that the value of C<RV> coincides with the numbers we see when we
stringify $b. The addresses inside RV() and IV() are addresses of
C<X***> structure which holds the current state of an C<SV>. This
address may change during lifetime of an SV.
=head2 A reference to an array
This shows what a reference to an array looks like.
use Devel::Peek;
$a = [42];
Dump $a;
The output:
SV = RV(0xf041c)
REFCNT = 1
FLAGS = (ROK)
RV = 0xb2850
SV = PVAV(0xbd448)
REFCNT = 1
FLAGS = ()
IV = 0
NV = 0
ARRAY = 0xb2048
ALLOC = 0xb2048
FILL = 0
MAX = 0
ARYLEN = 0x0
FLAGS = (REAL)
Elt No. 0 0xb5658
SV = IV(0xbe860)
REFCNT = 1
FLAGS = (IOK,pIOK)
IV = 42
This says C<$a> is an SV and that it is an RV. That RV points to
another SV which is a PVAV, an array. The array has one element,
element zero, which is another SV. The field C<FILL> above indicates
the last element in the array, similar to C<$#$a>.
If C<$a> pointed to an array of two elements then we would see the
following.
use Devel::Peek 'Dump';
$a = [42,24];
Dump $a;
The output:
SV = RV(0xf041c)
REFCNT = 1
FLAGS = (ROK)
RV = 0xb2850
SV = PVAV(0xbd448)
REFCNT = 1
FLAGS = ()
IV = 0
NV = 0
ARRAY = 0xb2048
ALLOC = 0xb2048
FILL = 0
MAX = 0
ARYLEN = 0x0
FLAGS = (REAL)
Elt No. 0 0xb5658
SV = IV(0xbe860)
REFCNT = 1
FLAGS = (IOK,pIOK)
IV = 42
Elt No. 1 0xb5680
SV = IV(0xbe818)
REFCNT = 1
FLAGS = (IOK,pIOK)
IV = 24
Note that C<Dump> will not report I<all> the elements in the array,
only several first (depending on how deep it already went into the
report tree).
=head2 A reference to a hash
The following shows the raw form of a reference to a hash.
use Devel::Peek;
$a = {hello=>42};
Dump $a;
The output:
SV = RV(0x8177858) at 0x816a618
REFCNT = 1
FLAGS = (ROK)
RV = 0x814fc10
SV = PVHV(0x8167768) at 0x814fc10
REFCNT = 1
FLAGS = (SHAREKEYS)
IV = 1
NV = 0
ARRAY = 0x816c5b8 (0:7, 1:1)
hash quality = 100.0%
KEYS = 1
FILL = 1
MAX = 7
RITER = -1
EITER = 0x0
Elt "hello" HASH = 0xc8fd181b
SV = IV(0x816c030) at 0x814fcf4
REFCNT = 1
FLAGS = (IOK,pIOK)
IV = 42
This shows C<$a> is a reference pointing to an SV. That SV is a PVHV, a
hash. Fields RITER and EITER are used by C<L<each>>.
The "quality" of a hash is defined as the total number of comparisons needed
to access every element once, relative to the expected number needed for a
random hash. The value can go over 100%.
The total number of comparisons is equal to the sum of the squares of the
number of entries in each bucket. For a random hash of C<<n>> keys into
C<<k>> buckets, the expected value is:
n + n(n-1)/2k
=head2 Dumping a large array or hash
The C<Dump()> function, by default, dumps up to 4 elements from a
toplevel array or hash. This number can be increased by supplying a
second argument to the function.
use Devel::Peek;
$a = [10,11,12,13,14];
Dump $a;
Notice that C<Dump()> prints only elements 10 through 13 in the above code.
The following code will print all of the elements.
use Devel::Peek 'Dump';
$a = [10,11,12,13,14];
Dump $a, 5;
=head2 A reference to an SV which holds a C pointer
This is what you really need to know as an XS programmer, of course. When
an XSUB returns a pointer to a C structure that pointer is stored in an SV
and a reference to that SV is placed on the XSUB stack. So the output from
an XSUB which uses something like the T_PTROBJ map might look something like
this:
SV = RV(0xf381c)
REFCNT = 1
FLAGS = (ROK)
RV = 0xb8ad8
SV = PVMG(0xbb3c8)
REFCNT = 1
FLAGS = (OBJECT,IOK,pIOK)
IV = 729160
NV = 0
PV = 0
STASH = 0xc1d10 "CookBookB::Opaque"
This shows that we have an SV which is an RV. That RV points at another
SV. In this case that second SV is a PVMG, a blessed scalar. Because it is
blessed it has the C<OBJECT> flag set. Note that an SV which holds a C
pointer also has the C<IOK> flag set. The C<STASH> is set to the package
name which this SV was blessed into.
The output from an XSUB which uses something like the T_PTRREF map, which
doesn't bless the object, might look something like this:
SV = RV(0xf381c)
REFCNT = 1
FLAGS = (ROK)
RV = 0xb8ad8
SV = PVMG(0xbb3c8)
REFCNT = 1
FLAGS = (IOK,pIOK)
IV = 729160
NV = 0
PV = 0
=head2 A reference to a subroutine
Looks like this:
SV = RV(0x798ec)
REFCNT = 1
FLAGS = (TEMP,ROK)
RV = 0x1d453c
SV = PVCV(0x1c768c)
REFCNT = 2
FLAGS = ()
IV = 0
NV = 0
COMP_STASH = 0x31068 "main"
START = 0xb20e0
ROOT = 0xbece0
XSUB = 0x0
XSUBANY = 0
GVGV::GV = 0x1d44e8 "MY" :: "top_targets"
FILE = "(eval 5)"
DEPTH = 0
PADLIST = 0x1c9338
This shows that
=over 4
=item *
the subroutine is not an XSUB (since C<START> and C<ROOT> are
non-zero, and C<XSUB> is zero);
=item *
that it was compiled in the package C<main>;
=item *
under the name C<MY::top_targets>;
=item *
inside a 5th eval in the program;
=item *
it is not currently executed (see C<DEPTH>);
=item *
it has no prototype (C<PROTOTYPE> field is missing).
=back
=head1 EXPORTS
C<Dump>, C<mstat>, C<DeadCode>, C<DumpArray>, C<DumpWithOP> and
C<DumpProg>, C<fill_mstats>, C<mstats_fillhash>, C<mstats2hash> by
default. Additionally available C<SvREFCNT>, C<SvREFCNT_inc> and
C<SvREFCNT_dec>.
=head1 BUGS
Readers have been known to skip important parts of L<perlguts>, causing much
frustration for all.
=head1 AUTHOR
Ilya Zakharevich ilya at math.ohio-state.edu
Copyright (c) 1995-98 Ilya Zakharevich. All rights reserved.
This program is free software; you can redistribute it and/or
modify it under the same terms as Perl itself.
Author of this software makes no claim whatsoever about suitability,
reliability, edability, editability or usability of this product, and
should not be kept liable for any damage resulting from the use of
it. If you can use it, you are in luck, if not, I should not be kept
responsible. Keep a handy copy of your backup tape at hand.
=head1 SEE ALSO
L<perlguts>, and L<perlguts>, again.
=cut
--- NEW FILE: Changes ---
0.3: Some functions return SV * now.
0.4: Hashes dumped recursively.
Additional fields for CV added.
0.5: Prototypes for functions supported.
Strings are consostently in quotes now.
Name changed to Devel::Peek (former ExtUtils::Peek).
0.7:
New function mstat added.
Docs added (thanks to Dean Roehrich).
0.8:
Exports Dump and mstat.
Docs list more details.
Arrays print addresses of SV.
CV: STASH renamed to COMP_STASH. The package of GV is printed now.
Updated for newer overloading implementation (but will not report
packages with overloading).
0.81:
Implements and exports DeadCode().
Buglet in the definition of mstat for malloc-less perl corrected.
0.82:
New style PADless CV allowed.
0.83:
DumpArray added.
Compatible with PerlIO.
When calculating junk inside subs, divide by refcount.
0.84:
Indented output.
0.85:
By Gisle Aas: format SvPVX, print magic (but not unrefcounted mg_obj);
A lot of new fields stolen from sv_dump();
0.86:
By Gisle Aas:
- Updated the documentation.
- Move string printer to it's own function: fprintpv()
- Use it to print PVs, HV keys, MG_PTR
- Don't print IV for hashes as KEY is the same field
- Tag GvSTASH as "GvSTASH" in order to not confuse it with
the other STASH field, e.g. Dump(bless \*foo, "bar")
0.87:
Extra indentation of SvRV.
AMAGIC removed.
Head of OOK data printed too.
0.88:
PADLIST and OUTSIDE of CVs itemized.
Prints the value of the hash of HV keys.
Changes by Gisle: do not print both if AvARRAY == AvALLOC;
print hash fill statistics.
0.89:
Changes by Gisle: optree dump.
0.90:
DumpWithOP, DumpProg exported.
Better indent for AV, HV elts.
Address of SV printed.
Corrected Zero code which was causing segfaults.
0.91:
Compiles, runs test under 5.005beta2.
Update DEBUGGING_MSTATS-less MSTATS.
0.92:
Should compile without MYMALLOC too.
0.94:
Had problems with HEf_SVKEY magic.
0.95:
Added "hash quality" output to estimate Perl's hash functions.
1.02:
2004-10-22: Document "hash quality" output and update examples.
--- NEW FILE: Peek.xs ---
#define PERL_NO_GET_CONTEXT
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"
static bool
_runops_debug(int flag)
{
dTHX;
const bool d = PL_runops == MEMBER_TO_FPTR(Perl_runops_debug);
if (flag >= 0)
PL_runops
= MEMBER_TO_FPTR(flag ? Perl_runops_debug : Perl_runops_standard);
return d;
}
static SV *
DeadCode(pTHX)
{
#ifdef PURIFY
return Nullsv;
#else
SV* sva;
SV* sv;
SV* ret = newRV_noinc((SV*)newAV());
register SV* svend;
int tm = 0, tref = 0, ts = 0, ta = 0, tas = 0;
for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
svend = &sva[SvREFCNT(sva)];
for (sv = sva + 1; sv < svend; ++sv) {
if (SvTYPE(sv) == SVt_PVCV) {
CV *cv = (CV*)sv;
AV* padlist = CvPADLIST(cv), *argav;
SV** svp;
SV** pad;
int i = 0, j, levelm, totm = 0, levelref, totref = 0;
int levels, tots = 0, levela, tota = 0, levelas, totas = 0;
int dumpit = 0;
if (CvXSUB(sv)) {
continue; /* XSUB */
}
if (!CvGV(sv)) {
continue; /* file-level scope. */
}
if (!CvROOT(cv)) {
/* PerlIO_printf(Perl_debug_log, " no root?!\n"); */
continue; /* autoloading stub. */
}
do_gvgv_dump(0, Perl_debug_log, "GVGV::GV", CvGV(sv));
if (CvDEPTH(cv)) {
PerlIO_printf(Perl_debug_log, " busy\n");
continue;
}
svp = AvARRAY(padlist);
while (++i <= AvFILL(padlist)) { /* Depth. */
SV **args;
pad = AvARRAY((AV*)svp[i]);
argav = (AV*)pad[0];
if (!argav || (SV*)argav == &PL_sv_undef) {
PerlIO_printf(Perl_debug_log, " closure-template\n");
continue;
}
args = AvARRAY(argav);
levelm = levels = levelref = levelas = 0;
levela = sizeof(SV*) * (AvMAX(argav) + 1);
if (AvREAL(argav)) {
for (j = 0; j < AvFILL(argav); j++) {
if (SvROK(args[j])) {
PerlIO_printf(Perl_debug_log, " ref in args!\n");
levelref++;
}
/* else if (SvPOK(args[j]) && SvPVX(args[j])) { */
else if (SvTYPE(args[j]) >= SVt_PV && SvLEN(args[j])) {
levelas += SvLEN(args[j])/SvREFCNT(args[j]);
}
}
}
for (j = 1; j < AvFILL((AV*)svp[1]); j++) { /* Vars. */
if (SvROK(pad[j])) {
levelref++;
do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
dumpit = 1;
}
/* else if (SvPOK(pad[j]) && SvPVX(pad[j])) { */
else if (SvTYPE(pad[j]) >= SVt_PVAV) {
if (!SvPADMY(pad[j])) {
levelref++;
do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
dumpit = 1;
}
}
else if (SvTYPE(pad[j]) >= SVt_PV && SvLEN(pad[j])) {
levels++;
levelm += SvLEN(pad[j])/SvREFCNT(pad[j]);
/* Dump(pad[j],4); */
}
}
PerlIO_printf(Perl_debug_log, " level %i: refs: %i, strings: %i in %i,\targsarray: %i, argsstrings: %i\n",
i, levelref, levelm, levels, levela, levelas);
totm += levelm;
tota += levela;
totas += levelas;
tots += levels;
totref += levelref;
if (dumpit)
do_sv_dump(0, Perl_debug_log, (SV*)cv, 0, 2, 0, 0);
}
if (AvFILL(padlist) > 1) {
PerlIO_printf(Perl_debug_log, " total: refs: %i, strings: %i in %i,\targsarrays: %i, argsstrings: %i\n",
totref, totm, tots, tota, totas);
}
tref += totref;
tm += totm;
ts += tots;
ta += tota;
tas += totas;
}
}
}
PerlIO_printf(Perl_debug_log, "total: refs: %i, strings: %i in %i\targsarray: %i, argsstrings: %i\n", tref, tm, ts, ta, tas);
return ret;
#endif /* !PURIFY */
}
#if (defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS)) \
&& (defined(MYMALLOC) && !defined(PLAIN_MALLOC))
# define mstat(str) dump_mstats(str)
#else
# define mstat(str) \
PerlIO_printf(Perl_debug_log, "%s: perl not compiled with DEBUGGING_MSTATS\n",str);
#endif
#if (defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS)) \
&& (defined(MYMALLOC) && !defined(PLAIN_MALLOC))
/* Very coarse overestimate, 2-per-power-of-2, one more to determine NBUCKETS. */
# define _NBUCKETS (2*8*IVSIZE+1)
struct mstats_buffer
{
perl_mstats_t buffer;
UV buf[_NBUCKETS*4];
};
static void
_fill_mstats(struct mstats_buffer *b, int level)
{
dTHX;
b->buffer.nfree = b->buf;
b->buffer.ntotal = b->buf + _NBUCKETS;
b->buffer.bucket_mem_size = b->buf + 2*_NBUCKETS;
b->buffer.bucket_available_size = b->buf + 3*_NBUCKETS;
Zero(b->buf, (level ? 4*_NBUCKETS: 2*_NBUCKETS), unsigned long);
get_mstats(&(b->buffer), _NBUCKETS, level);
}
static void
fill_mstats(SV *sv, int level)
{
dTHX;
if (SvREADONLY(sv))
croak("Cannot modify a readonly value");
SvGROW(sv, sizeof(struct mstats_buffer)+1);
_fill_mstats((struct mstats_buffer*)SvPVX(sv),level);
SvCUR_set(sv, sizeof(struct mstats_buffer));
*SvEND(sv) = '\0';
SvPOK_only(sv);
}
static void
_mstats_to_hv(HV *hv, const struct mstats_buffer *b, int level)
{
dTHX;
SV **svp;
int type;
svp = hv_fetch(hv, "topbucket", 9, 1);
sv_setiv(*svp, b->buffer.topbucket);
svp = hv_fetch(hv, "topbucket_ev", 12, 1);
sv_setiv(*svp, b->buffer.topbucket_ev);
svp = hv_fetch(hv, "topbucket_odd", 13, 1);
sv_setiv(*svp, b->buffer.topbucket_odd);
svp = hv_fetch(hv, "totfree", 7, 1);
sv_setiv(*svp, b->buffer.totfree);
svp = hv_fetch(hv, "total", 5, 1);
sv_setiv(*svp, b->buffer.total);
svp = hv_fetch(hv, "total_chain", 11, 1);
sv_setiv(*svp, b->buffer.total_chain);
svp = hv_fetch(hv, "total_sbrk", 10, 1);
sv_setiv(*svp, b->buffer.total_sbrk);
svp = hv_fetch(hv, "sbrks", 5, 1);
sv_setiv(*svp, b->buffer.sbrks);
svp = hv_fetch(hv, "sbrk_good", 9, 1);
sv_setiv(*svp, b->buffer.sbrk_good);
svp = hv_fetch(hv, "sbrk_slack", 10, 1);
sv_setiv(*svp, b->buffer.sbrk_slack);
svp = hv_fetch(hv, "start_slack", 11, 1);
sv_setiv(*svp, b->buffer.start_slack);
svp = hv_fetch(hv, "sbrked_remains", 14, 1);
sv_setiv(*svp, b->buffer.sbrked_remains);
svp = hv_fetch(hv, "minbucket", 9, 1);
sv_setiv(*svp, b->buffer.minbucket);
svp = hv_fetch(hv, "nbuckets", 8, 1);
sv_setiv(*svp, b->buffer.nbuckets);
if (_NBUCKETS < b->buffer.nbuckets)
warn("FIXME: internal mstats buffer too short");
for (type = 0; type < (level ? 4 : 2); type++) {
UV *p = 0, *p1 = 0;
AV *av;
int i;
static const char *types[4] = {
"free", "used", "mem_size", "available_size"
};
svp = hv_fetch(hv, types[type], strlen(types[type]), 1);
if (SvOK(*svp) && !(SvROK(*svp) && SvTYPE(SvRV(*svp)) == SVt_PVAV))
croak("Unexpected value for the key '%s' in the mstats hash", types[type]);
if (!SvOK(*svp)) {
av = newAV();
(void)SvUPGRADE(*svp, SVt_RV);
SvRV_set(*svp, (SV*)av);
SvROK_on(*svp);
} else
av = (AV*)SvRV(*svp);
av_extend(av, b->buffer.nbuckets - 1);
/* XXXX What is the official way to reduce the size of the array? */
switch (type) {
case 0:
p = b->buffer.nfree;
break;
case 1:
p = b->buffer.ntotal;
p1 = b->buffer.nfree;
break;
case 2:
p = b->buffer.bucket_mem_size;
break;
case 3:
p = b->buffer.bucket_available_size;
break;
}
for (i = 0; i < b->buffer.nbuckets; i++) {
svp = av_fetch(av, i, 1);
if (type == 1)
sv_setiv(*svp, p[i]-p1[i]);
else
sv_setuv(*svp, p[i]);
}
}
}
static void
mstats_fillhash(SV *sv, int level)
{
struct mstats_buffer buf;
if (!(SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVHV))
croak("Not a hash reference");
_fill_mstats(&buf, level);
_mstats_to_hv((HV *)SvRV(sv), &buf, level);
}
static void
mstats2hash(SV *sv, SV *rv, int level)
{
if (!(SvROK(rv) && SvTYPE(SvRV(rv)) == SVt_PVHV))
croak("Not a hash reference");
if (!SvPOK(sv))
croak("Undefined value when expecting mstats buffer");
if (SvCUR(sv) != sizeof(struct mstats_buffer))
croak("Wrong size for a value with a mstats buffer");
_mstats_to_hv((HV *)SvRV(rv), (struct mstats_buffer*)SvPVX(sv), level);
}
#else /* !( defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS) \ ) */
static void
fill_mstats(SV *sv, int level)
{
croak("Cannot report mstats without Perl malloc");
}
static void
mstats_fillhash(SV *sv, int level)
{
croak("Cannot report mstats without Perl malloc");
}
static void
mstats2hash(SV *sv, SV *rv, int level)
{
croak("Cannot report mstats without Perl malloc");
}
#endif /* defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS)... */
#define _CvGV(cv) \
(SvROK(cv) && (SvTYPE(SvRV(cv))==SVt_PVCV) \
? SvREFCNT_inc(CvGV((CV*)SvRV(cv))) : &PL_sv_undef)
MODULE = Devel::Peek PACKAGE = Devel::Peek
void
mstat(str="Devel::Peek::mstat: ")
char *str
void
fill_mstats(SV *sv, int level = 0)
void
mstats_fillhash(SV *sv, int level = 0)
PROTOTYPE: \%;$
void
mstats2hash(SV *sv, SV *rv, int level = 0)
PROTOTYPE: $\%;$
void
Dump(sv,lim=4)
SV * sv
I32 lim
PPCODE:
{
SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", FALSE);
const STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", FALSE);
const I32 save_dumpindent = PL_dumpindent;
PL_dumpindent = 2;
do_sv_dump(0, Perl_debug_log, sv, 0, lim,
(bool)(dumpop && SvTRUE(dumpop)), pv_lim);
PL_dumpindent = save_dumpindent;
}
void
DumpArray(lim,...)
I32 lim
PPCODE:
{
long i;
SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", FALSE);
const STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", FALSE);
const I32 save_dumpindent = PL_dumpindent;
PL_dumpindent = 2;
for (i=1; i<items; i++) {
PerlIO_printf(Perl_debug_log, "Elt No. %ld 0x%"UVxf"\n", i - 1, PTR2UV(ST(i)));
do_sv_dump(0, Perl_debug_log, ST(i), 0, lim,
(bool)(dumpop && SvTRUE(dumpop)), pv_lim);
}
PL_dumpindent = save_dumpindent;
}
void
DumpProg()
PPCODE:
{
warn("dumpindent is %d", (int)PL_dumpindent);
if (PL_main_root)
op_dump(PL_main_root);
}
I32
SvREFCNT(sv)
SV * sv
# PPCODE needed since otherwise sv_2mortal is inserted that will kill the value.
SV *
SvREFCNT_inc(sv)
SV * sv
PPCODE:
{
RETVAL = SvREFCNT_inc(sv);
PUSHs(RETVAL);
}
# PPCODE needed since by default it is void
void
SvREFCNT_dec(sv)
SV * sv
PPCODE:
{
SvREFCNT_dec(sv);
PUSHs(sv);
}
SV *
DeadCode()
CODE:
RETVAL = DeadCode(aTHX);
OUTPUT:
RETVAL
MODULE = Devel::Peek PACKAGE = Devel::Peek PREFIX = _
SV *
_CvGV(cv)
SV *cv
bool
_runops_debug(int flag = -1)
--- NEW FILE: Makefile.PL ---
use ExtUtils::MakeMaker;
WriteMakefile(
NAME => "Devel::Peek",
VERSION_FROM => 'Peek.pm',
XSPROTOARG => '-noprototypes',
'dist' => {
COMPRESS => 'gzip -9f',
SUFFIX => 'gz',
DIST_DEFAULT => 'all tardist',
},
MAN3PODS => {},
);
More information about the dslinux-commit
mailing list