Lines Matching defs:MyStates

526                           BBState &MyStates) const;
529                                 BBState &MyStates);
534       Instruction *Inst, DenseMap<Value *, RRInfo> &Releases, BBState &MyStates,
1241                                BBState &MyStates) const {
1244   for (auto I = MyStates.top_down_ptr_begin(), E = MyStates.top_down_ptr_end();
1328     BBState &MyStates) {
1339     BottomUpPtrState &S = MyStates.getPtrBottomUpState(Arg);
1351     BottomUpPtrState &S = MyStates.getPtrBottomUpState(Arg);
1365     // Conservatively, clear MyStates for all known pointers.
1366     MyStates.clearBottomUpPointers();
1378   for (auto MI = MyStates.bottom_up_ptr_begin(),
1379             ME = MyStates.bottom_up_ptr_end();
1401   BBState &MyStates = BBStates[BB];
1405   BBState::edge_iterator SI(MyStates.succ_begin()),
1406                          SE(MyStates.succ_end());
1411     MyStates.InitFromSucc(I->second);
1417       MyStates.MergeSucc(I->second);
1435     NestingDetected |= VisitInstructionBottomUp(Inst, BB, Retains, MyStates);
1439     if (MyStates.bottom_up_ptr_list_size() > MaxPtrStates) {
1448   for (BBState::edge_iterator PI(MyStates.pred_begin()),
1449        PE(MyStates.pred_end()); PI != PE; ++PI) {
1452       NestingDetected |= VisitInstructionBottomUp(II, BB, Retains, MyStates);
1493     Instruction *Inst, DenseMap<Value *, RRInfo> &Releases, BBState &MyStates,
1506       TopDownPtrState &S = MyStates.getPtrTopDownState(Root);
1528     TopDownPtrState &S = MyStates.getPtrTopDownState(Arg);
1536     TopDownPtrState &S = MyStates.getPtrTopDownState(Arg);
1549     // Conservatively, clear MyStates for all known pointers.
1550     MyStates.clearTopDownPointers();
1562   for (auto MI = MyStates.top_down_ptr_begin(),
1563             ME = MyStates.top_down_ptr_end();
1585   BBState &MyStates = BBStates[BB];
1589   BBState::edge_iterator PI(MyStates.pred_begin()),
1590                          PE(MyStates.pred_end());
1595     MyStates.InitFromPred(I->second);
1601       MyStates.MergePred(I->second);
1605   // Check that BB and MyStates have the same number of predecessors. This
1608   if (!BB->hasNPredecessors(MyStates.pred_end() - MyStates.pred_begin()))
1609     for (auto I = MyStates.top_down_ptr_begin(),
1610               E = MyStates.top_down_ptr_end();
1623         &Inst, Releases, MyStates, ReleaseInsertPtToRCIdentityRoots);
1627     if (MyStates.top_down_ptr_list_size() > MaxPtrStates) {
1635   CheckForCFGHazards(BB, BBStates, MyStates);
1656   BBState &MyStates = BBStates[EntryBB];
1657   MyStates.SetAsEntry();
1696     BBState &MyStates = BBStates[&ExitBB];
1697     if (!MyStates.isExit())
1700     MyStates.SetAsExit();
1702     PredStack.push_back(std::make_pair(&ExitBB, MyStates.pred_begin()));