reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
178 RegInfos.push_back(RI); 182 assert(RegInfos.size() > 0 && "Empty CHRScope"); 183 Region *Parent = RegInfos[0].R->getParent(); 189 assert(RegInfos.size() > 0 && "Empty CHRScope"); 190 return RegInfos.front().R->getEntry(); 194 assert(RegInfos.size() > 0 && "Empty CHRScope"); 195 return RegInfos.back().R->getExit(); 206 Region *LastRegion = RegInfos.back().R; 216 assert(RegInfos.size() > 0 && "Empty CHRScope"); 217 assert(Next->RegInfos.size() > 0 && "Empty CHRScope"); 222 for (RegInfo &RI : Next->RegInfos) 223 RegInfos.push_back(RI); 231 for (RegInfo &RI : RegInfos) 245 assert(RegInfos.begin()->R != Boundary && 247 auto BoundaryIt = std::find_if(RegInfos.begin(), RegInfos.end(), 247 auto BoundaryIt = std::find_if(RegInfos.begin(), RegInfos.end(), 251 if (BoundaryIt == RegInfos.end()) 255 TailRegInfos.insert(TailRegInfos.begin(), BoundaryIt, RegInfos.end()); 256 RegInfos.resize(BoundaryIt - RegInfos.begin()); 256 RegInfos.resize(BoundaryIt - RegInfos.begin()); 268 assert(std::find_if(RegInfos.begin(), RegInfos.end(), 268 assert(std::find_if(RegInfos.begin(), RegInfos.end(), 271 }) != RegInfos.end() && 282 for (const RegInfo &RI : RegInfos) 470 assert(RegInfos.size() > 0 && "Empty CHRScope"); 472 OS << RegInfos.size() << ", Regions["; 473 for (const RegInfo &RI : RegInfos) { 481 if (RegInfos[0].R->getParent()) { 482 OS << "], Parent " << RegInfos[0].R->getParent()->getNameStr(); 854 AddSelects(Result->RegInfos[0]); 888 RegInfo &RI = Scope->RegInfos[0]; 1124 for (RegInfo &RI : Scope->RegInfos) 1165 SmallVector<RegInfo, 8> RegInfos(Scope->RegInfos); // Copy 1307 for (RegInfo &RI : Scope->RegInfos) { 1353 Scope->RegInfos[0].R->getEntry()->getTerminator()) 1392 for (RegInfo &RI : Scope->RegInfos) { 1398 for (RegInfo &RI : Scope->RegInfos) { 1437 return Scope1->RegInfos[0].R->getDepth() < Scope2->RegInfos[0].R->getDepth(); 1437 return Scope1->RegInfos[0].R->getDepth() < Scope2->RegInfos[0].R->getDepth(); 1577 for (RegInfo &RI : Scope->RegInfos) { 1698 assert(Scope->RegInfos.size() >= 1 && "Should have at least one Region"); 1699 Region *FirstRegion = Scope->RegInfos[0].R; 1701 Region *LastRegion = Scope->RegInfos[Scope->RegInfos.size() - 1].R; 1701 Region *LastRegion = Scope->RegInfos[Scope->RegInfos.size() - 1].R; 1773 for (RegInfo &RI : Scope->RegInfos)