| Package | Description |
|---|---|
| de.mirkosertic.bytecoder.core | |
| de.mirkosertic.bytecoder.graph | |
| de.mirkosertic.bytecoder.ssa |
| Modifier and Type | Class and Description |
|---|---|
class |
BytecodeField |
class |
BytecodeLinkedClass |
class |
BytecodeMethod |
class |
RootNode |
| 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 |
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 |
GraphDFSOrder<T extends Node<? extends Node,? extends EdgeType>> |
class |
Node<V extends Node,E extends EdgeType> |
class |
Partitioning<T extends Node<T,? extends EdgeType>> |
| Modifier and Type | Method and Description |
|---|---|
<T extends Node> |
Node.addEdgeTo(E aType,
T aTargetNode) |
<T extends Node> |
Node.singleOutgoingNodeMatching(Predicate<E> aPredicate) |
| Modifier and Type | Method and Description |
|---|---|
Node |
Edge.sourceNode() |
| Modifier and Type | Method and Description |
|---|---|
void |
Edge.newSourceIs(Node aNewSource) |
| Constructor and Description |
|---|
Edge(Node aSourceNode,
TYPE aType,
TARGET aTargetNode) |
| Modifier and Type | Method and Description |
|---|---|
<T extends Node> |
RegionNode.addEdgeTo(ControlFlowEdgeType aType,
T aTargetNode) |
Copyright © 2020 Systemprogrammierung Mirko Sertic. All rights reserved.