diff options
author | Daniel P. Berrangé | 2021-02-04 13:48:26 +0100 |
---|---|---|
committer | Dr. David Alan Gilbert | 2021-02-08 12:19:51 +0100 |
commit | cf3a74c94f3da92fdf8d45047756f0e43657be1a (patch) | |
tree | 4bd20f44846b8a99eb0b4d23504d410e7f14f922 /replay | |
parent | migration: stop returning errno from load_snapshot() (diff) | |
download | qemu-cf3a74c94f3da92fdf8d45047756f0e43657be1a.tar.gz qemu-cf3a74c94f3da92fdf8d45047756f0e43657be1a.tar.xz qemu-cf3a74c94f3da92fdf8d45047756f0e43657be1a.zip |
block: add ability to specify list of blockdevs during snapshot
When running snapshot operations, there are various rules for which
blockdevs are included/excluded. While this provides reasonable default
behaviour, there are scenarios that are not well handled by the default
logic. Some of the conditions do not have a single correct answer.
Thus there needs to be a way for the mgmt app to provide an explicit
list of blockdevs to perform snapshots across. This can be achieved
by passing a list of node names that should be used.
Reviewed-by: Eric Blake <eblake@redhat.com>
Signed-off-by: Daniel P. Berrangé <berrange@redhat.com>
Message-Id: <20210204124834.774401-5-berrange@redhat.com>
Signed-off-by: Dr. David Alan Gilbert <dgilbert@redhat.com>
Diffstat (limited to 'replay')
-rw-r--r-- | replay/replay-debugging.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/replay/replay-debugging.c b/replay/replay-debugging.c index 8e0050915d..67d8237077 100644 --- a/replay/replay-debugging.c +++ b/replay/replay-debugging.c @@ -148,7 +148,7 @@ static char *replay_find_nearest_snapshot(int64_t icount, *snapshot_icount = -1; - bs = bdrv_all_find_vmstate_bs(NULL); + bs = bdrv_all_find_vmstate_bs(false, NULL, NULL); if (!bs) { goto fail; } @@ -159,7 +159,7 @@ static char *replay_find_nearest_snapshot(int64_t icount, aio_context_release(aio_context); for (i = 0; i < nb_sns; i++) { - if (bdrv_all_find_snapshot(sn_tab[i].name, NULL) == 0) { + if (bdrv_all_find_snapshot(sn_tab[i].name, false, NULL, NULL) == 0) { if (sn_tab[i].icount != -1ULL && sn_tab[i].icount <= icount && (!nearest || nearest->icount < sn_tab[i].icount)) { |