Class

org.opalj.br.cfg

ExitNode

Related Doc: package cfg

Permalink

class ExitNode extends CFGNode

Represents the artificial exit node of a control flow graph. The graph contains an explicit exit node to make it trivial to navigate to all instructions that may cause a(n ab)normal return from the method.

Linear Supertypes
CFGNode, Node, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ExitNode
  2. CFGNode
  3. Node
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ExitNode(normalReturn: Boolean)

    Permalink

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. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef

  7. def equals(other: Any): Boolean

    Permalink
    Definition Classes
    Node → AnyRef → Any

  8. def finalize(): Unit

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

  9. final def foreachSuccessor(f: (Node) ⇒ Unit): Unit

    Permalink
    Definition Classes
    CFGNode → Node

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

    Permalink
    Definition Classes
    AnyRef → Any

  11. final def hasSuccessors: Boolean

    Permalink
    Definition Classes
    CFGNode → Node

  12. def hashCode(): Int

    Permalink
    Definition Classes
    Node → AnyRef → Any

  13. final def isBasicBlock: Boolean

    Permalink
    Definition Classes
    ExitNode → CFGNode

  14. final def isCatchNode: Boolean

    Permalink
    Definition Classes
    ExitNode → CFGNode

  15. final def isExitNode: Boolean

    Permalink
    Definition Classes
    ExitNode → CFGNode

  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  18. def nodeId: Long

    Permalink
    Definition Classes
    ExitNode → Node

  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  21. def predecessors: Set[CFGNode]

    Permalink
    Definition Classes
    CFGNode

  22. def reachable(reflexive: Boolean = false): Set[CFGNode]

    Permalink

    Computes the set of all CFGNodes that are reachable from this one.

    Computes the set of all CFGNodes that are reachable from this one.

    Definition Classes
    CFGNode
    Note

    The result is not cached.

  23. def successors: Set[CFGNode]

    Permalink
    Definition Classes
    CFGNode

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

    Permalink
    Definition Classes
    AnyRef

  25. def toHRR: Option[String]

    Permalink
    Definition Classes
    ExitNode → Node

  26. def toString(): String

    Permalink
    Definition Classes
    ExitNode → AnyRef → Any

  27. def visualProperties: Map[String, String]

    Permalink
    Definition Classes
    ExitNode → Node

  28. final def wait(): Unit

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

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

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

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

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

Inherited from CFGNode

Inherited from Node

Inherited from AnyRef

Inherited from Any

Ungrouped