vta

package

v0.1.5 Latest Latest Go to latest Published: Jul 13, 2021 License: BSD-3-Clause Imports: 6 Imported by: 24

Documentation ¶

Index ¶

func CallGraph(funcs map[*ssa.Function]bool, initial *callgraph.Graph) *callgraph.Graph

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func CallGraph ¶

func CallGraph(funcs map[*ssa.Function]bool, initial *callgraph.Graph) *callgraph.Graph

CallGraph uses the VTA algorithm to compute call graph for all functions f such that f:true is in `funcs`. VTA refines the results of 'initial' callgraph and uses it to establish interprocedural data flow. VTA is sound if 'initial` is sound modulo reflection and unsage. The resulting callgraph does not have a root node.

Types ¶

This section is empty.

Source Files ¶

View all Source files

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL