Home
last modified time | relevance | path

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

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRDFGraph.h340 template <typename S> NodeAddr(const NodeAddr<S> &NA) in NodeAddr() function
756 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
758 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
820 NodeAddr<UseNode*> newUse(NodeAddr<InstrNode*> Owner,
822 NodeAddr<PhiUseNode*> newPhiUse(NodeAddr<PhiNode*> Owner,
825 NodeAddr<DefNode*> newDef(NodeAddr<InstrNode*> Owner,
827 NodeAddr<DefNode*> newDef(NodeAddr<InstrNode*> Owner,
829 NodeAddr<PhiNode*> newPhi(NodeAddr<BlockNode*> Owner);
830 NodeAddr<StmtNode*> newStmt(NodeAddr<BlockNode*> Owner,
832 NodeAddr<BlockNode*> newBlock(NodeAddr<FuncNode*> Owner,
[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,
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DRDFGraph.cpp808 NodeAddr<UseNode*> DataFlowGraph::newUse(NodeAddr<InstrNode*> Owner, in newUse()
815 NodeAddr<PhiUseNode*> DataFlowGraph::newPhiUse(NodeAddr<PhiNode*> Owner, in newPhiUse()
824 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner, in newDef()
831 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner, in newDef()
839 NodeAddr<PhiNode*> DataFlowGraph::newPhi(NodeAddr<BlockNode*> Owner) { in newPhi()
845 NodeAddr<StmtNode*> DataFlowGraph::newStmt(NodeAddr<BlockNode*> Owner, in newStmt()
853 NodeAddr<BlockNode*> DataFlowGraph::newBlock(NodeAddr<FuncNode*> Owner, in newBlock()
1189 std::pair<NodeAddr<RefNode*>,NodeAddr<RefNode*>>
1212 NodeAddr<RefNode*> DataFlowGraph::getNextShadow(NodeAddr<InstrNode*> IA, in getNextShadow()
1563 void DataFlowGraph::linkRefUp(NodeAddr<InstrNode*> IA, NodeAddr<T> TA, in linkRefUp()
[all …]
H A DRDFLiveness.cpp167 NodeAddr<PhiNode*> PA = IA; in getAllReachingDefs()
290 for (NodeAddr<DefNode*> DA : Ds) { in getAllReachingDefs()
334 for (NodeAddr<NodeBase*> R : RDs) in getAllReachingDefsRecImpl()
339 for (NodeAddr<DefNode*> DA : RDs) { in getAllReachingDefsRecImpl()
363 NodeAddr<InstrNode*> IA) { in getNearestAliasedRef()
380 NodeAddr<RefNode*> Clob, Use; in getNearestAliasedRef()
403 BA = NodeAddr<BlockNode*>(); in getNearestAliasedRef()
416 return NodeAddr<RefNode*>(); in getNearestAliasedRef()
595 NodeAddr<PhiUseNode*> PUA = I; in computePhiInfo()
810 NodeAddr<PhiUseNode*> PUA = U; in computeLiveIns()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DRDFDeadCode.cpp88 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()
101 for (NodeAddr<DefNode*> TA : DFG.getRelatedRefs(IA, DA)) in processDef()
129 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) in collect()
150 auto IsDead = [this] (NodeAddr<InstrNode*> IA) -> bool { in collect()
159 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) in collect()
208 auto UsesFirst = [] (NodeAddr<RefNode*> A, NodeAddr<RefNode*> B) -> bool { in erase()
220 for (NodeAddr<RefNode*> RA : DRNs) { in erase()
230 for (NodeAddr<InstrNode*> IA : DINs) { in erase()
[all …]
H A DHexagonOptAddrMode.cpp91 bool processBlock(NodeAddr<BlockNode *> BA);
178 NodeAddr<UseNode *> UA = *I; in canRemoveAddasl()
215 NodeAddr<UseNode *> UN = *I; in allValidCandidates()
300 NodeAddr<UseNode *> UA = *I; in isSafeToExtLR()
354 NodeAddr<UseNode *> UN = *I; in processAddUses()
394 NodeAddr<UseNode *> UseN = *I; in processAddUses()
441 NodeAddr<UseNode *> UN = *I; in analyzeUses()
616 NodeAddr<UseNode *> UseUN = *I; in changeAddAsl()
695 NodeAddr<StmtNode *> SA = IA; in processBlock()
745 NodeAddr<UseNode *> UseN = *I; in processBlock()
[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()
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()
219 MachineInstr &MI = *NodeAddr<StmtNode*>(IA).Addr->getCode(); in rewrite()
253 auto IsDead = [this] (NodeAddr<DefNode*> DA) -> bool { 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);
/freebsd-13.1/contrib/llvm-project/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()