org
.
argus
.
jawa
.
alir
.
dataDependenceAnalysis
InterproceduralDataDependenceGraph
Related Doc:
package dataDependenceAnalysis
class
InterproceduralDataDependenceGraph
[
Node <:
IDDGNode
]
extends
DataDependenceBaseGraph
[
Node
]
Linear Supertypes
DataDependenceBaseGraph
[
Node
],
InterproceduralGraph
[
Node
],
Serializable
,
Serializable
,
AlirSuccPredAccesses
[
Node
],
AlirEdgeAccesses
[
Node
],
AlirGraph
[
Node
],
AnyRef
,
Any
Ordering
Alphabetic
By Inheritance
Inherited
InterproceduralDataDependenceGraph
DataDependenceBaseGraph
InterproceduralGraph
Serializable
Serializable
AlirSuccPredAccesses
AlirEdgeAccesses
AlirGraph
AnyRef
Any
Hide All
Show All
Visibility
Public
All
Instance Constructors
new
InterproceduralDataDependenceGraph
()
Type Members
type
Edge
=
AlirEdge
[
Node
]
Definition Classes
AlirGraph
Value Members
final
def
!=
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
final
def
##
()
:
Int
Definition Classes
AnyRef → Any
final
def
==
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
addEdge
(
e:
Edge
)
:
Boolean
Definition Classes
AlirEdgeAccesses
def
addEdge
(
source:
Node
,
target:
Node
)
:
Edge
Definition Classes
AlirEdgeAccesses
def
addIDDGCallArgNode
(
icfgN:
ICFGCallNode
,
position:
Int
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
addIDDGCenterNode
(
icfgN:
ICFGCenterNode
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
addIDDGEntryNode
(
icfgN:
ICFGEntryNode
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
addIDDGEntryParamNode
(
icfgN:
ICFGEntryNode
,
position:
Int
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
addIDDGExitParamNode
(
icfgN:
ICFGExitNode
,
position:
Int
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
addIDDGNormalNode
(
icfgN:
ICFGNormalNode
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
addIDDGReturnArgNode
(
icfgN:
ICFGReturnNode
,
position:
Int
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
addIDDGReturnVarNode
(
icfgN:
ICFGCallNode
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
addIDDGVirtualBodyNode
(
icfgN:
ICFGCallNode
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
addNode
(
node:
Node
)
:
Node
Definition Classes
InterproceduralGraph
→ AlirEdgeAccesses
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
deleteEdge
(
e:
Edge
)
:
Boolean
Definition Classes
InterproceduralGraph
def
deleteEdge
(
source:
Node
,
target:
Node
)
:
Edge
Definition Classes
InterproceduralGraph
def
deleteNode
(
node:
Node
)
:
Boolean
Definition Classes
InterproceduralGraph
val
eIDProvider
:
EdgeNameProvider
[
Edge
] { def filterLabel(uri: String): String }
Attributes
protected
Definition Classes
InterproceduralGraph
def
edgeSource
(
edge:
AlirEdge
[
Node
]
)
:
Node
Attributes
protected
Definition Classes
AlirSuccPredAccesses
def
edgeTarget
(
edge:
AlirEdge
[
Node
]
)
:
Node
Attributes
protected
Definition Classes
AlirSuccPredAccesses
def
edges
:
Iterable
[
Edge
]
Definition Classes
AlirGraph
var
entryN
:
IDDGEntryNode
Attributes
protected
def
entryNode
:
Node
Definition Classes
InterproceduralDataDependenceGraph
→
DataDependenceBaseGraph
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
def
findDefSite
(
defSite:
Context
,
position:
Int
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
findDefSite
(
defSite:
Context
,
isRet:
Boolean
=
false
)
:
Option
[
Node
]
Definition Classes
DataDependenceBaseGraph
def
findPath
(
srcNode:
Node
,
tarNode:
Node
)
:
IList
[
Edge
]
Definition Classes
InterproceduralGraph
def
findVirtualBodyDefSite
(
defSite:
Context
)
:
Option
[
Node
]
Definition Classes
DataDependenceBaseGraph
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
getEdges
(
n1:
Node
,
n2:
Node
)
:
CSet
[
Edge
]
Definition Classes
AlirGraph
def
getIDDGCallArgNode
(
icfgN:
ICFGCallNode
,
position:
Int
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
getIDDGCallArgNodes
(
icfgN:
ICFGCallNode
)
:
IList
[
Node
]
Definition Classes
DataDependenceBaseGraph
def
getIDDGCenterNode
(
icfgN:
ICFGEntryNode
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
getIDDGCenterNode
(
icfgN:
ICFGCenterNode
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
getIDDGEntryParamNode
(
icfgN:
ICFGEntryNode
,
position:
Int
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
getIDDGExitParamNode
(
icfgN:
ICFGExitNode
,
position:
Int
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
getIDDGNormalNode
(
icfgN:
ICFGNormalNode
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
getIDDGReturnArgNode
(
icfgN:
ICFGReturnNode
,
position:
Int
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
getIDDGReturnVarNode
(
icfgN:
ICFGCallNode
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
getIDDGVirtualBodyNode
(
icfgN:
ICFGCallNode
)
:
Node
Definition Classes
DataDependenceBaseGraph
def
getNode
(
n:
Node
)
:
Node
Definition Classes
InterproceduralGraph
→ AlirGraph
val
graph
:
DirectedPseudograph
[
Node
,
Edge
]
Attributes
protected
Definition Classes
InterproceduralGraph
→ AlirGraph
def
hasEdge
(
n1:
Node
,
n2:
Node
)
:
Boolean
Definition Classes
AlirGraph
def
hasNode
(
n:
Node
)
:
Boolean
Definition Classes
AlirGraph
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
var
icfg
:
InterproceduralControlFlowGraph
[
ICFGNode
]
Definition Classes
InterproceduralDataDependenceGraph
→
DataDependenceBaseGraph
def
iddgCallArgNodeExists
(
icfgN:
ICFGCallNode
,
position:
Int
)
:
Boolean
Definition Classes
DataDependenceBaseGraph
def
iddgCenterNodeExists
(
icfgN:
ICFGCenterNode
)
:
Boolean
Definition Classes
DataDependenceBaseGraph
def
iddgEntryNodeExists
(
icfgN:
ICFGEntryNode
)
:
Boolean
Definition Classes
DataDependenceBaseGraph
def
iddgEntryParamNodeExists
(
icfgN:
ICFGEntryNode
,
position:
Int
)
:
Boolean
Definition Classes
DataDependenceBaseGraph
def
iddgExitParamNodeExists
(
icfgN:
ICFGExitNode
,
position:
Int
)
:
Boolean
Definition Classes
DataDependenceBaseGraph
def
iddgNormalNodeExists
(
icfgN:
ICFGNormalNode
)
:
Boolean
Definition Classes
DataDependenceBaseGraph
def
iddgReturnArgNodeExists
(
icfgN:
ICFGReturnNode
,
position:
Int
)
:
Boolean
Definition Classes
DataDependenceBaseGraph
def
iddgReturnVarNodeExists
(
icfgN:
ICFGCallNode
)
:
Boolean
Definition Classes
DataDependenceBaseGraph
def
iddgVirtualBodyNodeExists
(
icfgN:
ICFGCallNode
)
:
Boolean
Definition Classes
DataDependenceBaseGraph
def
initGraph
(
global:
Global
,
icfg:
InterproceduralControlFlowGraph
[
ICFGNode
]
)
:
Unit
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
newIDDGCallArgNode
(
icfgN:
ICFGCallNode
,
position:
Int
)
:
IDDGCallArgNode
Attributes
protected
Definition Classes
DataDependenceBaseGraph
def
newIDDGCenterNode
(
icfgN:
ICFGCenterNode
)
:
IDDGCenterNode
Attributes
protected
Definition Classes
DataDependenceBaseGraph
def
newIDDGEntryNode
(
icfgN:
ICFGEntryNode
)
:
IDDGEntryNode
Attributes
protected
Definition Classes
DataDependenceBaseGraph
def
newIDDGEntryParamNode
(
icfgN:
ICFGEntryNode
,
position:
Int
)
:
IDDGEntryParamNode
Attributes
protected
Definition Classes
DataDependenceBaseGraph
def
newIDDGExitParamNode
(
icfgN:
ICFGExitNode
,
position:
Int
)
:
IDDGExitParamNode
Attributes
protected
Definition Classes
DataDependenceBaseGraph
def
newIDDGNormalNode
(
icfgN:
ICFGNormalNode
)
:
IDDGNormalNode
Attributes
protected
Definition Classes
DataDependenceBaseGraph
def
newIDDGReturnArgNode
(
icfgN:
ICFGReturnNode
,
position:
Int
)
:
IDDGReturnArgNode
Attributes
protected
Definition Classes
DataDependenceBaseGraph
def
newIDDGReturnVarNode
(
icfgN:
ICFGCallNode
)
:
IDDGReturnVarNode
Attributes
protected
Definition Classes
DataDependenceBaseGraph
def
newIDDGVirtualBodyNode
(
icfgN:
ICFGCallNode
)
:
IDDGVirtualBodyNode
Attributes
protected
Definition Classes
DataDependenceBaseGraph
def
nodes
:
Iterable
[
Node
]
Definition Classes
AlirGraph
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
def
numOfEdges
:
Int
Definition Classes
AlirGraph
def
numOfNodes
:
Int
Definition Classes
AlirGraph
val
pl
:
MMap
[
InterproceduralNode
,
Node
]
Attributes
protected
Definition Classes
InterproceduralGraph
def
pool
:
MMap
[
InterproceduralNode
,
Node
]
Definition Classes
InterproceduralGraph
def
prePostNodeOrder
(
n:
Node
)
:
MMap
[
Node
, (
Int
,
Int
)]
Definition Classes
AlirGraph
def
predecessor
(
edge:
Edge
)
:
Node
Definition Classes
AlirSuccPredAccesses
def
predecessorEdges
(
node:
Node
)
:
CSet
[
Edge
]
Definition Classes
AlirSuccPredAccesses
def
predecessors
(
node:
Node
)
:
CSet
[
Node
]
Definition Classes
AlirSuccPredAccesses
def
stronglyConnectedSets
:
Iterable
[
CSet
[
Node
]]
Definition Classes
AlirGraph
def
successor
(
edge:
Edge
)
:
Node
Definition Classes
AlirSuccPredAccesses
def
successorEdges
(
node:
Node
)
:
CSet
[
Edge
]
Definition Classes
AlirSuccPredAccesses
def
successors
(
node:
Node
)
:
CSet
[
Node
]
Definition Classes
AlirSuccPredAccesses
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
def
toDot
(
w:
Writer
,
vlp:
VertexNameProvider
[
Node
] =
vIDProvider
)
:
Unit
Definition Classes
InterproceduralGraph
def
toGML
(
w:
Writer
,
vip:
VertexNameProvider
[
Node
] =
vIDProvider
,
vlp:
VertexNameProvider
[
Node
] =
vLDProvider
,
eip:
EdgeNameProvider
[
Edge
] =
eIDProvider
,
elp:
EdgeNameProvider
[
Edge
] =
null
)
:
Unit
Definition Classes
InterproceduralGraph
def
toGraphML
(
w:
Writer
,
vip:
VertexNameProvider
[
Node
] =
vIDProvider
,
vlp:
VertexNameProvider
[
Node
] =
vLDProvider
,
eip:
EdgeNameProvider
[
Edge
] =
eIDProvider
,
elp:
EdgeNameProvider
[
Edge
] =
null
)
:
Unit
Definition Classes
InterproceduralGraph
def
toString
()
:
String
Definition Classes
AnyRef → Any
val
vIDProvider
:
VertexNameProvider
[
Node
] { def filterLabel(uri: String): String }
Attributes
protected
Definition Classes
InterproceduralGraph
val
vLDProvider
:
VertexNameProvider
[
Node
] { def filterLabel(uri: String): String }
Attributes
protected
Definition Classes
InterproceduralGraph
final
def
wait
()
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
final
def
wait
(
arg0:
Long
,
arg1:
Int
)
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
final
def
wait
(
arg0:
Long
)
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
Inherited from
DataDependenceBaseGraph
[
Node
]
Inherited from
InterproceduralGraph
[
Node
]
Inherited from
Serializable
Inherited from
Serializable
Inherited from
AlirSuccPredAccesses
[
Node
]
Inherited from
AlirEdgeAccesses
[
Node
]
Inherited from
AlirGraph
[
Node
]
Inherited from
AnyRef
Inherited from
Any
Ungrouped