GSP
Quick Navigator

Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Support
Contact Us
Online Help
Handbooks
Domain Status
Man Pages

FAQ
Virtual Servers
Pricing
Billing
Technical

Network
Facilities
Connectivity
Topology Map

Miscellaneous
Server Agreement
Year 2038
Credits
 

USA Flag

 

 

Man Pages
Devel::MAT::Tool::Reachability(3) User Contributed Perl Documentation Devel::MAT::Tool::Reachability(3)

"Devel::MAT::Tool::Reachability" - analyse how SVs are reachable

This "Devel::MAT" tool determines which SVs are reachable via any known roots and which are not. For reachable SVs, they are classified into several broad categories:
  • SVs that directly make up the symbol table.
  • SVs that form the padlist of functions or store the names of lexical variables.
  • SVs that hold the value of lexical variables.
  • User data stored in package globals, lexical variables, or referenced recursively via structures stored in them.
  • Miscellaneous other SVs that are used to implement the internals of the interpreter.

This tool adds the following SV methods.

   $r = $sv->reachable

Returns true if the SV is reachable from a known root.

Paul Evans <leonerd@leonerd.org.uk>
2022-04-08 perl v5.32.1

Search for    or go to Top of page |  Section 3 |  Main Index

Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with ManDoc.