Class

org.argus.jawa.alir.taintAnalysis

TaintGraph

Related Doc: package taintAnalysis

Permalink

class TaintGraph extends InterproceduralGraph[TaintNode]

Linear Supertypes
InterproceduralGraph[TaintNode], Serializable, Serializable, AlirSuccPredAccesses[TaintNode], AlirEdgeAccesses[TaintNode], AlirGraph[TaintNode], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TaintGraph
  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

Instance Constructors

  1. new TaintGraph()

    Permalink

Type Members

  1. type Edge = AlirEdge[TaintNode]

    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: TaintNode, target: TaintNode): Edge

    Permalink
    Definition Classes
    AlirEdgeAccesses

  6. def addNode(node: TaintNode): TaintNode

    Permalink
    Definition Classes
    InterproceduralGraph → AlirEdgeAccesses

  7. def addSource(src: TaintNode): MSet[TaintNode]

    Permalink

  8. def addTaintEdge(srcSlot: TaintSlot, tarSlot: TaintSlot): Edge

    Permalink

  9. def addTaintNode(tf: TaintSlot): TaintNode

    Permalink

  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  11. def clone(): AnyRef

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

  12. def deleteEdge(e: Edge): Boolean

    Permalink
    Definition Classes
    InterproceduralGraph

  13. def deleteEdge(source: TaintNode, target: TaintNode): Edge

    Permalink
    Definition Classes
    InterproceduralGraph

  14. def deleteNode(node: TaintNode): Boolean

    Permalink
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  16. def edgeSource(edge: AlirEdge[TaintNode]): TaintNode

    Permalink
    Attributes
    protected
    Definition Classes
    AlirSuccPredAccesses

  17. def edgeTarget(edge: AlirEdge[TaintNode]): TaintNode

    Permalink
    Attributes
    protected
    Definition Classes
    AlirSuccPredAccesses

  18. def edges: Iterable[Edge]

    Permalink
    Definition Classes
    AlirGraph

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

    Permalink
    Definition Classes
    AnyRef

  20. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  21. def finalize(): Unit

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

  22. def findPath(srcNode: TaintNode, tarNode: TaintNode): IList[Edge]

    Permalink
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Definition Classes
    AnyRef → Any

  24. def getEdges(n1: TaintNode, n2: TaintNode): CSet[Edge]

    Permalink
    Definition Classes
    AlirGraph

  25. def getNode(n: TaintNode): TaintNode

    Permalink
    Definition Classes
    InterproceduralGraph → AlirGraph

  26. def getSources: Set[TaintNode]

    Permalink

  27. def getTaintNode(tf: TaintSlot): TaintNode

    Permalink

  28. val graph: DirectedPseudograph[TaintNode, Edge]

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph → AlirGraph

  29. def hasEdge(n1: TaintNode, n2: TaintNode): Boolean

    Permalink
    Definition Classes
    AlirGraph

  30. def hasNode(n: TaintNode): Boolean

    Permalink
    Definition Classes
    AlirGraph

  31. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  32. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  34. def newTaintNode(tf: TaintSlot): TaintNode

    Permalink
    Attributes
    protected

  35. def nodes: Iterable[TaintNode]

    Permalink
    Definition Classes
    AlirGraph

  36. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  37. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  38. def numOfEdges: Int

    Permalink
    Definition Classes
    AlirGraph

  39. def numOfNodes: Int

    Permalink
    Definition Classes
    AlirGraph

  40. val pl: MMap[InterproceduralNode, TaintNode]

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  41. def pool: MMap[InterproceduralNode, TaintNode]

    Permalink
    Definition Classes
    InterproceduralGraph

  42. def prePostNodeOrder(n: TaintNode): MMap[TaintNode, (Int, Int)]

    Permalink
    Definition Classes
    AlirGraph

  43. def predecessor(edge: Edge): TaintNode

    Permalink
    Definition Classes
    AlirSuccPredAccesses

  44. def predecessorEdges(node: TaintNode): CSet[Edge]

    Permalink
    Definition Classes
    AlirSuccPredAccesses

  45. def predecessors(node: TaintNode): CSet[TaintNode]

    Permalink
    Definition Classes
    AlirSuccPredAccesses

  46. def stronglyConnectedSets: Iterable[CSet[TaintNode]]

    Permalink
    Definition Classes
    AlirGraph

  47. def successor(edge: Edge): TaintNode

    Permalink
    Definition Classes
    AlirSuccPredAccesses

  48. def successorEdges(node: TaintNode): CSet[Edge]

    Permalink
    Definition Classes
    AlirSuccPredAccesses

  49. def successors(node: TaintNode): CSet[TaintNode]

    Permalink
    Definition Classes
    AlirSuccPredAccesses

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

    Permalink
    Definition Classes
    AnyRef

  51. def taintNodeExists(tf: TaintSlot): Boolean

    Permalink

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

    Permalink
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Definition Classes
    InterproceduralGraph

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

    Permalink
    Definition Classes
    InterproceduralGraph

  55. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  56. val vIDProvider: VertexNameProvider[TaintNode] { def filterLabel(uri: String): String }

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  57. val vLDProvider: VertexNameProvider[TaintNode] { def filterLabel(uri: String): String }

    Permalink
    Attributes
    protected
    Definition Classes
    InterproceduralGraph

  58. final def wait(): Unit

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

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

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

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

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

Inherited from InterproceduralGraph[TaintNode]

Inherited from Serializable

Inherited from Serializable

Inherited from AlirSuccPredAccesses[TaintNode]

Inherited from AlirEdgeAccesses[TaintNode]

Inherited from AlirGraph[TaintNode]

Inherited from AnyRef

Inherited from Any

Ungrouped