| /linux/tools/testing/selftests/kvm/ |
| H A 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 …]
|
| H A D | dirty_log_test.c | 42 * iteration to provide a lower bound on coverage.
80 static uint64_t iteration; variable
112 * pages during the first iteration. in guest_code()
116 vcpu_arch_put_guest(*(uint64_t *)addr, READ_ONCE(iteration)); in guest_code()
128 vcpu_arch_put_guest(*(uint64_t *)addr, READ_ONCE(iteration)); in guest_code()
208 * iteration, the test fails.
212 * write during iteration N-1, thus remember last iteration last log entry
213 * and also don't fail when it is reported in the next iteration, together with
214 * an outdated iteration count.
506 * multiple times per iteration, i.e. can show up in both in vm_dirty_log_verify()
[all …]
|
| /linux/include/drm/ |
| H A D | drm_atomic.h | 316 * iteration
852 * @connector: &struct drm_connector iteration cursor
853 * @old_connector_state: &struct drm_connector_state iteration cursor for the
855 * @new_connector_state: &struct drm_connector_state iteration cursor for the
857 * @__i: int iteration cursor, for macro-internal use
876 * @connector: &struct drm_connector iteration cursor
877 * @old_connector_state: &struct drm_connector_state iteration cursor for the
879 * @__i: int iteration cursor, for macro-internal use
897 * @connector: &struct drm_connector iteration cursor
898 * @new_connector_state: &struct drm_connector_state iteration cursor for the
[all …]
|
| /linux/tools/testing/selftests/kvm/x86/ |
| H A 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/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 | 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
|
| H A D | iomap.h | 222 * @inode: Set at the start of the iteration and should not change.
229 * @status: Status of the most recent iteration. Zero on success or a negative
232 * @iomap: Map describing the I/O iteration
251 * iomap_length_trim - trimmed length of the current iomap iteration
252 * @iter: iteration structure
257 * iteration.
270 * iomap_length - length of the current iomap iteration
271 * @iter: iteration structure
273 * Returns the length that the operation applies to for the current iteration.
291 * iomap_iter_srcmap - return the source map for the current iomap iteration
[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 | 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 | 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/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/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/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/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/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/Documentation/networking/ |
| H A 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/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/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/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 */
|