Searched refs:best (Results 1 – 11 of 11) sorted by relevance
| /tools/testing/selftests/kvm/x86_64/ |
| D | kvm_pv_test.c | 210 struct kvm_cpuid2 *best; in main() local
224 best = kvm_get_supported_cpuid(); in main()
225 clear_kvm_cpuid_features(best); in main()
226 vcpu_set_cpuid(vm, VCPU_ID, best); in main()
|
| D | hyperv_features.c | 169 struct kvm_cpuid2 *best) in guest_test_msrs_access() argument
448 hv_set_cpuid(vm, best, &feat, &recomm, &dbg); in guest_test_msrs_access()
481 void *input, void *output, struct kvm_cpuid2 *best) in guest_test_hcalls_access() argument
593 hv_set_cpuid(vm, best, &feat, &recomm, &dbg); in guest_test_hcalls_access()
627 struct kvm_cpuid2 *best; in main() local
645 best = kvm_get_supported_hv_cpuid(); in main()
653 best); in main()
675 best = kvm_get_supported_hv_cpuid(); in main()
681 best); in main()
|
| /tools/testing/selftests/bpf/ |
| D | test_lpm_map.c | 85 struct tlpm_node *best = NULL; in tlpm_match() local
102 if (!best || i > best->n_bits) in tlpm_match()
103 best = list; in tlpm_match()
107 return best; in tlpm_match()
114 struct tlpm_node *best = tlpm_match(list, key, n_bits); in tlpm_delete() local
117 if (!best || best->n_bits != n_bits) in tlpm_delete()
120 if (best == list) { in tlpm_delete()
121 node = best->next; in tlpm_delete()
122 free(best); in tlpm_delete()
127 if (node->next == best) { in tlpm_delete()
[all …]
|
| /tools/vm/ |
| D | slabinfo.c | 352 struct aliasinfo *best = NULL; in find_one_alias() local
356 (!best || strlen(best->name) < strlen(a->name))) { in find_one_alias()
357 best = a; in find_one_alias()
359 return best; in find_one_alias()
362 return best; in find_one_alias()
|
| /tools/kvm/kvm_stat/ |
| D | kvm_stat.txt | 26 or architecture. It is best to check the KVM kernel module source code for the
|
| /tools/perf/Documentation/ |
| D | perf-stat.txt | 407 For best results it is usually a good idea to use it with interval
423 for best results. Otherwise the bottlenecks may be inconsistent
|
| /tools/memory-model/Documentation/ |
| D | access-marking.txt | 113 architectures. Therefore, it is best to capture the return value from
|
| D | litmus-tests.txt | 497 at best of exponential time complexity. Adding processes and increasing
888 So it is best to start small and then work up. Where possible, break
|
| D | explanation.txt | 1198 This is best explained with some examples. The simplest case looks
|
| /tools/usb/usbip/ |
| D | COPYING | 285 possible use to the public, the best way to achieve this is to make it
|
| /tools/power/pm-graph/ |
| D | README | 203 The best way to gauge the health of a system is to run a series of
|