| Package | Description |
|---|---|
| dataflow | |
| dataflow.model |
| Modifier and Type | Method and Description |
|---|---|
DataFlowNode |
DataFlowNodeFactory.create(com.github.javaparser.ast.Node n,
OwnedNode<?> owner) |
| Modifier and Type | Method and Description |
|---|---|
Optional<DataFlowNode> |
MethodNodeHandler.handleNode(DataFlowGraph graph,
DataFlowMethod method,
Map<com.github.javaparser.ast.Node,DataFlowNode> overriddenValues,
com.github.javaparser.ast.Node n,
OwnedNode<?> owner)
Recursively creates new
DataFlowNode or finds existing ones and creates DataFlowEdge between those nodes if needed. |
static List<DataFlowNode> |
GraphUtil.walkBackUntil(DataFlowNode dfn,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate)
Walks back via
getIn() until for each node it holds that the predicate holds. |
static List<DataFlowNode> |
GraphUtil.walkBackUntil(List<DataFlowNode> nodes,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate) |
static List<DataFlowNode> |
GraphUtil.walkForwardUntil(DataFlowNode dfn,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate)
Walks forward via
getOut() until for each node it holds that the predicate holds. |
| Modifier and Type | Method and Description |
|---|---|
Optional<NodeCall> |
NodeCallFactory.create(OwnedNode<?> owner,
com.github.javaparser.ast.expr.MethodCallExpr node,
DataFlowNode instance)
Creates a
NodeCall. |
static List<DataFlowNode> |
GraphUtil.walkBackUntil(DataFlowNode dfn,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate)
Walks back via
getIn() until for each node it holds that the predicate holds. |
static List<DataFlowNode> |
GraphUtil.walkForwardUntil(DataFlowNode dfn,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate)
Walks forward via
getOut() until for each node it holds that the predicate holds. |
| Modifier and Type | Method and Description |
|---|---|
Optional<DataFlowNode> |
MethodNodeHandler.handleNode(DataFlowGraph graph,
DataFlowMethod method,
Map<com.github.javaparser.ast.Node,DataFlowNode> overriddenValues,
com.github.javaparser.ast.Node n,
OwnedNode<?> owner)
Recursively creates new
DataFlowNode or finds existing ones and creates DataFlowEdge between those nodes if needed. |
static List<DataFlowNode> |
GraphUtil.walkBackUntil(DataFlowNode dfn,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate)
Walks back via
getIn() until for each node it holds that the predicate holds. |
static List<DataFlowNode> |
GraphUtil.walkBackUntil(DataFlowNode dfn,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate)
Walks back via
getIn() until for each node it holds that the predicate holds. |
static List<DataFlowNode> |
GraphUtil.walkBackUntil(List<DataFlowNode> nodes,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate) |
static List<DataFlowNode> |
GraphUtil.walkBackUntil(List<DataFlowNode> nodes,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate) |
static List<DataFlowNode> |
GraphUtil.walkBackUntil(List<DataFlowNode> nodes,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate) |
static List<DataFlowNode> |
GraphUtil.walkForwardUntil(DataFlowNode dfn,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate)
Walks forward via
getOut() until for each node it holds that the predicate holds. |
static List<DataFlowNode> |
GraphUtil.walkForwardUntil(DataFlowNode dfn,
java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scopePredicate)
Walks forward via
getOut() until for each node it holds that the predicate holds. |
| Modifier and Type | Field and Description |
|---|---|
protected List<DataFlowNode> |
DataFlowMethod.Builder.changedFields |
protected List<DataFlowNode> |
DataFlowMethod.Builder.inputFields |
| Modifier and Type | Method and Description |
|---|---|
DataFlowNode |
DataFlowNode.Builder.build() |
DataFlowNode |
DataFlowEdge.getFrom() |
DataFlowNode |
DataFlowMethod.getNode(com.github.javaparser.ast.Node node) |
DataFlowNode |
DataFlowGraph.getNode(com.github.javaparser.ast.Node node) |
DataFlowNode |
DataFlowEdge.getTo() |
| Modifier and Type | Method and Description |
|---|---|
List<DataFlowNode> |
DataFlowMethod.getChangedFields() |
List<DataFlowNode> |
DataFlowMethod.getDirectInputNodesFor(DataFlowNode node)
Get's all nodes that are directly connected with an edge to (not from) the input node, which are in scope of this method.
|
Collection<DataFlowNode> |
DataFlowMethod.getDirectOwnedNodes() |
List<DataFlowNode> |
DataFlowGraph.getFields() |
List<DataFlowNode> |
DataFlowMethod.getInputFields() |
Optional<DataFlowNode> |
NodeCall.getInstance() |
List<DataFlowNode> |
ParameterList.getNodes() |
Collection<DataFlowNode> |
DataFlowMethod.getNodes() |
Map<com.github.javaparser.ast.Node,DataFlowNode> |
DataFlowGraph.getNodes() |
Set<DataFlowNode> |
OwnerNode.getOwnedNodes()
Gets all direct or indirectly owned nodes.
|
List<DataFlowNode> |
ParameterList.getParameters() |
Optional<DataFlowNode> |
NodeCall.getReturnNode() |
Optional<DataFlowNode> |
DataFlowMethod.getReturnNode() |
List<DataFlowNode> |
DataFlowNode.walkBackUntil(java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scope)
Walks back over incoming edges until predicate is met or no incoming edges are present.
|
| Modifier and Type | Method and Description |
|---|---|
void |
ParameterList.add(DataFlowNode node) |
void |
DataFlowMethod.addChangedField(DataFlowNode node) |
void |
DataFlowMethod.addChangedFields(DataFlowNode... fields) |
void |
DataFlowNode.addEdgeTo(DataFlowNode to) |
void |
DataFlowGraph.addField(DataFlowNode node) |
void |
DataFlowGraph.addFields(DataFlowNode... fields) |
void |
DataFlowMethod.addNode(DataFlowNode created) |
void |
DataFlowGraph.addNode(DataFlowNode node) |
void |
DataFlowMethod.addParameter(DataFlowNode node) |
DataFlowMethod.Builder |
DataFlowMethod.Builder.changedFields(DataFlowNode... changedFields) |
boolean |
ParameterList.contains(DataFlowNode dfn) |
DataFlowGraph.Builder |
DataFlowGraph.Builder.fields(DataFlowNode... fields) |
DataFlowEdge.Builder |
DataFlowEdge.Builder.from(DataFlowNode from) |
List<DataFlowNode> |
DataFlowMethod.getDirectInputNodesFor(DataFlowNode node)
Get's all nodes that are directly connected with an edge to (not from) the input node, which are in scope of this method.
|
boolean |
DataFlowNode.hasAsDirectInput(DataFlowNode node) |
NodeCall.Builder |
NodeCall.Builder.in(DataFlowNode... inputNodes) |
DataFlowMethod.Builder |
DataFlowMethod.Builder.inputParameters(DataFlowNode... inputParameters) |
boolean |
DataFlowMethod.isInputBoundary(DataFlowNode n) |
ParameterList.Builder |
ParameterList.Builder.node(DataFlowNode node) |
ParameterList.Builder |
ParameterList.Builder.nodes(DataFlowNode... nodes) |
DataFlowMethod.Builder |
DataFlowMethod.Builder.nodes(DataFlowNode... nodes) |
boolean |
OwnerNode.owns(DataFlowNode node)
True when this owner is either a direct owner or is an indirect owner of the input node.
|
NodeCall.Builder |
NodeCall.Builder.returnNode(DataFlowNode node) |
DataFlowMethod.Builder |
DataFlowMethod.Builder.returnNode(DataFlowNode returnNode) |
void |
DataFlowEdge.setFrom(DataFlowNode from) |
void |
NodeCall.setInstance(DataFlowNode instance) |
void |
NodeCall.setReturnNode(DataFlowNode returnNode) |
void |
DataFlowMethod.setReturnNode(DataFlowNode returnNode) |
void |
DataFlowEdge.setTo(DataFlowNode to) |
DataFlowEdge.Builder |
DataFlowEdge.Builder.to(DataFlowNode to) |
| Modifier and Type | Method and Description |
|---|---|
void |
ParameterList.addAll(List<DataFlowNode> inputParameters) |
void |
DataFlowMethod.addNodes(List<DataFlowNode> nodes) |
void |
DataFlowGraph.addNodes(List<DataFlowNode> nodes) |
DataFlowMethod.Builder |
DataFlowMethod.Builder.changedFields(List<DataFlowNode> changedFields) |
DataFlowGraph.Builder |
DataFlowGraph.Builder.fields(List<DataFlowNode> fields) |
DataFlowMethod.Builder |
DataFlowMethod.Builder.inputFields(List<DataFlowNode> inputFields) |
ParameterList.Builder |
ParameterList.Builder.nodes(List<DataFlowNode> nodes) |
DataFlowGraph.Builder |
DataFlowGraph.Builder.nodes(Map<com.github.javaparser.ast.Node,DataFlowNode> nodes) |
void |
DataFlowMethod.setChangedFields(List<DataFlowNode> changedFields) |
void |
DataFlowGraph.setFields(List<DataFlowNode> fields) |
void |
DataFlowMethod.setInputFields(List<DataFlowNode> inputFields) |
void |
ParameterList.setParameters(List<DataFlowNode> parameters) |
List<DataFlowNode> |
DataFlowNode.walkBackUntil(java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scope)
Walks back over incoming edges until predicate is met or no incoming edges are present.
|
List<DataFlowNode> |
DataFlowNode.walkBackUntil(java.util.function.Predicate<DataFlowNode> predicate,
java.util.function.Predicate<DataFlowNode> scope)
Walks back over incoming edges until predicate is met or no incoming edges are present.
|
| Constructor and Description |
|---|
DataFlowEdge(DataFlowNode from,
DataFlowNode to) |
| Constructor and Description |
|---|
ParameterList(List<DataFlowNode> inputParameters,
DataFlowMethod method) |
Copyright © 2019. All rights reserved.