| Class | Description |
|---|---|
| BusyCodeMotion |
Performs a partial redundancy elimination (= code motion).
|
| DelayabilityAnalysis |
Performs a Delayability-analysis on the given graph.
|
| DownSafetyAnalysis |
Performs an DownSafe-analysis on the given graph.
|
| EarliestnessComputation |
Computes the earliest points for the given expressions.
This basically finds the highest point in the flow-graph where we can put each computation, without introducing new computations on any path. More technically: A computation is earliest, if at the current point the computation is down-safe, and if either: any of the predecessors is not transparent, or if any predecessors is not "safe" (ie. |
| LatestComputation |
Performs a Latest-Computation on the given graph.
|
| LazyCodeMotion |
Performs a partial redundancy elimination (= code motion).
|
| NotIsolatedAnalysis |
Performs a Not-Isolated-analysis on the given graph, which is basically the
same as an Isolated-analysis (we just return the complement, as it's easier
to calculate it).
|
| SootFilter |
Allows easy filtering/wrapping of Soot objects.
|
| UpSafetyAnalysis |
Performs an UpSafe-analysis on the given graph.
|