Home
last modified time | relevance | path

Searched refs:automaton (Results 1 – 25 of 47) sorted by relevance

12

/external/llvm-project/llvm/include/llvm/TableGen/
DAutomaton.td10 // generic finite-state automaton.
15 // generic finite-state automaton over a set of actions and states.
17 // This automaton is defined by:
22 // A theoretical automaton is defined by <Q, S, d, q0, F>:
34 // To ensure the generation of the automaton terminates, the state transitions
46 // This automaton is considered to be nondeterministic, meaning that multiple
47 // transitions can occur from any (state, action) pair. The generated automaton
51 // In addition to a generated automaton that determines if a sequence of inputs
56 // this class will be considered when constructing the automaton.
92 // The automaton generator uses this property to crawl the set of possible
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/TableGen/
DAutomaton.td10 // generic finite-state automaton.
15 // generic finite-state automaton over a set of actions and states.
17 // This automaton is defined by:
22 // A theoretical automaton is defined by <Q, S, d, q0, F>:
34 // To ensure the generation of the automaton terminates, the state transitions
46 // This automaton is considered to be nondeterministic, meaning that multiple
47 // transitions can occur from any (state, action) pair. The generated automaton
51 // In addition to a generated automaton that determines if a sequence of inputs
56 // this class will be considered when constructing the automaton.
92 // The automaton generator uses this property to crawl the set of possible
/external/rust/crates/aho-corasick/
DDESIGN.md78 an Aho-Corasick automaton does not make it slower. (Strictly speaking, however,
79 this is not true, since a larger automaton will make less effective use of the
84 try matching alternative keys in the automaton. The trick is that these state
87 because they instruct the searcher (the thing traversing the automaton while
91 More formally, a failure transition points to a state in the automaton that may
96 an Aho-Corasick automaton with the following patterns: 'abcd' and 'cef'. The
164 The code for traversing this *automaton* or *finite state machine* (it is no
205 is still roughly "traverse the automaton with bytes from the haystack, and quit
209 how the automaton is built (see `src/nfa.rs`, which has detailed comments about
225 By this formulation, the Aho-Corasick automaton described in the previous
[all …]
/external/scapy/scapy/modules/krack/
D__init__.py28 from scapy.modules.krack.automaton import KrackAP
/external/scapy/scapy/
Dautomaton.py251 def __init__(self, state_func, automaton, *args, **kargs): argument
258 self.automaton = automaton
267 return self.func(self.automaton, *self.args, **self.kargs)
354 def __init__(self, name, ioevent, automaton, proto, args, kargs): argument
360 self.atmt = automaton(*args, **kargs)
382 def __init__(self, name, ioevent, automaton): argument
385 self.automaton = automaton
387 return _ATMT_supersocket(self.name, self.ioevent, self.automaton, proto, args, kargs)
Dall.py35 from scapy.automaton import *
Dscapypipes.py13 from scapy.automaton import recv_error
/external/rust/crates/aho-corasick/src/
Dlib.rs205 mod automaton; module
Ddfa.rs4 use automaton::Automaton;
Dahocorasick.rs3 use automaton::Automaton;
/external/libxml2/os400/iconv/
DREADME.iconv39 finite automaton from the files mentioned above into a C file for all
44 with libxml2, the generated automaton is stored within sources and need not
/external/scapy/test/tls/
Dtests_tls_netaccess.uts7 + TLS server automaton tests
86 + TLS client automaton tests
/external/scapy/test/
Dlinux.uts11 = TCP client automaton
12 ~ automaton netaccess linux needs_root
/external/llvm-project/llvm/include/llvm/Target/
DTargetItinerary.td130 // The packetizer automaton to use for this itinerary. By default all
131 // itineraries for a target are bundled up into the same automaton. This only
138 // itinerary to be generated in a different automaton. The subtarget will need
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Target/
DTargetItinerary.td130 // The packetizer automaton to use for this itinerary. By default all
131 // itineraries for a target are bundled up into the same automaton. This only
138 // itinerary to be generated in a different automaton. The subtarget will need
/external/rust/crates/regex-automata/
DCargo.toml.orig10 keywords = ["regex", "dfa", "automata", "automaton", "nfa"]
DCargo.toml24 keywords = ["regex", "dfa", "automata", "automaton", "nfa"]
/external/scapy/scapy/layers/tls/
Dautomaton.py12 from scapy.automaton import Automaton
Dautomaton_srv.py24 from scapy.automaton import ATMT
25 from scapy.layers.tls.automaton import _TLSAutomaton
Dautomaton_cli.py25 from scapy.automaton import ATMT
26 from scapy.layers.tls.automaton import _TLSAutomaton
/external/mesa3d/src/compiler/nir/
Dnir_algebraic.py1211 self.automaton = TreeAutomaton(self.xforms)
1222 automaton=self.automaton,
/external/rust/crates/regex-syntax/
DREADME.md51 compile a regular expression into an automaton. Therefore, there is little need
/external/llvm-project/llvm/unittests/TableGen/
DAutomata.td82 // This test generates an automaton that can pack values into bins subject to
/external/rust/crates/regex/
DPERFORMANCE.md44 turn it into a proper automaton that decodes a subset of UTF-8 which
46 size of the automaton.
/external/scapy/scapy/layers/
Dtftp.py14 from scapy.automaton import *

12