/linux-4.1.27/arch/sh/lib/ |
D | memcpy-sh4.S | 28 ! 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 …]
|
D | copy_page.S | 309 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/ |
D | selftest.c | 48 __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/ |
D | memcopy.S | 139 # 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
|
D | memset.S | 57 # per iteration 64 # set 16 bytes per iteration for word-aligned dst
|
D | usercopy.S | 89 # 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/ |
D | random32.c | 312 u32 iteration; member 444 for (j = 0; j < test2[i].iteration - 1; j++) in prandom_state_selftest()
|
/linux-4.1.27/Documentation/ |
D | assoc_array.txt | 20 - 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
|
D | crc32.txt | 164 immediately, without waiting for the previous loop iteration.
|
/linux-4.1.27/drivers/pnp/isapnp/ |
D | core.c | 305 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/ |
D | da9055.c | 461 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()
|
D | da7213.c | 200 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/ |
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 | sha512-ssse3-asm.S | 310 # (80 rounds) / (2 rounds/iteration) + (1 iteration) 311 # +1 iteration because the scheduler leads hashing by 1 iteration
|
D | sha1_ssse3_asm.S | 303 .set i, ((\r) % 80) # pre-compute for the next iteration 377 # vector iteration / 4 scalar rounds
|
/linux-4.1.27/arch/s390/kernel/ |
D | relocate_kernel.S | 66 j .top # ...next iteration
|
/linux-4.1.27/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-4.1.27/tools/testing/ktest/ |
D | ktest.pl | 179 my $iteration = 0; 1384 my $i = $iteration; 1394 my $i = $iteration; 1637 my $i = $iteration; 4190 $iteration = $i;
|
/linux-4.1.27/kernel/trace/ |
D | Kconfig | 547 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/ |
D | driver-changes.txt | 131 * device list iteration upon module removal (as of 2.6.10)
|
/linux-4.1.27/drivers/net/ethernet/intel/e1000e/ |
D | ich8lan.c | 4300 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/ |
D | stan.S | 316 |--there is a danger of unwanted overflow in first LOOP iteration. In this
|
/linux-4.1.27/Documentation/mtd/ |
D | nand_ecc.txt | 546 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/ |
D | NO_HZ.txt | 113 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/ |
D | botching-up-ioctls.txt | 54 will have a second iteration or at least an extension for any given interface.
|
/linux-4.1.27/drivers/net/ethernet/neterion/ |
D | s2io.c | 6130 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/ |
D | seq_file.txt | 124 The stop() function is called when iteration is complete; its job, of
|
/linux-4.1.27/drivers/video/fbdev/sis/ |
D | sis_main.c | 4218 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/ |
D | entry.S | 541 addi a3, a7, -4*4 # next iteration
|
/linux-4.1.27/Documentation/locking/ |
D | rt-mutex-design.txt | 433 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/ |
D | acpi_object_usage.txt | 325 with the UEFI Forum; this may cause some iteration as
|
D | arm-acpi.txt | 282 within the registry. This may require iteration. The UEFI Forum, though,
|
/linux-4.1.27/Documentation/RCU/ |
D | RTFP.txt | 54 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/ |
D | fpsp.S | 5577 #--there is a danger of unwanted overflow in first LOOP iteration. In this
|
D | fplsp.S | 5902 #--there is a danger of unwanted overflow in first LOOP iteration. In this
|