From: Peter Lieven <pl@kamp.de>
To: qemu-devel@nongnu.org
Cc: Peter Lieven <pl@kamp.de>
Subject: [Qemu-devel] [PATCHv2 8/9] migration: do not search dirty pages in bulk stage
Date: Fri, 15 Mar 2013 16:50:17 +0100 [thread overview]
Message-ID: <1363362619-3190-9-git-send-email-pl@kamp.de> (raw)
In-Reply-To: <1363362619-3190-1-git-send-email-pl@kamp.de>
avoid searching for dirty pages just increment the
page offset. all pages are dirty anyway.
Signed-off-by: Peter Lieven <pl@kamp.de>
---
arch_init.c | 12 +++++++++---
1 file changed, 9 insertions(+), 3 deletions(-)
diff --git a/arch_init.c b/arch_init.c
index a3dc20d..ca281ad 100644
--- a/arch_init.c
+++ b/arch_init.c
@@ -321,8 +321,14 @@ ram_addr_t migration_bitmap_find_and_reset_dirty(MemoryRegion *mr,
unsigned long nr = base + (start >> TARGET_PAGE_BITS);
unsigned long size = base + (int128_get64(mr->size) >> TARGET_PAGE_BITS);
- unsigned long next = find_next_bit(migration_bitmap, size, nr);
-
+ unsigned long next;
+
+ if (ram_bulk_stage) {
+ next = nr + 1;
+ } else {
+ next = find_next_bit(migration_bitmap, size, nr);
+ }
+
if (next < size) {
clear_bit(next, migration_bitmap);
migration_dirty_pages--;
@@ -523,7 +529,7 @@ static void reset_ram_globals(void)
{
last_seen_block = NULL;
last_sent_block = NULL;
- last_offset = 0;
+ last_offset = -1;
last_version = ram_list.version;
ram_bulk_stage = true;
}
--
1.7.9.5
next prev parent reply other threads:[~2013-03-15 16:11 UTC|newest]
Thread overview: 27+ messages / expand[flat|nested] mbox.gz Atom feed top
2013-03-15 15:50 [Qemu-devel] [PATCHv2 0/9] buffer_is_zero / migration optimizations Peter Lieven
2013-03-15 15:50 ` [Qemu-devel] [PATCHv2 1/9] move vector definitions to qemu-common.h Peter Lieven
2013-03-19 15:35 ` Eric Blake
2013-03-15 15:50 ` [Qemu-devel] [PATCHv2 2/9] cutils: add a function to find non-zero content in a buffer Peter Lieven
2013-03-19 15:54 ` Eric Blake
2013-03-19 16:18 ` Peter Lieven
2013-03-19 16:43 ` Eric Blake
2013-03-19 19:42 ` Peter Lieven
2013-03-15 15:50 ` [Qemu-devel] [PATCHv2 3/9] buffer_is_zero: use vector optimizations if possible Peter Lieven
2013-03-19 16:08 ` Eric Blake
2013-03-19 16:14 ` Peter Lieven
2013-03-19 19:44 ` Peter Lieven
2013-03-15 15:50 ` [Qemu-devel] [PATCHv2 4/9] bitops: use vector algorithm to optimize find_next_bit() Peter Lieven
2013-03-19 16:49 ` Eric Blake
2013-03-19 19:40 ` Peter Lieven
2013-03-15 15:50 ` [Qemu-devel] [PATCHv2 5/9] migration: search for zero instead of dup pages Peter Lieven
2013-03-19 16:55 ` Eric Blake
2013-03-15 15:50 ` [Qemu-devel] [PATCHv2 6/9] migration: add an indicator for bulk state of ram migration Peter Lieven
2013-03-19 17:32 ` Eric Blake
2013-03-15 15:50 ` [Qemu-devel] [PATCHv2 7/9] migration: do not sent zero pages in bulk stage Peter Lieven
2013-03-19 17:36 ` Eric Blake
2013-03-19 19:35 ` Peter Lieven
2013-03-15 15:50 ` Peter Lieven [this message]
2013-03-19 17:40 ` [Qemu-devel] [PATCHv2 8/9] migration: do not search dirty " Eric Blake
2013-03-19 19:29 ` Peter Lieven
2013-03-15 15:50 ` [Qemu-devel] [PATCHv2 9/9] migration: use XBZRLE only after " Peter Lieven
2013-03-19 17:43 ` Eric Blake
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=1363362619-3190-9-git-send-email-pl@kamp.de \
--to=pl@kamp.de \
--cc=qemu-devel@nongnu.org \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).