| /Linux-v5.15/tools/perf/pmu-events/arch/x86/jaketown/ |
| D | uncore-power.json | 10 …than or equal to the frequency that is configured in the filter. (filter_band0=XXX with XXX in 10…
20 …than or equal to the frequency that is configured in the filter. (filter_band1=XXX with XXX in 10…
30 …than or equal to the frequency that is configured in the filter. (filter_band2=XXX with XXX in 10…
40 …than or equal to the frequency that is configured in the filter. (filter_band3=XXX, with XXX in 1…
50 …than or equal to the frequency that is configured in the filter. (filter_band0=XXX with XXX in 10…
61 …than or equal to the frequency that is configured in the filter. (filter_band1=XXX with XXX in 10…
72 …than or equal to the frequency that is configured in the filter. (filter_band2=XXX with XXX in 10…
83 …than or equal to the frequency that is configured in the filter. (filter_band3=XXX, with XXX in 1…
186 …s the number of cycles that the uncore was running at a frequency greater than or equal to 1.2Ghz.…
197 …s the number of cycles that the uncore was running at a frequency greater than or equal to 2Ghz. D…
[all …]
|
| /Linux-v5.15/tools/perf/pmu-events/arch/x86/ivytown/ |
| D | uncore-power.json | 10 …than or equal to the frequency that is configured in the filter. (filter_band0=XXX, with XXX in 1…
20 …than or equal to the frequency that is configured in the filter. (filter_band1=XXX, with XXX in 1…
30 …than or equal to the frequency that is configured in the filter. (filter_band2=XXX, with XXX in 1…
40 …than or equal to the frequency that is configured in the filter. (filter_band3=XXX, with XXX in 1…
50 …than or equal to the frequency that is configured in the filter. (filter_band0=XXX, with XXX in 1…
61 …than or equal to the frequency that is configured in the filter. (filter_band1=XXX, with XXX in 1…
72 …than or equal to the frequency that is configured in the filter. (filter_band2=XXX, with XXX in 1…
83 …than or equal to the frequency that is configured in the filter. (filter_band3=XXX, with XXX in 1…
187 …s the number of cycles that the uncore was running at a frequency greater than or equal to 1.2Ghz.…
198 …s the number of cycles that the uncore was running at a frequency greater than or equal to 2Ghz. D…
[all …]
|
| /Linux-v5.15/tools/perf/pmu-events/arch/x86/icelakex/ |
| D | memory.json | 164 …domly selected loads when the latency from first dispatch to completion is greater than 4 cycles.",
174 …tency from first dispatch to completion is greater than 4 cycles. Reported latency may be longer …
180 …domly selected loads when the latency from first dispatch to completion is greater than 8 cycles.",
190 …tency from first dispatch to completion is greater than 8 cycles. Reported latency may be longer …
196 …omly selected loads when the latency from first dispatch to completion is greater than 16 cycles.",
206 …ency from first dispatch to completion is greater than 16 cycles. Reported latency may be longer …
212 …omly selected loads when the latency from first dispatch to completion is greater than 32 cycles.",
222 …ency from first dispatch to completion is greater than 32 cycles. Reported latency may be longer …
228 …omly selected loads when the latency from first dispatch to completion is greater than 64 cycles.",
238 …ency from first dispatch to completion is greater than 64 cycles. Reported latency may be longer …
[all …]
|
| /Linux-v5.15/tools/perf/pmu-events/arch/x86/tigerlake/ |
| D | memory.json | 25 …mly selected loads when the latency from first dispatch to completion is greater than 128 cycles.",
35 …ency from first dispatch to completion is greater than 128 cycles. Reported latency may be longer…
41 …omly selected loads when the latency from first dispatch to completion is greater than 16 cycles.",
51 …ency from first dispatch to completion is greater than 16 cycles. Reported latency may be longer …
57 …mly selected loads when the latency from first dispatch to completion is greater than 256 cycles.",
67 …ency from first dispatch to completion is greater than 256 cycles. Reported latency may be longer…
73 …omly selected loads when the latency from first dispatch to completion is greater than 32 cycles.",
83 …ency from first dispatch to completion is greater than 32 cycles. Reported latency may be longer …
89 …domly selected loads when the latency from first dispatch to completion is greater than 4 cycles.",
99 …tency from first dispatch to completion is greater than 4 cycles. Reported latency may be longer …
[all …]
|
| /Linux-v5.15/Documentation/ABI/testing/ |
| D | sysfs-tty | 30 sysfs rather than via ioctls.
39 sysfs rather than via ioctls.
48 sysfs rather than via ioctls.
57 sysfs rather than via ioctls.
66 sysfs rather than via ioctls.
75 sysfs rather than via ioctls.
84 sysfs rather than via ioctls.
93 sysfs rather than via ioctls.
102 sysfs rather than via ioctls.
111 sysfs rather than via ioctls.
[all …]
|
| /Linux-v5.15/tools/perf/pmu-events/arch/powerpc/power8/ |
| D | memory.json | 53 …"BriefDescription": "Final Pump Scope (Group) ended up either larger or smaller than Initial Pump …
54 …"PublicDescription": "Final Pump Scope(Group) to get data sourced, ended up larger than Initial Pu…
59 …"BriefDescription": "Final Pump Scope (Group) ended up larger than Initial Pump Scope (Chip) for a…
60 …"PublicDescription": "Final Pump Scope(Group) to get data sourced, ended up larger than Initial Pu…
84 …"PublicDescription": "Final Pump Scope(system) to get data sourced, ended up larger than Initial P…
89 …"BriefDescription": "Final Pump Scope (system) ended up larger than Initial Pump Scope (Chip/Group…
90 …"PublicDescription": "Final Pump Scope(system) to get data sourced, ended up larger than Initial P…
119 …"BriefDescription": "Final Pump Scope (Group) ended up either larger or smaller than Initial Pump …
120 …"PublicDescription": "Final Pump Scope(Group) to get data sourced, ended up larger than Initial Pu…
125 …"BriefDescription": "Final Pump Scope (Group) ended up larger than Initial Pump Scope (Chip) for a…
[all …]
|
| /Linux-v5.15/Documentation/filesystems/ |
| D | inotify.rst | 33 An fd-per-watch quickly consumes more file descriptors than are allowed,
34 more fd's than are feasible to manage, and more fd's than are optimally
37 A watch consumes less memory than an open file, separating the number
72 Additionally, it _is_ possible to more than one instance and
73 juggle more than one queue and thus more than one associated fd. There
75 process can easily want more than one queue.
|
| /Linux-v5.15/tools/perf/pmu-events/arch/x86/icelake/ |
| D | memory.json | 41 …omly selected loads when the latency from first dispatch to completion is greater than 16 cycles.",
51 …ency from first dispatch to completion is greater than 16 cycles. Reported latency may be longer …
159 …mly selected loads when the latency from first dispatch to completion is greater than 512 cycles.",
169 …ency from first dispatch to completion is greater than 512 cycles. Reported latency may be longer…
369 …domly selected loads when the latency from first dispatch to completion is greater than 4 cycles.",
379 …tency from first dispatch to completion is greater than 4 cycles. Reported latency may be longer …
385 …mly selected loads when the latency from first dispatch to completion is greater than 128 cycles.",
395 …ency from first dispatch to completion is greater than 128 cycles. Reported latency may be longer…
413 …domly selected loads when the latency from first dispatch to completion is greater than 8 cycles.",
423 …tency from first dispatch to completion is greater than 8 cycles. Reported latency may be longer …
[all …]
|
| /Linux-v5.15/drivers/net/ethernet/intel/i40e/ |
| D | i40e_lan_hmc.h | 14 * The sizes of the variables may be larger than needed due to crossing byte
21 u16 cpuid; /* bigger than needed, see above for reason */
25 u16 dbuff; /* bigger than needed, see above for reason */
27 u16 hbuff; /* bigger than needed, see above for reason */
36 u32 rxmax; /* bigger than needed, see above for reason */
41 u16 lrxqthresh; /* bigger than needed, see above for reason */
47 * The sizes of the variables may be larger than needed due to crossing byte
|
| /Linux-v5.15/arch/arm/nwfpe/ |
| D | fpa11_cprt.c | 34 /* Hint to GCC that we'd like a jump table rather than a load of CMPs */ in EmulateCPRT()
157 comparison (cheaper than an 80-bit one). */ in PerformComparison()
221 /* test for less than condition */ in PerformComparison()
229 /* test for greater than or equal condition */ in PerformComparison()
247 /* test for less than condition */ in PerformComparison()
255 /* test for greater than or equal condition */ in PerformComparison()
268 /* test for less than condition */ in PerformComparison()
276 /* test for greater than or equal condition */ in PerformComparison()
294 /* test for less than condition */ in PerformComparison()
302 /* test for greater than or equal condition */ in PerformComparison()
[all …]
|
| /Linux-v5.15/drivers/cpuidle/governors/ |
| D | teo.c | 13 * timer events are two or more orders of magnitude more frequent than any
25 * consider idle duration values greater than the sleep length, because the
30 * a CPU is likely to be significantly shorter than the sleep length and selects
52 * situations in which the measured idle duration is so much shorter than the
54 * shallower than the one whose bin is fallen into by the sleep length (these
75 * than the candidate one (it represents the cases in which the CPU was not
80 * shallower than the candidate one.
82 * 2. If the second sum is greater than the first one or the third sum is
83 * greater than %NR_RECENT / 2, the CPU is likely to wake up early, so look
86 * - Traverse the idle states shallower than the candidate one in the
[all …]
|
| /Linux-v5.15/Documentation/networking/ |
| D | ipsec.rst | 20 defined in section 3, is not smaller than the size of the original
26 datagram fragmentation when the expanded datagram is larger than the
31 where IP datagrams of size smaller than the threshold are sent in the
37 is smaller than the threshold or the compressed len is larger than original
|
| /Linux-v5.15/tools/perf/pmu-events/arch/x86/goldmont/ |
| D | frontend.json | 4 …line, and that cache line is in the ICache. This event counts differently than Intel processors ba…
10 …ine that are available in the ICache (hit). This event counts differently than Intel processors ba…
14 …, and that cache line is not in the ICache. This event counts differently than Intel processors ba…
20 …hat are not available in the ICache (miss). This event counts differently than Intel processors ba…
24 …r when a branch target is to a new line.\r\nThis event counts differently than Intel processors ba…
30 …"BriefDescription": "References per ICache line. This event counts differently than Intel processo…
|
| /Linux-v5.15/arch/x86/math-emu/ |
| D | README | 74 a value of pi which is accurate to more than 128 bits. As a consequence,
75 the reduced argument is accurate to more than 64 bits for arguments up
76 to a few pi, and accurate to more than 64 bits for most arguments,
96 therefore now fully re-entrant, rather than having just the restricted
103 are fewer than those which applied to the 1.xx series of the emulator.
113 (a) the operands have a higher precision than the current setting of the
116 (c) the magnitude of the exact result (before rounding) is less than 2^-16382.
146 greater than 0xffff appear to be illegal in vm86 mode but are quite
229 than that of an Intel 80486 FPU.
241 arguments greater than pi/4 can be thought of as being related to the
[all …]
|
| D | reg_round.S | 49 | smaller than the magnitude of the correct exact result by an amount |
50 | greater than zero and less than one ls bit of the significand. |
53 | less than 0x80000000 <=> the significand is less than 1/2 an ls |
54 | bit smaller than the magnitude of the |
57 | smaller than the magnitude of the true |
59 | greater than 0x80000000 <=> the significand is more than 1/2 an ls |
60 | bit smaller than the magnitude of the |
214 jc LCheck_truncate_24 /* less than half, no increment needed */
216 jne LGreater_Half_24 /* greater than half, increment needed */
220 jnz LGreater_Half_24 /* greater than half, increment needed */
[all …]
|
| /Linux-v5.15/tools/perf/pmu-events/arch/x86/goldmontplus/ |
| D | frontend.json | 4 …line, and that cache line is in the ICache. This event counts differently than Intel processors ba…
12 …ine that are available in the ICache (hit). This event counts differently than Intel processors ba…
16 …, and that cache line is not in the ICache. This event counts differently than Intel processors ba…
24 …hat are not available in the ICache (miss). This event counts differently than Intel processors ba…
28 …r when a branch target is to a new line.\r\nThis event counts differently than Intel processors ba…
36 …"BriefDescription": "References per ICache line. This event counts differently than Intel processo…
|
| /Linux-v5.15/Documentation/driver-api/thermal/ |
| D | cpu-idle-cooling.rst | 26 budget lower than the requested one and under-utilize the CPU, thus
28 with a power less than the requested power budget and the next OPP
48 belong to the same cluster, with a duration greater than the cluster
132 - It is less than or equal to the latency we tolerate when the
137 - It is greater than the idle state’s target residency we want to go
148 ... which is more than the sustainable power (or there is something
177 Practically, if the running power is less than the targeted power, we
180 running power greater than the targeted power.
192 * The injected idle duration must be greater than the idle state
|
| /Linux-v5.15/arch/nds32/lib/ |
| D | memmove.S | 29 andi $r2, $r2, #3 ! How many bytes are less than a word
31 beqz $p1, byte_cpy ! When n is less than a word
44 andi $r2, $r2, #3 ! How many bytes are less than a word
46 beqz $p1, reverse_byte_cpy ! When n is less than a word
58 byte_cpy: ! Less than 4 bytes to copy now
|
| /Linux-v5.15/drivers/target/iscsi/ |
| D | iscsi_target_nodeattrib.c | 50 pr_err("Requested DataOut Timeout %u larger than" in iscsit_na_dataout_timeout()
55 pr_err("Requested DataOut Timeout %u smaller than" in iscsit_na_dataout_timeout()
76 " than maximum %u", dataout_timeout_retries, in iscsit_na_dataout_timeout_retries()
81 " than minimum %u", dataout_timeout_retries, in iscsit_na_dataout_timeout_retries()
106 pr_err("Requested NopIn Timeout %u larger than maximum" in iscsit_na_nopin_timeout()
111 pr_err("Requested NopIn Timeout %u smaller than" in iscsit_na_nopin_timeout()
157 " than maximum %u\n", nopin_response_timeout, in iscsit_na_nopin_response_timeout()
162 " than minimum %u\n", nopin_response_timeout, in iscsit_na_nopin_response_timeout()
|
| /Linux-v5.15/Documentation/devicetree/bindings/sound/ |
| D | wlf,arizona.yaml | 30 default. If present, values must be specified less than or equal
31 to the number of input signals. If values less than the number of
49 should be less than or equal to the number of outputs, if less values
64 of values should be less than or equal to the number of inputs,
79 be handled normally. If present, number of cells must be less than
80 or equal to the number of AIFs. If less than the number of AIFs, for
|
| /Linux-v5.15/fs/ntfs3/lib/ |
| D | decompress_common.c | 43 * a codeword shorter than 'max_codeword_len' will have multiple entries
56 * less than or equal to 'max_codeword_len'. Then, only codewords of
84 * 'lens' array. Must be less than or equal to 2048.
88 * less than or equal to 13.
98 * All entries in 'lens' must be less than or equal to this value.
99 * This must be less than or equal to 23.
179 * max_codeword_len is the number of codewords shorter than 'len' bits. in make_huffman_decode_table()
187 * than 'num_syms' entries in 'sorted_syms' may be filled. in make_huffman_decode_table()
225 * there are codewords longer than table_bits for which we must in make_huffman_decode_table()
248 * fewer than this may actually be needed. in make_huffman_decode_table()
[all …]
|
| /Linux-v5.15/Documentation/filesystems/spufs/ |
| D | spufs.rst | 87 If a count smaller than four is requested, read returns -1 and
101 If a count smaller than four is requested, read returns -1 and
121 operations on an open wbox file are: write(2) If a count smaller than
146 If a count smaller than four is requested, read returns -1 and
177 When the count supplied to the read call is shorter than the
198 If a count smaller than four is requested, read returns -1 and
204 If a count smaller than four is requested, write returns -1 and
219 If a count smaller than four is requested, read returns -1 and
225 If a count smaller than four is requested, write returns -1 and
245 When the count supplied to the read call is shorter than the
|
| /Linux-v5.15/Documentation/usb/ |
| D | ehci.rst | 38 Note that USB 2.0 support involves more than just EHCI. It requires
90 and prevent use of polling intervals of less than one frame.
147 badly when they see different faults than OHCI or UHCI report.
165 So more than 50 MByte/sec is available for bulk transfers, when both
183 microframe rather than thirteen. (Seems like a reasonable trade off
196 it completed in less than 250 usec (depending on transfer size).
207 going to waste more than half the USB 2.0 bandwidth. Delays between the
209 than the I/O. If that same loop used 16 KB chunks, it'd be better; a
212 But rather than depending on such large I/O buffers to make synchronous
229 More than standard 80% periodic bandwidth allocation is possible
|
| /Linux-v5.15/include/linux/ |
| D | iopoll.h | 23 * tight-loops). Should be less than ~20ms since usleep_range
34 * macros defined below rather than this macro directly.
67 * be less than ~10us since udelay is used (see
77 * macros defined below rather than this macro directly.
109 * tight-loops). Should be less than ~20ms since usleep_range
118 * macros defined below rather than this macro directly.
130 * be less than ~10us since udelay is used (see
138 * macros defined below rather than this macro directly.
|
| /Linux-v5.15/Documentation/staging/ |
| D | crc32.rst | 16 - When dividing polynomials, there are no carries. Rather than add and
20 Like all division, the remainder is always smaller than the divisor.
89 We can do it 8 bits at a time rather than 1 bit at a time::
121 Here, rather than just shifting one bit of the remainder to decide
123 This produces a 40-bit (rather than a 33-bit) intermediate remainder,
132 It is not practical to process much more than 8 bits at a time using this
133 technique, because tables larger than 256 entries use too much memory and,
145 producing a 48-bit intermediate remainder. Rather than doing a single
153 takes barely longer than a single table look-up and thus performs almost
|
