| /linux/tools/sched_ext/ |
| H A D | scx_flatcg.bpf.c | 17 * For example, B is competing against C and in that competition its share is
18 * 100/(100+100) == 1/2. At its parent level, A is competing against D and A's
21 * eventual shaer is the same at 1/6. D is only competing at the top level and
25 * as B, C and D competing each other with respective share of 1/6, 1/6 and 2/3
32 * apache instances competing with 2:1 weight ratio nested four level deep.
|
| /linux/Documentation/devicetree/bindings/i2c/ |
| H A D | i2c-gate.yaml | 16 there are no competing masters to consider for gates and therefore there is
|
| /linux/net/dccp/ccids/ |
| H A D | Kconfig | 20 be reasonably fair when competing for bandwidth with TCP-like flows,
|
| /linux/Documentation/ |
| H A D | atomic_t.txt | 115 This is typically true on 'normal' platforms, where a regular competing STORE
328 guarantees between competing LL/SC sections, such a guarantee does not
|
| /linux/tools/testing/selftests/bpf/benchs/ |
| H A D | run_bench_ringbufs.sh | 42 header "Single-producer, consumer/producer competing on the same CPU, low batch count"
|
| /linux/Documentation/usb/ |
| H A D | CREDITS | 137 introductory documents (competing with Alberto's :).
|
| /linux/include/drm/ |
| H A D | drm_modeset_lock.h | 42 * Each thread competing for a set of locks must use one acquire
|
| /linux/arch/mips/include/asm/ |
| H A D | sync.h | 140 * such that the Invalidate of a competing LL-SC goes 'missing' and SC
|
| /linux/Documentation/driver-api/dmaengine/ |
| H A D | dmatest.rst | 17 competing for the same channel.
|
| /linux/tools/testing/selftests/powerpc/mm/ |
| H A D | pkey_siginfo.c | 8 * attempted to be protected by two different keys from two competing
|
| /linux/Documentation/block/ |
| H A D | bfq-iosched.rst | 194 processes are competing for the device at the same time, but
282 - If several processes are competing for the device at the same time,
|
| /linux/Documentation/locking/ |
| H A D | ww-mutex-design.rst | 116 expect the number of simultaneous competing transactions to be typically small,
|
| /linux/Documentation/filesystems/caching/ |
| H A D | netfs-api.rst | 380 competing DIO writes to the same storage in the cache.
|
| /linux/Documentation/admin-guide/sysctl/ |
| H A D | net.rst | 144 RPS (e.g. RFS, aRFS) processing is competing with the registered NAPI poll function
|
| /linux/LICENSES/preferred/ |
| H A D | LGPL-2.1 | 98 advantage over competing non-free programs. These disadvantages are the
|
| /linux/block/ |
| H A D | blk-wbt.c | 545 * the idle limit, or go to normal if we haven't had competing in get_limit()
|
| /linux/fs/bcachefs/ |
| H A D | six.c | 114 * for anoter thread taking the competing lock type, and we may havve to do a
|
| /linux/drivers/memory/tegra/ |
| H A D | tegra20-emc.c | 1161 * competing memory accesses. This means that threshold should be in tegra_emc_devfreq_init()
|
| /linux/drivers/usb/core/ |
| H A D | urb.c | 179 * At this point, we could be competing with another thread which in usb_unanchor_urb()
|
| /linux/drivers/clocksource/ |
| H A D | sh_cmt.c | 436 /* we're competing with the interrupt handler. in sh_cmt_clock_event_program_verify()
|
| /linux/mm/ |
| H A D | util.c | 993 * balancing memory across competing virtual machines that are hosted.
|
| /linux/drivers/gpu/drm/amd/amdkfd/ |
| H A D | kfd_priv.h | 815 * number of CU's a device has along with number of other competing processes
|
| /linux/Documentation/mm/ |
| H A D | process_addrs.rst | 707 VMA read locking is entirely optimistic - if the lock is contended or a competing
|
| /linux/fs/kernfs/ |
| H A D | dir.c | 1623 * SUICIDAL is used to arbitrate among competing invocations. Only in kernfs_remove_self()
|
| /linux/drivers/accel/habanalabs/common/ |
| H A D | device.c | 2515 * This function is competing with the reset function, so try to in hl_device_fini()
|