Trait

org.argus.jawa.alir.interprocedural

InterproceduralGraph

Related Doc: package interprocedural

Permalink

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
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InterproceduralGraph
  2. Serializable
  3. Serializable
  4. AlirSuccPredAccesses
  5. AlirEdgeAccesses
  6. AlirGraph
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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 addNode(node: Node): Node

    Permalink
    Definition Classes
    InterproceduralGraph → AlirEdgeAccesses

  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  8. def clone(): AnyRef

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

  9. def deleteEdge(e: Edge): Boolean

    Permalink

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

    Permalink

  11. def deleteNode(node: Node): Boolean

    Permalink

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

    Permalink
    Attributes
    protected

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

    Permalink
    Attributes
    protected
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Attributes
    protected
    Definition Classes
    AlirSuccPredAccesses

  15. def edges: Iterable[Edge]

    Permalink
    Definition Classes
    AlirGraph

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

    Permalink
    Definition Classes
    AnyRef

  17. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  18. def finalize(): Unit

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

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AlirGraph

  22. def getNode(n: Node): Node

    Permalink
    Definition Classes
    InterproceduralGraph → AlirGraph

  23. val graph: DirectedPseudograph[Node, Edge]

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph → AlirGraph

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

    Permalink
    Definition Classes
    AlirGraph

  25. def hasNode(n: Node): Boolean

    Permalink
    Definition Classes
    AlirGraph

  26. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  27. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  29. def nodes: Iterable[Node]

    Permalink
    Definition Classes
    AlirGraph

  30. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  31. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  32. def numOfEdges: Int

    Permalink
    Definition Classes
    AlirGraph

  33. def numOfNodes: Int

    Permalink
    Definition Classes
    AlirGraph

  34. val pl: MMap[InterproceduralNode, Node]

    Permalink
    Attributes
    protected

  35. def pool: MMap[InterproceduralNode, Node]

    Permalink

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

    Permalink
    Definition Classes
    AlirGraph

  37. def predecessor(edge: Edge): Node

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirGraph

  41. def successor(edge: Edge): Node

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink

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

    Permalink

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

    Permalink

  48. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Attributes
    protected

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

    Permalink
    Attributes
    protected

  51. final def wait(): Unit

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

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

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

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

    Permalink
    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