llir-opt
0.0.1
Low-Level Post-Link Optimiser for OCaml and C
|
#include <passes/global_forward/nodes.h>
Public Member Functions | |
ReverseNodeState (DAGBlock &node) | |
void | Merge (const ReverseNodeState &that) |
LUB operator of two nodes. | |
void | Store (ID< Object > id) |
void | Store (ID< Object > id, uint64_t start, uint64_t end, MemoryStoreInst *store=nullptr) |
void | Store (const BitSet< Object > &changed) |
void | Load (ID< Object > id) |
void | Load (ID< Object > id, uint64_t start, uint64_t end) |
void | Load (const BitSet< Object > &loaded) |
void | dump (llvm::raw_ostream &os) |
Print information about the node to a stream. | |
Public Attributes | |
DAGBlock & | Node |
Originating nodes. | |
llvm::DenseSet< ReverseNodeState * > | Succs |
Predecessor of the node. | |
std::unordered_map< ID< Object >, std::map< uint64_t, std::pair< MemoryStoreInst *, uint64_t > > > | Stores |
Set of stores which can be forwarded here. | |
BitSet< Object > | Stored |
Imprecise, tainted locations. | |
BitSet< Object > | Loaded |
Set of inaccurate loads. | |
Node in the reverse flow graph used to find the earliest insertion point for stores which can potentially be folded.