| /linux-6.12.1/tools/testing/selftests/kvm/ |
| D | dirty_log_perf_test.c | 65 static int iteration; variable
83 int current_iteration = READ_ONCE(iteration); in vcpu_worker()
96 pr_debug("vCPU %d updated last completed iteration to %d\n", in vcpu_worker()
102 pr_debug("vCPU %d iteration %d dirty memory time: %ld.%.9lds\n", in vcpu_worker()
106 pr_debug("vCPU %d iteration %d populate memory time: %ld.%.9lds\n", in vcpu_worker()
113 * (iteration is negative) so that vCPUs are accessing memory in vcpu_worker()
116 while (current_iteration == READ_ONCE(iteration) && in vcpu_worker()
117 READ_ONCE(iteration) >= 0 && !READ_ONCE(host_quit)) {} in vcpu_worker()
121 …bug("\nvCPU %d dirtied 0x%lx pages over %d iterations in %ld.%.9lds. (Avg %ld.%.9lds/iteration)\n", in vcpu_worker()
172 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 vcpu_arch_put_guest(*(uint64_t *)addr, READ_ONCE(iteration)); in guest_code()
119 vcpu_arch_put_guest(*(uint64_t *)addr, READ_ONCE(iteration)); in guest_code()
389 pr_info("Iteration %ld collected %u pages\n", iteration, count); in dirty_ring_collect_dirty_pages()
454 * bit set in the _next_ iteration. For example, if we detected the
455 * page value changed to current iteration but at the same time the
563 "set in this iteration but it is missing", in vm_dirty_log_verify()
575 * previous iteration number or the current one. in vm_dirty_log_verify()
577 matched = (*value_ptr == iteration || in vm_dirty_log_verify()
[all …]
|
| D | access_tracking_perf_test.c | 52 static int iteration; variable
54 /* Defines what vCPU threads should do during a given iteration. */
62 /* The iteration that was last completed by each vCPU. */
220 *current_iteration = READ_ONCE(iteration); in spin_wait_for_next_iteration()
268 /* Kick off the vCPUs by incrementing iteration. */ in run_iteration()
269 next_iteration = ++iteration; in run_iteration()
273 /* Wait for all vCPUs to finish the iteration. */ in run_iteration()
|
| /linux-6.12.1/include/drm/ |
| D | drm_atomic.h | 316 * iteration
799 * @connector: &struct drm_connector iteration cursor
800 * @old_connector_state: &struct drm_connector_state iteration cursor for the
802 * @new_connector_state: &struct drm_connector_state iteration cursor for the
804 * @__i: int iteration cursor, for macro-internal use
823 * @connector: &struct drm_connector iteration cursor
824 * @old_connector_state: &struct drm_connector_state iteration cursor for the
826 * @__i: int iteration cursor, for macro-internal use
844 * @connector: &struct drm_connector iteration cursor
845 * @new_connector_state: &struct drm_connector_state iteration cursor for the
[all …]
|
| /linux-6.12.1/tools/testing/selftests/kvm/x86_64/ |
| D | dirty_log_page_splitting_test.c | 32 static int iteration; variable
58 iteration++; in run_vcpu_iteration()
61 iteration) in run_vcpu_iteration()
72 int current_iteration = READ_ONCE(iteration); in vcpu_worker()
80 /* Wait for the start of the next iteration to be signaled. */ in vcpu_worker()
81 while (current_iteration == READ_ONCE(iteration) && in vcpu_worker()
82 READ_ONCE(iteration) >= 0 && in vcpu_worker()
121 iteration = -1; in run_test()
137 while (iteration < ITERATIONS) { in run_test()
139 get_page_stats(vm, &stats_dirty_pass[iteration - 1], in run_test()
[all …]
|
| /linux-6.12.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 | 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 | dim.h | 132 * @prev_stats: Measured rates from previous iteration (for comparison)
133 * @start_sample: Sampled data at start of current iteration
175 * These will determine if the algorithm is in a valid state to start an iteration.
177 * @DIM_START_MEASURE: This is the first iteration (also after applying a new profile)
208 * These will determine the verdict of current iteration.
210 * @DIM_STATS_WORSE: Current iteration shows worse performance than before
211 * @DIM_STATS_SAME: Current iteration shows same performance than before
212 * @DIM_STATS_BETTER: Current iteration shows better performance than before
|
| D | iomap.h | 204 * @inode: Set at the start of the iteration and should not change.
210 * iteration, or a negative errno. 0 causes the iteration to stop.
212 * @iomap: Map describing the I/O iteration
229 * iomap_length - length of the current iomap iteration
230 * @iter: iteration structure
232 * Returns the length that the operation applies to for the current iteration.
244 * iomap_iter_srcmap - return the source map for the current iomap iteration
245 * @i: iteration structure
|
| 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.
|
| D | cgroup.h | 141 * Iteration helpers and macros.
169 * If a subsystem synchronizes ->css_online() and the start of iteration, a
176 * It is allowed to temporarily drop RCU read lock during iteration. The
178 * the start of the next iteration by, for example, bumping the css refcnt.
189 * Walk @root's descendants. @root is included in the iteration and the
192 * If a subsystem synchronizes ->css_online() and the start of iteration, a
230 * iteration should lock and unlock both @pos->parent and @pos.
236 * It is allowed to temporarily drop RCU read lock during iteration. The
238 * the start of the next iteration by, for example, bumping the css refcnt.
250 * traversal instead. @root is included in the iteration and the last
[all …]
|
| /linux-6.12.1/tools/testing/selftests/net/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.
95 # as decided by the first iteration of the ruleset.
139 # This tests the first iteration of the packet through conntrack,
178 # must also check that nat table was evaluated on second (lower device) iteration.
193 # This tests the 2nd iteration of the packet through conntrack,
213 # must also check that nat table was evaluated on second (lower device) iteration.
|
| /linux-6.12.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-6.12.1/fs/iomap/ |
| D | iter.c | 15 * changed during the operation. In this case, the iteration behaviour is to
26 /* handle the previous iteration (if any) */ in iomap_iter_advance()
40 /* clear the state for the next iteration */ in iomap_iter_advance()
61 * @iter: iteration structue
66 * This function handles cleanup of resources acquired for iteration when the
|
| /linux-6.12.1/fs/xfs/scrub/ |
| 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-6.12.1/include/linux/dma/ |
| 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-6.12.1/drivers/gpu/drm/loongson/ |
| 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-6.12.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-6.12.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-6.12.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-6.12.1/Documentation/gpu/ |
| 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-6.12.1/include/drm/display/ |
| D | drm_dp_mst_helper.h | 973 * @mgr: pointer to the &struct drm_dp_mst_topology_mgr iteration cursor
975 * iteration cursor
977 * iteration cursor
978 * @i: int iteration cursor, for macro-internal use
1013 * @mgr: &struct drm_dp_mst_topology_mgr iteration cursor
1014 * @old_state: &struct drm_dp_mst_topology_state iteration cursor for the old
1016 * @new_state: &struct drm_dp_mst_topology_state iteration cursor for the new
1018 * @__i: int iteration cursor, for macro-internal use
1032 * @mgr: &struct drm_dp_mst_topology_mgr iteration cursor
1033 * @old_state: &struct drm_dp_mst_topology_state iteration cursor for the old
[all …]
|
| /linux-6.12.1/net/smc/ |
| 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-6.12.1/drivers/base/ |
| D | class.c | 316 * of @class. If @start is set, the list iteration will start there,
317 * otherwise if it is NULL, the iteration starts at the beginning of
342 * iteration is complete.
366 * class_dev_iter_exit - finish iteration
369 * Finish an iteration. Always call this function after iteration is
370 * complete whether the iteration ran till the end or not.
387 * passing it @data. If @start is set, the list iteration will start
388 * there, otherwise if it is NULL, the iteration starts at the
|
| /linux-6.12.1/tools/testing/selftests/iommu/ |
| D | iommufd_fail_nth.c | 86 unsigned int iteration; member
113 ASSERT_GT(400, nth_state->iteration); in fail_nth_next()
114 if (nth_state->iteration != 0) { in fail_nth_next()
140 /* printf(" nth %u result=%d nth=%u\n", nth_state->iteration, in fail_nth_next()
147 /* printf(" nth %u result=%d\n", nth_state->iteration, in fail_nth_next()
150 nth_state->iteration++; in fail_nth_next()
165 if (!nth_state->iteration) in __fail_nth_enable()
168 len = snprintf(buf, sizeof(buf), "%u", nth_state->iteration); in __fail_nth_enable()
|