Searched refs:Region (Results 1 – 12 of 12) sorted by relevance
42 class Region; variable142 class Region : public SeaNode {144 explicit Region(): in Region() function176 void SetIDominator(Region* dom) { in SetIDominator()180 Region* GetIDominator() const { in GetIDominator()184 void AddToIDominatedSet(Region* dominated) { in AddToIDominatedSet()188 const std::set<Region*>* GetIDominatedSet() { in GetIDominatedSet()192 void AddToDominanceFrontier(Region* df_reg) { in AddToDominanceFrontier()197 std::set<Region*>* GetDominanceFrontier() { in GetDominanceFrontier()214 Region* predecessor);[all …]
32 void IRVisitor::Traverse(Region* region) { in Traverse()46 for (std::vector<Region*>::const_iterator cit = ordered_regions_.begin(); in Traverse()56 void SeaGraph::AddEdge(Region* src, Region* dst) const { in AddEdge()61 void SeaGraph::ComputeRPO(Region* current_region, int& current_rpo) { in ComputeRPO()63 std::vector<sea_ir::Region*>* succs = current_region->GetSuccessors(); in ComputeRPO()64 for (std::vector<sea_ir::Region*>::iterator succ_it = succs->begin(); in ComputeRPO()78 std::vector<Region*>::iterator crt_it; in ComputeIDominators()79 std::set<Region*> processedNodes; in ComputeIDominators()92 Region* new_dom = NULL; in ComputeIDominators()93 std::vector<Region*>* preds = (*crt_it)->GetPredecessors(); in ComputeIDominators()[all …]
28 sea_ir::Region* root = sg.GetNewRegion(); in TEST_F()29 sea_ir::Region* then_region = sg.GetNewRegion(); in TEST_F()30 sea_ir::Region* else_region = sg.GetNewRegion(); in TEST_F()31 std::vector<sea_ir::Region*>* regions = sg.GetRegions(); in TEST_F()38 std::vector<sea_ir::Region*>* succs = root->GetSuccessors(); in TEST_F()41 std::vector<sea_ir::Region*>* preds = then_region->GetPredecessors(); in TEST_F()
23 class Region; variable47 void AddSuccessor(Region* successor);48 void AddPredecessor(Region* predecesor);
23 class Region; variable47 virtual void Visit(Region* region) = 0;66 virtual void Traverse(Region* region);84 std::vector<Region*> ordered_regions_;
87 Region* GetRegion() { in GetRegion()92 void SetRegion(Region* region) { in SetRegion()106 Region* region_;
30 Region* r = phi->GetRegion(); in Visit()31 const std::vector<Region*>* predecessors = r->GetPredecessors(); in Visit()40 Region* root_region; in Initialize()42 for (std::vector<Region*>::const_iterator cit = graph->GetRegions()->begin(); in Initialize()50 Region* current_region = ordered_regions_.at(id); in Initialize()51 const std::set<Region*>* dominated_regions = current_region->GetIDominatedSet(); in Initialize()52 for (std::set<Region*>::const_iterator cit = dominated_regions->begin(); in Initialize()97 std::vector<Region*>* regions = &ordered_regions_; in Visit()100 for (std::vector<Region*>::const_iterator cit = regions->begin(); cit != regions->end(); cit++) { in Visit()107 void CodeGenPrepassVisitor::Visit(Region* region) { in Visit()[all …]
41 llvm::BasicBlock* GetBlock(Region* region) { in GetBlock()49 void AddBlock(Region* region, llvm::BasicBlock* block) { in AddBlock()108 void Visit(Region* region);132 void Visit(Region* region);153 void Visit(Region* region);
25 Region* root_region; in Initialize()27 for (std::vector<Region*>::const_iterator cit = graph->GetRegions()->begin(); in Initialize()35 Region* current_region = ordered_regions_.at(id); in Initialize()36 const std::set<Region*>* dominated_regions = current_region->GetIDominatedSet(); in Initialize()37 for (std::set<Region*>::const_iterator cit = dominated_regions->begin(); in Initialize()118 void DotGenerationVisitor::Visit(Region* region) { in Visit()139 std::vector<Region*>* successors = region->GetSuccessors(); in Visit()140 for (std::vector<Region*>::const_iterator cit = successors->begin(); cit != successors->end(); in Visit()
56 void Visit(Region* region);
144 std::vector<Region*>* regions = graph->GetRegions(); in ComputeTypes()147 for (std::vector<Region*>::const_iterator region_it = regions->begin(); in ComputeTypes()
44 void Visit(Region* region) { } in Visit()