123   static NodeRef getEntryNode(Region *R) {  in getEntryNode()
124     return {GraphTraits<Region *>::getEntryNode(R), nullptr};  in getEntryNode()
246   Region *ParentRegion;
313   void init(Region *R);
314   bool run(Region *R, DominatorTree *DT);
315   bool makeUniformRegion(Region *R, LegacyDivergenceAnalysis *DA);
331   bool runOnRegion(Region *R, RGPassManager &RGM) override {  in runOnRegion()
373   Order.resize(std::distance(GraphTraits<Region *>::nodes_begin(ParentRegion),  in INITIALIZE_PASS_DEPENDENCY()
374                              GraphTraits<Region *>::nodes_end(ParentRegion)));  in INITIALIZE_PASS_DEPENDENCY()
429     BasicBlock *Exit = N->getNodeAs<Region>()->getExit();  in analyzeLoops()
469     Region *R = RI->getRegionFor(P);  in gatherPredicates()
692     Region *SubRegion = Node->getNodeAs<Region>();  in changeExit()
950 static bool hasOnlyUniformBranches(Region *R, unsigned UniformMDKindID,  in hasOnlyUniformBranches()
981       for (auto BB : E->getNodeAs<Region>()->blocks()) {  in hasOnlyUniformBranches()
1007 void StructurizeCFG::init(Region *R) {  in init()
1018 bool StructurizeCFG::makeUniformRegion(Region *R,  in makeUniformRegion()
1054 bool StructurizeCFG::run(Region *R, DominatorTree *DT) {  in run()
1090 static void addRegionIntoQueue(Region &R, std::vector<Region *> &Regions) {  in addRegionIntoQueue()
1102   std::vector<Region *> Regions;  in run()
1105     Region *R = Regions.back();  in run()