| /linux/Documentation/locking/ |
| H A D | robust-futexes.rst | 54 To solve this problem, the traditional approach was to extend the vma
56 robust futexes attached to this area'. This approach requires 3 new
59 they have a robust_head set. This approach has two fundamental problems
63 approach had been pending for years, but they are still not completely
86 New approach to robust futexes
89 At the heart of this new approach there is a per-thread private list of
124 Key differences of this userspace-list based approach, compared to the
157 I have also measured an approach where glibc does the lock notification
164 approach scales nicely.)
|
| /linux/Documentation/gpu/ |
| H A D | drm-compute.rst | 23 from being terminated. There are several possible approach, all with their
26 The first approach you will likely try is to pin all buffers used by compute.
31 A second approach that will work slightly better on its own is adding an option
|
| /linux/Documentation/bpf/ |
| H A D | ringbuf.rst | 41 ``BPF_MAP_TYPE_HASH_OF_MAPS`` addresses this with current approach.
44 approach would be an overkill.
46 Another approach could introduce a new concept, alongside BPF map, to represent
48 with lookup/update/delete operations. This approach would add a lot of extra
52 additional benefits over the approach of using a map. ``BPF_MAP_TYPE_RINGBUF``
56 The approach chosen has an advantage of re-using existing BPF map
|
| /linux/tools/memory-model/Documentation/ |
| H A D | simple.txt | 39 This approach is called "code locking".
62 takes this approach for much of its grace-period processing and also
77 This approach delegates any LKMM worries to the library maintainer.
98 The poster boy for this approach is the hash table, where placing a lock
114 a single-threaded approach while providing excellent performance and
120 must be used to protect this global view. This is the approach taken
207 or modifying the variable. This approach guarantees that code prior
|
| /linux/Documentation/userspace-api/gpio/ |
| H A D | gpio-get-linehandle-ioctl.rst | 92 The approach applied depends on whether the feature can reasonably be emulated
95 The approach applied for each feature is as follows:
98 Feature Approach
|
| H A D | gpio-v2-get-line-ioctl.rst | 109 The approach applied depends on whether the feature can reasonably be emulated
112 The approach applied for each feature is as follows:
115 Feature Approach
|
| /linux/Documentation/userspace-api/media/dvb/ |
| H A D | dvbproperty.rst | 23 So, the legacy union/struct based approach was deprecated, in favor
24 of a properties set approach. On such approach,
|
| /linux/Documentation/arch/powerpc/ |
| H A D | kasan.txt | 38 One approach is just to give up on inline instrumentation. This way boot-time
41 current approach.
|
| /linux/include/linux/platform_data/ |
| H A D | davinci_asp.h | 40 * SYMMETRICAL APPROACH:
49 * ACCURATE CLOCK APPROACH:
|
| /linux/tools/testing/selftests/net/forwarding/ |
| H A D | README | 29 This approach for testing switch ASICs has several advantages over the
38 not always available. With the VRF-based approach one merely needs to
|
| /linux/kernel/trace/ |
| H A D | trace_preemptirq.c | 56 * and lockdep uses a staged approach which splits the lockdep hardirq
87 * and lockdep uses a staged approach which splits the lockdep hardirq
|
| /linux/Documentation/arch/arm/nwfpe/ |
| H A D | todo.rst | 25 There are a couple of ways to approach the implementation of these. One
31 Another approach, which I know little about is CORDIC. This stands for
|
| /linux/net/ipv4/ |
| H A D | tcp_rate.c | 14 * at which packets were acknowledged. However, the approach of using only the
28 * deliberately avoids using the inter-packet spacing approach because that
29 * approach requires a large number of samples and sophisticated filtering.
|
| /linux/Documentation/filesystems/ |
| H A D | inotify.rst | 78 Why the system call approach?
87 family of system calls because that is the preferred approach for new kernel
|
| /linux/lib/crypto/ |
| H A D | polyval.c | 33 * For the generic implementation, we don't use the traditional table approach
34 * to GF(2^128) multiplication. That approach is not constant-time and requires
35 * a lot of memory. Instead, we use a different approach which emulates
38 * approach is borrowed from BoringSSL, which in turn credits BearSSL's
|
| /linux/Documentation/ABI/stable/ |
| H A D | sysfs-class-bluetooth | 9 approach such as GPIO.
|
| /linux/Documentation/litmus-tests/locking/ |
| H A D | RM-fixed.litmus | 6 * This litmus test demonstrates that the old "roach motel" approach
|
| H A D | RM-broken.litmus | 6 * This litmus test demonstrates that the old "roach motel" approach
|
| /linux/net/smc/ |
| H A D | Kconfig | 30 of the SMC protocol stack compared to a complete kernel-based approach. Select
|
| /linux/tools/verification/rv/ |
| H A D | README.txt | 5 checking and theorem proving) with a more practical approach for
|
| /linux/drivers/acpi/dptf/ |
| H A D | Kconfig | 11 a coordinated approach for different policies to effect the hardware
|
| /linux/Documentation/livepatch/ |
| H A D | livepatch.rst | 97 1. The first and most effective approach is stack checking of sleeping
104 2. The second approach, if needed, is kernel exit switching. A
119 (Note there's not yet such an approach for kthreads.)
122 the second approach. It's highly likely that some tasks may still be
|
| /linux/drivers/gpu/drm/xe/instructions/ |
| H A D | xe_gsc_commands.h | 19 * actually have data and this approach doesn't work for it we can re-work it
|
| /linux/Documentation/networking/caif/ |
| H A D | linux_caif.rst | 67 It implements the CAIF protocol stack in a layered approach, where
159 In this layered approach the following "rules" apply.
|
| /linux/arch/riscv/include/asm/ |
| H A D | kvm_host.h | 226 * We have a lockless approach for tracking pending VCPU interrupts
229 * in irqs_pending. Our approach is modeled around multiple producer
|