/Linux-v5.4/tools/testing/selftests/kvm/ |
D | dirty_log_test.c | 70 static uint64_t iteration; variable 102 *(uint64_t *)addr = READ_ONCE(iteration); in guest_code() 111 *(uint64_t *)addr = READ_ONCE(iteration); in guest_code() 207 TEST_ASSERT(*value_ptr == iteration || in vm_dirty_log_verify() 208 *value_ptr == iteration - 1, in vm_dirty_log_verify() 211 page, *value_ptr, iteration); in vm_dirty_log_verify() 233 TEST_ASSERT(*value_ptr <= iteration, in vm_dirty_log_verify() 236 page, *value_ptr, iteration); in vm_dirty_log_verify() 237 if (*value_ptr == iteration) { in vm_dirty_log_verify() 355 iteration = 1; in run_test() [all …]
|
/Linux-v5.4/tools/gpio/ |
D | gpio-hammer.c | 33 unsigned int iteration = 0; in hammer_device() local 92 iteration++; in hammer_device() 93 if (loops && iteration == loops) in hammer_device()
|
/Linux-v5.4/arch/sh/lib/ |
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 …]
|
D | copy_page.S | 310 1: ! Read longword, write two words per iteration 332 ! Read longword, write byte, word, byte per iteration
|
/Linux-v5.4/drivers/net/ethernet/sfc/falcon/ |
D | selftest.c | 45 __be16 iteration; member 345 if (received->iteration != payload->iteration) { in ef4_loopback_rx_packet() 348 "%s loopback test\n", ntohs(received->iteration), in ef4_loopback_rx_packet() 349 ntohs(payload->iteration), LOOPBACK_MODE(efx)); in ef4_loopback_rx_packet() 401 payload->iteration = htons(ntohs(payload->iteration) + 1); in ef4_iterate_state()
|
/Linux-v5.4/drivers/net/ethernet/sfc/ |
D | selftest.c | 45 __be16 iteration; member 345 if (received->iteration != payload->iteration) { in efx_loopback_rx_packet() 348 "%s loopback test\n", ntohs(received->iteration), in efx_loopback_rx_packet() 349 ntohs(payload->iteration), LOOPBACK_MODE(efx)); in efx_loopback_rx_packet() 401 payload->iteration = htons(ntohs(payload->iteration) + 1); in efx_iterate_state()
|
/Linux-v5.4/arch/xtensa/lib/ |
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 397 # per iteration 403 # copy 16 bytes per iteration for word-aligned dst and word-aligned src 471 # copy 16 bytes per iteration for word-aligned dst and unaligned src
|
D | memset.S | 49 # per iteration 56 # set 16 bytes per iteration for word-aligned dst
|
D | usercopy.S | 72 # per iteration 135 # copy 16 bytes per iteration for word-aligned dst and word-aligned src 200 # copy 16 bytes per iteration for word-aligned dst and unaligned src
|
/Linux-v5.4/Documentation/networking/ |
D | net_dim.txt | 32 iteration of the algorithm, it analyses a given sample of the data, compares it 47 Each iteration of the Net DIM algorithm follows these steps: 55 supplied to the previous iteration. The comparison step checks the difference 124 the proper state in order to move to the next iteration. 146 /* Signal net DIM work is done and it should move to next iteration */
|
/Linux-v5.4/tools/perf/lib/Documentation/tutorial/ |
D | tutorial.rst | 103 The iteration through the *struct perf_cpumap* CPUs is done using the *perf_cpu_map__for_each_cpu* 107 - tmp - iteration helper variable
|
/Linux-v5.4/lib/ |
D | random32.c | 318 u32 iteration; member 450 for (j = 0; j < test2[i].iteration - 1; j++) in prandom_state_selftest()
|
/Linux-v5.4/drivers/pnp/isapnp/ |
D | core.c | 288 int iteration = 1; in isapnp_isolate() local 320 iteration++; in isapnp_isolate() 328 if (iteration == 1) { in isapnp_isolate() 332 } else if (iteration > 1) { in isapnp_isolate()
|
/Linux-v5.4/Documentation/core-api/ |
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 immediately if any call to the iteration function results in a non-zero 495 slot in that parent that points to it. None-recursive iteration uses these to 499 The backpointers, however, make simultaneous alteration and iteration tricky. 518 the iteration as we won't have reached the pointer to it yet and the 553 so as long as anyone doing walking or iteration holds the RCU read lock, the
|
D | idr.rst | 49 :c:func:`idr_for_each_entry_continue` to continue an iteration. You can
|
/Linux-v5.4/sound/soc/codecs/ |
D | da9055.c | 454 u8 iteration; in da9055_get_alc_data() local 456 for (iteration = 0; iteration < DA9055_ALC_AVG_ITERATIONS; in da9055_get_alc_data() 457 iteration++) { in da9055_get_alc_data()
|
D | da7213.c | 197 u8 iteration; in da7213_get_alc_data() local 199 for (iteration = 0; iteration < DA7213_ALC_AVG_ITERATIONS; in da7213_get_alc_data() 200 iteration++) { in da7213_get_alc_data()
|
/Linux-v5.4/arch/s390/kernel/ |
D | relocate_kernel.S | 40 j .base # ...next iteration
|
/Linux-v5.4/arch/x86/crypto/ |
D | sha512-ssse3-asm.S | 310 # (80 rounds) / (2 rounds/iteration) + (1 iteration) 311 # +1 iteration because the scheduler leads hashing by 1 iteration
|
D | sha512-avx-asm.S | 311 # (80 rounds) / (2 rounds/iteration) + (1 iteration) 312 # +1 iteration because the scheduler leads hashing by 1 iteration
|
D | sha1_ssse3_asm.S | 298 .set i, ((\r) % 80) # pre-compute for the next iteration 372 # vector iteration / 4 scalar rounds
|
/Linux-v5.4/Documentation/devicetree/bindings/arm/ |
D | arm-boards | 180 iteration, Juno r0, is a vehicle for evaluating big.LITTLE on AArch64, 181 with the second iteration, Juno r1, mainly aimed at development of PCIe
|
/Linux-v5.4/Documentation/block/ |
D | biovecs.rst | 137 bio_vec' will contain a single-page IO vector during the iteration:: 143 bio_vec' will contain a multi-page IO vector during the iteration::
|
/Linux-v5.4/Documentation/crypto/ |
D | descore-readme.txt | 100 des iteration; above, Quick (64k) takes 21 and Small (2k) takes 37. 101 he claims to use 280k of tables but the iteration calculation seems 116 also very modified for crypt. his iteration code uses 16k 310 a specific sbox during a specific iteration.
|
/Linux-v5.4/tools/testing/ktest/ |
D | ktest.pl | 192 my $iteration = 0; 1441 my $i = $iteration; 1468 my $i = $iteration; 1722 my $i = $iteration; 4234 $iteration = $i;
|