/kvm-unit-tests/s390x/ |
H A D | memory-verify.c | 49 int j; in main() local 51 for (j = 0; j < SIZE; j += PAGE_SIZE) { in main() 52 if (*(volatile long *)(mem + j) != i) { in main() 56 *(volatile long *)(mem + j) = i + 1; in main()
|
H A D | sieve.c | 7 int i, j, r = 0; in sieve() local 17 for (j = i*2; j < size; j += i) in sieve() 18 data[j] = 0; in sieve()
|
H A D | stfle-sie.c | 60 for (int j = 0; j < stfle_size(); j++) in test_stfle_format_0() local 61 WRITE_ONCE((*fac)[j], prng64(&prng_s)); in test_stfle_format_0()
|
H A D | exittime.c | 253 int i, j, k, testfunc_arg; in main() local 279 for (j = 0; j < outer_iters; j++) { in main()
|
H A D | cpu.S | 63 0: j 0
|
H A D | cstart64.S | 90 j exit
|
/kvm-unit-tests/powerpc/ |
H A D | memory-verify.c | 49 int j; in main() local 51 for (j = 0; j < SIZE; j += PAGE_SIZE) { in main() 52 if (*(volatile long *)(mem + j) != i) { in main() 56 *(volatile long *)(mem + j) = i + 1; in main()
|
H A D | sieve.c | 7 int i, j, r = 0; in sieve() local 17 for (j = i*2; j < size; j += i) in sieve() 18 data[j] = 0; in sieve()
|
/kvm-unit-tests/common/ |
H A D | memory-verify.c | 49 int j; in main() local 51 for (j = 0; j < SIZE; j += PAGE_SIZE) { in main() 52 if (*(volatile long *)(mem + j) != i) { in main() 56 *(volatile long *)(mem + j) = i + 1; in main()
|
H A D | sieve.c | 7 int i, j, r = 0; in sieve() local 17 for (j = i*2; j < size; j += i) in sieve() 18 data[j] = 0; in sieve()
|
/kvm-unit-tests/arm/ |
H A D | sieve.c | 7 int i, j, r = 0; in sieve() local 17 for (j = i*2; j < size; j += i) in sieve() 18 data[j] = 0; in sieve()
|
H A D | pmu.c | 1131 for (int j = 0; j < NR_SAMPLES; j++) { in check_cpi() local
|
/kvm-unit-tests/riscv/ |
H A D | sieve.c | 7 int i, j, r = 0; in sieve() local 17 for (j = i*2; j < size; j += i) in sieve() 18 data[j] = 0; in sieve()
|
H A D | sbi-asm.S | 53 j 5b 66 j 8b 72 j sbi_hsm_check 78 j sbi_hsm_check 114 j 1b 132 j 6b
|
H A D | cstart.S | 29 j 9998b 47 j 1f 84 j 1b 115 j halt 124 j 1b 148 j 1b 174 j . /* unreachable */
|
/kvm-unit-tests/x86/ |
H A D | sieve.c | 7 int i, j, r = 0; in sieve() local 17 for (j = i*2; j < size; j += i) in sieve() 18 data[j] = 0; in sieve()
|
H A D | setjmp.c | 13 jmp_buf j; in main() local 16 i = setjmp(j); in main() 21 longjmp(j, i + 1); in main()
|
H A D | apic.c | 747 int c, i, j, k, f; in test_logical_ipi_xapic() local 804 for (j = 0; j < 8 && !f; j++) { in test_logical_ipi_xapic() 805 if (i == j) in test_logical_ipi_xapic() 809 if ((BIT(i) | BIT(j)) & k) in test_logical_ipi_xapic() 812 f += test_logical_ipi_multi_target(BIT(i), BIT(j), false, in test_logical_ipi_xapic() 813 BIT(i) | BIT(j) | k, vector); in test_logical_ipi_xapic() 816 f += test_logical_ipi_multi_target(BIT(i) | BIT(j), in test_logical_ipi_xapic() 817 BIT(i) | BIT(j), false, in test_logical_ipi_xapic() 818 BIT(i) | BIT(j) | k, vector); in test_logical_ipi_xapic() 827 for (j = 0; j < 4 && !f; j++) { in test_logical_ipi_xapic() [all …]
|
H A D | pmu_pebs.c | 389 unsigned int i, j; in main() local 429 for (j = 0; j <= PEBS_DATACFG_MASK; j++) { in main() 430 u64 pebs_data_cfg = j; in main()
|
H A D | vmx_tests.c | 3825 u8 i = 0, j; in test_apic_virtual_ctls() local 3839 for (j = 1; j < 8; j++) { in test_apic_virtual_ctls() 3844 if (! set_bit_pattern(j, &secondary)) in test_apic_virtual_ctls() 4729 u64 j, resv_bits_mask = 0; in test_ept_eptp() local 4824 for (j = maxphysaddr - 1; j <= 63; j++) { in test_ept_eptp() 4826 (j < maxphysaddr ? 0 : 1ul << j); in test_ept_eptp() 4830 if (j < maxphysaddr) in test_ept_eptp() 7288 u32 j; in test_pat() local 7295 for (j = 0; j < (i ? 8 : 1); j++) { in test_pat() 7296 val = i << j * 8; in test_pat() [all …]
|
/kvm-unit-tests/s390x/snippets/asm/ |
H A D | loop.S | 13 j retry label
|
H A D | icpt-loop.S | 15 j retry label
|
/kvm-unit-tests/ |
H A D | README.macOS.md | 35 $ make -j $(nproc) 43 $ make -j $(nproc) 79 $ make -j $(nproc)
|
/kvm-unit-tests/lib/x86/ |
H A D | apic.c | 252 unsigned int i, j = 0; in init_apic_map() local 256 id_map[j++] = i; in init_apic_map()
|
/kvm-unit-tests/scripts/ |
H A D | checkpatch.pl | 700 for my $j (0 .. $len2) { 702 $distance[$i][$j] = $j; 703 } elsif ($j == 0) { 704 $distance[$i][$j] = $i; 705 } elsif (substr($str1, $i-1, 1) eq substr($str2, $j-1, 1)) { 706 $distance[$i][$j] = $distance[$i - 1][$j - 1]; 708 my $dist1 = $distance[$i][$j - 1]; #insert distance 709 my $dist2 = $distance[$i - 1][$j]; # remove 710 my $dist3 = $distance[$i - 1][$j - 1]; #replace 711 $distance[$i][$j] = 1 + edit_distance_min($dist1, $dist2, $dist3);
|