Lines Matching defs:RW

574       // Visit each RW in the sequence selected by the current variant.
596     for (const Record *RW : SchedDef->getValueAsListOfDefs("SchedRW")) {
597       if (RW->isSubClassOf("SchedWrite"))
598         scanSchedRW(RW, SWDefs, RWSet);
600         assert(RW->isSubClassOf("SchedRead") && "Unknown SchedReadWrite");
601         scanSchedRW(RW, SRDefs, RWSet);
674     CodeGenSchedRW &RW = getSchedRW(MatchDef);
675     if (RW.IsAlias)
677     RW.Aliases.push_back(ADef);
716       RWVec, [Def](const CodeGenSchedRW &RW) { return RW.TheDef == Def; });
787                           " Ensure only one SchedAlias exists per RW.");
817   auto I = find_if(RWVec, [Seq](CodeGenSchedRW &RW) {
818     return ArrayRef(RW.Sequence) == Seq;
1270 // A Predicate transition is a list of RW sequences guarded by a PredTerm.
1338       // we're expanding. Consider following RW sequence with two variants
1422                           " Ensure only one SchedAlias exists per RW.");
1532   // Visit each original RW within the current sequence.
1535     // Push this RW on all partial PredTransitions or distribute variants.
1689   LLVM_DEBUG(dbgs() << "INFER RW proc("; dumpIdxVec(ProcIndices);
1839     for (const Record *RW : SC.InstRWs) {
1840       const Record *RWModelDef = RW->getValueAsDef("SchedModel");
1843       findRWs(RW->getValueAsListOfDefs("OperandReadWrites"), Writes, Reads);