Debian Codegraph @

upstream/opensuse-tumbleweed/man3/Devel::Peek.3pm

raw
1 .\" -*- mode: troff; coding: utf-8 -*-
2 .\" Automatically generated by Pod::Man v6.0.2 (Pod::Simple 3.45)
3 .\"
4 .\" Standard preamble:
5 .\" ========================================================================
6 .de Sp \" Vertical space (when we can't use .PP)
7 .if t .sp .5v
8 .if n .sp
9 ..
10 .de Vb \" Begin verbatim text
11 .ft CW
12 .nf
13 .ne \\$1
14 ..
15 .de Ve \" End verbatim text
16 .ft R
17 .fi
18 ..
19 .\" \*(C` and \*(C' are quotes in nroff, nothing in troff, for use with C<>.
20 .ie n \{\
21 . ds C` ""
22 . ds C' ""
23 'br\}
24 .el\{\
25 . ds C`
26 . ds C'
27 'br\}
28 .\"
29 .\" Escape single quotes in literal strings from groff's Unicode transform.
30 .ie \n(.g .ds Aq \(aq
31 .el .ds Aq '
32 .\"
33 .\" If the F register is >0, we'll generate index entries on stderr for
34 .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
35 .\" entries marked with X<> in POD. Of course, you'll have to process the
36 .\" output yourself in some meaningful fashion.
37 .\"
38 .\" Avoid warning from groff about undefined register 'F'.
39 .de IX
40 ..
41 .nr rF 0
42 .if \n(.g .if rF .nr rF 1
43 .if (\n(rF:(\n(.g==0)) \{\
44 . if \nF \{\
45 . de IX
46 . tm Index:\\$1\t\\n%\t"\\$2"
47 ..
48 . if !\nF==2 \{\
49 . nr % 0
50 . nr F 2
51 . \}
52 . \}
53 .\}
54 .rr rF
55 .\"
56 .\" Required to disable full justification in groff 1.23.0.
57 .if n .ds AD l
58 .\" ========================================================================
59 .\"
60 .IX Title "Devel::Peek 3pm"
61 .TH Devel::Peek 3pm 2026-03-09 "perl v5.42.1" "Perl Programmers Reference Guide"
62 .\" For nroff, turn off justification. Always turn off hyphenation; it makes
63 .\" way too many mistakes in technical documents.
64 .if n .ad l
65 .nh
66 .SH NAME
67 Devel::Peek \- A data debugging tool for the XS programmer
68 .SH SYNOPSIS
69 .IX Header "SYNOPSIS"
70 .Vb 7
71 \& use Devel::Peek;
72 \& Dump( $a );
73 \& Dump( $a, 5 );
74 \& Dump( @a );
75 \& Dump( %h );
76 \& DumpArray( 5, $a, $b, ... );
77 \& mstat "Point 5";
78 \&
79 \& use Devel::Peek \*(Aq:opd=st\*(Aq;
80 .Ve
81 .SH DESCRIPTION
82 .IX Header "DESCRIPTION"
83 Devel::Peek contains functions which allows raw Perl datatypes to be
84 manipulated from a Perl script. This is used by those who do XS programming
85 to check that the data they are sending from C to Perl looks as they think
86 it should look. The trick, then, is to know what the raw datatype is
87 supposed to look like when it gets to Perl. This document offers some tips
88 and hints to describe good and bad raw data.
89 .PP
90 It is very possible that this document will fall far short of being useful
91 to the casual reader. The reader is expected to understand the material in
92 the first few sections of perlguts.
93 .PP
94 Devel::Peek supplies a \f(CWDump()\fR function which can dump a raw Perl
95 datatype, and \f(CWmstat("marker")\fR function to report on memory usage
96 (if perl is compiled with corresponding option). The function
97 \&\fBDeadCode()\fR provides statistics on the data "frozen" into inactive
98 \&\f(CW\*(C`CV\*(C'\fR. Devel::Peek also supplies \f(CWSvREFCNT()\fR which can query reference
99 counts on SVs. This document will take a passive, and safe, approach
100 to data debugging and for that it will describe only the \f(CWDump()\fR
101 function.
102 .PP
103 All output is to STDERR.
104 .PP
105 The \f(CWDump()\fR function takes one or two arguments: something to dump, and
106 an optional limit for recursion and array elements (default is 4). The
107 first argument is evaluated in rvalue scalar context, with exceptions for
108 \&\f(CW@array\fR and \f(CW%hash\fR, which dump the array or hash itself. So \f(CW\*(C`Dump @array\*(C'\fR
109 works, as does \f(CW\*(C`Dump $foo\*(C'\fR. And \f(CW\*(C`Dump pos\*(C'\fR will call \f(CW\*(C`pos\*(C'\fR in rvalue
110 context, whereas \f(CW\*(C`Dump ${\epos}\*(C'\fR will call it in lvalue context.
111 .PP
112 Function \f(CWDumpArray()\fR allows dumping of multiple values (useful when you
113 need to analyze returns of functions).
114 .PP
115 The global variable \f(CW$Devel::Peek::pv_limit\fR can be set to limit the
116 number of character printed in various string values. Setting it to 0
117 means no limit.
118 .PP
119 If \f(CW\*(C`use Devel::Peek\*(C'\fR directive has a \f(CW\*(C`:opd=FLAGS\*(C'\fR argument,
120 this switches on debugging of opcode dispatch. \f(CW\*(C`FLAGS\*(C'\fR should be a
121 combination of \f(CW\*(C`s\*(C'\fR, \f(CW\*(C`t\*(C'\fR, and \f(CW\*(C`P\*(C'\fR (see
122 \&\fB\-D\fR flags in perlrun).
123 .PP
124 \&\f(CW\*(C`:opd\*(C'\fR is a shortcut for \f(CW\*(C`:opd=st\*(C'\fR.
125 .SS "Runtime debugging"
126 .IX Subsection "Runtime debugging"
127 \&\f(CWCvGV($cv)\fR return one of the globs associated to a subroutine reference \f(CW$cv\fR.
128 .PP
129 \&\fBdebug_flags()\fR returns a string representation of \f(CW$^D\fR (similar to
130 what is allowed for \fB\-D\fR flag). When called with a numeric argument,
131 sets $^D to the corresponding value. When called with an argument of
132 the form \f(CW"flags\-flags"\fR, set on/off bits of \f(CW$^D\fR corresponding to
133 letters before/after \f(CW\*(C`\-\*(C'\fR. (The returned value is for \f(CW$^D\fR before
134 the modification.)
135 .PP
136 \&\fBrunops_debug()\fR returns true if the current \fIopcode dispatcher\fR is the
137 debugging one. When called with an argument, switches to debugging or
138 non\-debugging dispatcher depending on the argument (active for
139 newly\-entered subs/etc only). (The returned value is for the dispatcher before the modification.)
140 .SS "Memory footprint debugging"
141 .IX Subsection "Memory footprint debugging"
142 When perl is compiled with support for memory footprint debugging
143 (default with Perl\*(Aqs \fBmalloc()\fR), Devel::Peek provides an access to this API.
144 .PP
145 Use \fBmstat()\fR function to emit a memory state statistic to the terminal.
146 For more information on the format of output of \fBmstat()\fR see
147 "Using \f(CW$ENV\fR{PERL_DEBUG_MSTATS}" in perldebguts.
148 .PP
149 Three additional functions allow access to this statistic from Perl.
150 First, use \f(CWmstats_fillhash(%hash)\fR to get the information contained
151 in the output of \fBmstat()\fR into \f(CW%hash\fR. The field of this hash are
152 .PP
153 .Vb 3
154 \& minbucket nbuckets sbrk_good sbrk_slack sbrked_remains sbrks
155 \& start_slack topbucket topbucket_ev topbucket_odd total total_chain
156 \& total_sbrk totfree
157 .Ve
158 .PP
159 Two additional fields \f(CW\*(C`free\*(C'\fR, \f(CW\*(C`used\*(C'\fR contain array references which
160 provide per\-bucket count of free and used chunks. Two other fields
161 \&\f(CW\*(C`mem_size\*(C'\fR, \f(CW\*(C`available_size\*(C'\fR contain array references which provide
162 the information about the allocated size and usable size of chunks in
163 each bucket. Again, see "Using \f(CW$ENV\fR{PERL_DEBUG_MSTATS}" in perldebguts
164 for details.
165 .PP
166 Keep in mind that only the first several "odd\-numbered" buckets are
167 used, so the information on size of the "odd\-numbered" buckets which are
168 not used is probably meaningless.
169 .PP
170 The information in
171 .PP
172 .Vb 1
173 \& mem_size available_size minbucket nbuckets
174 .Ve
175 .PP
176 is the property of a particular build of perl, and does not depend on
177 the current process. If you do not provide the optional argument to
178 the functions \fBmstats_fillhash()\fR, \fBfill_mstats()\fR, \fBmstats2hash()\fR, then
179 the information in fields \f(CW\*(C`mem_size\*(C'\fR, \f(CW\*(C`available_size\*(C'\fR is not
180 updated.
181 .PP
182 \&\f(CWfill_mstats($buf)\fR is a much cheaper call (both speedwise and
183 memory\-wise) which collects the statistic into \f(CW$buf\fR in
184 machine\-readable form. At a later moment you may need to call
185 \&\f(CW\*(C`mstats2hash($buf, %hash)\*(C'\fR to use this information to fill \f(CW%hash\fR.
186 .PP
187 All three APIs \f(CWfill_mstats($buf)\fR, \f(CWmstats_fillhash(%hash)\fR, and
188 \&\f(CW\*(C`mstats2hash($buf, %hash)\*(C'\fR are designed to allocate no memory if used
189 \&\fIthe second time\fR on the same \f(CW$buf\fR and/or \f(CW%hash\fR.
190 .PP
191 So, if you want to collect memory info in a cycle, you may call
192 .PP
193 .Vb 3
194 \& $#buf = 999;
195 \& fill_mstats($_) for @buf;
196 \& mstats_fillhash(%report, 1); # Static info too
197 \&
198 \& foreach (@buf) {
199 \& # Do something...
200 \& fill_mstats $_; # Collect statistic
201 \& }
202 \& foreach (@buf) {
203 \& mstats2hash($_, %report); # Preserve static info
204 \& # Do something with %report
205 \& }
206 .Ve
207 .SH EXAMPLES
208 .IX Header "EXAMPLES"
209 The following examples don\*(Aqt attempt to show everything as that would be a
210 monumental task, and, frankly, we don\*(Aqt want this manpage to be an internals
211 document for Perl. The examples do demonstrate some basics of the raw Perl
212 datatypes, and should suffice to get most determined people on their way.
213 There are no guidewires or safety nets, nor blazed trails, so be prepared to
214 travel alone from this point and on and, if at all possible, don\*(Aqt fall into
215 the quicksand (it\*(Aqs bad for business).
216 .PP
217 Oh, one final bit of advice: take perlguts with you. When you return we
218 expect to see it well\-thumbed.
219 .SS "A simple scalar string"
220 .IX Subsection "A simple scalar string"
221 Let\*(Aqs begin by looking a simple scalar which is holding a string.
222 .PP
223 .Vb 3
224 \& use Devel::Peek;
225 \& $a = 42; $a = "hello";
226 \& Dump $a;
227 .Ve
228 .PP
229 The output:
230 .PP
231 .Vb 7
232 \& SV = PVIV(0xbc288) at 0xbe9a8
233 \& REFCNT = 1
234 \& FLAGS = (POK,pPOK)
235 \& IV = 42
236 \& PV = 0xb2048 "hello"\e0
237 \& CUR = 5
238 \& LEN = 8
239 .Ve
240 .PP
241 This says \f(CW$a\fR is an SV, a scalar. The scalar type is a PVIV, which is
242 capable of holding an integer (IV) and/or a string (PV) value. The scalar\*(Aqs
243 head is allocated at address 0xbe9a8, while the body is at 0xbc288.
244 Its reference count is 1. It has the \f(CW\*(C`POK\*(C'\fR flag set, meaning its
245 current PV field is valid. Because POK is set we look at the PV item
246 to see what is in the scalar. The \e0 at the end indicate that this
247 PV is properly NUL\-terminated.
248 Note that the IV field still contains its old numeric value, but because
249 FLAGS doesn\*(Aqt have IOK set, we must ignore the IV item.
250 CUR indicates the number of characters in the PV. LEN indicates the
251 number of bytes allocated for the PV (at least one more than CUR, because
252 LEN includes an extra byte for the end\-of\-string marker, then usually
253 rounded up to some efficient allocation unit).
254 .SS "A simple scalar number"
255 .IX Subsection "A simple scalar number"
256 If the scalar contains a number the raw SV will be leaner.
257 .PP
258 .Vb 3
259 \& use Devel::Peek;
260 \& $a = 42;
261 \& Dump $a;
262 .Ve
263 .PP
264 The output:
265 .PP
266 .Vb 4
267 \& SV = IV(0xbc818) at 0xbe9a8
268 \& REFCNT = 1
269 \& FLAGS = (IOK,pIOK)
270 \& IV = 42
271 .Ve
272 .PP
273 This says \f(CW$a\fR is an SV, a scalar. The scalar is an IV, a number. Its
274 reference count is 1. It has the \f(CW\*(C`IOK\*(C'\fR flag set, meaning it is currently
275 being evaluated as a number. Because IOK is set we look at the IV item to
276 see what is in the scalar.
277 .SS "A simple scalar with an extra reference"
278 .IX Subsection "A simple scalar with an extra reference"
279 If the scalar from the previous example had an extra reference:
280 .PP
281 .Vb 4
282 \& use Devel::Peek;
283 \& $a = 42;
284 \& $b = \e$a;
285 \& Dump $a;
286 .Ve
287 .PP
288 The output:
289 .PP
290 .Vb 4
291 \& SV = IV(0xbe860) at 0xbe9a8
292 \& REFCNT = 2
293 \& FLAGS = (IOK,pIOK)
294 \& IV = 42
295 .Ve
296 .PP
297 Notice that this example differs from the previous example only in its
298 reference count. Compare this to the next example, where we dump \f(CW$b\fR
299 instead of \f(CW$a\fR.
300 .SS "A reference to a simple scalar"
301 .IX Subsection "A reference to a simple scalar"
302 This shows what a reference looks like when it references a simple scalar.
303 .PP
304 .Vb 4
305 \& use Devel::Peek;
306 \& $a = 42;
307 \& $b = \e$a;
308 \& Dump $b;
309 .Ve
310 .PP
311 The output:
312 .PP
313 .Vb 8
314 \& SV = IV(0xf041c) at 0xbe9a0
315 \& REFCNT = 1
316 \& FLAGS = (ROK)
317 \& RV = 0xbab08
318 \& SV = IV(0xbe860) at 0xbe9a8
319 \& REFCNT = 2
320 \& FLAGS = (IOK,pIOK)
321 \& IV = 42
322 .Ve
323 .PP
324 Starting from the top, this says \f(CW$b\fR is an SV. The scalar is an IV,
325 which is capable of holding an integer or reference value.
326 It has the \f(CW\*(C`ROK\*(C'\fR flag set, meaning it is a reference (rather than an
327 integer or string). Notice that Dump
328 follows the reference and shows us what \f(CW$b\fR was referencing. We see the
329 same \f(CW$a\fR that we found in the previous example.
330 .PP
331 Note that the value of \f(CW\*(C`RV\*(C'\fR coincides with the numbers we see when we
332 stringify \f(CW$b\fR. The addresses inside \fBIV()\fR are addresses of
333 \&\f(CW\*(C`X***\*(C'\fR structures which hold the current state of an \f(CW\*(C`SV\*(C'\fR. This
334 address may change during lifetime of an SV.
335 .SS "A reference to an array"
336 .IX Subsection "A reference to an array"
337 This shows what a reference to an array looks like.
338 .PP
339 .Vb 3
340 \& use Devel::Peek;
341 \& $a = [42];
342 \& Dump $a;
343 .Ve
344 .PP
345 The output:
346 .PP
347 .Vb 10
348 \& SV = IV(0xc85998) at 0xc859a8
349 \& REFCNT = 1
350 \& FLAGS = (ROK)
351 \& RV = 0xc70de8
352 \& SV = PVAV(0xc71e10) at 0xc70de8
353 \& REFCNT = 1
354 \& FLAGS = ()
355 \& ARRAY = 0xc7e820
356 \& FILL = 0
357 \& MAX = 0
358 \& FLAGS = (REAL)
359 \& Elt No. 0
360 \& SV = IV(0xc70f88) at 0xc70f98
361 \& REFCNT = 1
362 \& FLAGS = (IOK,pIOK)
363 \& IV = 42
364 .Ve
365 .PP
366 This says \f(CW$a\fR is a reference (ROK), which points to
367 another SV which is a PVAV, an array. The array has one element,
368 element zero, which is another SV. The field \f(CW\*(C`FILL\*(C'\fR above indicates
369 the last element in the array, similar to \f(CW\*(C`$#$a\*(C'\fR.
370 .PP
371 If \f(CW$a\fR pointed to an array of two elements then we would see the
372 following.
373 .PP
374 .Vb 3
375 \& use Devel::Peek \*(AqDump\*(Aq;
376 \& $a = [42,24];
377 \& Dump $a;
378 .Ve
379 .PP
380 The output:
381 .PP
382 .Vb 10
383 \& SV = IV(0x158c998) at 0x158c9a8
384 \& REFCNT = 1
385 \& FLAGS = (ROK)
386 \& RV = 0x1577de8
387 \& SV = PVAV(0x1578e10) at 0x1577de8
388 \& REFCNT = 1
389 \& FLAGS = ()
390 \& ARRAY = 0x1585820
391 \& FILL = 1
392 \& MAX = 1
393 \& FLAGS = (REAL)
394 \& Elt No. 0
395 \& SV = IV(0x1577f88) at 0x1577f98
396 \& REFCNT = 1
397 \& FLAGS = (IOK,pIOK)
398 \& IV = 42
399 \& Elt No. 1
400 \& SV = IV(0x158be88) at 0x158be98
401 \& REFCNT = 1
402 \& FLAGS = (IOK,pIOK)
403 \& IV = 24
404 .Ve
405 .PP
406 Note that \f(CW\*(C`Dump\*(C'\fR will not report \fIall\fR the elements in the array,
407 only several first (depending on how deep it already went into the
408 report tree).
409 .SS "A reference to a hash"
410 .IX Subsection "A reference to a hash"
411 The following shows the raw form of a reference to a hash.
412 .PP
413 .Vb 3
414 \& use Devel::Peek;
415 \& $a = {hello=>42};
416 \& Dump $a;
417 .Ve
418 .PP
419 The output:
420 .PP
421 .Vb 10
422 \& SV = IV(0x55cb50b50fb0) at 0x55cb50b50fc0
423 \& REFCNT = 1
424 \& FLAGS = (ROK)
425 \& RV = 0x55cb50b2b758
426 \& SV = PVHV(0x55cb50b319c0) at 0x55cb50b2b758
427 \& REFCNT = 1
428 \& FLAGS = (SHAREKEYS)
429 \& ARRAY = 0x55cb50b941a0 (0:7, 1:1)
430 \& hash quality = 100.0%
431 \& KEYS = 1
432 \& FILL = 1
433 \& MAX = 7
434 \& Elt "hello" HASH = 0x3128ece4
435 \& SV = IV(0x55cb50b464f8) at 0x55cb50b46508
436 \& REFCNT = 1
437 \& FLAGS = (IOK,pIOK)
438 \& IV = 42
439 .Ve
440 .PP
441 This shows \f(CW$a\fR is a reference pointing to an SV. That SV is a PVHV, a hash.
442 .PP
443 The "quality" of a hash is defined as the total number of comparisons needed
444 to access every element once, relative to the expected number needed for a
445 random hash. The value can go over 100%.
446 .PP
447 The total number of comparisons is equal to the sum of the squares of the
448 number of entries in each bucket. For a random hash of \f(CW\*(C`<n\*(C'\fR> keys into
449 \&\f(CW\*(C`<k\*(C'\fR> buckets, the expected value is:
450 .PP
451 .Vb 1
452 \& n + n(n\-1)/2k
453 .Ve
454 .SS "Dumping a large array or hash"
455 .IX Subsection "Dumping a large array or hash"
456 The \f(CWDump()\fR function, by default, dumps up to 4 elements from a
457 toplevel array or hash. This number can be increased by supplying a
458 second argument to the function.
459 .PP
460 .Vb 3
461 \& use Devel::Peek;
462 \& $a = [10,11,12,13,14];
463 \& Dump $a;
464 .Ve
465 .PP
466 Notice that \f(CWDump()\fR prints only elements 10 through 13 in the above code.
467 The following code will print all of the elements.
468 .PP
469 .Vb 3
470 \& use Devel::Peek \*(AqDump\*(Aq;
471 \& $a = [10,11,12,13,14];
472 \& Dump $a, 5;
473 .Ve
474 .SS "A reference to an SV which holds a C pointer"
475 .IX Subsection "A reference to an SV which holds a C pointer"
476 This is what you really need to know as an XS programmer, of course. When
477 an XSUB returns a pointer to a C structure that pointer is stored in an SV
478 and a reference to that SV is placed on the XSUB stack. So the output from
479 an XSUB which uses something like the T_PTROBJ map might look something like
480 this:
481 .PP
482 .Vb 11
483 \& SV = IV(0xf381c) at 0xc859a8
484 \& REFCNT = 1
485 \& FLAGS = (ROK)
486 \& RV = 0xb8ad8
487 \& SV = PVMG(0xbb3c8) at 0xc859a0
488 \& REFCNT = 1
489 \& FLAGS = (OBJECT,IOK,pIOK)
490 \& IV = 729160
491 \& NV = 0
492 \& PV = 0
493 \& STASH = 0xc1d10 "CookBookB::Opaque"
494 .Ve
495 .PP
496 This shows that we have an SV which is a reference, which points at another
497 SV. In this case that second SV is a PVMG, a blessed scalar. Because it is
498 blessed it has the \f(CW\*(C`OBJECT\*(C'\fR flag set. Note that an SV which holds a C
499 pointer also has the \f(CW\*(C`IOK\*(C'\fR flag set. The \f(CW\*(C`STASH\*(C'\fR is set to the package
500 name which this SV was blessed into.
501 .PP
502 The output from an XSUB which uses something like the T_PTRREF map, which
503 doesn\*(Aqt bless the object, might look something like this:
504 .PP
505 .Vb 10
506 \& SV = IV(0xf381c) at 0xc859a8
507 \& REFCNT = 1
508 \& FLAGS = (ROK)
509 \& RV = 0xb8ad8
510 \& SV = PVMG(0xbb3c8) at 0xc859a0
511 \& REFCNT = 1
512 \& FLAGS = (IOK,pIOK)
513 \& IV = 729160
514 \& NV = 0
515 \& PV = 0
516 .Ve
517 .SS "A reference to a subroutine"
518 .IX Subsection "A reference to a subroutine"
519 Looks like this:
520 .PP
521 .Vb 10
522 \& SV = IV(0x24d2dd8) at 0x24d2de8
523 \& REFCNT = 1
524 \& FLAGS = (TEMP,ROK)
525 \& RV = 0x24e79d8
526 \& SV = PVCV(0x24e5798) at 0x24e79d8
527 \& REFCNT = 2
528 \& FLAGS = ()
529 \& COMP_STASH = 0x22c9c50 "main"
530 \& START = 0x22eed60 ===> 0
531 \& ROOT = 0x22ee490
532 \& GVGV::GV = 0x22de9d8 "MY" :: "top_targets"
533 \& FILE = "(eval 5)"
534 \& DEPTH = 0
535 \& FLAGS = 0x0
536 \& OUTSIDE_SEQ = 93
537 \& PADLIST = 0x22e9ed8
538 \& PADNAME = 0x22e9ec0(0x22eed00) PAD = 0x22e9ea8(0x22eecd0)
539 \& OUTSIDE = 0x22c9fb0 (MAIN)
540 .Ve
541 .PP
542 This shows that
543 .IP \(bu 4
544 the subroutine is not an XSUB (since \f(CW\*(C`START\*(C'\fR and \f(CW\*(C`ROOT\*(C'\fR are
545 non\-zero, and \f(CW\*(C`XSUB\*(C'\fR is not listed, and is thus null);
546 .IP \(bu 4
547 that it was compiled in the package \f(CW\*(C`main\*(C'\fR;
548 .IP \(bu 4
549 under the name \f(CW\*(C`MY::top_targets\*(C'\fR;
550 .IP \(bu 4
551 inside a 5th eval in the program;
552 .IP \(bu 4
553 it is not currently executed (because \f(CW\*(C`DEPTH\*(C'\fR is 0);
554 .IP \(bu 4
555 it has no prototype (\f(CW\*(C`PROTOTYPE\*(C'\fR field is missing).
556 .SH EXPORTS
557 .IX Header "EXPORTS"
558 \&\f(CW\*(C`Dump\*(C'\fR, \f(CW\*(C`mstat\*(C'\fR, \f(CW\*(C`DeadCode\*(C'\fR, \f(CW\*(C`DumpArray\*(C'\fR, \f(CW\*(C`DumpWithOP\*(C'\fR and
559 \&\f(CW\*(C`DumpProg\*(C'\fR, \f(CW\*(C`fill_mstats\*(C'\fR, \f(CW\*(C`mstats_fillhash\*(C'\fR, \f(CW\*(C`mstats2hash\*(C'\fR by
560 default. Additionally available is \f(CW\*(C`SvREFCNT\*(C'\fR.
561 .SH BUGS
562 .IX Header "BUGS"
563 Readers have been known to skip important parts of perlguts, causing much
564 frustration for all.
565 .SH AUTHOR
566 .IX Header "AUTHOR"
567 Ilya Zakharevich [email protected]\-state.edu
568 .PP
569 Copyright (c) 1995\-98 Ilya Zakharevich. All rights reserved.
570 This program is free software; you can redistribute it and/or
571 modify it under the same terms as Perl itself.
572 .PP
573 Author of this software makes no claim whatsoever about suitability,
574 reliability, edability, editability or usability of this product, and
575 should not be kept liable for any damage resulting from the use of
576 it. If you can use it, you are in luck, if not, I should not be kept
577 responsible. Keep a handy copy of your backup tape at hand.
578 .SH "SEE ALSO"
579 .IX Header "SEE ALSO"
580 perlguts, and perlguts, again.