Trait

org.argus.jawa.alir.dataDependenceAnalysis

DataDependenceBaseGraph

Related Doc: package dataDependenceAnalysis

Permalink

trait DataDependenceBaseGraph[Node <: IDDGNode] extends InterproceduralGraph[Node]

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

Type Members

  1. type Edge = AlirEdge[Node]

    Permalink
    Definition Classes
    AlirGraph

Abstract Value Members

  1. abstract def entryNode: Node

    Permalink

  2. abstract def icfg: InterproceduralControlFlowGraph[ICFGNode]

    Permalink

Concrete 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

  7. def addIDDGCenterNode(icfgN: ICFGCenterNode): Node

    Permalink

  8. def addIDDGEntryNode(icfgN: ICFGEntryNode): Node

    Permalink

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

    Permalink

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

    Permalink

  11. def addIDDGNormalNode(icfgN: ICFGNormalNode): Node

    Permalink

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

    Permalink

  13. def addIDDGReturnVarNode(icfgN: ICFGCallNode): Node

    Permalink

  14. def addIDDGVirtualBodyNode(icfgN: ICFGCallNode): Node

    Permalink

  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. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  26. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  27. def finalize(): Unit

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

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

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    InterproceduralGraph

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AlirGraph

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

    Permalink

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

    Permalink

  36. def getIDDGCenterNode(icfgN: ICFGEntryNode): Node

    Permalink

  37. def getIDDGCenterNode(icfgN: ICFGCenterNode): Node

    Permalink

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

    Permalink

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

    Permalink

  40. def getIDDGNormalNode(icfgN: ICFGNormalNode): Node

    Permalink

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

    Permalink

  42. def getIDDGReturnVarNode(icfgN: ICFGCallNode): Node

    Permalink

  43. def getIDDGVirtualBodyNode(icfgN: ICFGCallNode): Node

    Permalink

  44. def getNode(n: Node): Node

    Permalink
    Definition Classes
    InterproceduralGraph → AlirGraph

  45. val graph: DirectedPseudograph[Node, Edge]

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph → AlirGraph

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

    Permalink
    Definition Classes
    AlirGraph

  47. def hasNode(n: Node): Boolean

    Permalink
    Definition Classes
    AlirGraph

  48. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

  50. def iddgCenterNodeExists(icfgN: ICFGCenterNode): Boolean

    Permalink

  51. def iddgEntryNodeExists(icfgN: ICFGEntryNode): Boolean

    Permalink

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

    Permalink

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

    Permalink

  54. def iddgNormalNodeExists(icfgN: ICFGNormalNode): Boolean

    Permalink

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

    Permalink

  56. def iddgReturnVarNodeExists(icfgN: ICFGCallNode): Boolean

    Permalink

  57. def iddgVirtualBodyNodeExists(icfgN: ICFGCallNode): Boolean

    Permalink

  58. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Attributes
    protected

  61. def newIDDGCenterNode(icfgN: ICFGCenterNode): IDDGCenterNode

    Permalink
    Attributes
    protected

  62. def newIDDGEntryNode(icfgN: ICFGEntryNode): IDDGEntryNode

    Permalink
    Attributes
    protected

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

    Permalink
    Attributes
    protected

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

    Permalink
    Attributes
    protected

  65. def newIDDGNormalNode(icfgN: ICFGNormalNode): IDDGNormalNode

    Permalink
    Attributes
    protected

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

    Permalink
    Attributes
    protected

  67. def newIDDGReturnVarNode(icfgN: ICFGCallNode): IDDGReturnVarNode

    Permalink
    Attributes
    protected

  68. def newIDDGVirtualBodyNode(icfgN: ICFGCallNode): IDDGVirtualBodyNode

    Permalink
    Attributes
    protected

  69. def nodes: Iterable[Node]

    Permalink
    Definition Classes
    AlirGraph

  70. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  71. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  72. def numOfEdges: Int

    Permalink
    Definition Classes
    AlirGraph

  73. def numOfNodes: Int

    Permalink
    Definition Classes
    AlirGraph

  74. val pl: MMap[InterproceduralNode, Node]

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  75. def pool: MMap[InterproceduralNode, Node]

    Permalink
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Definition Classes
    AlirGraph

  77. def predecessor(edge: Edge): Node

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirGraph

  81. def successor(edge: Edge): Node

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    InterproceduralGraph

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

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

  88. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  91. final def wait(): Unit

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

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

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

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

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

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