Class

org.argus.jawa.alir.dataDependenceAnalysis

MultiDataDependenceGraph

Related Doc: package dataDependenceAnalysis

Permalink

class MultiDataDependenceGraph[Node <: IDDGNode] extends DataDependenceBaseGraph[Node]

Linear Supertypes
DataDependenceBaseGraph[Node], InterproceduralGraph[Node], Serializable, Serializable, AlirSuccPredAccesses[Node], AlirEdgeAccesses[Node], AlirGraph[Node], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MultiDataDependenceGraph
  2. DataDependenceBaseGraph
  3. InterproceduralGraph
  4. Serializable
  5. Serializable
  6. AlirSuccPredAccesses
  7. AlirEdgeAccesses
  8. AlirGraph
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MultiDataDependenceGraph()

    Permalink

Type Members

  1. type Edge = AlirEdge[Node]

    Permalink
    Definition Classes
    AlirGraph

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. def addEdge(e: Edge): Boolean

    Permalink
    Definition Classes
    AlirEdgeAccesses

  5. def addEdge(source: Node, target: Node): Edge

    Permalink
    Definition Classes
    AlirEdgeAccesses

  6. def addGraph(iddg: DataDependenceBaseGraph[Node]): Unit

    Permalink

  7. def addIDDGCallArgNode(icfgN: ICFGCallNode, position: Int): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  8. def addIDDGCenterNode(icfgN: ICFGCenterNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  9. def addIDDGEntryNode(icfgN: ICFGEntryNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  10. def addIDDGEntryParamNode(icfgN: ICFGEntryNode, position: Int): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  11. def addIDDGExitParamNode(icfgN: ICFGExitNode, position: Int): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  12. def addIDDGNormalNode(icfgN: ICFGNormalNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  13. def addIDDGReturnArgNode(icfgN: ICFGReturnNode, position: Int): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  14. def addIDDGReturnVarNode(icfgN: ICFGCallNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  15. def addIDDGVirtualBodyNode(icfgN: ICFGCallNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  16. def addNode(node: Node): Node

    Permalink
    Definition Classes
    InterproceduralGraph → AlirEdgeAccesses

  17. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  18. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  19. def deleteEdge(e: Edge): Boolean

    Permalink
    Definition Classes
    InterproceduralGraph

  20. def deleteEdge(source: Node, target: Node): Edge

    Permalink
    Definition Classes
    InterproceduralGraph

  21. def deleteNode(node: Node): Boolean

    Permalink
    Definition Classes
    InterproceduralGraph

  22. val eIDProvider: EdgeNameProvider[Edge] { def filterLabel(uri: String): String }

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  23. def edgeSource(edge: AlirEdge[Node]): Node

    Permalink
    Attributes
    protected
    Definition Classes
    AlirSuccPredAccesses

  24. def edgeTarget(edge: AlirEdge[Node]): Node

    Permalink
    Attributes
    protected
    Definition Classes
    AlirSuccPredAccesses

  25. def edges: Iterable[Edge]

    Permalink
    Definition Classes
    AlirGraph

  26. val encontext: Context

    Permalink

  27. val entryNode: Node

    Permalink
    Definition Classes
    MultiDataDependenceGraph → DataDependenceBaseGraph

  28. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  29. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  30. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  31. def findDefSite(defSite: Context, position: Int): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  32. def findDefSite(defSite: Context, isRet: Boolean = false): Option[Node]

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  33. def findPath(srcNode: Node, tarNode: Node): IList[Edge]

    Permalink
    Definition Classes
    InterproceduralGraph

  34. def findVirtualBodyDefSite(defSite: Context): Option[Node]

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  35. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  36. def getEdges(n1: Node, n2: Node): CSet[Edge]

    Permalink
    Definition Classes
    AlirGraph

  37. def getIDDGCallArgNode(icfgN: ICFGCallNode, position: Int): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  38. def getIDDGCallArgNodes(icfgN: ICFGCallNode): IList[Node]

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  39. def getIDDGCenterNode(icfgN: ICFGEntryNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  40. def getIDDGCenterNode(icfgN: ICFGCenterNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  41. def getIDDGEntryParamNode(icfgN: ICFGEntryNode, position: Int): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  42. def getIDDGExitParamNode(icfgN: ICFGExitNode, position: Int): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  43. def getIDDGNormalNode(icfgN: ICFGNormalNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  44. def getIDDGReturnArgNode(icfgN: ICFGReturnNode, position: Int): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  45. def getIDDGReturnVarNode(icfgN: ICFGCallNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  46. def getIDDGVirtualBodyNode(icfgN: ICFGCallNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  47. def getNode(n: Node): Node

    Permalink
    Definition Classes
    InterproceduralGraph → AlirGraph

  48. val graph: DirectedPseudograph[Node, Edge]

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph → AlirGraph

  49. def hasEdge(n1: Node, n2: Node): Boolean

    Permalink
    Definition Classes
    AlirGraph

  50. def hasNode(n: Node): Boolean

    Permalink
    Definition Classes
    AlirGraph

  51. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  52. val icfg: InterproceduralControlFlowGraph[ICFGNode]

    Permalink
    Definition Classes
    MultiDataDependenceGraph → DataDependenceBaseGraph

  53. def iddgCallArgNodeExists(icfgN: ICFGCallNode, position: Int): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  54. def iddgCenterNodeExists(icfgN: ICFGCenterNode): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  55. def iddgEntryNodeExists(icfgN: ICFGEntryNode): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  56. def iddgEntryParamNodeExists(icfgN: ICFGEntryNode, position: Int): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  57. def iddgExitParamNodeExists(icfgN: ICFGExitNode, position: Int): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  58. def iddgNormalNodeExists(icfgN: ICFGNormalNode): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  59. def iddgReturnArgNodeExists(icfgN: ICFGReturnNode, position: Int): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  60. def iddgReturnVarNodeExists(icfgN: ICFGCallNode): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  61. def iddgVirtualBodyNodeExists(icfgN: ICFGCallNode): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  62. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  63. def isLoaded(iddg: DataDependenceBaseGraph[Node]): Boolean

    Permalink

  64. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  65. def newIDDGCallArgNode(icfgN: ICFGCallNode, position: Int): IDDGCallArgNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  66. def newIDDGCenterNode(icfgN: ICFGCenterNode): IDDGCenterNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  67. def newIDDGEntryNode(icfgN: ICFGEntryNode): IDDGEntryNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  68. def newIDDGEntryParamNode(icfgN: ICFGEntryNode, position: Int): IDDGEntryParamNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  69. def newIDDGExitParamNode(icfgN: ICFGExitNode, position: Int): IDDGExitParamNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  70. def newIDDGNormalNode(icfgN: ICFGNormalNode): IDDGNormalNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  71. def newIDDGReturnArgNode(icfgN: ICFGReturnNode, position: Int): IDDGReturnArgNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  72. def newIDDGReturnVarNode(icfgN: ICFGCallNode): IDDGReturnVarNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  73. def newIDDGVirtualBodyNode(icfgN: ICFGCallNode): IDDGVirtualBodyNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  74. def nodes: Iterable[Node]

    Permalink
    Definition Classes
    AlirGraph

  75. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  76. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  77. def numOfEdges: Int

    Permalink
    Definition Classes
    AlirGraph

  78. def numOfNodes: Int

    Permalink
    Definition Classes
    AlirGraph

  79. val pl: MMap[InterproceduralNode, Node]

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  80. def pool: MMap[InterproceduralNode, Node]

    Permalink
    Definition Classes
    InterproceduralGraph

  81. def prePostNodeOrder(n: Node): MMap[Node, (Int, Int)]

    Permalink
    Definition Classes
    AlirGraph

  82. def predecessor(edge: Edge): Node

    Permalink
    Definition Classes
    AlirSuccPredAccesses

  83. def predecessorEdges(node: Node): CSet[Edge]

    Permalink
    Definition Classes
    AlirSuccPredAccesses

  84. def predecessors(node: Node): CSet[Node]

    Permalink
    Definition Classes
    AlirSuccPredAccesses

  85. def stronglyConnectedSets: Iterable[CSet[Node]]

    Permalink
    Definition Classes
    AlirGraph

  86. def successor(edge: Edge): Node

    Permalink
    Definition Classes
    AlirSuccPredAccesses

  87. def successorEdges(node: Node): CSet[Edge]

    Permalink
    Definition Classes
    AlirSuccPredAccesses

  88. def successors(node: Node): CSet[Node]

    Permalink
    Definition Classes
    AlirSuccPredAccesses

  89. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  90. def toDot(w: Writer, vlp: VertexNameProvider[Node] = vIDProvider): Unit

    Permalink
    Definition Classes
    InterproceduralGraph

  91. def toGML(w: Writer, vip: VertexNameProvider[Node] = vIDProvider, vlp: VertexNameProvider[Node] = vLDProvider, eip: EdgeNameProvider[Edge] = eIDProvider, elp: EdgeNameProvider[Edge] = null): Unit

    Permalink
    Definition Classes
    InterproceduralGraph

  92. def toGraphML(w: Writer, vip: VertexNameProvider[Node] = vIDProvider, vlp: VertexNameProvider[Node] = vLDProvider, eip: EdgeNameProvider[Edge] = eIDProvider, elp: EdgeNameProvider[Edge] = null): Unit

    Permalink
    Definition Classes
    InterproceduralGraph

  93. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  94. val vIDProvider: VertexNameProvider[Node] { def filterLabel(uri: String): String }

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  95. val vLDProvider: VertexNameProvider[Node] { def filterLabel(uri: String): String }

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  96. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  97. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  98. final def wait(arg0: Long): Unit

    Permalink
    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