Home
last modified time | relevance | path

Searched full:transitions (Results 1 – 25 of 388) sorted by relevance

12345678910>>...16

/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DDFAEmitter.cpp10 // 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"; in emit()
106 << DfaTransitions.size() << " transitions.\n\n"; in emit()
116 OS << "// A zero-terminated sequence of NFA state transitions. Every DFA\n"; in emit()
117 OS << "// transition implies a set of NFA transitions. These are referred\n"; in emit()
118 OS << "// to by index in " << Name << "Transitions[].\n"; in emit()
147 OS << "// A table of DFA transitions, ordered by {FromDfaState, Action}.\n"; in emit()
150 << "> " << Name << "Transitions = {{\n"; in emit()
[all …]
H A DDFAEmitter.h8 // Defines a generic automaton builder. This takes a set of transitions and
83 /// The set of nondeterministic transitions. A state-action pair can
94 /// The set of deterministic transitions. A state-action pair has only a
102 /// Visit a single DFA state and construct all possible transitions to new DFA
/freebsd/contrib/llvm-project/llvm/include/llvm/TableGen/
H A DAutomaton.td30 // initial state with all inputs under all transitions until termination.
34 // To ensure the generation of the automaton terminates, the state transitions
41 // provides a set of possible Transitions from state A, consuming an input
44 // all the possible transitions until none are valid.
47 // transitions can occur from any (state, action) pair. The generated automaton
84 // All transitions inherit from Transition.
93 // transitions from a starting state of 0b0.
/freebsd/contrib/flex/src/
H A Dtblcmp.c54 * totaltrans is the total number of transitions out of the state. Comstate
55 * is that state which is the destination of the most transitions out of State.
56 * Comfreq is how many transitions there are out of State to Comstate.
62 * many of the same out-transitions). A "most recently used" queue of
67 * homogeneous or nearly homogeneous (all transitions go to the same
73 * state will differ from the proto for two out-transitions. One of these
74 * out-transitions will be that character on which the proto does not go
87 * of the "best difference" to date, which is those transitions in bldtbl()
98 /* If the state has too few out-transitions, don't bother trying to in bldtbl()
233 * template transitions. in cmptmps()
[all …]
H A Ddfa.c48 * ds is the number of the state to check and state[] is its out-transitions,
65 * jam-transitions. in check_for_backing_up()
172 /* dump_transitions - list the transitions associated with a DFA state
177 * Goes through the set of out-transitions and lists them in human-readable
178 * form (i.e., not as equivalence classes); also lists jam transitions
179 * (i.e., all those which are not out-transitions, plus EOF). The dump
193 fprintf (file, _(" out-transitions: ")); in dump_transitions()
197 /* now invert the members of the set to get the jam transitions */ in dump_transitions()
201 fprintf (file, _("\n jam-transitions: EOF ")); in dump_transitions()
218 * number of epsilon transitions, which themselves do not have epsilon
[all …]
H A Dflexdef.h224 #define SYM_EPSILON (CSIZE + 1) /* to mark transitions on the symbol epsilon */
234 * The percentage the number of out-transitions a state must be of the
240 /* The percentage the number of homogeneous out-transitions of a state
241 * must be of the number of total out-transitions of the state in order
250 * number of out-transitions of the state in order to keep the first
257 * of out-transitions to use the proto as an acceptable close match.
261 /* The percentage the number of homogeneous out-transitions of a state
262 * must be of the number of total out-transitions of the state in order
269 * of out-transitions to create a new proto from the state.
273 /* The percentage the total number of out-transitions of a state must be
[all …]
/freebsd/secure/lib/libcrypto/man/man7/
H A Dlife_cycle-kdf.7148 starting state for any life-cycle transitions.
159 for all life-cycle transitions.
186 .SS "Formal State Transitions"
187 .IX Subsection "Formal State Transitions"
188 This section defines all of the legal state transitions.
202 At some point the \s-1EVP\s0 layer will begin enforcing the transitions described
H A Dlife_cycle-mac.7148 starting state for any life-cycle transitions.
166 for all life-cycle transitions.
203 .SS "Formal State Transitions"
204 .IX Subsection "Formal State Transitions"
205 This section defines all of the legal state transitions.
221 At some point the \s-1EVP\s0 layer will begin enforcing the transitions described
H A Dlife_cycle-rand.7148 starting state for any life-cycle transitions.
164 for all life-cycle transitions.
197 .SS "Formal State Transitions"
198 .IX Subsection "Formal State Transitions"
199 This section defines all of the legal state transitions.
214 At some point the \s-1EVP\s0 layer will begin enforcing the transitions described
H A Dlife_cycle-digest.7147 starting state for any life-cycle transitions.
165 for all life-cycle transitions.
202 .SS "Formal State Transitions"
203 .IX Subsection "Formal State Transitions"
204 This section defines all of the legal state transitions.
221 At some point the \s-1EVP\s0 layer will begin enforcing the transitions described
H A Dlife_cycle-cipher.7148 starting state for any life-cycle transitions.
180 for all life-cycle transitions.
236 .SS "Formal State Transitions"
237 .IX Subsection "Formal State Transitions"
238 This section defines all of the legal state transitions.
269 At some point the \s-1EVP\s0 layer will begin enforcing the transitions described
H A Dlife_cycle-pkey.7147 starting state for any life-cycle transitions.
187 for all life-cycle transitions.
249 .SS "Formal State Transitions"
250 .IX Subsection "Formal State Transitions"
251 This section defines all of the legal state transitions.
302 At some point the \s-1EVP\s0 layer will begin enforcing the transitions described
/freebsd/contrib/tzdata/
H A DNEWS48 transitions in September 1899, January 1937, and June 1954; adding
49 transitions in December 1941, November 1945, March and September
50 1977, and May and July 1990; and removing incorrect transitions in
124 Historical transitions for Mexico have been updated based on
133 Historical transitions for Portugal, represented by Europe/Lisbon,
137 changes affect a few transitions in 1917-1921, 1924, and 1940
221 Commentary about historical transitions in Portugal and her former
251 From 1947 through 1949, Toronto's transitions occurred at 02:00
312 Fix predictions for DST transitions in Palestine in 2072-2075,
370 Previously, it incorrectly omitted post-2075 transitions that are
[all …]
/freebsd/crypto/openssl/doc/man7/
H A Dlife_cycle-kdf.pod17 starting state for any life-cycle transitions.
31 for all life-cycle transitions.
69 =head2 Formal State Transitions
71 This section defines all of the legal state transitions.
145 At some point the EVP layer will begin enforcing the transitions described
H A Dlife_cycle-rand.pod17 starting state for any life-cycle transitions.
37 for all life-cycle transitions.
81 =head2 Formal State Transitions
83 This section defines all of the legal state transitions.
173 At some point the EVP layer will begin enforcing the transitions described
H A Dlife_cycle-mac.pod17 starting state for any life-cycle transitions.
40 for all life-cycle transitions.
88 =head2 Formal State Transitions
90 This section defines all of the legal state transitions.
198 At some point the EVP layer will begin enforcing the transitions described
H A Dlife_cycle-digest.pod16 starting state for any life-cycle transitions.
39 for all life-cycle transitions.
87 =head2 Formal State Transitions
89 This section defines all of the legal state transitions.
205 At some point the EVP layer will begin enforcing the transitions described
/freebsd/contrib/tzcode/
H A DNEWS21 Historical transitions for Mexico have been updated based on
30 Historical transitions for Portugal, represented by Europe/Lisbon,
34 changes affect a few transitions in 1917-1921, 1924, and 1940
118 Commentary about historical transitions in Portugal and her former
148 From 1947 through 1949, Toronto's transitions occurred at 02:00
209 Fix predictions for DST transitions in Palestine in 2072-2075,
267 Previously, it incorrectly omitted post-2075 transitions that are
563 distant-future DST transitions occur at times given in standard
565 the corresponding .zi Rule lines specify DST transitions with TO
622 Palestine transitions ar
[all...]
H A Dtzfile.5168 transforming a TZif file's transition times into transitions appropriate
203 or for all instants if the file has no transitions.
232 Also, if two or more leap second transitions are present and the last
342 As a partial workaround, a writer can output more transitions
347 permanent daylight saving time with transitions after 24:00
370 As a partial workaround, a writer can output more transitions
379 containing explicit transitions through the year 2087,
395 64-bit transitions only some of which are representable in 32
H A Dzic.8128 transitions are at standard time or Universal Time (UT) instead of local time.
158 transitions rather than concisely representing them
164 Generate redundant trailing explicit transitions for timestamps
167 seconds since the Epoch, even though the transitions could be
251 The output file contains more than 1200 transitions,
253 The current reference client supports at most 2000 transitions;
255 transitions.
849 To get separate transitions
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DAutomaton.h61 /// zero-terminated sequences pointed to by DFA transitions.
89 /// Pairs defines a sequence of possible NFA transitions for a single DFA in makePathSegment()
180 /// \param Transitions The Transitions table as created by TableGen. Note that
191 Automaton(ArrayRef<InfoT> Transitions,
198 for (const auto &I : Transitions)
/freebsd/lib/libpmc/
H A Dpmc.core.387 transitions of the conditions expressed by the other qualifiers.
415 Count the number of Intel Enhanced SpeedStep transitions.
421 (Umask 00H) Count all transitions.
423 (Umask 01H) Count frequency transitions.
441 The number of transitions from X87 to MMX.
566 The number of transitions from MMX to X87.
748 may report incorrect values after processor power state transitions.
781 may not count some transitions.
/freebsd/lib/libpmc/pmu-events/arch/x86/nehalemep/
H A Dfloating-point.json94 "BriefDescription": "All Floating Point to and from MMX transitions",
102 "BriefDescription": "Transitions from MMX to Floating Point instructions",
110 "BriefDescription": "Transitions from Floating Point to MMX instructions",
/freebsd/lib/libpmc/pmu-events/arch/x86/nehalemex/
H A Dfloating-point.json99 "BriefDescription": "All Floating Point to and from MMX transitions"
107 "BriefDescription": "Transitions from MMX to Floating Point instructions"
115 "BriefDescription": "Transitions from Floating Point to MMX instructions"
/freebsd/lib/libpmc/pmu-events/arch/x86/westmereep-dp/
H A Dfloating-point.json94 "BriefDescription": "All Floating Point to and from MMX transitions",
102 "BriefDescription": "Transitions from MMX to Floating Point instructions",
110 "BriefDescription": "Transitions from Floating Point to MMX instructions",

12345678910>>...16