An union‐find based Minimum Spanning Tree for CFG
Synopsis
Declared in <llvm/Transforms/Instrumentation/CFGMST.h>
template<
class Edge,
class BBInfo>
class CFGMST;
Description
Implements a Union‐find algorithm to compute Minimum Spanning Tree for a given CFG.
Member Functions
Name |
Description |
|
Construct a CFG minimum spanning tree for |
Add an edge from |
|
Return all CFG edges. |
|
Return the number of basic blocks with auxiliary info. |
|
Dump debug information about the instrumentation. |
|
Return the auxiliary information for |
|
Return the auxiliary information for |
|
Return the number of CFG edges. |
Created with MrDocs