Home
last modified time | relevance | path

Searched full:finite (Results 1 – 25 of 161) sorted by relevance

1234567

/openbmc/sdeventplus/src/sdeventplus/
H A Devent.hpp98 * @param[in] timeout - nullopt for no timeout or a finite timeout
101 * Only returns 0 a finite timeout is reached
115 * @param[in] timeout - nullopt for no timeout or a finite timeout
118 * Only returns 0 a finite timeout is reached
/openbmc/linux/arch/x86/crypto/
H A Dpolyval-clmulni_asm.S8 * keys powers h^8, ..., h^1 in the POLYVAL finite field. This precomputation
9 * allows us to split finite field multiplication into two steps.
15 * In the second step, we compute the reduction of p(x) modulo the finite field
19 * multiplication is finite field multiplication. The advantage is that the
20 * two-step process only requires 1 finite field reduction for every 8
/openbmc/google-misc/subprojects/ncsid/src/platforms/nemora/portable/
H A Dncsi_fsm.h20 /* Nemora NC-SI (Finite) State Machine implementation */
43 * For this reason there are actually 3 NC-SI finite state machines:
214 * of the 3 finite state machines.
/openbmc/qemu/tests/qemu-iotests/
H A D043.out22 == finite chain of length 3 (human) ==
40 == finite chain of length 3 (json) ==
H A D04385 echo "== finite chain of length 3 (human) =="
90 echo "== finite chain of length 3 (json) =="
/openbmc/linux/arch/mips/pci/
H A Dfixup-sb1250.c13 * to the finite max.
84 * Set the SP1011 HT/PCI bridge's TRDY timeout to the finite max.
/openbmc/linux/arch/arm64/crypto/
H A Dpolyval-ce-core.S10 * ..., h^1 in the POLYVAL finite field. This precomputation allows us to split
11 * finite field multiplication into two steps.
17 * In the second step, we compute the reduction of p(x) modulo the finite field
21 * multiplication is finite field multiplication. The advantage is that the
22 * two-step process only requires 1 finite field reduction for every 8
/openbmc/linux/crypto/
H A Dpolyval-generic.c15 * modulus for finite field multiplication which makes hardware accelerated
85 * lookup table implementation for finite field multiplication.
106 * lookup table implementation of finite field multiplication.
/openbmc/qemu/tests/tcg/i386/
H A Dtest-i386-fscale.c87 printf("FAIL: fscale finite up inf\n"); in main()
93 printf("FAIL: fscale finite down inf\n"); in main()
/openbmc/openbmc/meta-openembedded/meta-python/recipes-devtools/python/
H A Dpython3-automat_24.8.1.bb1 DESCRIPTION = "Self-service finite-state machines for the programmer on the go"
/openbmc/linux/drivers/net/wwan/iosm/
H A Diosm_ipc_pm.h35 * enum ipc_mem_host_pm_state - Possible states of the HOST SLEEP finite state
59 * enum ipc_mem_dev_pm_state - Possible states of the DEVICE SLEEP finite state
/openbmc/openbmc/poky/meta/recipes-support/re2c/
H A Dre2c_4.0.1.bb2 …tor for C, C++ and Go. It compiles regular expressions to determinisitic finite automata and encod…
/openbmc/openbmc/meta-openembedded/meta-python/recipes-devtools/python/python3-pexpect/
H A D0001-FSM.py-change-shebang-from-python-to-python3.patch21 '''This module implements a Finite State Machine (FSM). In addition to state
/openbmc/linux/Documentation/trace/rv/
H A Ddeterministic_automata.rst11 - *E* is the finite set of events;
76 char *event_names[event_max]; // E: the finite set of events
/openbmc/linux/include/uapi/linux/
H A Dtps6594_pfsm.h3 * Userspace ABI for TPS6594 PMIC Pre-configurable Finite State Machine
/openbmc/linux/drivers/s390/net/
H A Dctcm_main.h195 fsm_instance *fsm; /* finite state machine of this channel */
211 /* The finite state machine of this interface */
/openbmc/linux/drivers/misc/
H A Dtps6594-pfsm.c3 * PFSM (Pre-configurable Finite State Machine) driver for TI TPS6594/TPS6593/LP8764 PMICs
302 MODULE_DESCRIPTION("TPS6594 Pre-configurable Finite State Machine Driver");
/openbmc/linux/tools/perf/pmu-events/arch/s390/cf_z14/
H A Dtransaction.json48 "BriefDescription": "Cycles per Instructions from Finite cache/memory",
/openbmc/linux/tools/perf/pmu-events/arch/s390/cf_z15/
H A Dtransaction.json48 "BriefDescription": "Cycles per Instructions from Finite cache/memory",
/openbmc/qemu/include/libdecnumber/
H A DdecNumberLocal.h287 /* bcdnum -- a structure describing a format-independent finite */
351 /* DFISINT -- test for finite and exponent q=0 */
352 /* DFISUINT01 -- test for sign=0, finite, exponent q=0, and */
448 /* Macros to decode the coefficient in a finite decFloat *df into */
544 /* Macros to decode the coefficient in a finite decFloat *df into */
597 /* Macros to decode the coefficient in a finite decFloat *df into */
644 /* Set a decFloat to the maximum positive finite number (Nmax) */
/openbmc/linux/lib/
H A Dts_fsm.c3 * lib/ts_fsm.c A naive finite state machine text search approach
9 * A finite state machine consists of n states (struct ts_fsm_token)
10 * representing the pattern as a finite automaton. The data is read
/openbmc/linux/Documentation/gpu/amdgpu/display/
H A Ddc-glossary.rst207 Power Gate Finite State Machine
/openbmc/linux/tools/perf/pmu-events/arch/s390/cf_z13/
H A Dtransaction.json48 "BriefDescription": "Cycles per Instructions from Finite cache/memory",
/openbmc/linux/tools/perf/pmu-events/arch/s390/cf_z16/
H A Dtransaction.json48 "BriefDescription": "Cycles per Instructions from Finite cache/memory",
/openbmc/linux/Documentation/misc-devices/
H A Dtps6594-pfsm.rst12 Strictly speaking, PFSM (Pre-configurable Finite State Machine) is not

1234567