|
Ghidra 11.4.2
Ghidra internal decompiler documentation.
|
A range of nodes (within the weak topological ordering) that are iterated together. More...
#include <rangeutil.hh>
Public Member Functions | |
| Partition (void) | |
| Construct empty partition. | |
Private Attributes | |
| ValueSet * | startNode |
| Starting node of component. | |
| ValueSet * | stopNode |
| Ending node of component. | |
| bool | isDirty |
| Set to true if a node in this component has changed this iteration. | |
Friends | |
| class | ValueSetSolver |
A range of nodes (within the weak topological ordering) that are iterated together.