HomeSort by: relevance | last modified time | path
    Searched refs:Transitions (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
DFAEmitter.cpp 10 // given a set of possible states and transitions.
12 // The input transitions can be nondeterministic - this class will produce the
16 // state and also produce, given a sequence of transitions that results in an
104 << NumNfaTransitions << " transitions.\n";
106 << DfaTransitions.size() << " transitions.\n\n";
116 OS << "// A zero-terminated sequence of NFA state transitions. Every DFA\n";
117 OS << "// transition implies a set of NFA transitions. These are referred\n";
118 OS << "// to by index in " << Name << "Transitions[].\n";
147 OS << "// A table of DFA transitions, ordered by {FromDfaState, Action}.\n";
150 << DfaTransitions.size() << "> " << Name << "Transitions = {{\n"
    [all...]
SubtargetEmitter.cpp 1004 make_range(SC.Transitions.begin(), SC.Transitions.end())) {
1523 if (SC.Transitions.empty())
1527 // Ignore this variant scheduling class no transitions use any meaningful
1529 if (!any_of(SC.Transitions, [](const CodeGenSchedTransition &T) {
1541 // A variant scheduling class may define transitions for multiple
1544 for (const CodeGenSchedTransition &T : SC.Transitions) {
1573 // described by instances of CodeGenSchedTransition. Note that transitions may
1598 // Now emit transitions associated with processor PI.
1600 for (const CodeGenSchedTransition &T : SC.Transitions) {
    [all...]
CodeGenSchedule.cpp 1324 // Encapsulate a set of partially constructed transitions.
1384 // exist in variant (2). This means we have possible transitions from A
1571 // starts. RWSeq must be applied to all transitions between StartIdx and the end
1621 // Push a new (empty) write sequence onto all partial Transitions.
1631 // Push a new (empty) read sequence onto all partial Transitions.
1675 // transitions. We don't need to build sched classes for them.
1703 .Transitions.push_back(std::move(SCTrans));
1772 PredTransitions Transitions(*this);
1774 SubstitutedAny |= Transitions.substituteVariants(Trans);
1775 LLVM_DEBUG(Transitions.dump())
    [all...]
CodeGenSchedule.h 137 std::vector<CodeGenSchedTransition> Transitions;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
Automaton.h 63 /// zero-terminated sequences pointed to by DFA transitions.
91 /// Pairs defines a sequence of possible NFA transitions for a single DFA
182 /// \param Transitions The Transitions table as created by TableGen. Note that
193 Automaton(ArrayRef<InfoT> Transitions,
200 for (const auto &I : Transitions)
  /src/external/apache2/llvm/dist/clang/lib/Serialization/
ASTReader.cpp 6307 // explicit transitions (for which we did not serialize anything).
6318 // Read the state transitions.
6327 unsigned Transitions = Record[Idx++];
6334 F.StateTransitions.reserve(F.StateTransitions.size() + Transitions);
6335 for (unsigned I = 0; I != Transitions; ++I) {

Completed in 88 milliseconds