/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
H A D | RDFGraph.h | 334 template <typename T> struct NodeAddr { struct 335 NodeAddr() = default; 336 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} in NodeAddr() function 340 template <typename S> NodeAddr(const NodeAddr<S> &NA) in NodeAddr() function 343 bool operator== (const NodeAddr<T> &NA) const { 347 bool operator!= (const NodeAddr<T> &NA) const { 391 NodeAddr<NodeBase*> New(); 464 void append(NodeAddr<NodeBase*> NA); 512 using NodeList = SmallVector<NodeAddr<NodeBase *>, 4>; 553 NodeAddr<RefNode*> getNextRef(RegisterRef RR, Predicate P, bool NextOnly, [all …]
|
H A D | RDFLiveness.h | 83 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,
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
H A D | RDFGraph.cpp | 108 static void printRefHeader(raw_ostream &OS, const NodeAddr<RefNode*> RA, in printRefHeader() 116 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<DefNode*>> &P) { in operator <<() 133 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<UseNode*>> &P) { in operator <<() 145 const Print<NodeAddr<PhiUseNode*>> &P) { in operator <<() 159 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<RefNode*>> &P) { in operator <<() 208 for (NodeAddr<T> A : P.List) { in operator <<() 218 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<PhiNode*>> &P) { in operator <<() 224 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeAddr<StmtNode *>> &P) { in operator <<() 250 const Print<NodeAddr<InstrNode*>> &P) { in operator <<() 266 const Print<NodeAddr<BlockNode*>> &P) { in operator <<() [all …]
|
H A D | RDFLiveness.cpp | 110 NodeAddr<RefNode*> RefA, bool TopShadows, bool FullChain, in getAllReachingDefs() 133 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs() 155 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs() 163 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* { in getAllReachingDefs() 165 return NodeAddr<StmtNode*>(IA).Addr->getCode()->getParent(); in getAllReachingDefs() 167 NodeAddr<PhiNode*> PA = IA; in getAllReachingDefs() 168 NodeAddr<BlockNode*> BA = PA.Addr->getOwner(DFG); in getAllReachingDefs() 176 std::map<NodeId, NodeAddr<InstrNode*>> Owners; in getAllReachingDefs() 184 NodeAddr<InstrNode*> IA = TA.Addr->getOwner(DFG); in getAllReachingDefs() 192 NodeAddr<InstrNode*> OA = DFG.addr<InstrNode*>(A); in getAllReachingDefs() [all …]
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
H A D | RDFDeadCode.cpp | 82 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 D | HexagonOptAddrMode.cpp | 91 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, 158 bool HexagonOptAddrMode::canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, in canRemoveAddasl() 169 for (NodeAddr<UseNode *> UA : AddAslSN.Addr->members_if(DFG->IsUse, *DFG)) { in canRemoveAddasl() [all …]
|
H A D | HexagonRDFOpt.cpp | 95 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 D | RDFCopy.cpp | 63 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 D | RDFDeadCode.h | 59 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 D | RDFCopy.h | 52 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM); 54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
H A D | X86LoadValueInjectionLoadHardening.cpp | 361 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()
|