Home
last modified time | relevance | path

Searched refs:NodeAddr (Results 1 – 11 of 11) sorted by relevance

/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DRDFGraph.h335 template <typename T> struct NodeAddr { struct
336 NodeAddr() = default;
337 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} in NodeAddr() argument
341 template <typename S> NodeAddr(const NodeAddr<S> &NA) in NodeAddr() function
344 bool operator== (const NodeAddr<T> &NA) const {
348 bool operator!= (const NodeAddr<T> &NA) const {
392 NodeAddr<NodeBase*> New();
465 void append(NodeAddr<NodeBase*> NA);
513 using NodeList = SmallVector<NodeAddr<NodeBase *>, 4>;
554 NodeAddr<RefNode*> getNextRef(RegisterRef RR, Predicate P, bool NextOnly,
[all …]
H A DRDFLiveness.h83 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA,
86 NodeList getAllReachingDefs(NodeAddr<RefNode*> RefA) {
91 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA) {
95 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA,
98 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA) {
103 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs);
105 NodeAddr<RefNode*> getNearestAliasedRef(RegisterRef RefRR,
106 NodeAddr<InstrNode*> IA);
165 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs,
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DRDFGraph.cpp106 static void printRefHeader(raw_ostream &OS, const NodeAddr<RefNode*> RA, in printRefHeader()
114 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<DefNode*>> &P) { in operator <<()
131 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<UseNode*>> &P) { in operator <<()
143 const Print<NodeAddr<PhiUseNode*>> &P) { in operator <<()
157 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<RefNode*>> &P) { in operator <<()
206 for (NodeAddr<T> A : P.List) { in operator <<()
216 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<PhiNode*>> &P) { in operator <<()
222 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeAddr<StmtNode *>> &P) { in operator <<()
248 const Print<NodeAddr<InstrNode*>> &P) { in operator <<()
264 const Print<NodeAddr<BlockNode*>> &P) { in operator <<()
[all …]
H A DRDFLiveness.cpp109 NodeAddr<RefNode*> RefA, bool TopShadows, bool FullChain, in getAllReachingDefs()
132 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
154 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
162 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* { in getAllReachingDefs()
164 return NodeAddr<StmtNode*>(IA).Addr->getCode()->getParent(); in getAllReachingDefs()
166 NodeAddr<PhiNode*> PA = IA; in getAllReachingDefs()
167 NodeAddr<BlockNode*> BA = PA.Addr->getOwner(DFG); in getAllReachingDefs()
175 std::map<NodeId, NodeAddr<InstrNode*>> Owners; in getAllReachingDefs()
183 NodeAddr<InstrNode*> IA = TA.Addr->getOwner(DFG); in getAllReachingDefs()
191 NodeAddr<InstrNode*> OA = DFG.addr<InstrNode*>(A); in getAllReachingDefs()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/
H A DRDFDeadCode.cpp82 void DeadCodeElimination::scanInstr(NodeAddr<InstrNode*> IA, in scanInstr()
86 if (!isLiveInstr(NodeAddr<StmtNode*>(IA).Addr->getCode())) in scanInstr()
88 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) { in scanInstr()
94 void DeadCodeElimination::processDef(NodeAddr<DefNode*> DA, in processDef()
96 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG); in processDef()
97 for (NodeAddr<UseNode*> UA : IA.Addr->members_if(DFG.IsUse, DFG)) { in processDef()
101 for (NodeAddr<DefNode*> TA : DFG.getRelatedRefs(IA, DA)) in processDef()
105 void DeadCodeElimination::processUse(NodeAddr<UseNode*> UA, in processUse()
107 for (NodeAddr<DefNode*> DA : LV.getAllReachingDefs(UA)) { in processUse()
128 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) in collect()
[all …]
H A DHexagonOptAddrMode.cpp91 bool processBlock(NodeAddr<BlockNode *> BA);
93 NodeAddr<UseNode *> UseN, unsigned UseMOnum);
94 bool processAddUses(NodeAddr<StmtNode *> AddSN, MachineInstr *AddMI,
100 bool canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, MachineInstr &MI,
102 bool isSafeToExtLR(NodeAddr<StmtNode *> SN, MachineInstr *MI,
104 void getAllRealUses(NodeAddr<StmtNode *> SN, NodeList &UNodeList);
105 bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList);
110 bool changeAddAsl(NodeAddr<UseNode *> AddAslUN, MachineInstr *AddAslMI,
160 bool HexagonOptAddrMode::canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, in canRemoveAddasl()
171 for (NodeAddr<UseNode *> UA : AddAslSN.Addr->members_if(DFG->IsUse, *DFG)) { in canRemoveAddasl()
[all …]
H A DHexagonRDFOpt.cpp95 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove);
96 void removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum);
163 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in run()
165 NodeAddr<StmtNode*> SA = TA; in run()
166 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) { in run()
189 void HexagonDCE::removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum) { in removeOperand()
190 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode(); in removeOperand()
201 for (NodeAddr<RefNode*> RA : Refs) in removeOperand()
206 for (NodeAddr<RefNode*> RA : Refs) { in removeOperand()
215 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove) { in rewrite()
[all …]
H A DRDFCopy.cpp63 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) { in recordCopy()
70 NodeAddr<BlockNode*> BA = DFG.findBlock(B); in scanBlock()
72 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) { in scanBlock()
74 NodeAddr<StmtNode*> SA = IA; in scanBlock()
89 NodeAddr<InstrNode*> IA) { in getLocalReachingDef()
90 NodeAddr<RefNode*> RA = L.getNearestAliasedRef(RefRR, IA); in getLocalReachingDef()
144 for (NodeAddr<DefNode*> DA : SA.Addr->members_if(DFG.IsDef, DFG)) { in run()
164 NodeAddr<InstrNode*> IA = UA.Addr->getOwner(DFG); in run()
176 << *NodeAddr<StmtNode*>(IA).Addr->getCode(); in run()
H A DRDFDeadCode.h59 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
60 void processDef(NodeAddr<DefNode*> DA, SetQueue<NodeId> &WorkQ);
61 void processUse(NodeAddr<UseNode*> UA, SetQueue<NodeId> &WorkQ);
H A DRDFCopy.h52 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
/openbsd-src/gnu/llvm/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp361 auto AnalyzeDef = [&](NodeAddr<DefNode *> SourceDef) { in getGadgetGraph()
363 std::function<void(NodeAddr<DefNode *>)> AnalyzeDefUseChain = in getGadgetGraph()
364 [&](NodeAddr<DefNode *> Def) { in getGadgetGraph()
374 NodeAddr<PhiNode *> Phi = Use.Addr->getOwner(DFG); in getGadgetGraph()
418 NodeAddr<InstrNode *> Owner{Use.Addr->getOwner(DFG)}; in getGadgetGraph()
471 NodeAddr<BlockNode *> EntryBlock = DFG.getFunc().Addr->getEntryBlock(DFG); in getGadgetGraph()
472 for (NodeAddr<PhiNode *> ArgPhi : in getGadgetGraph()
478 for (NodeAddr<BlockNode *> BA : DFG.getFunc().Addr->members(DFG)) { in getGadgetGraph()
479 for (NodeAddr<StmtNode *> SA : in getGadgetGraph()