Class

org.argus.jawa.alir.dataDependenceAnalysis

InterproceduralDataDependenceGraph

Related Doc: package dataDependenceAnalysis

Permalink

class InterproceduralDataDependenceGraph[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. InterproceduralDataDependenceGraph
  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 InterproceduralDataDependenceGraph()

    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 addIDDGCallArgNode(icfgN: ICFGCallNode, position: Int): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  7. def addIDDGCenterNode(icfgN: ICFGCenterNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  8. def addIDDGEntryNode(icfgN: ICFGEntryNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  11. def addIDDGNormalNode(icfgN: ICFGNormalNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  13. def addIDDGReturnVarNode(icfgN: ICFGReturnNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  14. def addIDDGVirtualBodyNode(icfgN: ICFGCallNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  15. def addNode(node: Node): Node

    Permalink
    Definition Classes
    InterproceduralGraph → AlirEdgeAccesses

  16. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  17. def clone(): AnyRef

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

  18. def deleteEdge(e: Edge): Boolean

    Permalink
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Definition Classes
    InterproceduralGraph

  20. def deleteNode(node: Node): Boolean

    Permalink
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Attributes
    protected
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Attributes
    protected
    Definition Classes
    AlirSuccPredAccesses

  24. def edges: Iterable[Edge]

    Permalink
    Definition Classes
    AlirGraph

  25. var entryN: IDDGEntryNode

    Permalink
    Attributes
    protected

  26. def entryNode: Node

    Permalink
    Definition Classes
    InterproceduralDataDependenceGraph → DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    AnyRef

  28. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  29. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AlirGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  38. def getIDDGCenterNode(icfgN: ICFGEntryNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  39. def getIDDGCenterNode(icfgN: ICFGCenterNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  42. def getIDDGNormalNode(icfgN: ICFGNormalNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  44. def getIDDGReturnVarNode(icfgN: ICFGReturnNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  45. def getIDDGVirtualBodyNode(icfgN: ICFGCallNode): Node

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  46. def getNode(n: Node): Node

    Permalink
    Definition Classes
    InterproceduralGraph → AlirGraph

  47. val graph: DirectedPseudograph[Node, Edge]

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph → AlirGraph

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

    Permalink
    Definition Classes
    AlirGraph

  49. def hasNode(n: Node): Boolean

    Permalink
    Definition Classes
    AlirGraph

  50. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  51. var icfg: InterproceduralControlFlowGraph[ICFGNode]

    Permalink
    Definition Classes
    InterproceduralDataDependenceGraph → DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  53. def iddgCenterNodeExists(icfgN: ICFGCenterNode): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  54. def iddgEntryNodeExists(icfgN: ICFGEntryNode): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  57. def iddgNormalNodeExists(icfgN: ICFGNormalNode): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  59. def iddgReturnVarNodeExists(icfgN: ICFGReturnNode): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  60. def iddgVirtualBodyNodeExists(icfgN: ICFGCallNode): Boolean

    Permalink
    Definition Classes
    DataDependenceBaseGraph

  61. def initGraph(global: Global, icfg: InterproceduralControlFlowGraph[ICFGNode]): Unit

    Permalink

  62. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  65. def newIDDGCenterNode(icfgN: ICFGCenterNode): IDDGCenterNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  66. def newIDDGEntryNode(icfgN: ICFGEntryNode): IDDGEntryNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  69. def newIDDGNormalNode(icfgN: ICFGNormalNode): IDDGNormalNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

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

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  71. def newIDDGReturnVarNode(icfgN: ICFGReturnNode): IDDGReturnVarNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  72. def newIDDGVirtualBodyNode(icfgN: ICFGCallNode): IDDGVirtualBodyNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataDependenceBaseGraph

  73. def nodes: Iterable[Node]

    Permalink
    Definition Classes
    AlirGraph

  74. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  75. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  76. def numOfEdges: Int

    Permalink
    Definition Classes
    AlirGraph

  77. def numOfNodes: Int

    Permalink
    Definition Classes
    AlirGraph

  78. val pl: MMap[InterproceduralNode, Node]

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  79. def pool: MMap[InterproceduralNode, Node]

    Permalink
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Definition Classes
    AlirGraph

  81. def predecessor(edge: Edge): Node

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirGraph

  85. def successor(edge: Edge): Node

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    InterproceduralGraph

  90. 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

  91. 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

  92. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  95. final def wait(): Unit

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

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

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

  97. 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