x86/kvm/cpuid.c

560 /* Mask kvm_cpu_caps for @leaf with the raw CPUID capabilities of this CPU. */
561 static __always_inline void __kvm_cpu_cap_mask(unsigned int leaf)
563 	const struct cpuid_reg cpuid = x86_feature_cpuid(leaf * 32);
566 	reverse_cpuid_check(leaf);
571 	kvm_cpu_caps[leaf] &= *__cpuid_entry_get_reg(&entry, cpuid.reg);
575 void kvm_cpu_cap_init_kvm_defined(enum kvm_only_cpuid_leafs leaf, u32 mask)
578 	BUILD_BUG_ON(leaf < NCAPINTS);
580 	kvm_cpu_caps[leaf] = mask;
582 	__kvm_cpu_cap_mask(leaf);
585 static __always_inline void kvm_cpu_cap_mask(enum cpuid_leafs leaf, u32 mask)
588 	BUILD_BUG_ON(leaf >= NCAPINTS);
590 	kvm_cpu_caps[leaf] &= mask;
592 	__kvm_cpu_cap_mask(leaf);
797 	 * CPUs that support SSE2.  On CPUs that don't support AMD's leaf,
800 	 * leaf can make it easier for userspace to detect the feature.
939 		/* Limited to the highest leaf implemented in KVM. */
1200 		 * userspace by providing the CPUID leaf ourselves.
1202 		 * However, only do it if the host has CPUID leaf 0x8000001d.
1204 		 * CPUID leaf if KVM reports that it supports 0x8000001d or
1206 		 * highest Intel leaf which QEMU tries to use as the guest's
1208 		 * loop if said highest leaf has no subleaves indexed by ECX.
1474  * Intel CPUID semantics treats any query for an out-of-range leaf as if the
1475  * highest basic leaf (i.e. CPUID.0H:EAX) were requested.  AMD CPUID semantics
1476  * returns all zeroes for any undefined leaf, whether or not the leaf is in
1479  * A leaf is considered out-of-range if its function is higher than the maximum
1480  * supported leaf of its associated class or if its associated class does not
1485  * class exists if a guest CPUID entry for its <base> leaf exists.  For a given
1486  * class, CPUID.<base>.EAX contains the max supported leaf for the class.
1527 	 * max basic entry, e.g. if the max basic leaf is 0xb but there is no
1535 	 * the effective CPUID entry is the max basic leaf.  Note, the index of
1536 	 * the original requested leaf is observed!
1573 		 * When leaf 0BH or 1FH is defined, CL is pass-through
1575 		 * subleaves. Index 1 will exist iff the leaf is
1576 		 * implemented, so we pass through CL iff leaf 1