reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
182 if ((DFG->IsDef(AA) && AA.Id != OffsetRegRD) || 262 NodeId id = PA.Id; 306 if ((DFG->IsDef(AA) && AA.Id != LRExtRegRD) ||lib/Target/Hexagon/HexagonRDFOpt.cpp
166 R2I.insert(std::make_pair(RA.Id, SA.Id)); 166 R2I.insert(std::make_pair(RA.Id, SA.Id)); 167 if (DFG.IsDef(RA) && DeadNodes.count(RA.Id)) 168 if (!DeadInstrs.count(SA.Id)) 169 PartlyDead.insert(SA.Id); 201 OpMap.insert(std::make_pair(RA.Id, getOpNum(RA.Addr->getOp()))); 206 unsigned N = OpMap[RA.Id]; 253 return getDeadNodes().count(DA.Id); 268 Remove.insert(D.Id);lib/Target/Hexagon/RDFCopy.cpp
64 CopyMap.insert(std::make_pair(SA.Id, EM)); 65 Copies.push_back(SA.Id); 91 if (RA.Id != 0) { 93 return RA.Id; 139 auto FS = CopyMap.find(SA.Id); 184 UA.Addr->linkToDef(UA.Id, DFG.addr<DefNode*>(AtCopy)); 197 auto FC = CopyMap.find(IA.Id);lib/Target/Hexagon/RDFDeadCode.cpp
89 if (!LiveNodes.count(RA.Id)) 90 WorkQ.push_back(RA.Id); 98 if (!LiveNodes.count(UA.Id)) 99 WorkQ.push_back(UA.Id); 102 LiveNodes.insert(TA.Id); 108 if (!LiveNodes.count(DA.Id)) 109 WorkQ.push_back(DA.Id); 152 if (LiveNodes.count(DA.Id)) 160 if (!LiveNodes.count(RA.Id)) 161 DeadNodes.insert(RA.Id); 166 DeadInstrs.insert(IA.Id); 215 return A.Id < B.Id; 215 return A.Id < B.Id;lib/Target/Hexagon/RDFGraph.cpp
110 OS << Print<NodeId>(RA.Id, G) << '<' 177 OS << Print<NodeId>(I.Id, P.G); 219 OS << Print<NodeId>(P.Obj.Id, P.G) << ": phi [" 227 OS << Print<NodeId>(P.Obj.Id, P.G) << ": " << P.G.getTII().getName(Opc); 259 OS << "instr? " << Print<NodeId>(P.Obj.Id, P.G); 279 OS << Print<NodeId>(P.Obj.Id, P.G) << ": --- " << printMBBReference(*BB) 299 OS << "DFG dump:[\n" << Print<NodeId>(P.Obj.Id, P.G) << ": Function: " 323 OS << Print<NodeId>(I->Id, P.G) 399 if (Next != NA.Id) { 400 Next = NA.Id; 447 Ref.RD = DA.Id; 454 Ref.RD = DA.Id; 476 if (ML.Id != 0) { 479 Code.FirstM = NA.Id; 483 Code.LastM = NA.Id; 490 if (Code.LastM == MA.Id) 491 Code.LastM = NA.Id; 497 assert(MA.Id != 0); 500 if (MA.Id == NA.Id) { 500 if (MA.Id == NA.Id) { 501 if (Code.LastM == MA.Id) { 513 if (MX == NA.Id) { 517 if (Code.LastM == NA.Id) 518 Code.LastM = MA.Id; 548 if (M.Id == 0) { 557 Code.FirstM = PA.Id; 558 PA.Addr->setNext(M.Id); 818 PUA.Addr->setPredecessor(PredB.Id); 1047 if (Visited.count(DA.Id)) 1068 Visited.insert(T.Id); 1093 if (Visited.count(DA.Id)) 1122 Visited.insert(T.Id); 1130 assert(IA.Id != 0 && RA.Id != 0); 1130 assert(IA.Id != 0 && RA.Id != 0); 1133 NodeId Start = RA.Id; 1137 } while (RA.Id != 0 && RA.Id != Start); 1137 } while (RA.Id != 0 && RA.Id != Start); 1156 assert(IA.Id != 0 && RA.Id != 0); 1156 assert(IA.Id != 0 && RA.Id != 0); 1195 assert(IA.Id != 0 && RA.Id != 0); 1195 assert(IA.Id != 0 && RA.Id != 0); 1198 NodeId Start = RA.Id; 1201 if (NA.Id == 0 || NA.Id == Start) 1201 if (NA.Id == 0 || NA.Id == Start) 1208 if (NA.Id != 0 && NA.Id != Start) 1208 if (NA.Id != 0 && NA.Id != Start) 1217 assert(IA.Id != 0 && RA.Id != 0); 1217 assert(IA.Id != 0 && RA.Id != 0); 1224 if (Loc.second.Id != 0 || !Create) 1238 assert(IA.Id != 0 && RA.Id != 0); 1238 assert(IA.Id != 0 && RA.Id != 0); 1417 PhiM[DBA.Id].insert(Defs.begin(), Defs.end()); 1427 auto HasDF = PhiM.find(BA.Id); 1522 PhiQ.insert(P.Id); 1541 PhiQ.remove(PA.Id); 1550 PhiQ.insert(OA.Id); 1593 if (TAP.Id == 0) { 1602 TAP.Addr->linkToDef(TAP.Id, RDA); 1645 markBlock(BA.Id, DefM); 1689 return PUA.Addr->getPredecessor() == BA.Id; 1703 assert(RA.Id != 0); 1717 releaseBlock(BA.Id, DefM); 1732 if (TA.Id == UA.Id) { 1732 if (TA.Id == UA.Id) { 1737 while (TA.Id != 0) { 1739 if (S == UA.Id) { 1806 if (TA.Id == DA.Id) { 1806 if (TA.Id == DA.Id) { 1813 while (TA.Id != 0) { 1815 if (S == DA.Id) { 1827 RDA.Addr->setReachedDef(ReachedDefs.front().Id); 1833 RDA.Addr->setReachedUse(ReachedUses.front().Id);lib/Target/Hexagon/RDFGraph.h
341 : Addr(static_cast<T>(NA.Addr)), Id(NA.Id) {} 344 assert((Addr == NA.Addr) == (Id == NA.Id)); 722 return (P.Addr == nullptr) && (N == 0 || P.Id == N); 916 if (M.Id == 0)lib/Target/Hexagon/RDFLiveness.cpp
124 NodeId Start = RefA.Id; 164 Defs.insert(TA.Id); 165 Owners.insert(TA.Addr->getOwner(DFG).Id); 228 Defs.count(TA.Id); 295 TmpDefs.insert(R.Id); 300 Result.insert(DA.Id); 304 if (Visited.count(PA.Id)) 306 Visited.insert(PA.Id); 326 NodeId FindId = IA.Id; 330 return T.Id == FindId; 355 if (Clob.Id != 0) 357 if (Use.Id != 0) 368 if (!BA.Id) 445 RefMap &RealUses = RealUseMap[PhiA.Id]; 457 DefQ.insert(R.Id); 458 PhiDefs.insert(R.Id); 460 PhiDRs.insert(std::make_pair(PhiA.Id, DRs)); 478 RealUses[R.Reg].insert({A.Id,R.Mask}); 494 DefQ.insert(T.Id); 526 if (PhiDefs.count(DA.Id)) 543 PhiUQ.push_back(PhiA.Id); 553 if (!DFG.IsRef<NodeAttrs::Use>(I) || SeenUses.count(I.Id)) 565 NodeId RP = D.Addr->getOwner(DFG).Id; 566 std::map<NodeId,RegisterAggr> &M = PhiUp[PUA.Id]; 577 SeenUses.insert(T.Id); 618 RefMap &RUM = RealUseMap[PA.Id]; 621 std::map<NodeId,RegisterAggr> &PUM = PhiUp[UA.Id]; 690 NBMap.insert(std::make_pair(RA.Id, BB)); 691 NBMap.insert(std::make_pair(IA.Id, BB)); 728 for (const RefMap::value_type &S : RealUseMap[P.Id]) 745 RefMap &RUs = RealUseMap[PA.Id]; 751 if (!SeenUses.insert(U.Id).second) 784 LOX[S.Reg].insert({D.Id, TM}); 790 SeenUses.insert(T.Id); 1045 NewDefs.insert({TA.Id,T.Mask}); 1078 if (getBlockWithRef(D.Id) != B) 1079 LiveIn[RR.Reg].insert({D.Id,RR.Mask});