|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface PAEdgeSet
Method Summary | |
---|---|
boolean |
addEdge(PANode node1,
String f,
PANode node2)
|
void |
addEdge(Temp v,
PANode node)
|
void |
addEdges(Collection node1s,
String f,
Collection node2s)
|
void |
addEdges(Collection node1s,
String f,
PANode node2)
|
boolean |
addEdges(PANode node1,
String f,
Collection node2s)
|
void |
addEdges(Temp v,
Collection nodes)
|
Set |
allFlagsForNode(PANode node)
|
Set |
allSourceNodes()
|
Set |
allVariables()
|
Object |
clone()
|
void |
copyEdges(PANode node,
PAEdgeSet es2)
|
void |
forAllEdges(harpoon.Analysis.PointerAnalysis.PAEdgeVisitor visitor)
|
void |
forAllEdges(PANode node,
harpoon.Analysis.PointerAnalysis.PAEdgeVisitor visitor)
|
void |
forAllEdges(Temp v,
harpoon.Analysis.PointerAnalysis.PAEdgeVisitor visitor)
|
void |
forAllNodes(PANodeVisitor visitor)
|
void |
forAllPointedNodes(PANode node,
PANodeVisitor visitor)
|
void |
forAllPointedNodes(PANode node,
String f,
PANodeVisitor visitor)
|
void |
forAllPointedNodes(Temp v,
PANodeVisitor visitor)
|
Set |
getEdgesFrom(PANode node,
String f)
|
Relation |
getPrecedenceRelation()
Returns a relation that contains all the pairs <n2,n1>
such that there was an edge from n1 to n2
(through some field f ). |
Set |
pointedNodes(Collection node1s,
String f)
|
Set |
pointedNodes(PANode node)
|
Set |
pointedNodes(PANode node1,
String f)
|
Set |
pointedNodes(Temp v)
|
void |
remove(Set set)
|
void |
removeEdge(PANode node1,
String f,
PANode node2)
|
void |
removeEdge(Temp v,
PANode node)
|
void |
removeEdges(PANode node1)
|
void |
removeEdges(PANode node1,
String f)
|
void |
removeEdges(Temp v)
|
PAEdgeSet |
specialize(Map map)
|
void |
union(PAEdgeSet edges2)
Convenient version of union , equivalent to
union(edges2, null) . |
void |
union(PAEdgeSet edges2,
Set ppgRoots)
Add all the edges from edges2 to this
PAEdgeSet . |
Method Detail |
---|
void addEdge(Temp v, PANode node)
void addEdges(Temp v, Collection nodes)
void removeEdge(Temp v, PANode node)
void removeEdges(Temp v)
Set pointedNodes(Temp v)
Set allVariables()
boolean addEdge(PANode node1, String f, PANode node2)
boolean addEdges(PANode node1, String f, Collection node2s)
void addEdges(Collection node1s, String f, PANode node2)
void addEdges(Collection node1s, String f, Collection node2s)
void removeEdge(PANode node1, String f, PANode node2)
void removeEdges(PANode node1, String f)
void removeEdges(PANode node1)
Set pointedNodes(PANode node1, String f)
Set pointedNodes(Collection node1s, String f)
Set pointedNodes(PANode node)
Set allFlagsForNode(PANode node)
Set allSourceNodes()
Set getEdgesFrom(PANode node, String f)
void forAllPointedNodes(Temp v, PANodeVisitor visitor)
void forAllPointedNodes(PANode node, String f, PANodeVisitor visitor)
void forAllPointedNodes(PANode node, PANodeVisitor visitor)
void forAllNodes(PANodeVisitor visitor)
void forAllEdges(Temp v, harpoon.Analysis.PointerAnalysis.PAEdgeVisitor visitor)
void forAllEdges(PANode node, harpoon.Analysis.PointerAnalysis.PAEdgeVisitor visitor)
void forAllEdges(harpoon.Analysis.PointerAnalysis.PAEdgeVisitor visitor)
void copyEdges(PANode node, PAEdgeSet es2)
PAEdgeSet specialize(Map map)
void remove(Set set)
void union(PAEdgeSet edges2, Set ppgRoots)
this
PAEdgeSet
.
ppgRoots
- If non-null, the starting points of all new
edges will be added to this set (this is useful for doing
efficient escape info propagation after points-to graph
updates).void union(PAEdgeSet edges2)
union
, equivalent to
union(edges2, null)
.
Relation getPrecedenceRelation()
<n2,n1>
such that there was an edge from n1
to n2
(through some field f
).
Object clone()
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |