| /linux/tools/gpio/ |
| H A D | gpio-hammer.c | 34 unsigned int iteration = 0; in hammer_device() local
100 iteration++; in hammer_device()
101 if (loops && iteration == loops) in hammer_device()
|
| /linux/arch/sh/lib/ |
| H A D | memcpy-sh4.S | 29 ! At the start of each iteration, r7 contains last long load
39 ! 6 cycles, 4 bytes per iteration
102 ! At the start of each iteration, r7 contains last long load
112 ! 6 cycles, 4 bytes per iteration
222 ! 4 cycles, 2 bytes per iteration
250 ! 3 cycles, 1 byte per iteration
332 ! 4 cycles, 2 long words per iteration
366 ! 4 cycles, 2 long words per iteration
386 ! 3 cycles, 1 byte per iteration
434 ! 4 cycles, 2 long words per iteration
[all …]
|
| H A D | copy_page.S | 310 1: ! Read longword, write two words per iteration
332 ! Read longword, write byte, word, byte per iteration
|
| /linux/drivers/net/ethernet/sfc/ |
| H A D | selftest.c | 49 __be16 iteration;
348 if (received.iteration != payload->iteration) { in efx_loopback_rx_packet()
351 "%s loopback test\n", ntohs(received.iteration), in efx_loopback_rx_packet()
352 ntohs(payload->iteration), LOOPBACK_MODE(efx)); in efx_loopback_rx_packet()
406 payload->iteration = htons(ntohs(payload->iteration) + 1); in efx_iterate_state()
|
| /linux/drivers/net/ethernet/sfc/siena/ |
| H A D | selftest.c | 50 __be16 iteration;
349 if (received.iteration != payload->iteration) { in efx_siena_loopback_rx_packet()
352 "%s loopback test\n", ntohs(received.iteration), in efx_siena_loopback_rx_packet()
353 ntohs(payload->iteration), LOOPBACK_MODE(efx)); in efx_siena_loopback_rx_packet()
407 payload->iteration = htons(ntohs(payload->iteration) + 1); in efx_iterate_state()
|
| /linux/drivers/net/ethernet/sfc/falcon/ |
| H A D | selftest.c | 47 __be16 iteration;
351 if (received.iteration != payload->iteration) { in ef4_loopback_rx_packet()
354 "%s loopback test\n", ntohs(received.iteration), in ef4_loopback_rx_packet()
355 ntohs(payload->iteration), LOOPBACK_MODE(efx)); in ef4_loopback_rx_packet()
409 payload->iteration = htons(ntohs(payload->iteration) + 1); in ef4_iterate_state()
|
| /linux/tools/testing/selftests/iommu/ |
| H A D | iommufd_fail_nth.c | 89 unsigned int iteration; member
116 ASSERT_GT(1000, nth_state->iteration); in fail_nth_next()
117 if (nth_state->iteration != 0) { in fail_nth_next()
153 nth_state->iteration++; in fail_nth_next()
168 if (!nth_state->iteration) in __fail_nth_enable()
171 len = snprintf(buf, sizeof(buf), "%u", nth_state->iteration); in __fail_nth_enable()
|
| /linux/arch/xtensa/lib/ |
| H A D | memcopy.S | 123 # per iteration
129 # copy 16 bytes per iteration for word-aligned dst and word-aligned src
195 # copy 16 bytes per iteration for word-aligned dst and unaligned src
384 # per iteration
390 # copy 16 bytes per iteration for word-aligned dst and word-aligned src
458 # copy 16 bytes per iteration for word-aligned dst and unaligned src
|
| H A D | memset.S | 49 # per iteration
56 # set 16 bytes per iteration for word-aligned dst
|
| H A D | usercopy.S | 77 # per iteration
140 # copy 16 bytes per iteration for word-aligned dst and word-aligned src
205 # copy 16 bytes per iteration for word-aligned dst and unaligned src
|
| /linux/tools/testing/selftests/kvm/ |
| H A D | access_tracking_perf_test.c | 61 static int iteration;
66 /* Defines what vCPU threads should do during a given iteration. */
74 /* The iteration that was last completed by each vCPU. */
319 *current_iteration = READ_ONCE(iteration); in spin_wait_for_next_iteration()
367 /* Kick off the vCPUs by incrementing iteration. */ in run_iteration()
368 next_iteration = ++iteration; in run_iteration()
372 /* Wait for all vCPUs to finish the iteration. */ in run_iteration()
60 static int iteration; global() variable
|
| /linux/Documentation/gpu/ |
| H A D | drm-vm-bind-locking.rst | 172 // The following list iteration needs the Gem object's
246 one of the :ref:`gpu_vm list spinlocks <Spinlock iteration>`. Once
250 iteration scheme needs to be used.
321 .. _Spinlock iteration:
365 might want to avoid also this iteration scheme. Particularly, if the
367 anticipated number of list items is small, where list iteration doesn't
369 associated with each iteration, the atomic operation overhead
370 associated with this type of iteration is, most likely, negligible. Note that
372 iteration is protected by an outer level lock or semaphore, since list
377 concurrently with list iteration.
[all …]
|
| /linux/drivers/pnp/isapnp/ |
| H A D | core.c | 289 int iteration = 1; in isapnp_isolate() local
321 iteration++; in isapnp_isolate()
329 if (iteration == 1) { in isapnp_isolate()
333 } else if (iteration > 1) { in isapnp_isolate()
|
| /linux/Documentation/core-api/ |
| H A D | assoc_array.rst | 266 The internal tree will be packed down if possible as part of the iteration
297 it is possible for the iteration function to see some objects twice. If
299 iteration algorithm should not, however, miss any objects.
303 stops immediately if any call to the iteration function results in a
505 slot in that parent that points to it. None-recursive iteration uses these to
509 The backpointers, however, make simultaneous alteration and iteration tricky.
528 the iteration as we won't have reached the pointer to it yet and the
563 so as long as anyone doing walking or iteration holds the RCU read lock, the
|
| H A D | idr.rst | 52 idr_for_each_entry_continue() to continue an iteration. You can
|
| /linux/lib/crypto/x86/ |
| H A D | sha512-ssse3-asm.S | 305 # (80 rounds) / (2 rounds/iteration) + (1 iteration)
306 # +1 iteration because the scheduler leads hashing by 1 iteration
|
| H A D | sha512-avx-asm.S | 306 # (80 rounds) / (2 rounds/iteration) + (1 iteration)
307 # +1 iteration because the scheduler leads hashing by 1 iteration
|
| H A D | sha1-ssse3-and-avx.S | 298 .set i, ((\r) % 80) # pre-compute for the next iteration
372 # vector iteration / 4 scalar rounds
|
| /linux/arch/s390/kernel/ |
| H A D | relocate_kernel.S | 40 j .base # ...next iteration
|
| /linux/Documentation/ABI/testing/ |
| H A D | sysfs-module | 70 Description: Read and write number of grant entries to attempt to free per iteration.
|
| /linux/drivers/platform/raspberrypi/vchiq-interface/ |
| H A D | TESTING | 48 ======== iteration 1 ========
|
| /linux/Documentation/crypto/ |
| H A D | descore-readme.rst | 125 des iteration; above, Quick (64k) takes 21 and Small (2k) takes 37.
126 he claims to use 280k of tables but the iteration calculation seems
146 also very modified for crypt. his iteration code uses 16k
362 a specific sbox during a specific iteration.
|
| /linux/sound/soc/codecs/ |
| H A D | da7213.c | 275 u8 iteration; in da7213_get_alc_data() local
277 for (iteration = 0; iteration < DA7213_ALC_AVG_ITERATIONS; in da7213_get_alc_data()
278 iteration++) { in da7213_get_alc_data()
|
| /linux/tools/testing/ktest/ |
| H A D | ktest.pl | 199 my $iteration = 0;
1559 my $i = $iteration;
1588 my $i = $iteration;
1859 my $i = $iteration;
4461 $iteration = $i;
|
| /linux/Documentation/bpf/ |
| H A D | map_lpm_trie.rst | 105 from leftmost leaf first. This means that iteration will return more
|