|
Ghidra 11.4.2
Ghidra internal decompiler documentation.
|
An edge in a data-flow path or graph. More...
#include <op.hh>
Public Member Functions | |
| PcodeOpNode (void) | |
| Unused constructor. | |
| PcodeOpNode (PcodeOp *o, int4 s) | |
| Constructor. | |
| bool | operator< (const PcodeOpNode &op2) const |
| Simple comparator for putting edges in a sorted container. | |
Static Public Member Functions | |
| static bool | compareByHigh (const PcodeOpNode &a, const PcodeOpNode &b) |
| Compare Varnodes by their HighVariable. | |
Public Attributes | |
| PcodeOp * | op |
| The p-code end-point of the edge. | |
| int4 | slot |
| Slot indicating the input Varnode end-point of the edge. | |
An edge in a data-flow path or graph.
A minimal node for traversing expressions in the data-flow
|
inlinestatic |
Compare Varnodes by their HighVariable.
Allow a sorting that groups together input Varnodes with the same HighVariable
References ghidra::Varnode::getHigh(), ghidra::PcodeOp::getIn(), op, and slot.
Referenced by ghidra::Merge::snipOutputInterference().
|
inline |
Simple comparator for putting edges in a sorted container.
Compare PcodeOps (as pointers) first, then slot
| op2 | is the other edge to compare with this |
References ghidra::PcodeOp::getSeqNum(), ghidra::SeqNum::getTime(), op, and slot.