Provides classes and predicates for computing the control-flow graph.
Import path
import semmle.go.controlflow.ControlFlowGraphImpl
Predicates
| firstNode | Holds if evaluation of root may start at first.
|
| hasEvaluationNode | Holds if e should have an evaluation node in the control-flow graph.
|
| isSwitchCaseTestPassingEdge | Holds if pred is the node for the case testExpr in an expression switch statement which is switching on switchExpr, and succ is the node to be executed next if the case test succeeds.
|
| lastNode | Holds if evaluation of root may complete normally after last.
|
| mayReturnNormally | Holds if the function f may return without panicking, exiting the process, or looping forever.
|
| succ | Gets a successor of nd, that is, a node that is executed after nd.
|