Home
last modified time | relevance | path

Searched refs:Transitions (Results 1 – 19 of 19) sorted by relevance

/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DDFAEmitter.cpp196 std::vector<Transition> Transitions; member in __anon4fed36600211::Automaton
253 Transitions.emplace_back(T, this); in emit()
254 Actions.insert(Transitions.back().getActions()); in emit()
259 LLVM_DEBUG(dbgs() << " Each state has " << Transitions.size() in emit()
274 for (Transition &T : Transitions) { in emit()
288 const auto &ActionTypes = Transitions.back().getTypes(); in emit()
H A DSubtargetEmitter.cpp1074 make_range(SC.Transitions.begin(), SC.Transitions.end())) { in GenSchedClassTables()
1649 if (SC.Transitions.empty()) in collectVariantClasses()
1655 if (llvm::none_of(SC.Transitions, hasMCSchedPredicates)) in collectVariantClasses()
1668 for (const CodeGenSchedTransition &T : SC.Transitions) { in collectProcessorIndices()
1723 for (const CodeGenSchedTransition &T : SC.Transitions) { in emitSchedModelHelpersImpl()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DAutomaton.h180 /// \param Transitions The Transitions table as created by TableGen. Note that
191 Automaton(ArrayRef<InfoT> Transitions,
198 for (const auto &I : Transitions)
/freebsd/sys/contrib/device-tree/Bindings/display/tilcdc/
H A Dpanel.txt7 - ac-bias-intrpt: AC Bias Pin Transitions per Interrupt
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenSchedule.cpp1706 .Transitions.push_back(std::move(SCTrans)); in inferFromTransitions()
1775 PredTransitions Transitions(*this); in inferFromRW() local
1777 SubstitutedAny |= Transitions.substituteVariants(Trans); in inferFromRW()
1778 LLVM_DEBUG(Transitions.dump()); in inferFromRW()
1779 LastTransitions = std::move(Transitions.TransVec); in inferFromRW()
2261 if (!Transitions.empty()) { in dump()
2263 for (const CodeGenSchedTransition &Transition : Transitions) { in dump()
H A DCodeGenSchedule.h140 std::vector<CodeGenSchedTransition> Transitions; member
/freebsd/contrib/llvm-project/llvm/include/llvm/TableGen/
H A DAutomaton.td41 // provides a set of possible Transitions from state A, consuming an input
/freebsd/crypto/openssl/doc/man7/
H A Dlife_cycle-kdf.pod69 =head2 Formal State Transitions
H A Dlife_cycle-rand.pod81 =head2 Formal State Transitions
H A Dlife_cycle-mac.pod88 =head2 Formal State Transitions
H A Dlife_cycle-digest.pod87 =head2 Formal State Transitions
H A Dlife_cycle-cipher.pod119 =head2 Formal State Transitions
H A Dlife_cycle-pkey.pod141 =head2 Formal State Transitions
/freebsd/contrib/tzdata/
H A Dantarctica84 # Transitions from 2021 on are taken from:
H A Daustralasia629 # Transitions after 1952 are from Shanks & Pottenger.
1996 # Transitions before 2015 are from timeanddate.com, which consulted
H A Deurope2266 # (Transitions of 1:00s as previously reported and used by the W-Eur rules,
H A Dasia2567 # Transitions through 1991 are from Shanks & Pottenger.
/freebsd/sys/dev/isp/
H A DDriverManual.txt489 5.9.2. Loop State Transitions- From Nil to Ready
/freebsd/contrib/llvm-project/clang/lib/Serialization/
H A DASTReader.cpp6632 unsigned Transitions = Record[Idx++]; in ReadPragmaDiagnosticMappings() local
6639 F.StateTransitions.reserve(F.StateTransitions.size() + Transitions); in ReadPragmaDiagnosticMappings()
6640 for (unsigned I = 0; I != Transitions; ++I) { in ReadPragmaDiagnosticMappings()