Home
last modified time | relevance | path

Searched refs:iteration (Results 1 – 35 of 35) sorted by relevance

/linux-4.1.27/arch/sh/lib/
Dmemcpy-sh4.S28 ! At the start of each iteration, r7 contains last long load
38 ! 6 cycles, 4 bytes per iteration
101 ! At the start of each iteration, r7 contains last long load
111 ! 6 cycles, 4 bytes per iteration
221 ! 4 cycles, 2 bytes per iteration
249 ! 3 cycles, 1 byte per iteration
331 ! 4 cycles, 2 long words per iteration
365 ! 4 cycles, 2 long words per iteration
385 ! 3 cycles, 1 byte per iteration
433 ! 4 cycles, 2 long words per iteration
[all …]
Dcopy_page.S309 1: ! Read longword, write two words per iteration
331 ! Read longword, write byte, word, byte per iteration
/linux-4.1.27/drivers/net/ethernet/sfc/
Dselftest.c48 __be16 iteration; member
331 if (received->iteration != payload->iteration) { in efx_loopback_rx_packet()
334 "%s loopback test\n", ntohs(received->iteration), in efx_loopback_rx_packet()
335 ntohs(payload->iteration), LOOPBACK_MODE(efx)); in efx_loopback_rx_packet()
387 payload->iteration = htons(ntohs(payload->iteration) + 1); in efx_iterate_state()
/linux-4.1.27/arch/xtensa/lib/
Dmemcopy.S139 # per iteration
145 # copy 16 bytes per iteration for word-aligned dst and word-aligned src
211 # copy 16 bytes per iteration for word-aligned dst and unaligned src
413 # per iteration
419 # copy 16 bytes per iteration for word-aligned dst and word-aligned src
487 # copy 16 bytes per iteration for word-aligned dst and unaligned src
Dmemset.S57 # per iteration
64 # set 16 bytes per iteration for word-aligned dst
Dusercopy.S89 # per iteration
152 # copy 16 bytes per iteration for word-aligned dst and word-aligned src
217 # copy 16 bytes per iteration for word-aligned dst and unaligned src
/linux-4.1.27/lib/
Drandom32.c312 u32 iteration; member
444 for (j = 0; j < test2[i].iteration - 1; j++) in prandom_state_selftest()
/linux-4.1.27/Documentation/
Dassoc_array.txt20 - Non-recursive iteration.
21 - Simultaneous alteration and iteration.
284 The internal tree will be packed down if possible as part of the iteration
315 it is possible for the iteration function to see some objects twice. If
317 iteration algorithm should not, however, miss any objects.
321 immediately if any call to the iteration function results in a non-zero
515 slot in that parent that points to it. None-recursive iteration uses these to
519 The backpointers, however, make simultaneous alteration and iteration tricky.
538 the iteration as we won't have reached the pointer to it yet and the
573 so as long as anyone doing walking or iteration holds the RCU read lock, the
Dcrc32.txt164 immediately, without waiting for the previous loop iteration.
/linux-4.1.27/drivers/pnp/isapnp/
Dcore.c305 int iteration = 1; in isapnp_isolate() local
337 iteration++; in isapnp_isolate()
345 if (iteration == 1) { in isapnp_isolate()
349 } else if (iteration > 1) { in isapnp_isolate()
/linux-4.1.27/sound/soc/codecs/
Dda9055.c461 u8 iteration; in da9055_get_alc_data() local
463 for (iteration = 0; iteration < DA9055_ALC_AVG_ITERATIONS; in da9055_get_alc_data()
464 iteration++) { in da9055_get_alc_data()
Dda7213.c200 u8 iteration; in da7213_get_alc_data() local
202 for (iteration = 0; iteration < DA7213_ALC_AVG_ITERATIONS; in da7213_get_alc_data()
203 iteration++) { in da7213_get_alc_data()
/linux-4.1.27/arch/x86/crypto/
Dsha512-avx-asm.S311 # (80 rounds) / (2 rounds/iteration) + (1 iteration)
312 # +1 iteration because the scheduler leads hashing by 1 iteration
Dsha512-ssse3-asm.S310 # (80 rounds) / (2 rounds/iteration) + (1 iteration)
311 # +1 iteration because the scheduler leads hashing by 1 iteration
Dsha1_ssse3_asm.S303 .set i, ((\r) % 80) # pre-compute for the next iteration
377 # vector iteration / 4 scalar rounds
/linux-4.1.27/arch/s390/kernel/
Drelocate_kernel.S66 j .top # ...next iteration
/linux-4.1.27/Documentation/crypto/
Ddescore-readme.txt100 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-4.1.27/tools/testing/ktest/
Dktest.pl179 my $iteration = 0;
1384 my $i = $iteration;
1394 my $i = $iteration;
1637 my $i = $iteration;
4190 $iteration = $i;
/linux-4.1.27/kernel/trace/
DKconfig547 run), and calls the tracepoint. Each iteration will record the time
548 it took to write to the tracepoint and the next iteration that
580 it recorded and give a rough estimate of how long each iteration took.
/linux-4.1.27/Documentation/pcmcia/
Ddriver-changes.txt131 * device list iteration upon module removal (as of 2.6.10)
/linux-4.1.27/drivers/net/ethernet/intel/e1000e/
Dich8lan.c4300 s32 j, iteration, sector_size; in e1000_erase_flash_bank_ich8lan() local
4320 iteration = flash_bank_size / ICH_FLASH_SEG_SIZE_256; in e1000_erase_flash_bank_ich8lan()
4324 iteration = 1; in e1000_erase_flash_bank_ich8lan()
4328 iteration = 1; in e1000_erase_flash_bank_ich8lan()
4332 iteration = 1; in e1000_erase_flash_bank_ich8lan()
4342 for (j = 0; j < iteration; j++) { in e1000_erase_flash_bank_ich8lan()
/linux-4.1.27/arch/m68k/fpsp040/
Dstan.S316 |--there is a danger of unwanted overflow in first LOOP iteration. In this
/linux-4.1.27/Documentation/mtd/
Dnand_ecc.txt546 iteration. In the last 3 statements is added to par and, if needed,
550 contains the running parity for this iteration. So instead of having:
561 (using time to measure the performance). After this iteration I was back
/linux-4.1.27/Documentation/timers/
DNO_HZ.txt113 computationally intensive short-iteration workloads: If any CPU is
114 delayed during a given iteration, all the other CPUs will be forced to
/linux-4.1.27/Documentation/ioctl/
Dbotching-up-ioctls.txt54 will have a second iteration or at least an extension for any given interface.
/linux-4.1.27/drivers/net/ethernet/neterion/
Ds2io.c6130 int cnt, iteration = 0, test_fail = 0; in s2io_rldram_test() local
6147 while (iteration < 2) { in s2io_rldram_test()
6149 if (iteration == 1) in s2io_rldram_test()
6154 if (iteration == 1) in s2io_rldram_test()
6159 if (iteration == 1) in s2io_rldram_test()
6198 iteration++; in s2io_rldram_test()
/linux-4.1.27/Documentation/filesystems/
Dseq_file.txt124 The stop() function is called when iteration is complete; its job, of
/linux-4.1.27/drivers/video/fbdev/sis/
Dsis_main.c4218 static int sisfb_post_300_rwtest(struct sis_video_info *ivideo, int iteration, in sisfb_post_300_rwtest() argument
4237 BankNumHigh = RankCapacity * 16 * iteration - 1; in sisfb_post_300_rwtest()
4238 if(iteration == 3) { /* Rank No */ in sisfb_post_300_rwtest()
4241 BankNumMid = RankCapacity * 16 * iteration / 2 - 1; in sisfb_post_300_rwtest()
/linux-4.1.27/arch/xtensa/kernel/
Dentry.S541 addi a3, a7, -4*4 # next iteration
/linux-4.1.27/Documentation/locking/
Drt-mutex-design.txt433 was passed by parameter (for the first iteration). The pi_lock of this task is
484 wait_lock, and continue the loop again. On the next iteration of the
/linux-4.1.27/Documentation/arm64/
Dacpi_object_usage.txt325 with the UEFI Forum; this may cause some iteration as
Darm-acpi.txt282 within the registry. This may require iteration. The UEFI Forum, though,
/linux-4.1.27/Documentation/RCU/
DRTFP.txt54 of convergent numerical algorithms are relaxed, so that iteration $n$
55 might use data from iteration $n-1$ or even $n-2$. This introduces
60 of each iteration. Unfortunately, chaotic relaxation requires highly
/linux-4.1.27/arch/m68k/ifpsp060/src/
Dfpsp.S5577 #--there is a danger of unwanted overflow in first LOOP iteration. In this
Dfplsp.S5902 #--there is a danger of unwanted overflow in first LOOP iteration. In this