Lines Matching refs:Variants
196 RecVec Vars = RWDef->getValueAsListOfDefs("Variants");
207 // More may be inferred later when inferring new SchedClasses from variants.
992 RecVec Variants = SchedRW.TheDef->getValueAsListOfDefs("Variants");
993 for (RecIter VI = Variants.begin(), VE = Variants.end(); VI != VE; ++VI) {
1053 // Populate IntersectingVariants with any variants or aliased sequences of the
1062 std::vector<TransVariant> Variants;
1070 const RecVec VarDefs = SchedRW.TheDef->getValueAsListOfDefs("Variants");
1072 Variants.push_back(TransVariant(*RI, SchedRW.Index, VarProcIdx, 0));
1079 // to is defined within a processor model, constrain all variants to
1090 const RecVec VarDefs = AliasRW.TheDef->getValueAsListOfDefs("Variants");
1092 Variants.push_back(TransVariant(*RI, AliasRW.Index, AliasProcIdx, 0));
1095 Variants.push_back(
1101 for (unsigned VIdx = 0, VEnd = Variants.size(); VIdx != VEnd; ++VIdx) {
1102 TransVariant &Variant = Variants[VIdx];
1103 // Don't expand variants if the processor models don't intersect.
1106 if (ProcIndices[0] && Variants[VIdx].ProcIdx) {
1115 "Multiple variants defined for processor " +
1131 // Push another copy of the current transition for more variants.
1223 // Push this RW on all partial PredTransitions or distribute variants.
1236 // Distribute this partial PredTransition across intersecting variants.
1254 // predicates should result in linear growth in the total number variants.
1256 // This is one step in a breadth-first search of nested variants.
1383 // If the first transition has no variants, nothing to do.
1755 dbgs() << "Expanded Variants:\n";
