| Package | Description |
|---|---|
| de.mirkosertic.bytecoder.allocator | |
| de.mirkosertic.bytecoder.core | |
| de.mirkosertic.bytecoder.graph | |
| de.mirkosertic.bytecoder.ssa |
| Modifier and Type | Class and Description |
|---|---|
static class |
AbstractAllocator.EdgeTypes |
| Modifier and Type | Class and Description |
|---|---|
class |
BytecodeImplementsEdgeType |
class |
BytecodeLinkedClassEdgeType |
class |
BytecodeProvidesFieldEdgeType |
class |
BytecodeProvidesMethodEdgeType |
class |
BytecodeSubclassOfEdgeType |
| Modifier and Type | Method and Description |
|---|---|
static Predicate<EdgeType> |
BytecodeProvidesMethodEdgeType.filter() |
static Predicate<EdgeType> |
BytecodeSubclassOfEdgeType.filter() |
static Predicate<EdgeType> |
BytecodeImplementsEdgeType.filter() |
static Predicate<EdgeType> |
BytecodeProvidesFieldEdgeType.filter() |
| Modifier and Type | Class and Description |
|---|---|
class |
Dominators<T extends Node<? extends Node,? extends EdgeType>>
Compute Dominators of a graph, following:
A Simple, Fast Dominance Algorithm
(Cooper, Keith D.
|
class |
Edge<TYPE extends EdgeType,TARGET extends Node> |
class |
GraphDFSOrder<T extends Node<? extends Node,? extends EdgeType>> |
class |
Node<V extends Node,E extends EdgeType> |
class |
Partitioning<T extends Node<T,? extends EdgeType>> |
| Constructor and Description |
|---|
Dominators(T rootNode,
Comparator<T> comparator,
Predicate<Edge<EdgeType,T>> edgeFilter) |
GraphDFSOrder(T graphStartNode,
Comparator<T> nodeComparator,
Predicate<Edge<EdgeType,T>> edgeFilter) |
Partitioning(Set<T> nodes,
Predicate<Edge<EdgeType,T>> edgeFilter) |
| Modifier and Type | Class and Description |
|---|---|
class |
ControlFlowEdgeType |
class |
DataFlowEdgeType |
| Modifier and Type | Method and Description |
|---|---|
static Predicate<EdgeType> |
DataFlowEdgeType.filter() |
Copyright © 2020 Systemprogrammierung Mirko Sertic. All rights reserved.