| Modifier and Type | Class and Description |
|---|---|
| public static enum |
| Modifier and Type | Field and Description |
|---|---|
| private Map | |
| public final DataFlowProblem. | |
| protected FullInterpreterContext | |
| protected List | |
| private int |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public int | |
| private void | |
| public abstract U | |
| public void | |
| protected LinkedList | generateWorkList()
Generate an ordered list of flow graph nodes in a forward or backward order depending on direction. |
| public String | |
| public int | |
| public U | |
| public U | |
| public FullInterpreterContext | |
| public DataFlowProblem. | |
| public U | |
| public abstract String | |
| public boolean | |
| public void | |
| public String |
| basicBlockToFlowGraph | back to summary |
|---|---|
| private Map<BasicBlock, U> basicBlockToFlowGraph | |
| direction | back to summary |
|---|---|
| public final DataFlowProblem. | |
| fic | back to summary |
|---|---|
| protected FullInterpreterContext fic | |
| flowGraphNodes | back to summary |
|---|---|
| protected List<U> flowGraphNodes | |
| nextVariableId | back to summary |
|---|---|
| private int nextVariableId | |
| DataFlowProblem | back to summary |
|---|---|
| public DataFlowProblem(DataFlowProblem. | |
| addDataFlowVar | back to summary |
|---|---|
| public int addDataFlowVar() | |
| buildFlowGraph | back to summary |
|---|---|
| private void buildFlowGraph() | |
| buildFlowGraphNode | back to summary |
|---|---|
| public abstract U buildFlowGraphNode(BasicBlock bb) | |
| compute_MOP_Solution | back to summary |
|---|---|
| public void compute_MOP_Solution() | |
| generateWorkList | back to summary |
|---|---|
| protected LinkedList Generate an ordered list of flow graph nodes in a forward or backward order depending on direction. | |
| getDataFlowVarsForOutput | back to summary |
|---|---|
| public String getDataFlowVarsForOutput() | |
| getDFVarsCount | back to summary |
|---|---|
| public int getDFVarsCount() | |
| getEntryNode | back to summary |
|---|---|
| public U getEntryNode() | |
| getExitNode | back to summary |
|---|---|
| public U getExitNode() | |
| getFIC | back to summary |
|---|---|
| public FullInterpreterContext getFIC() | |
| getFlowDirection | back to summary |
|---|---|
| public DataFlowProblem. | |
| getFlowGraphNode | back to summary |
|---|---|
| public U getFlowGraphNode(BasicBlock bb) | |
| getName | back to summary |
|---|---|
| public abstract String getName() | |
| isEmpty | back to summary |
|---|---|
| public boolean isEmpty() Are there are available data flow facts to run this problem? SSS FIXME: Silly optimization? | |
| setup | back to summary |
|---|---|
| public void setup(FullInterpreterContext fic) | |
| toString | back to summary |
|---|---|
| public String toString() Overrides java. Doc from java. Returns a string representation of the object.
Satisfying this method's contract implies a non- | |
| Modifier and Type | Field and Description |
|---|---|
| public static final DataFlowProblem. | |
| public static final DataFlowProblem. | |
| public static final DataFlowProblem. |
| Access | Constructor and Description |
|---|---|
| private |
| Modifier and Type | Method and Description |
|---|---|
| public static DataFlowProblem. | |
| public static DataFlowProblem. |
| BACKWARD | back to summary |
|---|---|
| public static final DataFlowProblem. | |
| BIDIRECTIONAL | back to summary |
|---|---|
| public static final DataFlowProblem. | |
| FORWARD | back to summary |
|---|---|
| public static final DataFlowProblem. | |
| DF_Direction | back to summary |
|---|---|
| private DF_Direction() | |
| valueOf | back to summary |
|---|---|
| public static DataFlowProblem. | |
| values | back to summary |
|---|---|
| public static DataFlowProblem. | |