Lines Matching refs:BBStates

525                           DenseMap<const BasicBlock *, BBState> &BBStates,
531 DenseMap<const BasicBlock *, BBState> &BBStates,
538 BasicBlock *BB, DenseMap<const BasicBlock *, BBState> &BBStates,
542 bool Visit(Function &F, DenseMap<const BasicBlock *, BBState> &BBStates,
551 bool PairUpRetainsAndReleases(DenseMap<const BasicBlock *, BBState> &BBStates,
560 bool PerformCodePlacement(DenseMap<const BasicBlock *, BBState> &BBStates,
1240 DenseMap<const BasicBlock *, BBState> &BBStates, in CheckForCFGHazards() argument
1267 BBStates.find(Succ); in CheckForCFGHazards()
1268 assert(BBI != BBStates.end()); in CheckForCFGHazards()
1396 DenseMap<const BasicBlock *, BBState> &BBStates, in VisitBottomUp() argument
1401 BBState &MyStates = BBStates[BB]; in VisitBottomUp()
1409 DenseMap<const BasicBlock *, BBState>::iterator I = BBStates.find(Succ); in VisitBottomUp()
1410 assert(I != BBStates.end()); in VisitBottomUp()
1415 I = BBStates.find(Succ); in VisitBottomUp()
1416 assert(I != BBStates.end()); in VisitBottomUp()
1422 << BBStates[BB] << "\n" in VisitBottomUp()
1455 LLVM_DEBUG(dbgs() << "\nFinal State:\n" << BBStates[BB] << "\n"); in VisitBottomUp()
1579 BasicBlock *BB, DenseMap<const BasicBlock *, BBState> &BBStates, in VisitTopDown() argument
1585 BBState &MyStates = BBStates[BB]; in VisitTopDown()
1593 DenseMap<const BasicBlock *, BBState>::iterator I = BBStates.find(Pred); in VisitTopDown()
1594 assert(I != BBStates.end()); in VisitTopDown()
1599 I = BBStates.find(Pred); in VisitTopDown()
1600 assert(I != BBStates.end()); in VisitTopDown()
1615 << BBStates[BB] << "\n" in VisitTopDown()
1634 << BBStates[BB] << "\n\n"); in VisitTopDown()
1635 CheckForCFGHazards(BB, BBStates, MyStates); in VisitTopDown()
1636 LLVM_DEBUG(dbgs() << "Final State:\n" << BBStates[BB] << "\n"); in VisitTopDown()
1645 DenseMap<const BasicBlock *, BBState> &BBStates) { in ComputePostOrders() argument
1656 BBState &MyStates = BBStates[EntryBB]; in ComputePostOrders()
1672 BBStates[CurrBB].addSucc(SuccBB); in ComputePostOrders()
1673 BBState &SuccStates = BBStates[SuccBB]; in ComputePostOrders()
1680 BBStates[CurrBB].addSucc(SuccBB); in ComputePostOrders()
1681 BBStates[SuccBB].addPred(CurrBB); in ComputePostOrders()
1696 BBState &MyStates = BBStates[&ExitBB]; in ComputePostOrders()
1706 BBState::edge_iterator PE = BBStates[PredStack.back().first].pred_end(); in ComputePostOrders()
1710 PredStack.push_back(std::make_pair(BB, BBStates[BB].pred_begin())); in ComputePostOrders()
1721 DenseMap<const BasicBlock *, BBState> &BBStates, in Visit() argument
1733 BBStates); in Visit()
1738 BottomUpNestingDetected |= VisitBottomUp(BB, BBStates, Retains); in Visit()
1751 VisitTopDown(BB, BBStates, Releases, ReleaseInsertPtToRCIdentityRoots); in Visit()
1825 DenseMap<const BasicBlock *, BBState> &BBStates, in PairUpRetainsAndReleases() argument
1872 const BBState &NRRBBState = BBStates[NewRetainRelease->getParent()]; in PairUpRetainsAndReleases()
1903 const BBState &RIPBBState = BBStates[RIP->getParent()]; in PairUpRetainsAndReleases()
1944 const BBState &NRRBBState = BBStates[NewReleaseRetain->getParent()]; in PairUpRetainsAndReleases()
1960 const BBState &RIPBBState = BBStates[RIP->getParent()]; in PairUpRetainsAndReleases()
2024 DenseMap<const BasicBlock *, BBState> &BBStates, in PerformCodePlacement() argument
2064 BBStates, Retains, Releases, M, Retain, DeadInsts, in PerformCodePlacement()
2255 DenseMap<const BasicBlock *, BBState> BBStates; in OptimizeSequences() local
2258 bool NestingDetected = Visit(F, BBStates, Retains, Releases); in OptimizeSequences()
2264 bool AnyPairsCompletelyEliminated = PerformCodePlacement(BBStates, Retains, in OptimizeSequences()