Lines Matching defs:exit
9 // Detects single entry single exit regions in the control flow graph.
54 Region::Region(BasicBlock *Entry, BasicBlock *Exit, RegionInfo* RInfo,
56 : RegionNode(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
74 assert(exit && "No exit to replace!");
75 exit = BB;
116 BasicBlock *entry = getEntry(), *exit = getExit();
119 if (!exit)
123 && !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
184 BasicBlock *exit = getExit();
188 if (!exit)
191 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE;
237 BasicBlock *entry = getEntry(), *exit = getExit();
240 if (!contains(*SI) && exit != *SI)
250 BasicBlock *exit = getExit();
257 if (*SI != exit && visited->find(*SI) == visited->end())
385 assert(I != children.end() && "Region does not exit. Unable to remove.");
400 unsigned NumSuccessors = exit->getTerminator()->getNumSuccessors();
410 Region *R = RI->getRegionFor(exit);
412 if (R->getEntry() != exit) {
413 if (exit->getTerminator()->getNumSuccessors() == 1)
414 return new Region(getEntry(), *succ_begin(exit), RI, DT);
419 while (R->getParent() && R->getParent()->getEntry() == exit)
486 BasicBlock *exit) const {
489 if (DT->dominates(entry, P) && !DT->dominates(exit, P))
495 bool RegionInfo::isRegion(BasicBlock *entry, BasicBlock *exit) const {
496 assert(entry && exit && "entry and exit must not be null!");
501 // Exit is the header of a loop that contains the entry. In this case,
502 // the dominance frontier must only contain the exit.
503 if (!DT->dominates(entry, exit)) {
506 if (*SI != exit && *SI != entry)
512 DST *exitSuccs = &DF->find(exit)->second;
517 if (*SI == exit || *SI == entry)
521 if (!isCommonDomFrontier(*SI, entry, exit))
528 if (DT->properlyDominates(entry, *SI) && *SI != exit)
535 void RegionInfo::insertShortCut(BasicBlock *entry, BasicBlock *exit,
537 assert(entry && exit && "entry and exit must not be null!");
539 BBtoBBMap::iterator e = ShortCut->find(exit);
542 // No further region at exit available.
543 (*ShortCut)[entry] = exit;
545 // We found a region e that starts at exit. Therefore (entry, e->second)
546 // is also a region, that is larger than (entry, exit). Insert the
563 bool RegionInfo::isTrivialRegion(BasicBlock *entry, BasicBlock *exit) const {
564 assert(entry && exit && "entry and exit must not be null!");
568 if (num_successors <= 1 && exit == *(succ_begin(entry)))
581 exit) {
582 assert(entry && exit && "entry and exit must not be null!");
584 if (isTrivialRegion(entry, exit))
587 Region *region = new Region(entry, exit, this, DT);
614 BasicBlock *exit = N->getBlock();
616 if (!exit)
619 if (isRegion(entry, exit)) {
620 Region *newRegion = createRegion(entry, exit);
626 lastExit = exit;
630 if (!DT->dominates(entry, exit))
664 // Passed region exit
701 // ShortCut a function where for every BB the exit of the largest region
764 BasicBlock *Exit = nullptr;
772 // Get the single exit of BB.
774 Exit = R->getExit();
776 Exit = *succ_begin(BB);
777 else // No single exit exists.
778 return Exit;
780 // Get largest region that starts at Exit.
781 Region *ExitR = getRegionFor(Exit);
783 && ExitR->getParent()->getEntry() == Exit)
786 for (pred_iterator PI = pred_begin(Exit), PE = pred_end(Exit); PI != PE;
792 if (DT->dominates(Exit, BB))
795 BB = Exit;
798 return Exit;
853 "Detect single entry single exit regions", true, true)
858 "Detect single entry single exit regions", true, true)
