Commit 5cfc7e0f authored by Paolo Bonzini's avatar Paolo Bonzini
Browse files

KVM: emulate: avoid repeated calls to do_insn_fetch_bytes 



do_insn_fetch_bytes will only be called once in a given insn_fetch and
insn_fetch_arr, because in fact it will only be called at most twice
for any instruction and the first call is explicit in x86_decode_insn.
This observation lets us hoist the call out of the memory copying loop.
It does not buy performance, because most fetches are one byte long
anyway, but it prepares for the next patch.

The overflow check is tricky, but correct.  Because do_insn_fetch_bytes
has already been called once, we know that fc->end is at least 15.  So
it is okay to subtract the number of bytes we want to read.

Signed-off-by: default avatarPaolo Bonzini <pbonzini@redhat.com>
parent 285ca9e9

arch/x86/kvm/emulate.c

+17 −9
Original line number Diff line number Diff line
@@ -708,7 +708,7 @@ static int segmented_read_std(struct x86_emulate_ctxt *ctxt, 
 * Prefetch the remaining bytes of the instruction without crossing page

 * boundary if they are not in fetch_cache yet.

 */

static int do_insn_fetch_bytes(struct x86_emulate_ctxt *ctxt)

static int do_insn_fetch_bytes(struct x86_emulate_ctxt *ctxt, int op_size)

{

	struct fetch_cache *fc = &ctxt->fetch;

	int rc;
@@ -720,7 +720,14 @@ static int do_insn_fetch_bytes(struct x86_emulate_ctxt *ctxt) 
	cur_size = fc->end - fc->start;

	size = min(15UL - cur_size,

		   PAGE_SIZE - offset_in_page(fc->end));

	if (unlikely(size == 0))



	/*

	 * One instruction can only straddle two pages,

	 * and one has been loaded at the beginning of

	 * x86_decode_insn.  So, if not enough bytes

	 * still, we must have hit the 15-byte boundary.

	 */

	if (unlikely(size < op_size))

		return X86EMUL_UNHANDLEABLE;

	rc = __linearize(ctxt, addr, size, false, true, &linear);

	if (unlikely(rc != X86EMUL_CONTINUE))
@@ -736,17 +743,18 @@ static int do_insn_fetch_bytes(struct x86_emulate_ctxt *ctxt) 
static int do_insn_fetch(struct x86_emulate_ctxt *ctxt,

			 void *__dest, unsigned size)

{

	int rc;

	struct fetch_cache *fc = &ctxt->fetch;

	u8 *dest = __dest;

	u8 *src = &fc->data[ctxt->_eip - fc->start];



	while (size--) {

		if (unlikely(ctxt->_eip == fc->end)) {

			rc = do_insn_fetch_bytes(ctxt);

	/* We have to be careful about overflow! */

	if (unlikely(ctxt->_eip > fc->end - size)) {

		int rc = do_insn_fetch_bytes(ctxt, size);

		if (rc != X86EMUL_CONTINUE)

			return rc;

	}



	while (size--) {

		*dest++ = *src++;

		ctxt->_eip++;

		continue;
@@ -4228,7 +4236,7 @@ int x86_decode_insn(struct x86_emulate_ctxt *ctxt, void *insn, int insn_len) 
	if (insn_len > 0)

		memcpy(ctxt->fetch.data, insn, insn_len);

	else {

		rc = do_insn_fetch_bytes(ctxt);

		rc = do_insn_fetch_bytes(ctxt, 1);

		if (rc != X86EMUL_CONTINUE)

			return rc;

	}

CRA Git | Maintained and supported by SUSTech CRA and CCSE