utils/TableGen/CodeGenSchedule.cpp

916 // A Predicate transition is a list of RW sequences guarded by a PredTerm.
919   SmallVector<PredCheck, 4> PredTerm;
953 // Return true if this predicate is mutually exclusive with a PredTerm. This
1102       if (mutuallyExclusive(PredDef, TransVec[TransIdx].PredTerm))
1138     Trans.PredTerm.push_back(PredCheck(IsRead, VInfo.RWIdx,PredDef));
1240   TransVec.back().PredTerm = Trans.PredTerm;
1297     // The final PredTerm is unique set of predicates guarding the transition.
1300            PI = I->PredTerm.begin(), PE = I->PredTerm.end(); PI != PE; ++PI) {
1305     SCTrans.PredTerm = Preds;
1319   // Create a seed transition with an empty PredTerm and the expanded sequences
1362   if (LastTransitions[0].PredTerm.empty())
1725            PCI = TI->PredTerm.begin(), PCE = TI->PredTerm.end();
1727       if (PCI != TI->PredTerm.begin())