DFItem
- dataflow item typepublic interface DataFlowDispatch<DFItem extends polyglot.visit.DataFlow.Item>
Modifier and Type | Method and Description |
---|---|
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowArrayAccess(polyglot.ast.ArrayAccess n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowArrayAccessAssign(polyglot.ast.ArrayAccessAssign n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowArrayInit(polyglot.ast.ArrayInit n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowAssert(polyglot.ast.Assert n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowBinary(polyglot.ast.Binary n,
DFItem dfIn,
DFItem trueItem,
DFItem falseItem,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowBlock(polyglot.ast.Block n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowBranch(polyglot.ast.Branch n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowCall(polyglot.ast.Call n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowCast(polyglot.ast.Cast n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowCatch(polyglot.ast.Catch n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowConditional(polyglot.ast.Conditional n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowConstructorCall(polyglot.ast.ConstructorCall n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowConstructorDecl(polyglot.ast.ConstructorDecl n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowDo(polyglot.ast.Do n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowEmpty(polyglot.ast.Empty n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowEval(polyglot.ast.Eval n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowExpr(polyglot.ast.Expr n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowField(polyglot.ast.Field n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowFieldAssign(polyglot.ast.FieldAssign n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowFieldDecl(polyglot.ast.FieldDecl n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowFinally(polyglot.ast.Block n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowFormal(polyglot.ast.Formal n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowIf(polyglot.ast.If n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowInitializer(polyglot.ast.Initializer n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowInstanceof(polyglot.ast.Instanceof n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowLabeled(polyglot.ast.Labeled n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowLit(polyglot.ast.Lit n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowLocal(polyglot.ast.Local n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowLocalAssign(polyglot.ast.LocalAssign n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowLocalDecl(polyglot.ast.LocalDecl n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowMethodDecl(polyglot.ast.MethodDecl n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowNew(polyglot.ast.New n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowNewArray(polyglot.ast.NewArray n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowReturn(polyglot.ast.Return n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowSpecial(polyglot.ast.Special n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowSuppress(Suppress n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowSynchronized(polyglot.ast.Synchronized n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowThrow(polyglot.ast.Throw n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowTry(polyglot.ast.Try n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowTypeNode(polyglot.ast.TypeNode n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowUnary(polyglot.ast.Unary n,
DFItem dfIn,
DFItem trueItem,
DFItem falseItem,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
flowWhile(polyglot.ast.While n,
DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Compute the dataflow for
n |
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> |
ignoreNode(DFItem dfIn,
polyglot.visit.FlowGraph<DFItem> graph,
polyglot.visit.FlowGraph.Peer<DFItem> peer)
Ignore the node (i.e., it is a no-op).
|
java.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowArrayAccess(polyglot.ast.ArrayAccess n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurrence of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowArrayAccessAssign(polyglot.ast.ArrayAccessAssign n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowArrayInit(polyglot.ast.ArrayInit n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowAssert(polyglot.ast.Assert n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowBinary(polyglot.ast.Binary n, DFItem dfIn, DFItem trueItem, DFItem falseItem, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowBlock(polyglot.ast.Block n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowBranch(polyglot.ast.Branch n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowCall(polyglot.ast.Call n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowCast(polyglot.ast.Cast n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowCatch(polyglot.ast.Catch n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowConditional(polyglot.ast.Conditional n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowConstructorCall(polyglot.ast.ConstructorCall n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowConstructorDecl(polyglot.ast.ConstructorDecl n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowDo(polyglot.ast.Do n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowEmpty(polyglot.ast.Empty n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowEval(polyglot.ast.Eval n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowExpr(polyglot.ast.Expr n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowField(polyglot.ast.Field n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowFieldDecl(polyglot.ast.FieldDecl n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowFieldAssign(polyglot.ast.FieldAssign n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowFormal(polyglot.ast.Formal n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowIf(polyglot.ast.If n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowInitializer(polyglot.ast.Initializer n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowInstanceof(polyglot.ast.Instanceof n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowLabeled(polyglot.ast.Labeled n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowLit(polyglot.ast.Lit n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowLocal(polyglot.ast.Local n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowLocalAssign(polyglot.ast.LocalAssign n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowLocalDecl(polyglot.ast.LocalDecl n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowMethodDecl(polyglot.ast.MethodDecl n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowNew(polyglot.ast.New n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowNewArray(polyglot.ast.NewArray n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowReturn(polyglot.ast.Return n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowSpecial(polyglot.ast.Special n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowSuppress(Suppress n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowSynchronized(polyglot.ast.Synchronized n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowThrow(polyglot.ast.Throw n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowTry(polyglot.ast.Try n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowFinally(polyglot.ast.Block n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowTypeNode(polyglot.ast.TypeNode n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowUnary(polyglot.ast.Unary n, DFItem dfIn, DFItem trueItem, DFItem falseItem, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraphjava.util.Map<polyglot.visit.FlowGraph.EdgeKey,DFItem> flowWhile(polyglot.ast.While n, DFItem dfIn, polyglot.visit.FlowGraph<DFItem> graph, polyglot.visit.FlowGraph.Peer<DFItem> peer)
n
n
- AST node to compute the dataflow fordfIn
- input dataflow itemgraph
- dataflow graphpeer
- occurance of the dataflow node in the flowgraph