[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-Id: <20220809055138.101470-1-zhiguangni01@gmail.com>
Date: Tue, 9 Aug 2022 13:51:38 +0800
From: Liam Ni <zhiguangni01@...il.com>
To: seanjc@...gle.com, pbonzini@...hat.com, tglx@...utronix.de,
mingo@...hat.com, bp@...en8.de, dave.hansen@...ux.intel.com,
hpa@...or.com
Cc: x86@...nel.org, kvm@...r.kernel.org, linux-kernel@...r.kernel.org,
zhiguangni01@...il.com
Subject: [PATCH] KVM:make cpuid_entry2_find more efficient
Compared with the way of obtaining the pointer by
fetching the value of the array and then fetching the pointer,
the way of obtaining the pointer by the pointer offset is more efficient.
Signed-off-by: Liam Ni <zhiguangni01@...il.com>
---
arch/x86/kvm/cpuid.c | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/arch/x86/kvm/cpuid.c b/arch/x86/kvm/cpuid.c
index de6d44e07e34..3bf82a891564 100644
--- a/arch/x86/kvm/cpuid.c
+++ b/arch/x86/kvm/cpuid.c
@@ -75,7 +75,7 @@ static inline struct kvm_cpuid_entry2 *cpuid_entry2_find(
int i;
for (i = 0; i < nent; i++) {
- e = &entries[i];
+ e = entries + i;
if (e->function == function &&
(!(e->flags & KVM_CPUID_FLAG_SIGNIFCANT_INDEX) || e->index == index))
--
2.25.1
Powered by blists - more mailing lists