| /linux/include/linux/ |
| H A D | prime_numbers.h | 12 * @prime: the current prime number in this iteration
16 * the @max value. On each iteration, @prime is set to the current prime number.
18 * @prime set to 1 on the first iteration use for_each_prime_number_from()
26 * @prime: the current prime number in this iteration
31 * @max value. On each iteration, @prime is set to the current prime number.
|
| H A D | radix-tree.h | 103 * iteration radix_tree_iter also holds the slots' bit-mask for one chosen
277 * @start: iteration starting index
297 * radix_tree_next_chunk - find next chunk of slots for iteration
331 * radix_tree_iter_retry - retry this chunk of the iteration
337 * and continue the iteration.
361 * before releasing the lock to continue the iteration from the next index.
393 * a) we are doing tagged iteration and iter->tags has been set to 0, or
394 * b) we are doing non-tagged iteration, and iter->index and iter->next_index
445 * @start: iteration starting index
460 * @start: iteration starting index
|
| H A D | cgroup.h | 149 * Iteration helpers and macros.
177 * If a subsystem synchronizes ->css_online() and the start of iteration, a
184 * It is allowed to temporarily drop RCU read lock during iteration. The
186 * the start of the next iteration by, for example, bumping the css refcnt.
197 * Walk @root's descendants. @root is included in the iteration and the
200 * If a subsystem synchronizes ->css_online() and the start of iteration, a
238 * iteration should lock and unlock both @pos->parent and @pos.
244 * It is allowed to temporarily drop RCU read lock during iteration. The
246 * the start of the next iteration by, for example, bumping the css refcnt.
258 * traversal instead. @root is included in the iteration and the last
[all …]
|
| H A D | interval_tree.h | 36 * @is_hole: 0 == used, 1 == is_hole, -1 == done iteration
40 * a used, which is fully covered by nodes. Each iteration step toggles between
47 * Use interval_tree_span_iter_done() to detect end of iteration.
|
| H A D | xarray.h | 435 * During the iteration, @entry will have the value of the entry stored
436 * in @xa at @index. You may modify @index during the iteration if you
438 * during the iteration. At the end of the iteration, @entry will be set
443 * after each iteration, it will also end up being O(n.log(n)).
464 * During the iteration, @entry will have the value of the entry stored
465 * in @xa at @index. You may modify @index during the iteration if you
467 * during the iteration. At the end of the iteration, @entry will be set
472 * after each iteration, it will also end up being O(n.log(n)).
489 * During the iteration, @entry will have the value of the entry stored
490 * in @xa at @index. You may modify @index during the iteration if you want
[all …]
|
| /linux/tools/testing/selftests/net/netfilter/ |
| H A D | conntrack_vrf.sh | 7 # For ingress, this means first iteration has iifname of lower/real
9 # Second iteration is iifname set to vrf device, tvrf in this script.
11 # For egress, this is reversed: first iteration has the vrf device,
12 # second iteration is done with the lower/real/veth0 device.
84 # as decided by the first iteration of the ruleset.
128 # This tests the first iteration of the packet through conntrack,
167 # must also check that nat table was evaluated on second (lower device) iteration.
182 # This tests the 2nd iteration of the packet through conntrack,
202 # must also check that nat table was evaluated on second (lower device) iteration.
|
| /linux/tools/testing/radix-tree/ |
| H A D | iteration_check.c | 3 * iteration_check.c: test races having to do with xarray iteration
65 * node and randomly pausing the iteration.
98 * node and randomly pausing the iteration.
131 * two iteration functions.
179 perror("create tagged iteration thread"); in iteration_test()
183 perror("create untagged iteration thread"); in iteration_test()
|
| /linux/include/linux/dma/ |
| H A D | ti-cppi5.h | 722 * @icnt0: Total loop iteration count for level 0 (innermost)
736 * @icnt0: Total loop iteration count for level 0 (innermost)
737 * @icnt1: Total loop iteration count for level 1
752 * @icnt0: Total loop iteration count for level 0 (innermost)
753 * @icnt1: Total loop iteration count for level 1
756 * @icnt2: Total loop iteration count for level 2
774 * @icnt0: Total loop iteration count for level 0 (innermost)
775 * @icnt1: Total loop iteration count for level 1
778 * @icnt2: Total loop iteration count for level 2
779 * @icnt3: Total loop iteration count for level 3 (outermost)
[all …]
|
| /linux/fs/xfs/scrub/ |
| H A D | bitmap.h | 26 * iteration caller. The special value -ECANCELED can be used to stop
27 * iteration, because neither bitmap iterator ever generates that error code on
54 * iteration caller. The special value -ECANCELED can be used to stop
55 * iteration, because neither bitmap iterator ever generates that error code on
|
| /linux/drivers/gpu/drm/loongson/ |
| H A D | lsdc_benchmark.c | 106 unsigned int iteration = 60; in lsdc_show_benchmark_copy() local
110 iteration, in lsdc_show_benchmark_copy()
118 iteration, in lsdc_show_benchmark_copy()
126 iteration, in lsdc_show_benchmark_copy()
|
| /linux/arch/x86/tools/ |
| H A D | insn_sanity.c | 34 static unsigned long iter_start; /* Start of iteration number */
35 static unsigned long iter_end = DEFAULT_MAX_ITER; /* End of iteration number */
46 fprintf(stderr, "\t-s Give a random seed (and iteration number)\n"); in usage()
47 fprintf(stderr, "\t-m Give a maximum iteration number\n"); in usage()
100 /* Give a seed and iteration number */ in dump_stream()
206 usage("Max iteration number must be bigger than iter-num"); in parse_args()
236 if (i < iter_start) /* Skip to given iteration number */ in main()
|
| /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 …]
|
| /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.
302 return the result of the last iterator function called. Iteration stops
303 immediately if any call to the iteration function results in a non-zero
491 Non-Recursive Iteration
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.
502 Simultaneous Alteration And Iteration
518 the iteration as we won't have reached the pointer to it yet and the
[all …]
|
| /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/net/smc/ |
| H A D | smc_tx.c | 233 /* initialize variables for 1st iteration of subsequent loop */ in smc_tx_sendmsg()
261 break; /* either on 1st or 2nd iteration */ in smc_tx_sendmsg()
262 /* prepare next (== 2nd) iteration */ in smc_tx_sendmsg()
399 break; /* either on 1st or 2nd iteration */ in smcr_tx_rdma_writes()
400 /* prepare next (== 2nd) iteration */ in smcr_tx_rdma_writes()
408 break; /* either on 1st or 2nd iteration */ in smcr_tx_rdma_writes()
409 /* prepare next (== 2nd) iteration */ in smcr_tx_rdma_writes()
443 break; /* either on 1st or 2nd iteration */ in smcd_tx_rdma_writes()
444 /* prepare next (== 2nd) iteration */ in smcd_tx_rdma_writes()
449 break; /* either on 1st or 2nd iteration */ in smcd_tx_rdma_writes()
[all …]
|
| /linux/lib/math/ |
| H A D | rational.c | 41 * decreased each iteration using the Euclidean algorithm. in rational_best_approximation()
43 * dp is the value of d from the prior iteration. in rational_best_approximation()
92 * is the 1st iteration, so always choose the semi-convergent. in rational_best_approximation()
|
| /linux/drivers/media/dvb-frontends/ |
| H A D | mxl5xx_regs.h | 106 …RA_DMD_DVBS_1ST_CORR_RS_ERRORS_ADDR_OFFSET 0x3FFFC6C8 /* corrected RS Errors: 1st iteration */
107 …_DMD_DVBS_1ST_UNCORR_RS_ERRORS_ADDR_OFFSET 0x3FFFC6CC /* uncorrected RS Errors: 1st iteration */
119 #define DMD0_STATUS_DVBS_1ST_SCALED_BER_COUNT_ADDR 0x3FFFC710 /* DMD 0: 1st iteration BER co…
120 #define DMD0_STATUS_DVBS_SCALED_BER_COUNT_ADDR 0x3FFFC714 /* DMD 0: 2nd iteration BER co…
|
| /linux/drivers/iommu/iommufd/ |
| H A D | double_span.h | 14 * value of is_used will not repeat on two iteration cycles.
27 /* 0 = hole, 1 = used span[0], 2 = used span[1], -1 done iteration */
|
| /linux/drivers/net/ethernet/sfc/ |
| H A D | selftest.c | 49 __be16 iteration;
347 /* Check that iteration matches */ in efx_loopback_rx_packet()
348 if (received.iteration != payload->iteration) { in efx_loopback_rx_packet()
350 "saw RX packet from iteration %d (wanted %d) in " 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()
378 /* Initialise an efx_selftest_state for a new iteration */
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;
348 /* Check that iteration matches */ in efx_siena_loopback_rx_packet()
349 if (received.iteration != payload->iteration) { in efx_siena_loopback_rx_packet()
351 "saw RX packet from iteration %d (wanted %d) in " 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()
379 /* Initialise an efx_siena_selftest_state for a new iteration */
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;
350 /* Check that iteration matches */ in ef4_loopback_rx_packet()
351 if (received.iteration != payload->iteration) { in ef4_loopback_rx_packet()
353 "saw RX packet from iteration %d (wanted %d) in " 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()
381 /* Initialise an ef4_selftest_state for a new iteration */
409 payload->iteration = htons(ntohs(payload->iteration) + 1); in ef4_iterate_state()
|
| /linux/drivers/net/wireless/intel/iwlwifi/fw/api/ |
| H A D | scan.h | 59 /* Default watchdog (in MS) for scheduled scan iteration */
220 * @iter_count: scan iteration on this channel
297 * @IWL_MVM_LMAC_SCAN_FLAG_ITER_COMPLETE: send iteration complete notification
354 * @delay: delay in seconds before first iteration
428 * @last_schedule_iteration: last scan iteration executed before scan abort
431 * @time_after_last_iter: time in seconds elapsed after last iteration
669 * on every iteration instead of only once after the last iteration
802 * @delay: delay in TUs before starting the first scan iteration
1159 * @last_iter: last scan iteration number
1162 * @time_from_last_iter: time elapsed from last iteration
[all …]
|
| /linux/include/uapi/linux/netfilter/ |
| H A D | x_tables.h | 128 /* fn returns 0 to continue iteration */
147 /* fn returns 0 to continue iteration */
167 /* fn returns 0 to continue iteration */
|
| /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/lib/ |
| H A D | klist.c | 17 * iteration (e.g. insertion and removal), including modification of the
21 * and initialized before an iteration. klist_next() is used to acquire the
42 * dead ones from iteration.
304 * klist_iter_exit - Finish a list iteration.
308 * refcount of the current node. Necessary in case iteration exited before
|