Lines Matching defs:RegInfos

149     RegInfos.push_back(RI);
153     assert(RegInfos.size() > 0 && "Empty CHRScope");
154     Region *Parent = RegInfos[0].R->getParent();
160     assert(RegInfos.size() > 0 && "Empty CHRScope");
161     return RegInfos.front().R->getEntry();
165     assert(RegInfos.size() > 0 && "Empty CHRScope");
166     return RegInfos.back().R->getExit();
177     Region *LastRegion = RegInfos.back().R;
187     assert(RegInfos.size() > 0 && "Empty CHRScope");
188     assert(Next->RegInfos.size() > 0 && "Empty CHRScope");
193     RegInfos.append(Next->RegInfos.begin(), Next->RegInfos.end());
200     for (RegInfo &RI : RegInfos)
214     assert(RegInfos.begin()->R != Boundary &&
217         RegInfos, [&Boundary](const RegInfo &RI) { return Boundary == RI.R; });
218     if (BoundaryIt == RegInfos.end())
220     ArrayRef<RegInfo> TailRegInfos(BoundaryIt, RegInfos.end());
233                      RegInfos,
242     RegInfos.erase(BoundaryIt, RegInfos.end());
249     for (const RegInfo &RI : RegInfos)
257   SmallVector<RegInfo, 8> RegInfos; // Regions that belong to this scope
283        : RegInfos(RegInfosIn), Subs(SubsIn), BranchInsertPoint(nullptr) {}
443   assert(RegInfos.size() > 0 && "Empty CHRScope");
445   OS << RegInfos.size() << ", Regions[";
446   for (const RegInfo &RI : RegInfos) {
454   if (RegInfos[0].R->getParent()) {
455     OS << "], Parent " << RegInfos[0].R->getParent()->getNameStr();
838         AddSelects(Result->RegInfos[0]);
872   RegInfo &RI = Scope->RegInfos[0];
1106   for (RegInfo &RI : Scope->RegInfos)
1147   SmallVector<RegInfo, 8> RegInfos(Scope->RegInfos);  // Copy
1148   for (RegInfo &RI : RegInfos) {
1157     if (RI.R == RegInfos[0].R) {
1289   for (RegInfo &RI : Scope->RegInfos) {
1335             Scope->RegInfos[0].R->getEntry()->getTerminator())
1374   for (RegInfo &RI : Scope->RegInfos) {
1380   for (RegInfo &RI : Scope->RegInfos) {
1419   return Scope1->RegInfos[0].R->getDepth() < Scope2->RegInfos[0].R->getDepth();
1558   for (RegInfo &RI : Scope->RegInfos) {
1676   assert(Scope->RegInfos.size() >= 1 && "Should have at least one Region");
1678   for (RegInfo &RI : Scope->RegInfos) {
1694   for (RegInfo &RI : Scope->RegInfos) {
1698   Region *FirstRegion = Scope->RegInfos[0].R;
1700   Region *LastRegion = Scope->RegInfos[Scope->RegInfos.size() - 1].R;
1772   for (RegInfo &RI : Scope->RegInfos)