Devel::MAT::Tool::Reachability(3pm)

Devel::MAT::Tool::Reachability3pm

Analyse how svs are reachable

Overview

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.

SV methods

This tool adds the following SV methods.

reachable

   $r = $sv->reachable;

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

Releases

2 releases since Debian 12 (Bookworm); the text changed 1 time.

  1. 12
  2. 13

Author

Paul Evans <[email protected]>

From libdevel-mat-perl 0.53-1+b1 in Debian 13 (Trixie). Parsed by carta from the page's man source.