| /Linux-v6.1/tools/testing/selftests/kvm/ |
| D | dirty_log_perf_test.c | 67 static int iteration; variable
85 int current_iteration = READ_ONCE(iteration); in vcpu_worker()
98 pr_debug("vCPU %d updated last completed iteration to %d\n", in vcpu_worker()
104 pr_debug("vCPU %d iteration %d dirty memory time: %ld.%.9lds\n", in vcpu_worker()
108 pr_debug("vCPU %d iteration %d populate memory time: %ld.%.9lds\n", in vcpu_worker()
115 * (iteration is negative) so that vCPUs are accessing memory in vcpu_worker()
118 while (current_iteration == READ_ONCE(iteration) && in vcpu_worker()
119 READ_ONCE(iteration) >= 0 && !READ_ONCE(host_quit)) {} in vcpu_worker()
123 …bug("\nvCPU %d dirtied 0x%lx pages over %d iterations in %ld.%.9lds. (Avg %ld.%.9lds/iteration)\n", in vcpu_worker()
244 iteration = 0; in run_test()
[all …]
|
| D | dirty_log_test.c | 77 static uint64_t iteration; variable
105 * pages during the first iteration. in guest_code()
109 *(uint64_t *)addr = READ_ONCE(iteration); in guest_code()
118 *(uint64_t *)addr = READ_ONCE(iteration); in guest_code()
366 pr_info("Iteration %ld collected %u pages\n", iteration, count); in dirty_ring_collect_dirty_pages()
438 * bit set in the _next_ iteration. For example, if we detected the
439 * page value changed to current iteration but at the same time the
567 "set in this iteration but it is missing", in vm_dirty_log_verify()
579 * previous iteration number or the current one. in vm_dirty_log_verify()
581 matched = (*value_ptr == iteration || in vm_dirty_log_verify()
[all …]
|
| D | access_tracking_perf_test.c | 51 static int iteration; variable
53 /* Defines what vCPU threads should do during a given iteration. */
64 /* The iteration that was last completed by each vCPU. */
217 *current_iteration = READ_ONCE(iteration); in spin_wait_for_next_iteration()
265 /* Kick off the vCPUs by incrementing iteration. */ in run_iteration()
266 next_iteration = ++iteration; in run_iteration()
270 /* Wait for all vCPUs to finish the iteration. */ in run_iteration()
|
| /Linux-v6.1/include/drm/ |
| D | drm_atomic.h | 316 * iteration
744 * @connector: &struct drm_connector iteration cursor
745 * @old_connector_state: &struct drm_connector_state iteration cursor for the
747 * @new_connector_state: &struct drm_connector_state iteration cursor for the
749 * @__i: int iteration cursor, for macro-internal use
768 * @connector: &struct drm_connector iteration cursor
769 * @old_connector_state: &struct drm_connector_state iteration cursor for the
771 * @__i: int iteration cursor, for macro-internal use
789 * @connector: &struct drm_connector iteration cursor
790 * @new_connector_state: &struct drm_connector_state iteration cursor for the
[all …]
|
| /Linux-v6.1/include/linux/ |
| 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.
|
| D | dim.h | 90 * @prev_stats: Measured rates from previous iteration (for comparison)
91 * @start_sample: Sampled data at start of current iteration
133 * These will determine if the algorithm is in a valid state to start an iteration.
135 * @DIM_START_MEASURE: This is the first iteration (also after applying a new profile)
166 * These will determine the verdict of current iteration.
168 * @DIM_STATS_WORSE: Current iteration shows worse performance than before
169 * @DIM_STATS_SAME: Current iteration shows same performance than before
170 * @DIM_STATS_BETTER: Current iteration shows better performance than before
|
| D | iomap.h | 172 * @inode: Set at the start of the iteration and should not change.
178 * iteration, or a negative errno. 0 causes the iteration to stop.
180 * @iomap: Map describing the I/O iteration
197 * iomap_length - length of the current iomap iteration
198 * @iter: iteration structure
200 * Returns the length that the operation applies to for the current iteration.
212 * iomap_iter_srcmap - return the source map for the current iomap iteration
213 * @i: iteration structure
|
| 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
|
| D | cgroup.h | 143 * Iteration helpers and macros.
171 * If a subsystem synchronizes ->css_online() and the start of iteration, a
178 * It is allowed to temporarily drop RCU read lock during iteration. The
180 * the start of the next iteration by, for example, bumping the css refcnt.
191 * Walk @root's descendants. @root is included in the iteration and the
194 * If a subsystem synchronizes ->css_online() and the start of iteration, a
232 * iteration should lock and unlock both @pos->parent and @pos.
238 * It is allowed to temporarily drop RCU read lock during iteration. The
240 * the start of the next iteration by, for example, bumping the css refcnt.
252 * traversal instead. @root is included in the iteration and the last
[all …]
|
| D | rbtree_latch.h | 22 * copy, this does not guarantee an iteration will not observe modifications.
23 * What might have been a stable copy at the start of the iteration, need not
24 * remain so for the duration of the iteration.
26 * Therefore, this does require a lockless RB-tree iteration to be non-fatal;
|
| /Linux-v6.1/tools/testing/selftests/netfilter/ |
| 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.
105 # as decided by the first iteration of the ruleset.
149 # This tests the first iteration of the packet through conntrack,
189 # must also check that nat table was evaluated on second (lower device) iteration.
205 # This tests the 2nd iteration of the packet through conntrack,
226 # must also check that nat table was evaluated on second (lower device) iteration.
|
| /Linux-v6.1/tools/testing/radix-tree/ |
| 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-v6.1/include/linux/dma/ |
| D | ti-cppi5.h | 721 * @icnt0: Total loop iteration count for level 0 (innermost)
735 * @icnt0: Total loop iteration count for level 0 (innermost)
736 * @icnt1: Total loop iteration count for level 1
751 * @icnt0: Total loop iteration count for level 0 (innermost)
752 * @icnt1: Total loop iteration count for level 1
755 * @icnt2: Total loop iteration count for level 2
773 * @icnt0: Total loop iteration count for level 0 (innermost)
774 * @icnt1: Total loop iteration count for level 1
777 * @icnt2: Total loop iteration count for level 2
778 * @icnt3: Total loop iteration count for level 3 (outermost)
[all …]
|
| /Linux-v6.1/fs/iomap/ |
| D | iter.c | 12 /* handle the previous iteration (if any) */ in iomap_iter_advance()
24 /* clear the state for the next iteration */ in iomap_iter_advance()
44 * @iter: iteration structue
49 * This function handles cleanup of resources acquired for iteration when the
|
| /Linux-v6.1/arch/x86/tools/ |
| 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-v6.1/include/drm/display/ |
| D | drm_dp_mst_helper.h | 917 * @mgr: pointer to the &struct drm_dp_mst_topology_mgr iteration cursor
919 * iteration cursor
921 * iteration cursor
922 * @i: int iteration cursor, for macro-internal use
957 * @mgr: &struct drm_dp_mst_topology_mgr iteration cursor
958 * @old_state: &struct drm_dp_mst_topology_state iteration cursor for the old
960 * @new_state: &struct drm_dp_mst_topology_state iteration cursor for the new
962 * @__i: int iteration cursor, for macro-internal use
976 * @mgr: &struct drm_dp_mst_topology_mgr iteration cursor
977 * @old_state: &struct drm_dp_mst_topology_state iteration cursor for the old
[all …]
|
| /Linux-v6.1/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 …]
|
| /Linux-v6.1/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.
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-v6.1/drivers/base/ |
| D | class.c | 277 * of @class. If @start is set, the list iteration will start there,
278 * otherwise if it is NULL, the iteration starts at the beginning of
298 * iteration is complete.
322 * class_dev_iter_exit - finish iteration
325 * Finish an iteration. Always call this function after iteration is
326 * complete whether the iteration ran till the end or not.
342 * passing it @data. If @start is set, the list iteration will start
343 * there, otherwise if it is NULL, the iteration starts at the
|
| /Linux-v6.1/net/smc/ |
| D | smc_tx.c | 234 /* initialize variables for 1st iteration of subsequent loop */ in smc_tx_sendmsg()
262 break; /* either on 1st or 2nd iteration */ in smc_tx_sendmsg()
263 /* prepare next (== 2nd) iteration */ in smc_tx_sendmsg()
416 break; /* either on 1st or 2nd iteration */ in smcr_tx_rdma_writes()
417 /* prepare next (== 2nd) iteration */ in smcr_tx_rdma_writes()
425 break; /* either on 1st or 2nd iteration */ in smcr_tx_rdma_writes()
426 /* prepare next (== 2nd) iteration */ in smcr_tx_rdma_writes()
460 break; /* either on 1st or 2nd iteration */ in smcd_tx_rdma_writes()
461 /* prepare next (== 2nd) iteration */ in smcd_tx_rdma_writes()
466 break; /* either on 1st or 2nd iteration */ in smcd_tx_rdma_writes()
[all …]
|
| /Linux-v6.1/Documentation/networking/ |
| D | net_dim.rst | 24 iteration of the algorithm, it analyses a given sample of the data, compares it
39 Each iteration of the Net DIM algorithm follows these steps:
48 supplied to the previous iteration. The comparison step checks the difference
120 the proper state in order to move to the next iteration.
142 /* Signal net DIM work is done and it should move to next iteration */
|
| /Linux-v6.1/lib/math/ |
| 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-v6.1/drivers/media/dvb-frontends/ |
| 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-v6.1/kernel/printk/ |
| D | printk_ringbuffer.h | 346 * @s: A u64 to store the sequence number on each iteration.
347 * @r: A printk_record to store the record on each iteration.
351 * iteration. For the sequence number, @r->info->seq should be checked.
363 * @s: A u64 to store the sequence number on each iteration.
364 * @i: A printk_info to store the record meta data on each iteration.
369 * iteration. For the sequence number, @r->info->seq should be checked.
|
| /Linux-v6.1/drivers/net/wireless/intel/iwlwifi/fw/api/ |
| D | scan.h | 55 /* Default watchdog (in MS) for scheduled scan iteration */
214 * @iter_count: scan iteration on this channel
291 * @IWL_MVM_LMAC_SCAN_FLAG_ITER_COMPLETE: send iteration complete notification
348 * @delay: delay in seconds before first iteration
422 * @last_schedule_iteration: last scan iteration executed before scan abort
425 * @time_after_last_iter: time in seconds elapsed after last iteration
660 * on every iteration instead of only once after the last iteration
775 * @delay: delay in TUs before starting the first scan iteration
1118 * @last_iter: last scan iteration number
1121 * @time_from_last_iter: time elapsed from last iteration
[all …]
|
