| /linux/Documentation/locking/ |
| H A D | locktypes.rst | 126 semaphores have no concept of owners, thus preventing PREEMPT_RT from
137 On non-PREEMPT_RT kernels the implementation is fair, thus preventing
148 implementation, thus changing the fairness:
152 thus starving even high-priority writers. In contrast, because readers
154 have its priority boosted until it releases the lock, thus preventing that
192 PREEMPT_RT kernels map local_lock to a per-CPU spinlock_t, thus changing
219 critical section is tiny, thus avoiding RT-mutex overhead.
303 thus preventing writer starvation.
309 implementation, thus changing semantics:
315 thus starving even high-priority writers. In contrast, because readers
[all …]
|
| /linux/Documentation/networking/device_drivers/ethernet/toshiba/ |
| H A D | spider_net.rst | 46 marks it full, and advances the GDACTDPA by one. Thus, when there is
55 and advance the tail pointer. Thus, when there is flowing RX traffic,
67 then mark the descr as "empty", ready to receive data. Thus, when there
74 Thus, in an idle system, the GDACTDPA, tail and head pointers will
157 marked xa... which is "empty". Thus, from the OS point of view, there
164 Since its already full, the hardware can do nothing more, and thus has
167 descr 254, since tail was at 255.) Thus, the system is deadlocked,
|
| /linux/Documentation/staging/ |
| H A D | static-keys.rst | 63 functionality. Thus, it is highly desirable to reduce their impact as much as
85 Thus, by default the 'printk' will not be emitted. And the code generated will
89 out-of-line true branch. Thus, changing branch direction is expensive but
144 Thus, 'static_branch_inc()' means 'make the branch true', and
161 thus a sure deadlock recipe. In order to still allow use of the
272 Thus, the disable jump label case adds a 'mov', 'test' and 'jne' instruction
274 to a 5 byte atomic no-op instruction at boot-time.) Thus, the disabled jump
281 function is 80 bytes long. Thus, we have saved 20% of the instruction
|
| H A D | crc32.rst | 17 subtract, we just xor. Thus, we tend to get a bit sloppy about
58 32 bits later. Thus, the first 32 cycles of this are pretty boring.
153 takes barely longer than a single table look-up and thus performs almost
164 been completed. Thus, the processor's load/store unit is sometimes idle.
170 on the previous CRC at all. Thus, those 4 table look-ups may commence
179 of a polynomial produces a larger multiple of that polynomial. Thus,
|
| /linux/fs/bcachefs/ |
| H A D | extents_format.h | 11 * represent extents that have been partially overwritten and thus trimmed:
20 * Thus an extent that is not checksummed or compressed will consist only of a
29 * Thus, in addition to the current size of the extent in struct bkey, we need
44 * in a bucket that has become heavily fragmented, and thus is being rewritten
47 * Thus it will only move a subset of the pointers (or in the case of
57 * Thus, a bch_extent consists of bch_extent_crc32s, bch_extent_crc64s, and
|
| /linux/Documentation/ABI/testing/ |
| H A D | sysfs-bus-pci-devices-aer_stats | 18 be reported using a single ERR_COR message, thus
39 be reported using a single ERR_FATAL message, thus
69 may be reported using a single ERR_FATAL message, thus
100 device, so these counters include them and are thus cumulative of all the error
|
| /linux/Documentation/security/tpm/ |
| H A D | tpm-security.rst | 45 send arbitrary PCR extends and thus disrupt the measurement system,
123 off version that tampering has occurred. Thus it becomes possible to
136 known (and usually empty). Thus, every HMAC session used by the
138 which thus provides a cryptographic input into the session key
139 derivation. Thus, the kernel creates the null primary key once (as a
184 attestation is done by the TPM owner who thus has access to only the
191 the encrypted parameter and thus the TPM will not be able to perform
|
| /linux/Documentation/networking/ |
| H A D | representors.rst | 29 representors. The PF can thus always communicate freely with the virtual
34 Thus, a representor is both a control plane object (representing the function in
97 Thus, the following should all have representors:
137 thus use some other channel such as devlink.
141 run over the virtual switch and the virtio-blk PF should thus *not* have a
187 that representor netdevice. Thus, if the delivery part of the rule corresponds
192 software) send the packet through the representor (and thus indirectly deliver
|
| /linux/Documentation/hid/ |
| H A D | hidreport-parsing.rst | 34 function is ``Usage Page``, thus for parsing the value 0x01 in the second byte
38 the HUT. We have a ``Usage Page``, thus we need to refer to HUT
44 and is a ``Local`` item (``10``). Thus, the meaning of the remaining four bits
|
| /linux/Documentation/hwmon/ |
| H A D | abituguru3.rst | 16 firmware and thus effectively many different revisions of the uGuru.
41 detection to be skipped, and thus the insmod to
43 driver will not load and thus no hwmon device will get
|
| H A D | abituguru.rst | 20 firmware and thus effectively many different revisions of the uGuru.
56 detection to be skipped, and thus the insmod to
58 driver will not load and thus no hwmon device will get
|
| /linux/Documentation/rust/ |
| H A D | testing.rst | 65 (thus enforcing they are kept in sync with the code they document) and as well
105 code, thus also benefitting from extra linting.
123 Thus, we presently simply print an error to the kernel log if an assertion
135 (currently) and thus is fairly limited in what these tests can test.
|
| /linux/Documentation/virt/kvm/ |
| H A D | halt-polling.rst | 19 invoked. Thus halt polling is especially useful on workloads with very short
45 Thus this is a per vcpu (or vcore) value.
49 received during the polling interval (and thus schedule is invoked) there are
143 entire block time and thus cpu utilisation will go to 100%.
152 allow that other task to run. Thus this doesn't allow a guest to cause denial of service
|
| /linux/Documentation/devicetree/bindings/regulator/ |
| H A D | ltc3589.txt | 21 0.3625 V to 0.75 V in 12.5 mV steps. The output voltage thus ranges between
23 have a fixed 0.8 V reference and thus output 0.8 * (1 + R1/R2) V. The ldo3
27 be disabled and thus should have the regulator-always-on property set.
|
| /linux/Documentation/devicetree/bindings/iio/adc/ |
| H A D | renesas,rcar-gyroadc.yaml | 71 data as it contains four ADCs on the chip and thus for 4-channel
80 thus for 8-channel operation, 8 chips are required.
87 Maxim chip supplies single ADC channel with data, thus for
|
| /linux/drivers/pinctrl/aspeed/ |
| H A D | pinmux-aspeed.c | 36 * outcome: The bitfields can be greater than one bit in size and thus can take
39 * is enabled). Thus we must explicitly test for either condition as required.
80 * neither the enabled nor disabled state. Thus we must explicitly test for
|
| /linux/Documentation/devicetree/bindings/gpio/ |
| H A D | nvidia,tegra186-gpio.yaml | 43 control a number of GPIOs. Thus, each GPIO is named according to an
62 ports. Thus, the number of interrupt signals generated by a controller
70 for each generated signal to be routed to a different CPU, thus allowing
73 separate register. Thus, a driver needs to know which status register to
|
| /linux/Documentation/bpf/ |
| H A D | ringbuf.rst | 119 reference-tracking logic, similar to socket ref-tracking. It is thus
182 already committed. It is thus possible for slow producers to temporarily hold
185 One interesting implementation bit, that significantly simplifies (and thus
190 last data page would be first data page again, and thus the sample will still
198 the record being committed. If not, consumer still has to catch up and thus
|
| /linux/tools/memory-model/litmus-tests/ |
| H A D | README | 188 complex due to a desire to have short(er) names. Thus, there is a tool to
224 smp_load_acquire(), so next is "Once". Thus far, we have "Rfi Once".
235 thus far is thus "Rfi Once PodRR Once Fre Once".
240 The full string is thus:
|
| /linux/Documentation/devicetree/bindings/clock/ |
| H A D | dove-divider-clock.txt | 5 the PMU, and thus this node should be a child of the PMU node.
20 Core PLL and Clock Divider Control 1 register. Thus, it will have
|
| /linux/Documentation/sound/cards/ |
| H A D | sb-live-mixer.rst | 93 The result is forwarded to the ADC capture FIFO (thus to the standard capture
106 The result is forwarded to the ADC capture FIFO (thus to the standard capture
120 The result is forwarded to the ADC capture FIFO (thus to the standard capture
149 of the AC97 codec. The result is forwarded to the ADC capture FIFO (thus to
166 forwarded to the ADC capture FIFO (thus to the standard capture PCM device).
178 forwarded to the ADC capture FIFO (thus to the standard capture PCM device).
190 (thus to the standard capture PCM device).
202 (thus to the standard capture PCM device).
214 capture FIFO (thus to the standard capture PCM device).
|
| /linux/Documentation/arch/x86/x86_64/ |
| H A D | fred.rst | 57 context upon event delivery and return. Thus it avoids the problem of
65 FRED always restores the full value of %rsp, thus ESPFIX is no longer
80 longer needed when FRED is enabled, thus is disallowed (#UD).
|
| /linux/drivers/of/unittest-data/ |
| H A D | overlay_bad_add_dup_prop.dtso | 9 * Thus the property "rpm_avail" in each fragment will
22 * memory leak and thus people who use kmemleak will not
|
| /linux/Documentation/filesystems/ |
| H A D | inotify.rst | 24 the file and thus, worse, pins the mount. Dnotify is therefore infeasible
38 spaces is thus sensible. The current design is what user-space developers
73 juggle more than one queue and thus more than one associated fd. There
|
| /linux/drivers/hwtracing/coresight/ |
| H A D | coresight-trbe.c | 5 * device (ETE) thus generating required trace data. Trace can be enabled
32 * sinks and thus we use ETE trace packets to pad the
81 * a trace session. Thus we need a quicker access to per-CPU
269 * ETE and thus there might be some amount of trace that was in trbe_report_wrap_event()
379 * within the buffer. Thus we ensure there is at least an extra in trbe_min_trace_buf_size()
422 * and skip this section thus advancing the head. in __trbe_normal_offset()
666 * Thus the check TRBPTR == TRBBASER will not be honored. in trbe_get_fault_act()
694 * erratum which forces the PAGE_SIZE alignment on the TRBPTR, and thus in trbe_get_trace_size()
696 * 64bytes. Thus we ignore the potential triggering of the erratum in trbe_get_trace_size()
706 * of the ring buffer. Thus use the beginning of the ring in trbe_get_trace_size()
[all …]
|