Lines Matching refs:Region
123 static NodeRef getEntryNode(Region *R) { in getEntryNode()
124 return {GraphTraits<Region *>::getEntryNode(R), nullptr}; in getEntryNode()
246 Region *ParentRegion;
321 void init(Region *R);
322 bool run(Region *R, DominatorTree *DT);
323 bool makeUniformRegion(Region *R, UniformityInfo &UA);
339 bool runOnRegion(Region *R, RGPassManager &RGM) override { in runOnRegion()
380 Order.resize(std::distance(GraphTraits<Region *>::nodes_begin(ParentRegion), in INITIALIZE_PASS_DEPENDENCY()
381 GraphTraits<Region *>::nodes_end(ParentRegion))); in INITIALIZE_PASS_DEPENDENCY()
436 BasicBlock *Exit = N->getNodeAs<Region>()->getExit(); in analyzeLoops()
476 Region *R = RI->getRegionFor(P); in gatherPredicates()
808 Region *SubRegion = Node->getNodeAs<Region>(); in changeExit()
1064 static bool hasOnlyUniformBranches(Region *R, unsigned UniformMDKindID, in hasOnlyUniformBranches()
1095 for (auto *BB : E->getNodeAs<Region>()->blocks()) { in hasOnlyUniformBranches()
1121 void StructurizeCFG::init(Region *R) { in init()
1132 bool StructurizeCFG::makeUniformRegion(Region *R, UniformityInfo &UA) { in makeUniformRegion()
1168 bool StructurizeCFG::run(Region *R, DominatorTree *DT) { in run()
1209 static void addRegionIntoQueue(Region &R, std::vector<Region *> &Regions) { in addRegionIntoQueue()
1221 std::vector<Region *> Regions; in run()
1224 Region *R = Regions.back(); in run()