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 graphs

    This package defines graph algorithms as well as factory methods to describe and compute graphs and trees.

    This package defines graph algorithms as well as factory methods to describe and compute graphs and trees.

    This package supports the following types of graphs:

    1. graphs based on explicitly connected nodes (org.opalj.graphs.Node),
    2. graphs where the relationship between the nodes are encoded externally (org.opalj.graphs.Graph).
    Definition Classes
    opalj
  • AbstractDominatorTree
  • AbstractGraph
  • ControlDependencies
  • DefaultMutableMode
  • DefaultMutableNode
  • DominanceFrontiers
  • DominatorTree
  • Graph
  • MutableNode
  • MutableNodeLike
  • Node
  • PostDominatorTree
  • UnidirectionalGraph
  • VirtualUnidirectionalGraph

final class DominatorTree extends AbstractDominatorTree

A (standard) dominator tree.

Note

Int ⇒ ((Int ⇒ Unit) ⇒ Unit) is basically an IntFunction[Consumer[IntConsumer]].

Linear Supertypes
AbstractDominatorTree, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DominatorTree
  2. AbstractDominatorTree
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. final def dom(n: Int): Int

    Returns the immediate dominator of the node with the given id.

    Returns the immediate dominator of the node with the given id.

    n

    The id of a valid node which is not the startNode.

    returns

    The id of the node which immediately dominates the given node.

    Definition Classes
    AbstractDominatorTree
    Note

    The root node does not have a(n immediate) dominator; in case n is the root node an IllegalArgumentException is thrown.

  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def foreachDom[U](n: Int, reflexive: Boolean = false)(f: (Int) ⇒ U): Unit

    Iterates over all dominator nodes of the given node and calls the given function f for each dominator node.

    Iterates over all dominator nodes of the given node and calls the given function f for each dominator node. Iteration starts with the immediate dominator of the given node if reflexive is false and starts with the node itself if reflexive is true.

    n

    The id of a valid node.

    Definition Classes
    AbstractDominatorTree
  11. val foreachSuccessorOf: (Int) ⇒ ((Int) ⇒ Unit) ⇒ Unit

    Executes the given function f for each successor instruction of pc.

    Executes the given function f for each successor instruction of pc.

    Defined w.r.t. the (implicitly) augmented CFG.

    Definition Classes
    DominatorTree → AbstractDominatorTree
  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. val hasVirtualStartNode: Boolean
  14. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. def immediateDominators: IntArray

    The array which stores the immediate dominator for each node.

    The array which stores the immediate dominator for each node.

    Definition Classes
    AbstractDominatorTree
  16. def isAugmented: Boolean

    If true the underlying cfg was augmented.

    If true the underlying cfg was augmented. To determine in which way the dominator tree is augmented, a pattern match should be used. E.g., the DominatorTree may an additional node which replaces the underlying CFG's root node.

    Definition Classes
    DominatorTree → AbstractDominatorTree
  17. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  18. def leaves(isIndexValid: (Int) ⇒ Boolean = _ ⇒ true): Chain[Int]

    (Re-)computes the dominator tree's leaf nodes.

    (Re-)computes the dominator tree's leaf nodes. Due to the way the graph is stored, this method has a complexity of O(2n). Hence, if the leaves are required more than once, storing/caching them should be considered.

    Definition Classes
    AbstractDominatorTree
  19. final def maxNode: Int
    Definition Classes
    AbstractDominatorTree
  20. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  22. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  23. val startNode: Int

    The unique start-node of the dominator tree.

    The unique start-node of the dominator tree. If the graph is augmented, this maybe a virtual node.

    Definition Classes
    DominatorTree → AbstractDominatorTree
  24. final def strictlyDominates(n: Int, w: Int): Boolean

    n

    a valid node of the graph.

    w

    a valid node of the graph.

    returns

    true if n strictly dominates w.

    Definition Classes
    AbstractDominatorTree
    Annotations
    @tailrec()
  25. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  26. def toDot(isIndexValid: (Int) ⇒ Boolean = _ ⇒ true): String

    Returns a Graphviz based visualization of this dominator tree.

    Returns a Graphviz based visualization of this dominator tree.

    isIndexValid

    A function that returns true if an element in the iDom array with a specific index is actually identifying a node. This is particularly useful/ required if the idom array given at initialization time is a sparse array.

    Definition Classes
    AbstractDominatorTree
  27. def toString(): String
    Definition Classes
    AnyRef → Any
  28. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from AbstractDominatorTree

Inherited from AnyRef

Inherited from Any

Ungrouped