• Home
  • Raw
  • Download

Lines Matching refs:RegInfos

180     RegInfos.push_back(RI);  in CHRScope()
184 assert(RegInfos.size() > 0 && "Empty CHRScope"); in getParentRegion()
185 Region *Parent = RegInfos[0].R->getParent(); in getParentRegion()
191 assert(RegInfos.size() > 0 && "Empty CHRScope"); in getEntryBlock()
192 return RegInfos.front().R->getEntry(); in getEntryBlock()
196 assert(RegInfos.size() > 0 && "Empty CHRScope"); in getExitBlock()
197 return RegInfos.back().R->getExit(); in getExitBlock()
208 Region *LastRegion = RegInfos.back().R; in appendable()
218 assert(RegInfos.size() > 0 && "Empty CHRScope"); in append()
219 assert(Next->RegInfos.size() > 0 && "Empty CHRScope"); in append()
224 RegInfos.append(Next->RegInfos.begin(), Next->RegInfos.end()); in append()
231 for (RegInfo &RI : RegInfos) in addSub()
245 assert(RegInfos.begin()->R != Boundary && in split()
248 RegInfos, [&Boundary](const RegInfo &RI) { return Boundary == RI.R; }); in split()
249 if (BoundaryIt == RegInfos.end()) in split()
251 ArrayRef<RegInfo> TailRegInfos(BoundaryIt, RegInfos.end()); in split()
263 assert(llvm::find_if(RegInfos, in split()
266 }) != RegInfos.end() && in split()
274 RegInfos.erase(BoundaryIt, RegInfos.end()); in split()
281 for (const RegInfo &RI : RegInfos) in contains()
289 SmallVector<RegInfo, 8> RegInfos; // Regions that belong to this scope member in __anon3b0d276f0211::CHRScope
315 : RegInfos(RegInfosIn.begin(), RegInfosIn.end()), in CHRScope()
468 assert(RegInfos.size() > 0 && "Empty CHRScope"); in print()
470 OS << RegInfos.size() << ", Regions["; in print()
471 for (const RegInfo &RI : RegInfos) { in print()
479 if (RegInfos[0].R->getParent()) { in print()
480 OS << "], Parent " << RegInfos[0].R->getParent()->getNameStr(); in print()
854 AddSelects(Result->RegInfos[0]); in findScope()
888 RegInfo &RI = Scope->RegInfos[0]; in checkScopeHoistable()
1123 for (RegInfo &RI : Scope->RegInfos) in getSelectsInScope()
1164 SmallVector<RegInfo, 8> RegInfos(Scope->RegInfos); // Copy in splitScope() local
1165 for (RegInfo &RI : RegInfos) { in splitScope()
1174 if (RI.R == RegInfos[0].R) { in splitScope()
1306 for (RegInfo &RI : Scope->RegInfos) { in classifyBiasedScopes()
1352 Scope->RegInfos[0].R->getEntry()->getTerminator()) in filterScopes()
1391 for (RegInfo &RI : Scope->RegInfos) { in setCHRRegions()
1397 for (RegInfo &RI : Scope->RegInfos) { in setCHRRegions()
1436 return Scope1->RegInfos[0].R->getDepth() < Scope2->RegInfos[0].R->getDepth(); in CHRScopeSorter()
1575 for (RegInfo &RI : Scope->RegInfos) { in insertTrivialPHIs()
1693 assert(Scope->RegInfos.size() >= 1 && "Should have at least one Region"); in transformScopes()
1694 Region *FirstRegion = Scope->RegInfos[0].R; in transformScopes()
1696 Region *LastRegion = Scope->RegInfos[Scope->RegInfos.size() - 1].R; in transformScopes()
1768 for (RegInfo &RI : Scope->RegInfos) in cloneScopeBlocks()