HomeSort by: relevance | last modified time | path
    Searched refs:NodeAddr (Results 1 - 11 of 11) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
RDFGraph.h 334 template <typename T> struct NodeAddr {
335 NodeAddr() = default;
336 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {}
340 template <typename S> NodeAddr(const NodeAddr<S> &NA)
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>
    [all...]
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,
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
RDFDeadCode.cpp 82 void DeadCodeElimination::scanInstr(NodeAddr<InstrNode*> IA,
86 if (!isLiveInstr(NodeAddr<StmtNode*>(IA).Addr->getCode()))
88 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) {
94 void DeadCodeElimination::processDef(NodeAddr<DefNode*> DA,
96 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG);
97 for (NodeAddr<UseNode*> UA : IA.Addr->members_if(DFG.IsUse, DFG)) {
101 for (NodeAddr<DefNode*> TA : DFG.getRelatedRefs(IA, DA))
105 void DeadCodeElimination::processUse(NodeAddr<UseNode*> UA,
107 for (NodeAddr<DefNode*> DA : LV.getAllReachingDefs(UA)) {
128 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)
    [all...]
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,
169 for (NodeAddr<UseNode *> UA : AddAslSN.Addr->members_if(DFG->IsUse, *DFG))
    [all...]
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);
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)) {
165 NodeAddr<StmtNode*> SA = TA;
166 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) {
189 void HexagonDCE::removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum) {
190 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode();
201 for (NodeAddr<RefNode*> RA : Refs)
206 for (NodeAddr<RefNode*> RA : Refs) {
215 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove)
    [all...]
RDFCopy.cpp 63 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) {
70 NodeAddr<BlockNode*> BA = DFG.findBlock(B);
72 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) {
74 NodeAddr<StmtNode*> SA = IA;
89 NodeAddr<InstrNode*> IA) {
90 NodeAddr<RefNode*> RA = L.getNearestAliasedRef(RefRR, IA);
144 for (NodeAddr<DefNode*> DA : SA.Addr->members_if(DFG.IsDef, DFG)) {
164 NodeAddr<InstrNode*> IA = UA.Addr->getOwner(DFG);
176 << *NodeAddr<StmtNode*>(IA).Addr->getCode();
RDFCopy.h 52 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RDFGraph.cpp 108 static void printRefHeader(raw_ostream &OS, const NodeAddr<RefNode*> RA,
116 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<DefNode*>> &P) {
133 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<UseNode*>> &P) {
145 const Print<NodeAddr<PhiUseNode*>> &P) {
159 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<RefNode*>> &P) {
208 for (NodeAddr<T> A : P.List) {
218 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<PhiNode*>> &P) {
224 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeAddr<StmtNode *>> &P) {
250 const Print<NodeAddr<InstrNode*>> &P) {
266 const Print<NodeAddr<BlockNode*>> &P)
    [all...]
RDFLiveness.cpp 110 NodeAddr<RefNode*> RefA, bool TopShadows, bool FullChain,
133 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef())
155 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef())
163 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* {
165 return NodeAddr<StmtNode*>(IA).Addr->getCode()->getParent();
167 NodeAddr<PhiNode*> PA = IA;
168 NodeAddr<BlockNode*> BA = PA.Addr->getOwner(DFG);
176 std::map<NodeId, NodeAddr<InstrNode*>> Owners;
184 NodeAddr<InstrNode*> IA = TA.Addr->getOwner(DFG);
192 NodeAddr<InstrNode*> OA = DFG.addr<InstrNode*>(A)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86LoadValueInjectionLoadHardening.cpp 361 auto AnalyzeDef = [&](NodeAddr<DefNode *> SourceDef) {
363 std::function<void(NodeAddr<DefNode *>)> AnalyzeDefUseChain =
364 [&](NodeAddr<DefNode *> Def) {
374 NodeAddr<PhiNode *> Phi = Use.Addr->getOwner(DFG);
418 NodeAddr<InstrNode *> Owner{Use.Addr->getOwner(DFG)};
471 NodeAddr<BlockNode *> EntryBlock = DFG.getFunc().Addr->getEntryBlock(DFG);
472 for (NodeAddr<PhiNode *> ArgPhi :
478 for (NodeAddr<BlockNode *> BA : DFG.getFunc().Addr->members(DFG)) {
479 for (NodeAddr<StmtNode *> SA :

Completed in 26 milliseconds