| /kernel/linux/linux-5.10/tools/testing/selftests/kvm/ |
| D | dirty_log_perf_test.c | 31 static uint64_t iteration; variable
51 uint64_t current_iteration = READ_ONCE(iteration); in vcpu_worker()
64 pr_debug("vCPU %d updated last completed iteration to %lu\n", in vcpu_worker()
70 pr_debug("vCPU %d iteration %lu dirty memory time: %ld.%.9lds\n", in vcpu_worker()
74 pr_debug("vCPU %d iteration %lu populate memory time: %ld.%.9lds\n", in vcpu_worker()
79 while (current_iteration == READ_ONCE(iteration) && in vcpu_worker()
84 …ug("\nvCPU %d dirtied 0x%lx pages over %lu iterations in %ld.%.9lds. (Avg %ld.%.9lds/iteration)\n", in vcpu_worker()
137 iteration = 0; in run_test()
147 pr_debug("Starting iteration %lu - Populating\n", iteration); in run_test()
148 while (READ_ONCE(vcpu_last_completed_iteration[vcpu_id]) != iteration) in run_test()
[all …]
|
| D | dirty_log_test.c | 70 static uint64_t iteration; variable
98 * pages during the first iteration. in guest_code()
102 *(uint64_t *)addr = READ_ONCE(iteration); in guest_code()
111 *(uint64_t *)addr = READ_ONCE(iteration); in guest_code()
205 * bit set in the _next_ iteration. For example, if we detected the
206 * page value changed to current iteration but at the same time the
304 "set in this iteration but it is missing", in vm_dirty_log_verify()
313 * previous iteration number or the current one. in vm_dirty_log_verify()
315 TEST_ASSERT(*value_ptr == iteration || in vm_dirty_log_verify()
316 *value_ptr == iteration - 1, in vm_dirty_log_verify()
[all …]
|
| /kernel/linux/linux-6.6/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()
177 iteration = 0; in run_test()
[all …]
|
| D | dirty_log_test.c | 80 static uint64_t iteration; variable
108 * pages during the first iteration. in guest_code()
112 *(uint64_t *)addr = READ_ONCE(iteration); in guest_code()
121 *(uint64_t *)addr = READ_ONCE(iteration); in guest_code()
392 pr_info("Iteration %ld collected %u pages\n", iteration, count); in dirty_ring_collect_dirty_pages()
457 * bit set in the _next_ iteration. For example, if we detected the
458 * page value changed to current iteration but at the same time the
579 "set in this iteration but it is missing", in vm_dirty_log_verify()
591 * previous iteration number or the current one. in vm_dirty_log_verify()
593 matched = (*value_ptr == iteration || in vm_dirty_log_verify()
[all …]
|
| /kernel/linux/linux-6.6/include/drm/ |
| D | drm_atomic.h | 316 * iteration
770 * @connector: &struct drm_connector iteration cursor
771 * @old_connector_state: &struct drm_connector_state iteration cursor for the
773 * @new_connector_state: &struct drm_connector_state iteration cursor for the
775 * @__i: int iteration cursor, for macro-internal use
794 * @connector: &struct drm_connector iteration cursor
795 * @old_connector_state: &struct drm_connector_state iteration cursor for the
797 * @__i: int iteration cursor, for macro-internal use
815 * @connector: &struct drm_connector iteration cursor
816 * @new_connector_state: &struct drm_connector_state iteration cursor for the
[all …]
|
| /kernel/linux/linux-5.10/include/drm/ |
| D | drm_atomic.h | 282 * iteration
691 * @connector: &struct drm_connector iteration cursor
692 * @old_connector_state: &struct drm_connector_state iteration cursor for the
694 * @new_connector_state: &struct drm_connector_state iteration cursor for the
696 * @__i: int iteration cursor, for macro-internal use
715 * @connector: &struct drm_connector iteration cursor
716 * @old_connector_state: &struct drm_connector_state iteration cursor for the
718 * @__i: int iteration cursor, for macro-internal use
736 * @connector: &struct drm_connector iteration cursor
737 * @new_connector_state: &struct drm_connector_state iteration cursor for the
[all …]
|
| D | drm_dp_mst_helper.h | 875 * @mgr: pointer to the &struct drm_dp_mst_topology_mgr iteration cursor
877 * iteration cursor
879 * iteration cursor
880 * @i: int iteration cursor, for macro-internal use
915 * @mgr: &struct drm_dp_mst_topology_mgr iteration cursor
916 * @old_state: &struct drm_dp_mst_topology_state iteration cursor for the old
918 * @new_state: &struct drm_dp_mst_topology_state iteration cursor for the new
920 * @__i: int iteration cursor, for macro-internal use
934 * @mgr: &struct drm_dp_mst_topology_mgr iteration cursor
935 * @old_state: &struct drm_dp_mst_topology_state iteration cursor for the old
[all …]
|
| /kernel/linux/linux-6.6/tools/testing/selftests/kvm/x86_64/ |
| D | dirty_log_page_splitting_test.c | 31 static int iteration; variable
57 iteration++; in run_vcpu_iteration()
60 iteration) in run_vcpu_iteration()
71 int current_iteration = READ_ONCE(iteration); in vcpu_worker()
79 /* Wait for the start of the next iteration to be signaled. */ in vcpu_worker()
80 while (current_iteration == READ_ONCE(iteration) && in vcpu_worker()
81 READ_ONCE(iteration) >= 0 && in vcpu_worker()
118 iteration = -1; in run_test()
134 while (iteration < ITERATIONS) { in run_test()
136 get_page_stats(vm, &stats_dirty_pass[iteration - 1], in run_test()
[all …]
|
| /kernel/linux/linux-6.6/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 | 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
|
| /kernel/linux/linux-5.10/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 | radix-tree.h | 101 * iteration radix_tree_iter also holds the slots' bit-mask for one chosen
275 * @start: iteration starting index
295 * radix_tree_next_chunk - find next chunk of slots for iteration
329 * radix_tree_iter_retry - retry this chunk of the iteration
335 * and continue the iteration.
359 * before releasing the lock to continue the iteration from the next index.
391 * a) we are doing tagged iteration and iter->tags has been set to 0, or
392 * b) we are doing non-tagged iteration, and iter->index and iter->next_index
443 * @start: iteration starting index
458 * @start: iteration starting index
|
| /kernel/linux/linux-5.10/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.
|
| /kernel/linux/linux-6.6/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.
|
| /kernel/linux/linux-6.6/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()
|
| /kernel/linux/linux-5.10/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()
|
| /kernel/linux/linux-6.6/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
|
| /kernel/linux/linux-6.6/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()
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/arch/x86/tools/ |
| D | insn_sanity.c | 38 static unsigned long iter_start; /* Start of iteration number */
39 static unsigned long iter_end = DEFAULT_MAX_ITER; /* End of iteration number */
50 fprintf(stderr, "\t-s Give a random seed (and iteration number)\n"); in usage()
51 fprintf(stderr, "\t-m Give a maximum iteration number\n"); in usage()
104 /* Give a seed and iteration number */ in dump_stream()
210 usage("Max iteration number must be bigger than iter-num"); in parse_args()
240 if (i < iter_start) /* Skip to given iteration number */ in main()
|
| /kernel/linux/linux-6.6/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()
|
| /kernel/linux/linux-6.6/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 …]
|