Searched refs:Transitions (Results 1 – 9 of 9) sorted by relevance
218 std::vector<Transition> Transitions; member in __anon8900ab900211::Automaton275 Transitions.emplace_back(T, this); in emit()276 Actions.insert(Transitions.back().getActions()); in emit()281 LLVM_DEBUG(dbgs() << " Each state has " << Transitions.size() in emit()296 for (Transition &T : Transitions) { in emit()310 const auto &ActionTypes = Transitions.back().getTypes(); in emit()
1040 make_range(SC.Transitions.begin(), SC.Transitions.end())) { in GenSchedClassTables()1557 if (SC.Transitions.empty()) in collectVariantClasses()1563 if (llvm::none_of(SC.Transitions, hasMCSchedPredicates)) in collectVariantClasses()1576 for (const CodeGenSchedTransition &T : SC.Transitions) { in collectProcessorIndices()1631 for (const CodeGenSchedTransition &T : SC.Transitions) { in emitSchedModelHelpersImpl()
1711 .Transitions.push_back(std::move(SCTrans)); in inferFromTransitions()1780 PredTransitions Transitions(*this); in inferFromRW() local1782 SubstitutedAny |= Transitions.substituteVariants(Trans); in inferFromRW()1783 LLVM_DEBUG(Transitions.dump()); in inferFromRW()1784 LastTransitions.swap(Transitions.TransVec); in inferFromRW()2244 if (!Transitions.empty()) { in dump()2246 for (const CodeGenSchedTransition &Transition : Transitions) { in dump()
133 std::vector<CodeGenSchedTransition> Transitions; member
193 Automaton(ArrayRef<InfoT> Transitions,200 for (const auto &I : Transitions)
41 // provides a set of possible Transitions from state A, consuming an input
356 GC Transitions
2497 generated code. For more details, see :ref:`GC Transitions
6386 unsigned Transitions = Record[Idx++]; in ReadPragmaDiagnosticMappings() local6393 F.StateTransitions.reserve(F.StateTransitions.size() + Transitions); in ReadPragmaDiagnosticMappings()6394 for (unsigned I = 0; I != Transitions; ++I) { in ReadPragmaDiagnosticMappings()