org
.
argus
.
jawa
.
alir
.
interprocedural
InterproceduralGraph
Related Doc:
package interprocedural
trait
InterproceduralGraph
[
Node <:
InterproceduralNode
]
extends
AlirGraph
[
Node
] with
AlirEdgeAccesses
[
Node
] with
AlirSuccPredAccesses
[
Node
] with
Serializable
Self Type
InterproceduralGraph
[
Node
]
Linear Supertypes
Serializable
,
Serializable
,
AlirSuccPredAccesses
[
Node
],
AlirEdgeAccesses
[
Node
],
AlirGraph
[
Node
],
AnyRef
,
Any
Known Subclasses
DataDependenceBaseGraph
,
InterproceduralControlFlowGraph
,
InterproceduralDataDependenceGraph
,
MultiDataDependenceGraph
,
PointerAssignmentGraph
,
TaintGraph
Ordering
Alphabetic
By Inheritance
Inherited
InterproceduralGraph
Serializable
Serializable
AlirSuccPredAccesses
AlirEdgeAccesses
AlirGraph
AnyRef
Any
Hide All
Show All
Visibility
Public
All
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
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
def
deleteEdge
(
source:
Node
,
target:
Node
)
:
Edge
def
deleteNode
(
node:
Node
)
:
Boolean
val
eIDProvider
:
EdgeNameProvider
[
Edge
] { def filterLabel(uri: String): String }
Attributes
protected
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
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
findPath
(
srcNode:
Node
,
tarNode:
Node
)
:
IList
[
Edge
]
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
getEdges
(
n1:
Node
,
n2:
Node
)
:
CSet
[
Edge
]
Definition Classes
AlirGraph
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
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
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
def
pool
:
MMap
[
InterproceduralNode
,
Node
]
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
def
toGML
(
w:
Writer
,
vip:
VertexNameProvider
[
Node
] =
vIDProvider
,
vlp:
VertexNameProvider
[
Node
] =
vLDProvider
,
eip:
EdgeNameProvider
[
Edge
] =
eIDProvider
,
elp:
EdgeNameProvider
[
Edge
] =
null
)
:
Unit
def
toGraphML
(
w:
Writer
,
vip:
VertexNameProvider
[
Node
] =
vIDProvider
,
vlp:
VertexNameProvider
[
Node
] =
vLDProvider
,
eip:
EdgeNameProvider
[
Edge
] =
eIDProvider
,
elp:
EdgeNameProvider
[
Edge
] =
null
)
:
Unit
def
toString
()
:
String
Definition Classes
AnyRef → Any
val
vIDProvider
:
VertexNameProvider
[
Node
] { def filterLabel(uri: String): String }
Attributes
protected
val
vLDProvider
:
VertexNameProvider
[
Node
] { def filterLabel(uri: String): String }
Attributes
protected
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
Serializable
Inherited from
Serializable
Inherited from
AlirSuccPredAccesses
[
Node
]
Inherited from
AlirEdgeAccesses
[
Node
]
Inherited from
AlirGraph
[
Node
]
Inherited from
AnyRef
Inherited from
Any
Ungrouped