Searched full:minimal (Results 1 – 25 of 793) sorted by relevance
12345678910>>...32
/linux-6.12.1/tools/testing/selftests/sched_ext/ |
D | minimal.c | 11 #include "minimal.bpf.skel.h" 16 struct minimal *skel; in setup() 30 struct minimal *skel = ctx; in run() 46 struct minimal *skel = ctx; in cleanup() 51 struct scx_test minimal = { variable 52 .name = "minimal", 53 .description = "Verify we can load a fully minimal scheduler", 58 REGISTER_SCX_TEST(&minimal)
|
D | minimal.bpf.c | 3 * A completely minimal scheduler. 5 * This scheduler defines the absolute minimal set of struct sched_ext_ops 20 .name = "minimal",
|
D | maybe_null.bpf.c | 35 .name = "minimal",
|
/linux-6.12.1/samples/rust/ |
D | rust_minimal.rs | 3 //! Rust minimal sample. 11 description: "Rust minimal sample", 21 pr_info!("Rust minimal sample (init)\n"); in init() 36 pr_info!("Rust minimal sample (exit)\n"); in drop()
|
D | Kconfig | 14 tristate "Minimal" 16 This option builds the Rust minimal module sample.
|
/linux-6.12.1/tools/testing/memblock/tests/ |
D | alloc_helpers_api.c | 16 * Expect to allocate a cleared region at the minimal memory address. 48 * The minimal address here is not aligned: 105 * Expect to prioritize granting memory over satisfying the minimal address 137 * available above the minimal address above a certain address: 147 * Expect to prioritize granting memory over satisfying the minimal address 183 * A test that tries to allocate a memory region with a minimal address below 231 * Expect to prioritize granting memory over satisfying the minimal address 263 * available above the minimal address above a certain address: 273 * Expect to prioritize granting memory over satisfying the minimal address 308 * A test that tries to allocate a memory region with a minimal address below
|
/linux-6.12.1/drivers/hwmon/ |
D | bt1-pvt.h | 62 * @PVT_TEMP_MIN: Minimal temperature in millidegrees of Celsius. 65 * @PVT_VOLT_MIN: Minimal voltage in mV. 68 * @PVT_DATA_MIN: Minimal PVT raw data value. 70 * @PVT_TRIM_MIN: Minimal temperature sensor trim value. 76 * @PVT_TOUT_MIN: Minimal timeout between samples in nanoseconds.
|
/linux-6.12.1/tools/testing/selftests/rcutorture/doc/ |
D | rcu-test-image.txt | 1 Normally, a minimal initrd is created automatically by the rcutorture 2 scripting. But minimal really does mean "minimal", namely just a single
|
/linux-6.12.1/drivers/net/ethernet/tehuti/ |
D | tn40.h | 56 struct tn40_fifo m; /* The minimal set of variables used by all fifos */ 60 struct tn40_fifo m; /* The minimal set of variables used by all fifos */ 64 struct tn40_fifo m; /* The minimal set of variables used by all fifos */ 68 struct tn40_fifo m; /* The minimal set of variables used by all fifos */
|
D | tehuti.h | 156 struct fifo m; /* minimal set of variables used by all fifos */ 160 struct fifo m; /* minimal set of variables used by all fifos */ 164 struct fifo m; /* minimal set of variables used by all fifos */ 168 struct fifo m; /* minimal set of variables used by all fifos */
|
/linux-6.12.1/include/linux/mfd/ |
D | max14577.h | 81 /* Minimal current, set in CHGCTRL4/MBCICHWRCL, uA */ 84 * Minimal current when high setting is active,
|
/linux-6.12.1/net/llc/ |
D | llc_input.c | 2 * llc_input.c - Minimal input path for LLC 29 * Packet handler for the station, registerable because in the minimal 30 * LLC core that is taking shape only the very minimal subset of LLC that
|
/linux-6.12.1/Documentation/filesystems/ |
D | directory-locking.rst | 163 Suppose deadlocks are possible. Consider the minimal deadlocked 168 contended locks in the minimal deadlock will be of the same rank, 185 Each operation in the minimal cycle must have locked at least 237 properties required for a minimal deadlock can not exist.
|
/linux-6.12.1/include/net/ |
D | netdev_queues.h | 179 * @stop_thrs: minimal number of available descriptors for queue to be left 181 * @start_thrs: minimal number of descriptors to re-enable the queue, can be 223 * @start_thrs: minimal number of descriptors to re-enable the queue
|
/linux-6.12.1/drivers/clocksource/ |
D | timer-vf-pit.c | 140 * reaches 0, it will generate an interrupt, thus the minimal in pit_clockevent_init() 142 * minimal LDVAL trigger value + 1, and the max_delta is full 32-bit. in pit_clockevent_init()
|
/linux-6.12.1/tools/include/nolibc/ |
D | nolibc.h | 7 * This file is designed to be used as a libc alternative for minimal programs 9 * type definitions, and the minimal startup code needed to call main().
|
D | errno.h | 3 * Minimal errno definitions for NOLIBC
|
/linux-6.12.1/drivers/gpu/drm/xe/ |
D | xe_pcode.c | 208 * @min_gt_freq: Minimal (RPn) GT frequency in units of 50MHz. 211 * This function initialize PCODE's QOS frequency table for a proper minimal 219 * frequency is higher then the minimal, and other errors directly translated
|
/linux-6.12.1/Documentation/admin-guide/mm/damon/ |
D | reclaim.rst | 18 minimal performance degradation [1]_ [2]_ . 150 Minimal time to wait before checking the watermarks, when DAMON_RECLAIM is 202 The minimal number of monitoring regions of DAMON for the cold memory
|
/linux-6.12.1/Documentation/power/ |
D | power_supply_class.rst | 105 design values for maximal and minimal power supply voltages. 106 Maximal/minimal means values of voltages when battery considered 111 about maximal and minimal voltage thresholds of a given battery.
|
/linux-6.12.1/include/asm-generic/ |
D | dma.h | 6 * Most architectures don't have these any more and can get the minimal
|
/linux-6.12.1/include/linux/dma/ |
D | pxa-dma.h | 15 * @prio: minimal mandatory priority of the channel
|
/linux-6.12.1/include/linux/ |
D | kmsan_types.h | 3 * A minimal header declaring types added by KMSAN to existing kernel structs.
|
D | page_reporting.h | 22 /* Minimal order of page reporting */
|
/linux-6.12.1/lib/ |
D | bust_spinlocks.c | 5 * Provides a minimal bust_spinlocks for architectures which don't
|
12345678910>>...32