HH\heapgraph_dfs_edges

performs dfs over the heap graph, starting from the given edges.

Description

function HH\heapgraph_dfs_edges(
  resource $heapgraph,
  array<int> $roots,
  array<int> $skips,
  mixed $callback,
): void

performs dfs over the heap graph, starting from the given edges.

calls back on every new edge in the scan.

Parameters

  • resource $heapgraph - the resource obtained with heapgraph_create
  • \array<int> $roots - edge indexes to start the scan from
  • \array<int> $skips - edge indexes to consider as if they're not there
  • mixed $callback - function(array $edge, array $node): void {}