类 Node
- java.lang.Object
-
- proguard.analysis.datastructure.callgraph.Node
-
public class Node extends java.lang.ObjectRepresents a node in a sub-callgraph, e.g. only the incoming or the outgoing callgraph for a specific method. SeeCallGraph#reconstructCallGraph(ClassPool, MethodSignature)for more details. The reconstruction process makes sure that there are no loops in the graph.
-
-
字段概要
字段 修饰符和类型 字段 说明 java.util.Set<CodeLocation>incomingCallLocationsTheCodeLocations containing the calls in this node's predecessors that lead here.booleanisTruncatedjava.util.Set<CodeLocation>outgoingCallLocationsTheCodeLocations containing the calls in this node that lead to its successors.java.util.Set<Node>predecessorsMethodSignaturesignaturejava.util.Set<Node>successors
-
构造器概要
构造器 构造器 说明 Node(MethodSignature signature)
-
方法概要
所有方法 实例方法 具体方法 修饰符和类型 方法 说明 booleanequals(java.lang.Object o)java.util.Set<Node>getAllPredecessors()Get all predecessors of this node.java.util.Set<Node>getFurthestPredecessors()Get the predecessor leaf nodes in the call sub-graph represented by this node.java.util.Set<Node>getFurthestSuccessors()Get the successor leaf nodes in the call sub-graph represented by this node.intgetPredecessorDepth()Calculate the distance between this node and its furthest predecessor.intgetSuccessorDepth()Calculate the distance between this node and its furthest successor.inthashCode()booleanpredecessorsContain(MethodSignature signature)Checks if this node or any predecessors corresponds to a specificMethodSignature.booleansuccessorsContain(MethodSignature signature)Checks if this node or any successors corresponds to a specificMethodSignature.
-
-
-
字段详细资料
-
signature
public final MethodSignature signature
-
predecessors
public final java.util.Set<Node> predecessors
-
incomingCallLocations
public final java.util.Set<CodeLocation> incomingCallLocations
TheCodeLocations containing the calls in this node's predecessors that lead here. If the call graph is traversed strictly in successor direction, there is exactly one incoming call per node, except for the root, which has none.
-
outgoingCallLocations
public final java.util.Set<CodeLocation> outgoingCallLocations
TheCodeLocations containing the calls in this node that lead to its successors. If the call graph is traversed strictly in predecessor direction, there is exactly one outgoing call per node, except for the root, which has none.
-
successors
public final java.util.Set<Node> successors
-
isTruncated
public boolean isTruncated
-
-
构造器详细资料
-
Node
public Node(MethodSignature signature)
-
-
方法详细资料
-
successorsContain
public boolean successorsContain(MethodSignature signature)
Checks if this node or any successors corresponds to a specificMethodSignature.- 参数:
signature- TheMethodSignatureto look for- 返回:
- true if this node or any of its transitive successors represents the target location
-
predecessorsContain
public boolean predecessorsContain(MethodSignature signature)
Checks if this node or any predecessors corresponds to a specificMethodSignature.- 参数:
signature- TheMethodSignatureto look for- 返回:
- true if this node or any of its transitive predecessors represents the target location
-
getSuccessorDepth
public int getSuccessorDepth()
Calculate the distance between this node and its furthest successor.- 返回:
- The distance (number of hops in the graph)
-
getPredecessorDepth
public int getPredecessorDepth()
Calculate the distance between this node and its furthest predecessor.- 返回:
- The distance (number of hops in the graph)
-
getAllPredecessors
public java.util.Set<Node> getAllPredecessors()
Get all predecessors of this node.
-
getFurthestPredecessors
public java.util.Set<Node> getFurthestPredecessors()
Get the predecessor leaf nodes in the call sub-graph represented by this node.
-
getFurthestSuccessors
public java.util.Set<Node> getFurthestSuccessors()
Get the successor leaf nodes in the call sub-graph represented by this node.
-
equals
public boolean equals(java.lang.Object o)
- 覆盖:
equals在类中java.lang.Object
-
hashCode
public int hashCode()
- 覆盖:
hashCode在类中java.lang.Object
-
-