Searched refs:Transitions (Results 1 – 20 of 20) sorted by relevance
192 std::vector<Transition> Transitions; member in __anon4fed36600211::Automaton249 Transitions.emplace_back(T, this); in emit()250 Actions.insert(Transitions.back().getActions()); in emit()255 LLVM_DEBUG(dbgs() << " Each state has " << Transitions.size() in emit()270 for (Transition &T : Transitions) { in emit()284 const auto &ActionTypes = Transitions.back().getTypes(); in emit()
1047 for (const CodeGenSchedTransition &CGT : SC.Transitions) { in genSchedClassTables()1628 if (SC.Transitions.empty()) in collectVariantClasses()1634 if (llvm::none_of(SC.Transitions, hasMCSchedPredicates)) in collectVariantClasses()1647 for (const CodeGenSchedTransition &T : SC.Transitions) { in collectProcessorIndices()1702 for (const CodeGenSchedTransition &T : SC.Transitions) { in emitSchedModelHelpersImpl()
180 /// \param Transitions The Transitions table as created by TableGen. Note that191 Automaton(ArrayRef<InfoT> Transitions,198 for (const auto &I : Transitions)
7 - ac-bias-intrpt: AC Bias Pin Transitions per Interrupt
1653 .Transitions.push_back(std::move(SCTrans)); in inferFromTransitions()1721 PredTransitions Transitions(*this); in inferFromRW() local1723 SubstitutedAny |= Transitions.substituteVariants(Trans); in inferFromRW()1724 LLVM_DEBUG(Transitions.dump()); in inferFromRW()1725 LastTransitions = std::move(Transitions.TransVec); in inferFromRW()2215 if (!Transitions.empty()) { in dump()2217 for (const CodeGenSchedTransition &Transition : Transitions) { in dump()
141 std::vector<CodeGenSchedTransition> Transitions; member
41 // provides a set of possible Transitions from state A, consuming an input
69 =head2 Formal State Transitions
81 =head2 Formal State Transitions
88 =head2 Formal State Transitions
113 =head2 Formal State Transitions
119 =head2 Formal State Transitions
141 =head2 Formal State Transitions
81 # Transitions from 2021 on are taken from:
629 # Transitions after 1952 are from Shanks & Pottenger.2006 # Transitions before 2015 are from timeanddate.com, which consulted
2577 # Transitions through 1991 are from Shanks & Pottenger.
2348 # (Transitions of 1:00s as previously reported and used by the W-Eur rules,
272 ### Algorithm Transitions
489 5.9.2. Loop State Transitions- From Nil to Ready
6971 unsigned Transitions = Record[Idx++]; in ReadPragmaDiagnosticMappings() local6978 F.StateTransitions.reserve(F.StateTransitions.size() + Transitions); in ReadPragmaDiagnosticMappings()6979 for (unsigned I = 0; I != Transitions; ++I) { in ReadPragmaDiagnosticMappings()