Home
last modified time | relevance | path

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

1234

/linux/tools/testing/selftests/sched_ext/
H A Dnohz_tick.c5 * Validate that a finite-slice EXT task restarts the scheduler tick when it
261 * The next EXT task receives a finite slice and must restart the tick. in run()
266 SCX_ERR("Failed to start finite-slice worker (%d)", errno); in run()
271 SCX_ERR("Finite-slice worker was not scheduled"); in run()
276 SCX_ERR("Finite-slice worker received only %llu scheduler ticks", in run()
284 * Leave the CPU idle after a finite-slice task. The next finite-slice in run()
295 SCX_ERR("Failed to start second finite-slice worker (%d)", errno); in run()
300 SCX_ERR("Second finite-slice worker was not scheduled"); in run()
306 SCX_ERR("Second finite-slice worker received only %llu scheduler ticks", in run()
319 fprintf(stderr, "CPU %d received %llu finite-slice ticks\n", in run()
[all …]
H A Dnohz_tick.bpf.c5 * Exercise tick dependency transitions between infinite and finite slices.
/linux/drivers/s390/net/
H A Dfsm.h98 * init_fsm - Creates a finite state machine
108 * Allocates and initializes a finite state machine instance with the
119 * kfree_fsm - Releases a finite state machine
133 * fsm_event - Emits an event to a finite state machine
187 * fsm_newstate - Modifies the state of a finite state machine
209 * fsm_getstate - Retrieves the current state of a finite state machine
229 * fsm_settimer - Initializes a timer for a finite state machine
260 * fsm_modtimer - Modifies a timer of a finite state machine
H A Dctcm_main.h195 fsm_instance *fsm; /* finite state machine of this channel */
211 /* The finite state machine of this interface */
/linux/lib/crypto/x86/
H A Dpolyval-pclmul-avx.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
/linux/lib/crypto/arm64/
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
/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.
/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
334 MODULE_DESCRIPTION("naive finite state machine text search");
/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
H A Diosm_ipc_mmio.h21 /* Possible states of the IPC finite state machine. */
/linux/include/uapi/linux/
H A Dtps6594_pfsm.h3 * Userspace ABI for TPS6594 PMIC Pre-configurable Finite State Machine
/linux/tools/perf/pmu-events/arch/s390/cf_z15/
H A Dtransaction.json48 "BriefDescription": "Cycles per Instructions from Finite cache/memory",
/linux/tools/perf/pmu-events/arch/s390/cf_z14/
H A Dtransaction.json48 "BriefDescription": "Cycles per Instructions from Finite cache/memory",
/linux/tools/perf/pmu-events/arch/s390/cf_z13/
H A Dtransaction.json48 "BriefDescription": "Cycles per Instructions from Finite cache/memory",
/linux/Documentation/misc-devices/
H A Dtps6594-pfsm.rst12 Strictly speaking, PFSM (Pre-configurable Finite State Machine) is not
/linux/tools/perf/pmu-events/arch/s390/cf_z17/
H A Dtransaction.json48 "BriefDescription": "Cycles per Instructions from Finite cache/memory",
/linux/tools/perf/pmu-events/arch/s390/cf_z16/
H A Dtransaction.json48 "BriefDescription": "Cycles per Instructions from Finite cache/memory",
/linux/drivers/usb/common/
H A Dusb-otg-fsm.c3 * OTG Finite State Machine from OTG spec
452 MODULE_DESCRIPTION("OTG Finite State Machine");
/linux/Documentation/filesystems/
H A Ddirectory-locking.rst268 those chains must end after a finite number of steps.
274 end after a finite number of steps, which means that it can't be a part
/linux/lib/zstd/compress/
H A Dhist.h4 * part of Finite State Entropy project
/linux/net/netfilter/
H A Dxt_TCPOPTSTRIP.c21 /* Beware zero-length options: make finite progress */ in optlen()
/linux/arch/m68k/fpsp040/
H A Dscosh.S44 | the appropriate sign. Huge is the largest finite number in
H A Dssinh.S45 | the appropriate sign. Huge is the largest finite number in
/linux/drivers/usb/core/
H A DKconfig97 Implements OTG Finite State Machine as specified in On-The-Go
/linux/drivers/net/ethernet/chelsio/cxgb4/
H A Dcxgb4_dcb.h70 /* Data Center Bridging state input for the Finite State Machine.

1234