95   std::optional<SmallVector<SUnit *, 4>> Cache;  member in __anon5d856e630111::InstructionRule
108       Cache = SmallVector<SUnit *, 4>();  in InstructionRule()
947       if (Cache->empty()) {  in apply()
952             Cache->push_back(&*I);  in apply()
954         if (Cache->empty())  in apply()
959           Cache->begin(), Cache->end(), [&SU, &DAG](SUnit *TargetSU) {  in apply()
982       if (Cache->empty()) {  in apply()
990               Cache->push_back(&*I);  in apply()
998         if (Cache->empty())  in apply()
1002       return DAG->IsReachable((*Cache)[0], const_cast<SUnit *>(SU));  in apply()
1025       if (Cache->empty()) {  in apply()
1042         Cache->push_back(TempSU);  in apply()
1046       assert(!Cache->empty());  in apply()
1048       return DAG->IsReachable((*Cache)[0], const_cast<SUnit *>(SU));  in apply()
1278       if (Cache->empty()) {  in apply()
1295         Cache->push_back(TempSU);  in apply()
1299       assert(!Cache->empty());  in apply()
1301       return (*Cache)[0] == SU;  in apply()
1320       if (Cache->empty()) {  in apply()
1323             Cache->push_back(&SU);  in apply()
1326         if (Cache->empty())  in apply()
1330       return SU->NodeNum > (*Cache)[0]->NodeNum;  in apply()
1864       if (!Cache->size()) {  in apply()
1870             Cache->push_back(&Elt);  in apply()
1875       assert(Cache->size());  in apply()
1877       for (auto &Elt : *Cache) {  in apply()
1905             Cache->push_back(SuccUnit);  in apply()
1912       assert(Cache->size());  in apply()
1916       return llvm::any_of(*Cache, [&SU](SUnit *Elt) {  in apply()
2009       if (!Cache->size()) {  in apply()
2026               Cache->push_back(Pred.getSUnit());  in apply()
2031         if (!Cache->size())  in apply()
2038       return llvm::any_of(*Cache, [&SU, &DAG](SUnit *Elt) {  in apply()