Packages

  • package root
    Definition Classes
    root
  • package org
    Definition Classes
    root
  • package opalj

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode.

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode. OPAL is designed with performance, scalability and adaptability in mind.

    Its main components are:

    • a library (Common) which provides generally useful data-structures and algorithms for static analyses.
    • a framework for implementing lattice based static analyses (Static Analysis Infrastructure)
    • a framework for parsing Java bytecode (Bytecode Infrastructure) that can be used to create arbitrary representations.
    • a library to create a one-to-one in-memory representation of Java bytecode (Bytecode Disassembler).
    • a library to create a representation of Java bytecode that facilitates writing simple static analyses (Bytecode Representation - org.opalj.br).
    • a scalable, easily customizable framework for the abstract interpretation of Java bytecode (Abstract Interpretation Framework - org.opalj.ai).
    • a library to extract dependencies between code elements and to facilitate checking architecture definitions.
    • a library for the lightweight manipulation and creation of Java bytecode (Bytecode Assembler).

    General Design Decisions

    Thread Safety

    Unless explicitly noted, OPAL is thread safe. I.e., the classes defined by OPAL can be considered to be thread safe unless otherwise stated. (For example, it is possible to read and process class files concurrently without explicit synchronization on the client side.)

    No null Values

    Unless explicitly noted, OPAL does not null values I.e., fields that are accessible will never contain null values and methods will never return null. If a method accepts null as a value for a parameter or returns a null value it is always explicitly documented. In general, the behavior of methods that are passed null values is undefined unless explicitly documented.

    No Typecasts for Collections

    For efficiency reasons, OPAL sometimes uses mutable data-structures internally. After construction time, these data-structures are generally represented using their generic interfaces (e.g., scala.collection.{Set,Map}). However, a downcast (e.g., to add/remove elements) is always forbidden as it would effectively prevent thread-safety.

    Assertions

    OPAL makes heavy use of Scala's Assertion Facility to facilitate writing correct code. Hence, for production builds (after thorough testing(!)) it is highly recommend to build OPAL again using -Xdisable-assertions.

    Definition Classes
    org
  • package br

    In this representation of Java bytecode references to a Java class file's constant pool and to attributes are replaced by direct references to the corresponding constant pool entries.

    In this representation of Java bytecode references to a Java class file's constant pool and to attributes are replaced by direct references to the corresponding constant pool entries. This facilitates developing analyses and fosters comprehension.

    Based on the fact that indirect references to constant pool entries are resolved and replaced by direct references this representation is called the resolved representation.

    This representation of Java bytecode is considered as OPAL's standard representation for writing Scala based analyses. This representation is engineered such that it facilitates writing analyses that use pattern matching.

    Definition Classes
    opalj
  • package cfg
    Definition Classes
    br
  • BasicBlock
  • CFG
  • CFGFactory
  • CFGNode
  • CatchNode
  • ExitNode

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

Source
ExitNode.scala
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. Protected

Instance Constructors

  1. new ExitNode(normalReturn: Boolean)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def addPredecessor(predecessor: CFGNode): Unit
    Definition Classes
    CFGNode
  5. def addPredecessors(predecessor: IterableOnce[CFGNode]): Unit
    Definition Classes
    CFGNode
  6. def addSuccessor(successor: CFGNode): Unit
    Definition Classes
    ExitNodeCFGNode
  7. def asBasicBlock: BasicBlock
    Definition Classes
    CFGNode
  8. def asCatchNode: CatchNode
    Definition Classes
    CFGNode
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(other: Any): Boolean
    Definition Classes
    Node → AnyRef → Any
  13. final def foreachSuccessor(f: (Node) => Unit): Unit

    Applies the given function for each successor node.

    Applies the given function for each successor node.

    Definition Classes
    CFGNodeNode
  14. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  15. final def hasSuccessors: Boolean

    Returns true if this node has successor nodes.

    Returns true if this node has successor nodes.

    Definition Classes
    CFGNodeNode
  16. def hashCode(): Int

    The hash code of this node.

    The hash code of this node. By default the hash code is the unique id.

    Definition Classes
    Node → AnyRef → Any
  17. def isAbnormalReturnExitNode: Boolean
    Definition Classes
    ExitNodeCFGNode
  18. def isBasicBlock: Boolean
    Definition Classes
    ExitNodeCFGNode
  19. def isCatchNode: Boolean
    Definition Classes
    ExitNodeCFGNode
  20. def isExitNode: Boolean
    Definition Classes
    ExitNodeCFGNode
  21. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  22. def isNormalReturnExitNode: Boolean
    Definition Classes
    ExitNodeCFGNode
  23. def isStartOfSubroutine: Boolean
    Definition Classes
    ExitNodeCFGNode
  24. def mayThrowException: Boolean

    Returns true if the last instruction of this basic block throws/may throw an exception; whether the exception is handled or not is not relevant!

    Returns true if the last instruction of this basic block throws/may throw an exception; whether the exception is handled or not is not relevant!

    Definition Classes
    CFGNode
  25. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. def nodeId: Int

    An identifier that uniquely identifies this node in the graph to which this node belongs.

    An identifier that uniquely identifies this node in the graph to which this node belongs. By default two nodes are considered equal if they have the same unique id.

    Definition Classes
    ExitNodeNode
  27. final val normalReturn: Boolean
  28. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  29. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  30. def predecessors: Set[CFGNode]
    Definition Classes
    CFGNode
  31. def reachable(reflexive: Boolean = false): Set[CFGNode]

    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.

  32. def removePredecessor(predecessor: CFGNode): Unit
    Definition Classes
    CFGNode
  33. def successors: Set[CFGNode]
    Definition Classes
    CFGNode
  34. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  35. def toHRR: Option[String]

    Returns a human readable representation (HRR) of this node.

    Returns a human readable representation (HRR) of this node.

    Definition Classes
    ExitNodeNode
  36. def toString(): String
    Definition Classes
    ExitNode → AnyRef → Any
  37. def visualProperties: Map[String, String]
    Definition Classes
    ExitNodeNode
  38. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  39. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  40. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from CFGNode

Inherited from Node

Inherited from AnyRef

Inherited from Any

Ungrouped