| Package | Description |
|---|---|
| soot |
Base Soot classes, shared by different intermediate representations.
|
| soot.jimple.toolkits.annotation.logic | |
| soot.jimple.toolkits.annotation.nullcheck |
Classes that carry out an analysis to determine whether or not null pointer
checks are necessary.
|
| soot.jimple.toolkits.annotation.parity | |
| soot.jimple.toolkits.annotation.purity | |
| soot.jimple.toolkits.callgraph | |
| soot.jimple.toolkits.infoflow | |
| soot.jimple.toolkits.pointer | |
| soot.jimple.toolkits.scalar |
A toolkit for scalar optimization of Jimple.
|
| soot.jimple.toolkits.scalar.pre |
Particial redundency elimination.
|
| soot.toolkits.exceptions | |
| soot.toolkits.graph |
Toolkit to produce and manipulate various types of control flow
graphs.
|
| soot.toolkits.graph.interaction | |
| soot.toolkits.graph.pdg | |
| soot.toolkits.scalar |
A number of scalar optimizations, and the flow analysis framework.
|
| soot.util |
Generally useful utility classes for Soot.
|
| Class and Description |
|---|
| SlowPseudoTopologicalOrderer
Provide the pseudo topological order of a graph's nodes.
|
| Class and Description |
|---|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| ExceptionalUnitGraph |
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| Class and Description |
|---|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| HashMutableDirectedGraph
HashMap based implementation of a MutableBlockGraph.
|
| MutableDirectedGraph
Defines a DirectedGraph which is modifiable.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| BriefUnitGraph
Represents a CFG where the nodes are Unit instances, and
where no edges are included to account for control flow
associated with exceptions.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| ExceptionalUnitGraph |
| Class and Description |
|---|
| Block
Represents BasicBlocks that partition
a method body.
|
| BlockGraph
Represents the control flow graph of a
Body at the basic
block level. |
| BriefUnitGraph
Represents a CFG where the nodes are Unit instances, and
where no edges are included to account for control flow
associated with exceptions.
|
| ClassicCompleteUnitGraph
Represents a CFG for a Body instance where the nodes are
Unit instances, and where edges are a conservative
indication of unexceptional and exceptional control
flow. |
| DirectedGraph
Defines the notion of a directed graph.
|
| DominanceFrontier
Interface to compute and/or store the dominance frontiers of nodes
in a dominator tree.
|
| DominatorNode
Represents a dominator node in DominatorTree.
|
| DominatorsFinder
General interface for a dominators analysis.
|
| DominatorTree
Constructs a dominator tree structure from the given
DominatorsFinder.
|
| ExceptionalBlockGraph
Represents a CFG where the nodes are
Blocks and the
edges are derived from control flow. |
| ExceptionalBlockGraph.ExceptionDest |
| ExceptionalGraph
Defines the interface for navigating a control flow graph which
distinguishes exceptional control flow.
|
| ExceptionalGraph.ExceptionDest
Data structure to represent the fact that
a given
Trap will catch some subset of the exceptions
which may be thrown by a given graph node. |
| ExceptionalUnitGraph |
| ExceptionalUnitGraph.ExceptionDest |
| HashMutableDirectedGraph
HashMap based implementation of a MutableBlockGraph.
|
| MHGDominatorsFinder
Calculate dominators for basic blocks.
|
| MutableDirectedGraph
Defines a DirectedGraph which is modifiable.
|
| MutableEdgeLabelledDirectedGraph
Defines a DirectedGraph which is modifiable and associates
a label object with every edge.
|
| Orderer
An orderer builds an order on a directed, not necessarily acyclic, graph.
|
| PseudoTopologicalOrderer
Orders in pseudo-topological order, the nodes of a DirectedGraph instance.
|
| ReversibleGraph
DirectedGraph which can be reversed and re-reversed.
|
| SlowPseudoTopologicalOrderer
Provide the pseudo topological order of a graph's nodes.
|
| TrapUnitGraph |
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| Class and Description |
|---|
| Block
Represents BasicBlocks that partition
a method body.
|
| BlockGraph
Represents the control flow graph of a
Body at the basic
block level. |
| DirectedGraph
Defines the notion of a directed graph.
|
| DominatorNode
Represents a dominator node in DominatorTree.
|
| DominatorsFinder
General interface for a dominators analysis.
|
| DominatorTree
Constructs a dominator tree structure from the given
DominatorsFinder.
|
| HashMutableEdgeLabelledDirectedGraph |
| MutableEdgeLabelledDirectedGraph
Defines a DirectedGraph which is modifiable and associates
a label object with every edge.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| Orderer
An orderer builds an order on a directed, not necessarily acyclic, graph.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
Copyright © 2012-2019 RoboVM AB. All Rights Reserved.