2013-02-13 18:04:05 +00:00
|
|
|
/*
|
2014-04-02 01:13:51 +00:00
|
|
|
* Copyright (C) 2013-2014 Red Hat, Inc.
|
2013-02-13 18:04:05 +00:00
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library. If not, see
|
|
|
|
* <http://www.gnu.org/licenses/>.
|
|
|
|
*
|
|
|
|
* Author: Eric Blake <eblake@redhat.com>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
|
|
#include "testutils.h"
|
|
|
|
#include "vircommand.h"
|
|
|
|
#include "virerror.h"
|
2013-05-09 18:59:04 +00:00
|
|
|
#include "virfile.h"
|
2013-02-13 18:04:05 +00:00
|
|
|
#include "virlog.h"
|
|
|
|
#include "virstoragefile.h"
|
2013-04-03 10:36:23 +00:00
|
|
|
#include "virstring.h"
|
2014-04-18 12:49:54 +00:00
|
|
|
#include "dirname.h"
|
2013-02-13 18:04:05 +00:00
|
|
|
|
2014-04-24 10:14:01 +00:00
|
|
|
#include "storage/storage_driver.h"
|
|
|
|
|
2013-02-13 18:04:05 +00:00
|
|
|
#define VIR_FROM_THIS VIR_FROM_NONE
|
|
|
|
|
2014-02-28 12:16:17 +00:00
|
|
|
VIR_LOG_INIT("tests.storagetest");
|
|
|
|
|
2013-02-13 18:04:05 +00:00
|
|
|
#define datadir abs_builddir "/virstoragedata"
|
|
|
|
|
|
|
|
/* This test creates the following files, all in datadir:
|
|
|
|
|
|
|
|
* raw: 1024-byte raw file
|
|
|
|
* qcow2: qcow2 file with 'raw' as backing
|
|
|
|
* wrap: qcow2 file with 'qcow2' as backing
|
|
|
|
* qed: qed file with 'raw' as backing
|
|
|
|
* sub/link1: symlink to qcow2
|
|
|
|
* sub/link2: symlink to wrap
|
|
|
|
*
|
|
|
|
* Relative names to these files are known at compile time, but absolute
|
|
|
|
* and canonical names depend on where the test is run; for convenience,
|
|
|
|
* we pre-populate the computation of these names for use during the test.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static char *qemuimg;
|
|
|
|
static char *absraw;
|
|
|
|
static char *canonraw;
|
|
|
|
static char *absqcow2;
|
|
|
|
static char *canonqcow2;
|
|
|
|
static char *abswrap;
|
2014-04-09 04:28:35 +00:00
|
|
|
static char *canonwrap;
|
2013-02-13 18:04:05 +00:00
|
|
|
static char *absqed;
|
2014-04-09 04:28:35 +00:00
|
|
|
static char *canonqed;
|
2014-04-04 19:35:22 +00:00
|
|
|
static char *absdir;
|
2014-04-09 04:28:35 +00:00
|
|
|
static char *canondir;
|
2013-02-13 18:04:05 +00:00
|
|
|
static char *abslink2;
|
|
|
|
|
|
|
|
static void
|
|
|
|
testCleanupImages(void)
|
|
|
|
{
|
|
|
|
VIR_FREE(qemuimg);
|
|
|
|
VIR_FREE(absraw);
|
|
|
|
VIR_FREE(canonraw);
|
|
|
|
VIR_FREE(absqcow2);
|
|
|
|
VIR_FREE(canonqcow2);
|
|
|
|
VIR_FREE(abswrap);
|
2014-04-09 04:28:35 +00:00
|
|
|
VIR_FREE(canonwrap);
|
2013-02-13 18:04:05 +00:00
|
|
|
VIR_FREE(absqed);
|
2014-04-09 04:28:35 +00:00
|
|
|
VIR_FREE(canonqed);
|
2014-04-04 19:35:22 +00:00
|
|
|
VIR_FREE(absdir);
|
2014-04-09 04:28:35 +00:00
|
|
|
VIR_FREE(canondir);
|
2013-02-13 18:04:05 +00:00
|
|
|
VIR_FREE(abslink2);
|
|
|
|
|
|
|
|
if (chdir(abs_builddir) < 0) {
|
|
|
|
fprintf(stderr, "unable to return to correct directory, refusing to "
|
|
|
|
"clean up %s\n", datadir);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2014-04-02 21:52:18 +00:00
|
|
|
virFileDeleteTree(datadir);
|
2013-02-13 18:04:05 +00:00
|
|
|
}
|
|
|
|
|
2014-04-18 12:49:54 +00:00
|
|
|
|
|
|
|
static virStorageSourcePtr
|
|
|
|
testStorageFileGetMetadata(const char *path,
|
|
|
|
int format,
|
|
|
|
uid_t uid, gid_t gid,
|
|
|
|
bool allow_probe)
|
|
|
|
{
|
2014-04-25 19:44:06 +00:00
|
|
|
struct stat st;
|
2014-04-18 12:49:54 +00:00
|
|
|
virStorageSourcePtr ret = NULL;
|
|
|
|
|
|
|
|
if (VIR_ALLOC(ret) < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
ret->type = VIR_STORAGE_TYPE_FILE;
|
|
|
|
ret->format = format;
|
|
|
|
|
2014-04-25 19:44:06 +00:00
|
|
|
if (stat(path, &st) == 0) {
|
|
|
|
if (S_ISDIR(st.st_mode)) {
|
|
|
|
ret->type = VIR_STORAGE_TYPE_DIR;
|
|
|
|
ret->format = VIR_STORAGE_FILE_DIR;
|
|
|
|
} else if (S_ISBLK(st.st_mode)) {
|
|
|
|
ret->type = VIR_STORAGE_TYPE_BLOCK;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-18 12:49:54 +00:00
|
|
|
if (VIR_STRDUP(ret->relPath, path) < 0)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
if (!(ret->relDir = mdir_name(path))) {
|
|
|
|
virReportOOMError();
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!(ret->path = canonicalize_file_name(path))) {
|
|
|
|
virReportError(VIR_ERR_INTERNAL_ERROR, "failed to resolve '%s'", path);
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (virStorageFileGetMetadata(ret, uid, gid, allow_probe) < 0)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
error:
|
|
|
|
virStorageSourceFree(ret);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2013-02-13 18:04:05 +00:00
|
|
|
static int
|
|
|
|
testPrepImages(void)
|
|
|
|
{
|
|
|
|
int ret = EXIT_FAILURE;
|
|
|
|
virCommandPtr cmd = NULL;
|
2013-12-17 23:28:20 +00:00
|
|
|
char *buf = NULL;
|
|
|
|
bool compat = false;
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
qemuimg = virFindFileInPath("kvm-img");
|
|
|
|
if (!qemuimg)
|
|
|
|
qemuimg = virFindFileInPath("qemu-img");
|
2013-02-26 19:45:38 +00:00
|
|
|
if (!qemuimg)
|
|
|
|
goto skip;
|
2013-02-13 18:04:05 +00:00
|
|
|
|
2014-04-10 19:34:15 +00:00
|
|
|
/* Clean up from any earlier failed tests */
|
|
|
|
virFileDeleteTree(datadir);
|
|
|
|
|
2013-12-17 23:28:20 +00:00
|
|
|
/* See if qemu-img supports '-o compat=xxx'. If so, we force the
|
|
|
|
* use of both v2 and v3 files; if not, it is v2 only but the test
|
|
|
|
* still works. */
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "create", "-f", "qcow2",
|
|
|
|
"-o?", "/dev/null", NULL);
|
|
|
|
virCommandSetOutputBuffer(cmd, &buf);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
goto skip;
|
|
|
|
if (strstr(buf, "compat "))
|
|
|
|
compat = true;
|
|
|
|
VIR_FREE(buf);
|
|
|
|
|
2013-02-13 18:04:05 +00:00
|
|
|
if (virAsprintf(&absraw, "%s/raw", datadir) < 0 ||
|
|
|
|
virAsprintf(&absqcow2, "%s/qcow2", datadir) < 0 ||
|
|
|
|
virAsprintf(&abswrap, "%s/wrap", datadir) < 0 ||
|
|
|
|
virAsprintf(&absqed, "%s/qed", datadir) < 0 ||
|
2014-04-04 19:35:22 +00:00
|
|
|
virAsprintf(&absdir, "%s/dir", datadir) < 0 ||
|
2013-07-04 10:20:21 +00:00
|
|
|
virAsprintf(&abslink2, "%s/sub/link2", datadir) < 0)
|
2013-02-13 18:04:05 +00:00
|
|
|
goto cleanup;
|
|
|
|
|
|
|
|
if (virFileMakePath(datadir "/sub") < 0) {
|
|
|
|
fprintf(stderr, "unable to create directory %s\n", datadir "/sub");
|
|
|
|
goto cleanup;
|
|
|
|
}
|
2014-04-04 19:35:22 +00:00
|
|
|
if (virFileMakePath(datadir "/dir") < 0) {
|
|
|
|
fprintf(stderr, "unable to create directory %s\n", datadir "/dir");
|
|
|
|
goto cleanup;
|
|
|
|
}
|
2014-04-09 04:28:35 +00:00
|
|
|
if (!(canondir = canonicalize_file_name(absdir))) {
|
|
|
|
virReportOOMError();
|
|
|
|
goto cleanup;
|
|
|
|
}
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
if (chdir(datadir) < 0) {
|
|
|
|
fprintf(stderr, "unable to test relative backing chains\n");
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
2013-12-17 23:28:20 +00:00
|
|
|
if (virAsprintf(&buf, "%1024d", 0) < 0 ||
|
|
|
|
virFileWriteStr("raw", buf, 0600) < 0) {
|
2013-02-26 19:45:38 +00:00
|
|
|
fprintf(stderr, "unable to create raw file\n");
|
2013-02-13 18:04:05 +00:00
|
|
|
goto cleanup;
|
2013-02-26 19:45:38 +00:00
|
|
|
}
|
2013-02-13 18:04:05 +00:00
|
|
|
if (!(canonraw = canonicalize_file_name(absraw))) {
|
|
|
|
virReportOOMError();
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Create a qcow2 wrapping relative raw; later on, we modify its
|
|
|
|
* metadata to test other configurations */
|
|
|
|
virCommandFree(cmd);
|
2013-12-17 23:28:20 +00:00
|
|
|
cmd = virCommandNewArgList(qemuimg, "create", "-f", "qcow2", NULL);
|
|
|
|
virCommandAddArgFormat(cmd, "-obacking_file=raw,backing_fmt=raw%s",
|
|
|
|
compat ? ",compat=0.10" : "");
|
|
|
|
virCommandAddArg(cmd, "qcow2");
|
2013-02-13 18:04:05 +00:00
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
2013-02-26 19:45:38 +00:00
|
|
|
goto skip;
|
2013-02-13 18:04:05 +00:00
|
|
|
/* Make sure our later uses of 'qemu-img rebase' will work */
|
|
|
|
virCommandFree(cmd);
|
2013-02-26 19:45:38 +00:00
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
2013-02-13 18:04:05 +00:00
|
|
|
"-F", "raw", "-b", "raw", "qcow2", NULL);
|
2013-02-26 19:45:38 +00:00
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
goto skip;
|
2013-02-13 18:04:05 +00:00
|
|
|
if (!(canonqcow2 = canonicalize_file_name(absqcow2))) {
|
|
|
|
virReportOOMError();
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Create a second qcow2 wrapping the first, to be sure that we
|
|
|
|
* can correctly avoid insecure probing. */
|
|
|
|
virCommandFree(cmd);
|
2013-02-26 19:45:38 +00:00
|
|
|
cmd = virCommandNewArgList(qemuimg, "create", "-f", "qcow2", NULL);
|
2013-12-17 23:28:20 +00:00
|
|
|
virCommandAddArgFormat(cmd, "-obacking_file=%s,backing_fmt=qcow2%s",
|
|
|
|
absqcow2, compat ? ",compat=1.1" : "");
|
2013-02-13 18:04:05 +00:00
|
|
|
virCommandAddArg(cmd, "wrap");
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
2013-02-26 19:45:38 +00:00
|
|
|
goto skip;
|
2014-04-09 04:28:35 +00:00
|
|
|
if (!(canonwrap = canonicalize_file_name(abswrap))) {
|
|
|
|
virReportOOMError();
|
|
|
|
goto cleanup;
|
|
|
|
}
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Create a qed file. */
|
|
|
|
virCommandFree(cmd);
|
2013-02-26 19:45:38 +00:00
|
|
|
cmd = virCommandNewArgList(qemuimg, "create", "-f", "qed", NULL);
|
2013-02-13 18:04:05 +00:00
|
|
|
virCommandAddArgFormat(cmd, "-obacking_file=%s,backing_fmt=raw",
|
|
|
|
absraw);
|
|
|
|
virCommandAddArg(cmd, "qed");
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
2013-02-26 19:45:38 +00:00
|
|
|
goto skip;
|
2014-04-09 04:28:35 +00:00
|
|
|
if (!(canonqed = canonicalize_file_name(absqed))) {
|
|
|
|
virReportOOMError();
|
|
|
|
goto cleanup;
|
|
|
|
}
|
2013-02-13 18:04:05 +00:00
|
|
|
|
2013-04-15 16:00:17 +00:00
|
|
|
#ifdef HAVE_SYMLINK
|
2013-02-13 18:04:05 +00:00
|
|
|
/* Create some symlinks in a sub-directory. */
|
|
|
|
if (symlink("../qcow2", datadir "/sub/link1") < 0 ||
|
|
|
|
symlink("../wrap", datadir "/sub/link2") < 0) {
|
|
|
|
fprintf(stderr, "unable to create symlink");
|
|
|
|
goto cleanup;
|
|
|
|
}
|
2013-04-15 16:00:17 +00:00
|
|
|
#endif
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
ret = 0;
|
2014-03-25 06:53:44 +00:00
|
|
|
cleanup:
|
2013-12-17 23:28:20 +00:00
|
|
|
VIR_FREE(buf);
|
2013-02-13 18:04:05 +00:00
|
|
|
virCommandFree(cmd);
|
|
|
|
if (ret)
|
|
|
|
testCleanupImages();
|
|
|
|
return ret;
|
2013-02-26 19:45:38 +00:00
|
|
|
|
2014-03-25 06:53:44 +00:00
|
|
|
skip:
|
2013-02-26 19:45:38 +00:00
|
|
|
fputs("qemu-img is too old; skipping this test\n", stderr);
|
|
|
|
ret = EXIT_AM_SKIP;
|
|
|
|
goto cleanup;
|
2013-02-13 18:04:05 +00:00
|
|
|
}
|
|
|
|
|
2014-04-05 18:00:48 +00:00
|
|
|
/* Many fields of virStorageFileMetadata have the same content whether
|
|
|
|
* we access the file relatively or absolutely; but file names differ
|
|
|
|
* depending on how the chain was opened. For ease of testing, we
|
|
|
|
* test both relative and absolute starts, and use a flag to say which
|
|
|
|
* of the two variations to compare against. */
|
2013-02-13 18:04:05 +00:00
|
|
|
typedef struct _testFileData testFileData;
|
|
|
|
struct _testFileData
|
|
|
|
{
|
|
|
|
const char *expBackingStore;
|
|
|
|
const char *expBackingStoreRaw;
|
|
|
|
unsigned long long expCapacity;
|
|
|
|
bool expEncrypted;
|
2014-04-04 04:03:04 +00:00
|
|
|
const char *pathRel;
|
|
|
|
const char *pathAbs;
|
2014-04-17 11:47:41 +00:00
|
|
|
const char *path;
|
2014-04-09 04:28:35 +00:00
|
|
|
const char *relDirRel;
|
|
|
|
const char *relDirAbs;
|
|
|
|
int type;
|
|
|
|
int format;
|
2013-02-13 18:04:05 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
enum {
|
|
|
|
EXP_PASS = 0,
|
|
|
|
EXP_FAIL = 1,
|
|
|
|
EXP_WARN = 2,
|
|
|
|
ALLOW_PROBE = 4,
|
2014-04-05 18:00:48 +00:00
|
|
|
ABS_START = 8,
|
2013-02-13 18:04:05 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
struct testChainData
|
|
|
|
{
|
|
|
|
const char *start;
|
2014-04-27 00:15:22 +00:00
|
|
|
virStorageFileFormat format;
|
2014-04-05 18:00:48 +00:00
|
|
|
const testFileData *files[4];
|
2013-02-13 18:04:05 +00:00
|
|
|
int nfiles;
|
|
|
|
unsigned int flags;
|
|
|
|
};
|
|
|
|
|
2014-05-26 13:38:29 +00:00
|
|
|
|
|
|
|
static const char testStorageChainFormat[] =
|
2014-05-26 14:39:38 +00:00
|
|
|
"chain member: %zu\n"
|
2014-05-26 13:38:29 +00:00
|
|
|
"store: %s\n"
|
|
|
|
"backingStoreRaw: %s\n"
|
|
|
|
"capacity: %lld\n"
|
|
|
|
"encryption: %d\n"
|
|
|
|
"relPath:%s\n"
|
|
|
|
"path:%s\n"
|
|
|
|
"relDir:%s\n"
|
|
|
|
"type:%d\n"
|
|
|
|
"format:%d\n";
|
|
|
|
|
2013-02-13 18:04:05 +00:00
|
|
|
static int
|
|
|
|
testStorageChain(const void *args)
|
|
|
|
{
|
|
|
|
const struct testChainData *data = args;
|
|
|
|
int ret = -1;
|
2014-04-17 14:05:16 +00:00
|
|
|
virStorageSourcePtr meta;
|
|
|
|
virStorageSourcePtr elt;
|
Convert 'int i' to 'size_t i' in tests/ files
Convert the type of loop iterators named 'i', 'j', k',
'ii', 'jj', 'kk', to be 'size_t' instead of 'int' or
'unsigned int', also santizing 'ii', 'jj', 'kk' to use
the normal 'i', 'j', 'k' naming
Signed-off-by: Daniel P. Berrange <berrange@redhat.com>
2013-07-08 14:09:33 +00:00
|
|
|
size_t i = 0;
|
2014-04-04 19:35:22 +00:00
|
|
|
char *broken = NULL;
|
2014-04-09 06:50:24 +00:00
|
|
|
bool isAbs = !!(data->flags & ABS_START);
|
2013-02-13 18:04:05 +00:00
|
|
|
|
2014-04-18 12:49:54 +00:00
|
|
|
meta = testStorageFileGetMetadata(data->start, data->format, -1, -1,
|
|
|
|
(data->flags & ALLOW_PROBE) != 0);
|
2013-02-13 18:04:05 +00:00
|
|
|
if (!meta) {
|
|
|
|
if (data->flags & EXP_FAIL) {
|
|
|
|
virResetLastError();
|
|
|
|
ret = 0;
|
|
|
|
}
|
|
|
|
goto cleanup;
|
|
|
|
} else if (data->flags & EXP_FAIL) {
|
|
|
|
fprintf(stderr, "call should have failed\n");
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
if (data->flags & EXP_WARN) {
|
|
|
|
if (!virGetLastError()) {
|
|
|
|
fprintf(stderr, "call should have warned\n");
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
virResetLastError();
|
2014-04-04 19:35:22 +00:00
|
|
|
if (virStorageFileChainGetBroken(meta, &broken) || !broken) {
|
|
|
|
fprintf(stderr, "call should identify broken part of chain\n");
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (virGetLastError()) {
|
|
|
|
fprintf(stderr, "call should not have warned\n");
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
if (virStorageFileChainGetBroken(meta, &broken) || broken) {
|
|
|
|
fprintf(stderr, "chain should not be identified as broken\n");
|
|
|
|
goto cleanup;
|
|
|
|
}
|
2013-02-13 18:04:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
elt = meta;
|
|
|
|
while (elt) {
|
|
|
|
char *expect = NULL;
|
|
|
|
char *actual = NULL;
|
2014-04-04 04:03:04 +00:00
|
|
|
const char *expPath;
|
2014-04-09 04:28:35 +00:00
|
|
|
const char *expRelDir;
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
if (i == data->nfiles) {
|
|
|
|
fprintf(stderr, "probed chain was too long\n");
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
2014-04-04 04:03:04 +00:00
|
|
|
expPath = isAbs ? data->files[i]->pathAbs
|
|
|
|
: data->files[i]->pathRel;
|
2014-04-09 04:28:35 +00:00
|
|
|
expRelDir = isAbs ? data->files[i]->relDirAbs
|
|
|
|
: data->files[i]->relDirRel;
|
2013-02-13 18:04:05 +00:00
|
|
|
if (virAsprintf(&expect,
|
2014-05-26 14:39:38 +00:00
|
|
|
testStorageChainFormat, i,
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
NULLSTR(data->files[i]->expBackingStore),
|
|
|
|
NULLSTR(data->files[i]->expBackingStoreRaw),
|
|
|
|
data->files[i]->expCapacity,
|
2014-04-04 04:03:04 +00:00
|
|
|
data->files[i]->expEncrypted,
|
2014-04-09 04:28:35 +00:00
|
|
|
NULLSTR(expPath),
|
2014-04-17 11:47:41 +00:00
|
|
|
NULLSTR(data->files[i]->path),
|
2014-04-09 04:28:35 +00:00
|
|
|
NULLSTR(expRelDir),
|
|
|
|
data->files[i]->type,
|
|
|
|
data->files[i]->format) < 0 ||
|
2013-02-13 18:04:05 +00:00
|
|
|
virAsprintf(&actual,
|
2014-05-26 14:39:38 +00:00
|
|
|
testStorageChainFormat, i,
|
2014-04-17 20:46:18 +00:00
|
|
|
NULLSTR(elt->backingStore ? elt->backingStore->path : NULL),
|
2013-02-13 18:04:05 +00:00
|
|
|
NULLSTR(elt->backingStoreRaw),
|
2014-05-26 13:38:29 +00:00
|
|
|
elt->capacity,
|
|
|
|
!!elt->encryption,
|
2014-04-17 11:36:59 +00:00
|
|
|
NULLSTR(elt->relPath),
|
2014-04-17 11:47:41 +00:00
|
|
|
NULLSTR(elt->path),
|
2014-04-09 04:28:35 +00:00
|
|
|
NULLSTR(elt->relDir),
|
2014-05-26 13:38:29 +00:00
|
|
|
elt->type,
|
|
|
|
elt->format) < 0) {
|
2013-02-13 18:04:05 +00:00
|
|
|
VIR_FREE(expect);
|
|
|
|
VIR_FREE(actual);
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
if (STRNEQ(expect, actual)) {
|
|
|
|
virtTestDifference(stderr, expect, actual);
|
|
|
|
VIR_FREE(expect);
|
|
|
|
VIR_FREE(actual);
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
VIR_FREE(expect);
|
|
|
|
VIR_FREE(actual);
|
2014-04-17 20:46:18 +00:00
|
|
|
elt = elt->backingStore;
|
2013-02-13 18:04:05 +00:00
|
|
|
i++;
|
|
|
|
}
|
|
|
|
if (i != data->nfiles) {
|
|
|
|
fprintf(stderr, "probed chain was too short\n");
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = 0;
|
2014-03-25 06:53:44 +00:00
|
|
|
cleanup:
|
2014-04-04 19:35:22 +00:00
|
|
|
VIR_FREE(broken);
|
2014-04-17 14:05:16 +00:00
|
|
|
virStorageSourceFree(meta);
|
2013-02-13 18:04:05 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2014-04-10 19:56:57 +00:00
|
|
|
struct testLookupData
|
|
|
|
{
|
2014-04-17 14:05:16 +00:00
|
|
|
virStorageSourcePtr chain;
|
2014-04-18 12:35:33 +00:00
|
|
|
const char *target;
|
2014-06-13 15:23:10 +00:00
|
|
|
virStorageSourcePtr from;
|
2014-04-10 19:56:57 +00:00
|
|
|
const char *name;
|
2014-04-18 12:35:33 +00:00
|
|
|
unsigned int expIndex;
|
2014-04-10 19:56:57 +00:00
|
|
|
const char *expResult;
|
2014-04-17 14:05:16 +00:00
|
|
|
virStorageSourcePtr expMeta;
|
2014-04-10 19:56:57 +00:00
|
|
|
const char *expParent;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int
|
|
|
|
testStorageLookup(const void *args)
|
|
|
|
{
|
|
|
|
const struct testLookupData *data = args;
|
|
|
|
int ret = 0;
|
2014-04-18 13:25:19 +00:00
|
|
|
virStorageSourcePtr result;
|
2014-04-10 19:56:57 +00:00
|
|
|
const char *actualParent;
|
2014-04-18 12:35:33 +00:00
|
|
|
unsigned int idx;
|
|
|
|
|
|
|
|
if (virStorageFileParseChainIndex(data->target, data->name, &idx) < 0 &&
|
|
|
|
data->expIndex) {
|
|
|
|
fprintf(stderr, "call should not have failed\n");
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
if (idx != data->expIndex) {
|
|
|
|
fprintf(stderr, "index: expected %u, got %u\n", data->expIndex, idx);
|
|
|
|
ret = -1;
|
|
|
|
}
|
2014-04-10 19:56:57 +00:00
|
|
|
|
2014-04-18 13:25:19 +00:00
|
|
|
/* Test twice to ensure optional parameter doesn't cause NULL deref. */
|
2014-06-13 15:23:10 +00:00
|
|
|
result = virStorageFileChainLookup(data->chain, data->from,
|
2014-04-18 12:35:33 +00:00
|
|
|
idx ? NULL : data->name,
|
|
|
|
idx, NULL);
|
2014-04-10 19:56:57 +00:00
|
|
|
|
|
|
|
if (!data->expResult) {
|
|
|
|
if (!virGetLastError()) {
|
|
|
|
fprintf(stderr, "call should have failed\n");
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
virResetLastError();
|
|
|
|
} else {
|
|
|
|
if (virGetLastError()) {
|
|
|
|
fprintf(stderr, "call should not have warned\n");
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-18 13:25:19 +00:00
|
|
|
if (!result) {
|
|
|
|
if (data->expResult) {
|
|
|
|
fprintf(stderr, "result 1: expected %s, got NULL\n",
|
|
|
|
data->expResult);
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
} else if (STRNEQ_NULLABLE(data->expResult, result->path)) {
|
2014-04-10 19:56:57 +00:00
|
|
|
fprintf(stderr, "result 1: expected %s, got %s\n",
|
2014-04-18 13:25:19 +00:00
|
|
|
NULLSTR(data->expResult), NULLSTR(result->path));
|
2014-04-10 19:56:57 +00:00
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
|
2014-06-13 15:23:10 +00:00
|
|
|
result = virStorageFileChainLookup(data->chain, data->from,
|
2014-04-18 12:35:33 +00:00
|
|
|
data->name, idx, &actualParent);
|
2014-04-10 19:56:57 +00:00
|
|
|
if (!data->expResult)
|
|
|
|
virResetLastError();
|
2014-04-18 13:25:19 +00:00
|
|
|
|
|
|
|
if (!result) {
|
|
|
|
if (data->expResult) {
|
|
|
|
fprintf(stderr, "result 2: expected %s, got NULL\n",
|
|
|
|
data->expResult);
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
} else if (STRNEQ_NULLABLE(data->expResult, result->path)) {
|
2014-04-10 19:56:57 +00:00
|
|
|
fprintf(stderr, "result 2: expected %s, got %s\n",
|
2014-04-18 13:25:19 +00:00
|
|
|
NULLSTR(data->expResult), NULLSTR(result->path));
|
2014-04-10 19:56:57 +00:00
|
|
|
ret = -1;
|
|
|
|
}
|
2014-04-18 13:25:19 +00:00
|
|
|
if (data->expMeta != result) {
|
2014-04-10 19:56:57 +00:00
|
|
|
fprintf(stderr, "meta: expected %p, got %p\n",
|
2014-04-18 13:25:19 +00:00
|
|
|
data->expMeta, result);
|
2014-04-10 19:56:57 +00:00
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
if (STRNEQ_NULLABLE(data->expParent, actualParent)) {
|
|
|
|
fprintf(stderr, "parent: expected %s, got %s\n",
|
|
|
|
NULLSTR(data->expParent), NULLSTR(actualParent));
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2014-05-02 17:22:17 +00:00
|
|
|
|
|
|
|
struct testPathCanonicalizeData
|
|
|
|
{
|
|
|
|
const char *path;
|
|
|
|
const char *expect;
|
|
|
|
};
|
|
|
|
|
|
|
|
static const char *testPathCanonicalizeSymlinks[][2] =
|
|
|
|
{
|
|
|
|
{"/path/blah", "/other/path/huzah"},
|
|
|
|
{"/path/to/relative/symlink", "../../actual/file"},
|
|
|
|
{"/cycle", "/cycle"},
|
|
|
|
{"/cycle2/link", "./link"},
|
|
|
|
};
|
|
|
|
|
|
|
|
static int
|
|
|
|
testPathCanonicalizeReadlink(const char *path,
|
2014-06-24 10:53:44 +00:00
|
|
|
char **linkpath,
|
2014-05-02 17:22:17 +00:00
|
|
|
void *data ATTRIBUTE_UNUSED)
|
|
|
|
{
|
|
|
|
size_t i;
|
|
|
|
|
2014-06-24 10:53:44 +00:00
|
|
|
*linkpath = NULL;
|
2014-05-02 17:22:17 +00:00
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_CARDINALITY(testPathCanonicalizeSymlinks); i++) {
|
|
|
|
if (STREQ(path, testPathCanonicalizeSymlinks[i][0])) {
|
2014-06-24 10:53:44 +00:00
|
|
|
if (VIR_STRDUP(*linkpath, testPathCanonicalizeSymlinks[i][1]) < 0)
|
2014-05-02 17:22:17 +00:00
|
|
|
return -1;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
testPathCanonicalize(const void *args)
|
|
|
|
{
|
|
|
|
const struct testPathCanonicalizeData *data = args;
|
|
|
|
char *canon = NULL;
|
|
|
|
int ret = -1;
|
|
|
|
|
|
|
|
canon = virStorageFileCanonicalizePath(data->path,
|
|
|
|
testPathCanonicalizeReadlink,
|
|
|
|
NULL);
|
|
|
|
|
|
|
|
if (STRNEQ_NULLABLE(data->expect, canon)) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"path canonicalization of '%s' failed: expected '%s' got '%s'\n",
|
|
|
|
data->path, NULLSTR(data->expect), NULLSTR(canon));
|
|
|
|
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
|
|
|
|
cleanup:
|
|
|
|
VIR_FREE(canon);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-02-13 18:04:05 +00:00
|
|
|
static int
|
|
|
|
mymain(void)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
virCommandPtr cmd = NULL;
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
struct testChainData data;
|
2014-06-13 15:23:10 +00:00
|
|
|
struct testLookupData data2;
|
2014-05-02 17:22:17 +00:00
|
|
|
struct testPathCanonicalizeData data3;
|
2014-04-17 14:05:16 +00:00
|
|
|
virStorageSourcePtr chain = NULL;
|
2014-06-13 14:44:09 +00:00
|
|
|
virStorageSourcePtr chain2; /* short for chain->backingStore */
|
|
|
|
virStorageSourcePtr chain3; /* short for chain2->backingStore */
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Prep some files with qemu-img; if that is not found on PATH, or
|
|
|
|
* if it lacks support for qcow2 and qed, skip this test. */
|
|
|
|
if ((ret = testPrepImages()) != 0)
|
|
|
|
return ret;
|
|
|
|
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
#define TEST_ONE_CHAIN(id, start, format, flags, ...) \
|
2013-02-13 18:04:05 +00:00
|
|
|
do { \
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
size_t i; \
|
|
|
|
memset(&data, 0, sizeof(data)); \
|
|
|
|
data = (struct testChainData){ \
|
|
|
|
start, format, { __VA_ARGS__ }, 0, flags, \
|
2013-02-13 18:04:05 +00:00
|
|
|
}; \
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
for (i = 0; i < ARRAY_CARDINALITY(data.files); i++) \
|
|
|
|
if (data.files[i]) \
|
|
|
|
data.nfiles++; \
|
2013-09-20 18:13:35 +00:00
|
|
|
if (virtTestRun("Storage backing chain " id, \
|
2013-02-13 18:04:05 +00:00
|
|
|
testStorageChain, &data) < 0) \
|
|
|
|
ret = -1; \
|
|
|
|
} while (0)
|
|
|
|
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
#define VIR_FLATTEN_2(...) __VA_ARGS__
|
|
|
|
#define VIR_FLATTEN_1(_1) VIR_FLATTEN_2 _1
|
|
|
|
|
2013-02-13 18:04:05 +00:00
|
|
|
#define TEST_CHAIN(id, relstart, absstart, format, chain1, flags1, \
|
|
|
|
chain2, flags2, chain3, flags3, chain4, flags4) \
|
|
|
|
do { \
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
TEST_ONE_CHAIN(#id "a", relstart, format, flags1, \
|
|
|
|
VIR_FLATTEN_1(chain1)); \
|
|
|
|
TEST_ONE_CHAIN(#id "b", relstart, format, flags2, \
|
|
|
|
VIR_FLATTEN_1(chain2)); \
|
2014-04-05 18:00:48 +00:00
|
|
|
TEST_ONE_CHAIN(#id "c", absstart, format, flags3 | ABS_START,\
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
VIR_FLATTEN_1(chain3)); \
|
2014-04-05 18:00:48 +00:00
|
|
|
TEST_ONE_CHAIN(#id "d", absstart, format, flags4 | ABS_START,\
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
VIR_FLATTEN_1(chain4)); \
|
2013-02-13 18:04:05 +00:00
|
|
|
} while (0)
|
|
|
|
|
|
|
|
/* The actual tests, in several groups. */
|
|
|
|
|
|
|
|
/* Missing file */
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
TEST_ONE_CHAIN("0", "bogus", VIR_STORAGE_FILE_RAW, EXP_FAIL);
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Raw image, whether with right format or no specified format */
|
2014-04-05 17:34:32 +00:00
|
|
|
testFileData raw = {
|
2014-04-04 04:03:04 +00:00
|
|
|
.pathRel = "raw",
|
|
|
|
.pathAbs = canonraw,
|
2014-04-17 11:47:41 +00:00
|
|
|
.path = canonraw,
|
2014-04-09 04:28:35 +00:00
|
|
|
.relDirRel = ".",
|
|
|
|
.relDirAbs = datadir,
|
|
|
|
.type = VIR_STORAGE_TYPE_FILE,
|
|
|
|
.format = VIR_STORAGE_FILE_RAW,
|
2014-04-05 17:34:32 +00:00
|
|
|
};
|
2013-02-13 18:04:05 +00:00
|
|
|
TEST_CHAIN(1, "raw", absraw, VIR_STORAGE_FILE_RAW,
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
(&raw), EXP_PASS,
|
|
|
|
(&raw), ALLOW_PROBE | EXP_PASS,
|
|
|
|
(&raw), EXP_PASS,
|
|
|
|
(&raw), ALLOW_PROBE | EXP_PASS);
|
2013-02-13 18:04:05 +00:00
|
|
|
TEST_CHAIN(2, "raw", absraw, VIR_STORAGE_FILE_AUTO,
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
(&raw), EXP_PASS,
|
|
|
|
(&raw), ALLOW_PROBE | EXP_PASS,
|
|
|
|
(&raw), EXP_PASS,
|
|
|
|
(&raw), ALLOW_PROBE | EXP_PASS);
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Qcow2 file with relative raw backing, format provided */
|
2014-04-04 04:03:04 +00:00
|
|
|
raw.pathAbs = "raw";
|
2014-04-05 18:00:48 +00:00
|
|
|
testFileData qcow2 = {
|
2014-04-05 17:34:32 +00:00
|
|
|
.expBackingStore = canonraw,
|
|
|
|
.expBackingStoreRaw = "raw",
|
|
|
|
.expCapacity = 1024,
|
2014-04-04 04:03:04 +00:00
|
|
|
.pathRel = "qcow2",
|
|
|
|
.pathAbs = canonqcow2,
|
2014-04-17 11:47:41 +00:00
|
|
|
.path = canonqcow2,
|
2014-04-09 04:28:35 +00:00
|
|
|
.relDirRel = ".",
|
|
|
|
.relDirAbs = datadir,
|
|
|
|
.type = VIR_STORAGE_TYPE_FILE,
|
|
|
|
.format = VIR_STORAGE_FILE_QCOW2,
|
2014-04-04 04:03:04 +00:00
|
|
|
};
|
|
|
|
testFileData qcow2_as_raw = {
|
|
|
|
.pathRel = "qcow2",
|
|
|
|
.pathAbs = canonqcow2,
|
2014-04-17 11:47:41 +00:00
|
|
|
.path = canonqcow2,
|
2014-04-09 04:28:35 +00:00
|
|
|
.relDirRel = ".",
|
|
|
|
.relDirAbs = datadir,
|
|
|
|
.type = VIR_STORAGE_TYPE_FILE,
|
|
|
|
.format = VIR_STORAGE_FILE_RAW,
|
2014-04-05 17:34:32 +00:00
|
|
|
};
|
2013-02-13 18:04:05 +00:00
|
|
|
TEST_CHAIN(3, "qcow2", absqcow2, VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&qcow2, &raw), EXP_PASS,
|
|
|
|
(&qcow2, &raw), ALLOW_PROBE | EXP_PASS,
|
|
|
|
(&qcow2, &raw), EXP_PASS,
|
|
|
|
(&qcow2, &raw), ALLOW_PROBE | EXP_PASS);
|
2013-02-13 18:04:05 +00:00
|
|
|
TEST_CHAIN(4, "qcow2", absqcow2, VIR_STORAGE_FILE_AUTO,
|
2014-04-04 04:03:04 +00:00
|
|
|
(&qcow2_as_raw), EXP_PASS,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&qcow2, &raw), ALLOW_PROBE | EXP_PASS,
|
2014-04-04 04:03:04 +00:00
|
|
|
(&qcow2_as_raw), EXP_PASS,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&qcow2, &raw), ALLOW_PROBE | EXP_PASS);
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Rewrite qcow2 file to use absolute backing name */
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-F", "raw", "-b", absraw, "qcow2", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
2014-04-05 18:00:48 +00:00
|
|
|
qcow2.expBackingStoreRaw = absraw;
|
2014-04-04 04:03:04 +00:00
|
|
|
raw.pathRel = absraw;
|
|
|
|
raw.pathAbs = absraw;
|
2014-04-09 04:28:35 +00:00
|
|
|
raw.relDirRel = datadir;
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Qcow2 file with raw as absolute backing, backing format provided */
|
|
|
|
TEST_CHAIN(5, "qcow2", absqcow2, VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&qcow2, &raw), EXP_PASS,
|
|
|
|
(&qcow2, &raw), ALLOW_PROBE | EXP_PASS,
|
|
|
|
(&qcow2, &raw), EXP_PASS,
|
|
|
|
(&qcow2, &raw), ALLOW_PROBE | EXP_PASS);
|
2013-02-13 18:04:05 +00:00
|
|
|
TEST_CHAIN(6, "qcow2", absqcow2, VIR_STORAGE_FILE_AUTO,
|
2014-04-04 04:03:04 +00:00
|
|
|
(&qcow2_as_raw), EXP_PASS,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&qcow2, &raw), ALLOW_PROBE | EXP_PASS,
|
2014-04-04 04:03:04 +00:00
|
|
|
(&qcow2_as_raw), EXP_PASS,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&qcow2, &raw), ALLOW_PROBE | EXP_PASS);
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Wrapped file access */
|
2014-04-05 17:34:32 +00:00
|
|
|
testFileData wrap = {
|
|
|
|
.expBackingStore = canonqcow2,
|
|
|
|
.expBackingStoreRaw = absqcow2,
|
|
|
|
.expCapacity = 1024,
|
2014-04-04 04:03:04 +00:00
|
|
|
.pathRel = "wrap",
|
|
|
|
.pathAbs = abswrap,
|
2014-04-17 11:47:41 +00:00
|
|
|
.path = canonwrap,
|
2014-04-09 04:28:35 +00:00
|
|
|
.relDirRel = ".",
|
|
|
|
.relDirAbs = datadir,
|
|
|
|
.type = VIR_STORAGE_TYPE_FILE,
|
|
|
|
.format = VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 17:34:32 +00:00
|
|
|
};
|
2014-04-04 04:03:04 +00:00
|
|
|
qcow2.pathRel = absqcow2;
|
2014-04-09 04:28:35 +00:00
|
|
|
qcow2.relDirRel = datadir;
|
2013-02-13 18:04:05 +00:00
|
|
|
TEST_CHAIN(7, "wrap", abswrap, VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&wrap, &qcow2, &raw), EXP_PASS,
|
|
|
|
(&wrap, &qcow2, &raw), ALLOW_PROBE | EXP_PASS,
|
|
|
|
(&wrap, &qcow2, &raw), EXP_PASS,
|
|
|
|
(&wrap, &qcow2, &raw), ALLOW_PROBE | EXP_PASS);
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Rewrite qcow2 and wrap file to omit backing file type */
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-b", absraw, "qcow2", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
|
|
|
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-b", absqcow2, "wrap", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
2014-04-04 04:03:04 +00:00
|
|
|
qcow2_as_raw.pathRel = absqcow2;
|
2014-04-09 04:28:35 +00:00
|
|
|
qcow2_as_raw.relDirRel = datadir;
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Qcow2 file with raw as absolute backing, backing format omitted */
|
2014-04-05 17:34:32 +00:00
|
|
|
testFileData wrap_as_raw = {
|
|
|
|
.expBackingStore = canonqcow2,
|
|
|
|
.expBackingStoreRaw = absqcow2,
|
|
|
|
.expCapacity = 1024,
|
2014-04-04 04:03:04 +00:00
|
|
|
.pathRel = "wrap",
|
|
|
|
.pathAbs = abswrap,
|
2014-04-17 11:47:41 +00:00
|
|
|
.path = canonwrap,
|
2014-04-09 04:28:35 +00:00
|
|
|
.relDirRel = ".",
|
|
|
|
.relDirAbs = datadir,
|
|
|
|
.type = VIR_STORAGE_TYPE_FILE,
|
|
|
|
.format = VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 17:34:32 +00:00
|
|
|
};
|
2013-02-13 18:04:05 +00:00
|
|
|
TEST_CHAIN(8, "wrap", abswrap, VIR_STORAGE_FILE_QCOW2,
|
2014-04-04 04:03:04 +00:00
|
|
|
(&wrap_as_raw, &qcow2_as_raw), EXP_PASS,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&wrap, &qcow2, &raw), ALLOW_PROBE | EXP_PASS,
|
2014-04-04 04:03:04 +00:00
|
|
|
(&wrap_as_raw, &qcow2_as_raw), EXP_PASS,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&wrap, &qcow2, &raw), ALLOW_PROBE | EXP_PASS);
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Rewrite qcow2 to a missing backing file, with backing type */
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-F", "qcow2", "-b", datadir "/bogus",
|
|
|
|
"qcow2", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
2014-04-05 18:00:48 +00:00
|
|
|
qcow2.expBackingStore = NULL;
|
|
|
|
qcow2.expBackingStoreRaw = datadir "/bogus";
|
2014-04-04 04:03:04 +00:00
|
|
|
qcow2.pathRel = "qcow2";
|
2014-04-09 04:28:35 +00:00
|
|
|
qcow2.relDirRel = ".";
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Qcow2 file with missing backing file but specified type */
|
|
|
|
TEST_CHAIN(9, "qcow2", absqcow2, VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&qcow2), EXP_WARN,
|
|
|
|
(&qcow2), ALLOW_PROBE | EXP_WARN,
|
|
|
|
(&qcow2), EXP_WARN,
|
|
|
|
(&qcow2), ALLOW_PROBE | EXP_WARN);
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Rewrite qcow2 to a missing backing file, without backing type */
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-b", datadir "/bogus", "qcow2", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
|
|
|
|
|
|
|
/* Qcow2 file with missing backing file and no specified type */
|
|
|
|
TEST_CHAIN(10, "qcow2", absqcow2, VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&qcow2), EXP_WARN,
|
|
|
|
(&qcow2), ALLOW_PROBE | EXP_WARN,
|
|
|
|
(&qcow2), EXP_WARN,
|
|
|
|
(&qcow2), ALLOW_PROBE | EXP_WARN);
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Rewrite qcow2 to use an nbd: protocol as backend */
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
2014-05-05 16:05:03 +00:00
|
|
|
"-F", "raw", "-b", "nbd:example.org:6000:exportname=blah",
|
2013-02-13 18:04:05 +00:00
|
|
|
"qcow2", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
2014-05-05 16:05:03 +00:00
|
|
|
qcow2.expBackingStore = "blah";
|
|
|
|
qcow2.expBackingStoreRaw = "nbd:example.org:6000:exportname=blah";
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* Qcow2 file with backing protocol instead of file */
|
2014-04-09 21:36:30 +00:00
|
|
|
testFileData nbd = {
|
2014-05-05 16:05:03 +00:00
|
|
|
.pathRel = "nbd:example.org:6000:exportname=blah",
|
|
|
|
.pathAbs = "nbd:example.org:6000:exportname=blah",
|
|
|
|
.path = "blah",
|
2014-04-09 21:36:30 +00:00
|
|
|
.type = VIR_STORAGE_TYPE_NETWORK,
|
|
|
|
.format = VIR_STORAGE_FILE_RAW,
|
2014-05-05 16:05:03 +00:00
|
|
|
.relDirRel = ".",
|
|
|
|
.relDirAbs = ".",
|
2014-04-09 21:36:30 +00:00
|
|
|
};
|
2013-02-13 18:04:05 +00:00
|
|
|
TEST_CHAIN(11, "qcow2", absqcow2, VIR_STORAGE_FILE_QCOW2,
|
2014-04-09 21:36:30 +00:00
|
|
|
(&qcow2, &nbd), EXP_PASS,
|
|
|
|
(&qcow2, &nbd), ALLOW_PROBE | EXP_PASS,
|
|
|
|
(&qcow2, &nbd), EXP_PASS,
|
|
|
|
(&qcow2, &nbd), ALLOW_PROBE | EXP_PASS);
|
2013-02-13 18:04:05 +00:00
|
|
|
|
|
|
|
/* qed file */
|
2014-04-05 17:34:32 +00:00
|
|
|
testFileData qed = {
|
|
|
|
.expBackingStore = canonraw,
|
|
|
|
.expBackingStoreRaw = absraw,
|
|
|
|
.expCapacity = 1024,
|
2014-04-04 04:03:04 +00:00
|
|
|
.pathRel = "qed",
|
|
|
|
.pathAbs = absqed,
|
2014-04-17 11:47:41 +00:00
|
|
|
.path = canonqed,
|
2014-04-09 04:28:35 +00:00
|
|
|
.relDirRel = ".",
|
|
|
|
.relDirAbs = datadir,
|
|
|
|
.type = VIR_STORAGE_TYPE_FILE,
|
|
|
|
.format = VIR_STORAGE_FILE_QED,
|
2014-04-04 04:03:04 +00:00
|
|
|
};
|
|
|
|
testFileData qed_as_raw = {
|
|
|
|
.pathRel = "qed",
|
|
|
|
.pathAbs = absqed,
|
2014-04-17 11:47:41 +00:00
|
|
|
.path = canonqed,
|
2014-04-09 04:28:35 +00:00
|
|
|
.relDirRel = ".",
|
|
|
|
.relDirAbs = datadir,
|
|
|
|
.type = VIR_STORAGE_TYPE_FILE,
|
|
|
|
.format = VIR_STORAGE_FILE_RAW,
|
2014-04-05 17:34:32 +00:00
|
|
|
};
|
2013-02-13 18:04:05 +00:00
|
|
|
TEST_CHAIN(12, "qed", absqed, VIR_STORAGE_FILE_AUTO,
|
2014-04-04 04:03:04 +00:00
|
|
|
(&qed_as_raw), EXP_PASS,
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
(&qed, &raw), ALLOW_PROBE | EXP_PASS,
|
2014-04-04 04:03:04 +00:00
|
|
|
(&qed_as_raw), EXP_PASS,
|
tests: refactor virstoragetest for less stack space
I'm about to add fields to virStorageFileMetadata, which means
also adding fields to the testFileData struct in virstoragetest.
Alas, adding even one pointer on an x86_64 machine gave me a
dreaded compiler error:
virstoragetest.c:712:1: error: the frame size of 4208 bytes is larger than 4096 bytes [-Werror=frame-larger-than=]
After some experimentation, I realized that each test was creating
yet another testChainData (which contains testFileData) on the stack;
forcing the reuse of one of these structures instead of creating a
fresh one each time drastically reduces the size requirements. While
at it, I also got rid of a lot of intermediate structs, with some
macro magic that lets me directly build up the destination chains
inline.
For a bit more insight into what this patch does:
The old code uses an intermediate variable as a fixed-size array
of structs:
testFileData chain[] = { a, b };
data.files = chain;
In the new code, the use of VIR_FLATTEN_* allows the TEST_CHAIN()
macro to still take a single argument for each chain, but now of
the form '(a, b)', where it is turned into the var-args 'a, b'
multiple arguments understood by TEST_ONE_CHAIN(). Thus, the
new code avoids an intermediate variable, and directly provides
the list of pointers to be assigned into array elements:
data.files = { &a, &b };
* tests/virstoragetest.c (mymain): Rewrite TEST_ONE_CHAIN to
reuse the same struct for each test, and to take the data
inline rather than via intermediate variables.
(testChainData): Use bounded array of pointers instead of
unlimited array of struct.
(testStorageChain): Reflect struct change.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-04-04 02:26:59 +00:00
|
|
|
(&qed, &raw), ALLOW_PROBE | EXP_PASS);
|
2013-02-13 18:04:05 +00:00
|
|
|
|
2014-04-04 19:35:22 +00:00
|
|
|
/* directory */
|
2014-04-05 17:34:32 +00:00
|
|
|
testFileData dir = {
|
2014-04-04 04:03:04 +00:00
|
|
|
.pathRel = "dir",
|
|
|
|
.pathAbs = absdir,
|
2014-04-18 08:07:41 +00:00
|
|
|
.path = canondir,
|
|
|
|
.relDirRel = ".",
|
|
|
|
.relDirAbs = datadir,
|
2014-04-09 04:28:35 +00:00
|
|
|
.type = VIR_STORAGE_TYPE_DIR,
|
|
|
|
.format = VIR_STORAGE_FILE_DIR,
|
2014-04-05 17:34:32 +00:00
|
|
|
};
|
2014-04-04 19:35:22 +00:00
|
|
|
TEST_CHAIN(13, "dir", absdir, VIR_STORAGE_FILE_AUTO,
|
|
|
|
(&dir), EXP_PASS,
|
|
|
|
(&dir), ALLOW_PROBE | EXP_PASS,
|
|
|
|
(&dir), EXP_PASS,
|
|
|
|
(&dir), ALLOW_PROBE | EXP_PASS);
|
|
|
|
TEST_CHAIN(14, "dir", absdir, VIR_STORAGE_FILE_DIR,
|
|
|
|
(&dir), EXP_PASS,
|
|
|
|
(&dir), ALLOW_PROBE | EXP_PASS,
|
|
|
|
(&dir), EXP_PASS,
|
|
|
|
(&dir), ALLOW_PROBE | EXP_PASS);
|
|
|
|
|
2013-04-15 16:00:17 +00:00
|
|
|
#ifdef HAVE_SYMLINK
|
2013-02-13 18:04:05 +00:00
|
|
|
/* Rewrite qcow2 and wrap file to use backing names relative to a
|
|
|
|
* symlink from a different directory */
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-F", "raw", "-b", "../raw", "qcow2", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
|
|
|
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-F", "qcow2", "-b", "../sub/link1", "wrap",
|
|
|
|
NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
|
|
|
|
|
|
|
/* Behavior of symlinks to qcow2 with relative backing files */
|
2014-04-05 18:00:48 +00:00
|
|
|
testFileData link1 = {
|
2014-04-05 17:34:32 +00:00
|
|
|
.expBackingStore = canonraw,
|
|
|
|
.expBackingStoreRaw = "../raw",
|
|
|
|
.expCapacity = 1024,
|
2014-04-04 04:03:04 +00:00
|
|
|
.pathRel = "../sub/link1",
|
|
|
|
.pathAbs = "../sub/link1",
|
2014-04-17 11:47:41 +00:00
|
|
|
.path = canonqcow2,
|
2014-04-09 04:28:35 +00:00
|
|
|
.relDirRel = "sub/../sub",
|
|
|
|
.relDirAbs = datadir "/sub/../sub",
|
|
|
|
.type = VIR_STORAGE_TYPE_FILE,
|
|
|
|
.format = VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 17:34:32 +00:00
|
|
|
};
|
2014-04-05 18:00:48 +00:00
|
|
|
testFileData link2 = {
|
2014-04-05 17:34:32 +00:00
|
|
|
.expBackingStore = canonqcow2,
|
|
|
|
.expBackingStoreRaw = "../sub/link1",
|
|
|
|
.expCapacity = 1024,
|
2014-04-04 04:03:04 +00:00
|
|
|
.pathRel = "sub/link2",
|
|
|
|
.pathAbs = abslink2,
|
2014-04-17 11:47:41 +00:00
|
|
|
.path = canonwrap,
|
2014-04-09 04:28:35 +00:00
|
|
|
.relDirRel = "sub",
|
|
|
|
.relDirAbs = datadir "/sub",
|
|
|
|
.type = VIR_STORAGE_TYPE_FILE,
|
|
|
|
.format = VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 17:34:32 +00:00
|
|
|
};
|
2014-04-04 04:03:04 +00:00
|
|
|
raw.pathRel = "../raw";
|
|
|
|
raw.pathAbs = "../raw";
|
2014-04-09 04:28:35 +00:00
|
|
|
raw.relDirRel = "sub/../sub/..";
|
|
|
|
raw.relDirAbs = datadir "/sub/../sub/..";
|
2014-04-04 19:35:22 +00:00
|
|
|
TEST_CHAIN(15, "sub/link2", abslink2, VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&link2, &link1, &raw), EXP_PASS,
|
|
|
|
(&link2, &link1, &raw), ALLOW_PROBE | EXP_PASS,
|
|
|
|
(&link2, &link1, &raw), EXP_PASS,
|
|
|
|
(&link2, &link1, &raw), ALLOW_PROBE | EXP_PASS);
|
2013-04-15 16:00:17 +00:00
|
|
|
#endif
|
2014-04-04 19:35:22 +00:00
|
|
|
|
|
|
|
/* Rewrite qcow2 to be a self-referential loop */
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-F", "qcow2", "-b", "qcow2", "qcow2", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
2014-04-05 18:00:48 +00:00
|
|
|
qcow2.expBackingStore = NULL;
|
|
|
|
qcow2.expBackingStoreRaw = "qcow2";
|
2014-04-04 19:35:22 +00:00
|
|
|
|
|
|
|
/* Behavior of an infinite loop chain */
|
|
|
|
TEST_CHAIN(16, "qcow2", absqcow2, VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&qcow2), EXP_WARN,
|
|
|
|
(&qcow2), ALLOW_PROBE | EXP_WARN,
|
|
|
|
(&qcow2), EXP_WARN,
|
|
|
|
(&qcow2), ALLOW_PROBE | EXP_WARN);
|
2014-04-04 19:35:22 +00:00
|
|
|
|
|
|
|
/* Rewrite wrap and qcow2 to be mutually-referential loop */
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-F", "qcow2", "-b", "wrap", "qcow2", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
|
|
|
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-F", "qcow2", "-b", absqcow2, "wrap", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
2014-04-05 18:00:48 +00:00
|
|
|
qcow2.expBackingStoreRaw = "wrap";
|
2014-04-04 04:03:04 +00:00
|
|
|
qcow2.pathRel = absqcow2;
|
2014-04-09 04:28:35 +00:00
|
|
|
qcow2.relDirRel = datadir;
|
2014-04-04 19:35:22 +00:00
|
|
|
|
|
|
|
/* Behavior of an infinite loop chain */
|
|
|
|
TEST_CHAIN(17, "wrap", abswrap, VIR_STORAGE_FILE_QCOW2,
|
2014-04-05 18:00:48 +00:00
|
|
|
(&wrap, &qcow2), EXP_WARN,
|
|
|
|
(&wrap, &qcow2), ALLOW_PROBE | EXP_WARN,
|
|
|
|
(&wrap, &qcow2), EXP_WARN,
|
|
|
|
(&wrap, &qcow2), ALLOW_PROBE | EXP_WARN);
|
2014-04-04 19:35:22 +00:00
|
|
|
|
2014-04-10 19:56:57 +00:00
|
|
|
/* Rewrite wrap and qcow2 back to 3-deep chain, absolute backing */
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-F", "qcow2", "-b", absraw, "qcow2", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
|
|
|
|
2014-04-12 04:08:07 +00:00
|
|
|
/* Test behavior of chain lookups, absolute backing from relative start */
|
2014-04-18 12:49:54 +00:00
|
|
|
chain = testStorageFileGetMetadata("wrap", VIR_STORAGE_FILE_QCOW2,
|
|
|
|
-1, -1, false);
|
2014-04-10 19:56:57 +00:00
|
|
|
if (!chain) {
|
|
|
|
ret = -1;
|
|
|
|
goto cleanup;
|
|
|
|
}
|
2014-06-13 14:44:09 +00:00
|
|
|
chain2 = chain->backingStore;
|
|
|
|
chain3 = chain2->backingStore;
|
2014-04-10 19:56:57 +00:00
|
|
|
|
2014-06-13 15:23:10 +00:00
|
|
|
#define TEST_LOOKUP_TARGET(id, target, from, name, index, result, \
|
2014-06-13 16:01:14 +00:00
|
|
|
meta, parent) \
|
2014-06-13 15:23:10 +00:00
|
|
|
do { \
|
|
|
|
data2 = (struct testLookupData){ \
|
|
|
|
chain, target, from, name, index, \
|
|
|
|
result, meta, parent, }; \
|
|
|
|
if (virtTestRun("Chain lookup " #id, \
|
|
|
|
testStorageLookup, &data2) < 0) \
|
|
|
|
ret = -1; \
|
2014-04-10 19:56:57 +00:00
|
|
|
} while (0)
|
2014-06-13 16:01:14 +00:00
|
|
|
#define TEST_LOOKUP(id, from, name, result, meta, parent) \
|
|
|
|
TEST_LOOKUP_TARGET(id, NULL, from, name, 0, result, meta, parent)
|
|
|
|
|
|
|
|
TEST_LOOKUP(0, NULL, "bogus", NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(1, chain, "bogus", NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(2, NULL, "wrap", chain->path, chain, NULL);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(3, chain, "wrap", NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(4, chain2, "wrap", NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(5, NULL, abswrap, chain->path, chain, NULL);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(6, chain, abswrap, NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(7, chain2, abswrap, NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(8, NULL, "qcow2", chain2->path, chain2, chain->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(9, chain, "qcow2", chain2->path, chain2, chain->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(10, chain2, "qcow2", NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(11, chain3, "qcow2", NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(12, NULL, absqcow2, chain2->path, chain2, chain->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(13, chain, absqcow2, chain2->path, chain2, chain->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(14, chain2, absqcow2, NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(15, chain3, absqcow2, NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(16, NULL, "raw", chain3->path, chain3, chain2->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(17, chain, "raw", chain3->path, chain3, chain2->path);
|
|
|
|
TEST_LOOKUP(18, chain2, "raw", chain3->path, chain3, chain2->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(19, chain3, "raw", NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(20, NULL, absraw, chain3->path, chain3, chain2->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(21, chain, absraw, chain3->path, chain3, chain2->path);
|
|
|
|
TEST_LOOKUP(22, chain2, absraw, chain3->path, chain3, chain2->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(23, chain3, absraw, NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(24, NULL, NULL, chain3->path, chain3, chain2->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(25, chain, NULL, chain3->path, chain3, chain2->path);
|
|
|
|
TEST_LOOKUP(26, chain2, NULL, chain3->path, chain3, chain2->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(27, chain3, NULL, NULL, NULL, NULL);
|
2014-04-10 19:56:57 +00:00
|
|
|
|
|
|
|
/* Rewrite wrap and qcow2 back to 3-deep chain, relative backing */
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-F", "raw", "-b", "raw", "qcow2", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
|
|
|
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-F", "qcow2", "-b", "qcow2", "wrap", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
|
|
|
|
2014-04-12 04:08:07 +00:00
|
|
|
/* Test behavior of chain lookups, relative backing from absolute start */
|
2014-04-17 14:05:16 +00:00
|
|
|
virStorageSourceFree(chain);
|
2014-04-18 12:49:54 +00:00
|
|
|
chain = testStorageFileGetMetadata(abswrap, VIR_STORAGE_FILE_QCOW2,
|
|
|
|
-1, -1, false);
|
2014-04-10 19:56:57 +00:00
|
|
|
if (!chain) {
|
|
|
|
ret = -1;
|
|
|
|
goto cleanup;
|
|
|
|
}
|
2014-06-13 14:44:09 +00:00
|
|
|
chain2 = chain->backingStore;
|
|
|
|
chain3 = chain2->backingStore;
|
2014-04-10 19:56:57 +00:00
|
|
|
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(28, NULL, "bogus", NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(29, chain, "bogus", NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(30, NULL, "wrap", chain->path, chain, NULL);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(31, chain, "wrap", NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(32, chain2, "wrap", NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(33, NULL, abswrap, chain->path, chain, NULL);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(34, chain, abswrap, NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(35, chain2, abswrap, NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(36, NULL, "qcow2", chain2->path, chain2, chain->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(37, chain, "qcow2", chain2->path, chain2, chain->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(38, chain2, "qcow2", NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(39, chain3, "qcow2", NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(40, NULL, absqcow2, chain2->path, chain2, chain->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(41, chain, absqcow2, chain2->path, chain2, chain->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(42, chain2, absqcow2, NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(43, chain3, absqcow2, NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(44, NULL, "raw", chain3->path, chain3, chain2->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(45, chain, "raw", chain3->path, chain3, chain2->path);
|
|
|
|
TEST_LOOKUP(46, chain2, "raw", chain3->path, chain3, chain2->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(47, chain3, "raw", NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(48, NULL, absraw, chain3->path, chain3, chain2->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(49, chain, absraw, chain3->path, chain3, chain2->path);
|
|
|
|
TEST_LOOKUP(50, chain2, absraw, chain3->path, chain3, chain2->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(51, chain3, absraw, NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(52, NULL, NULL, chain3->path, chain3, chain2->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP(53, chain, NULL, chain3->path, chain3, chain2->path);
|
|
|
|
TEST_LOOKUP(54, chain2, NULL, chain3->path, chain3, chain2->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP(55, chain3, NULL, NULL, NULL, NULL);
|
2014-04-10 19:56:57 +00:00
|
|
|
|
|
|
|
/* Use link to wrap with cross-directory relative backing */
|
|
|
|
virCommandFree(cmd);
|
|
|
|
cmd = virCommandNewArgList(qemuimg, "rebase", "-u", "-f", "qcow2",
|
|
|
|
"-F", "qcow2", "-b", "../qcow2", "wrap", NULL);
|
|
|
|
if (virCommandRun(cmd, NULL) < 0)
|
|
|
|
ret = -1;
|
|
|
|
|
|
|
|
/* Test behavior of chain lookups, relative backing */
|
2014-04-17 14:05:16 +00:00
|
|
|
virStorageSourceFree(chain);
|
2014-04-18 12:49:54 +00:00
|
|
|
chain = testStorageFileGetMetadata("sub/link2", VIR_STORAGE_FILE_QCOW2,
|
|
|
|
-1, -1, false);
|
2014-04-10 19:56:57 +00:00
|
|
|
if (!chain) {
|
|
|
|
ret = -1;
|
|
|
|
goto cleanup;
|
|
|
|
}
|
2014-06-13 14:44:09 +00:00
|
|
|
chain2 = chain->backingStore;
|
|
|
|
chain3 = chain2->backingStore;
|
2014-04-10 19:56:57 +00:00
|
|
|
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP(56, NULL, "bogus", NULL, NULL, NULL);
|
|
|
|
TEST_LOOKUP(57, NULL, "sub/link2", chain->path, chain, NULL);
|
|
|
|
TEST_LOOKUP(58, NULL, "wrap", chain->path, chain, NULL);
|
|
|
|
TEST_LOOKUP(59, NULL, abswrap, chain->path, chain, NULL);
|
|
|
|
TEST_LOOKUP(60, NULL, "../qcow2", chain2->path, chain2, chain->path);
|
|
|
|
TEST_LOOKUP(61, NULL, "qcow2", NULL, NULL, NULL);
|
|
|
|
TEST_LOOKUP(62, NULL, absqcow2, chain2->path, chain2, chain->path);
|
|
|
|
TEST_LOOKUP(63, NULL, "raw", chain3->path, chain3, chain2->path);
|
|
|
|
TEST_LOOKUP(64, NULL, absraw, chain3->path, chain3, chain2->path);
|
|
|
|
TEST_LOOKUP(65, NULL, NULL, chain3->path, chain3, chain2->path);
|
|
|
|
|
|
|
|
TEST_LOOKUP_TARGET(66, "vda", NULL, "bogus[1]", 0, NULL, NULL, NULL);
|
|
|
|
TEST_LOOKUP_TARGET(67, "vda", NULL, "vda[-1]", 0, NULL, NULL, NULL);
|
|
|
|
TEST_LOOKUP_TARGET(68, "vda", NULL, "vda[1][1]", 0, NULL, NULL, NULL);
|
|
|
|
TEST_LOOKUP_TARGET(69, "vda", NULL, "wrap", 0, chain->path, chain, NULL);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP_TARGET(70, "vda", chain, "wrap", 0, NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP_TARGET(71, "vda", chain2, "wrap", 0, NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP_TARGET(72, "vda", NULL, "vda[0]", 0, NULL, NULL, NULL);
|
|
|
|
TEST_LOOKUP_TARGET(73, "vda", NULL, "vda[1]", 1, chain2->path, chain2,
|
2014-04-18 12:35:33 +00:00
|
|
|
chain->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP_TARGET(74, "vda", chain, "vda[1]", 1, chain2->path, chain2,
|
|
|
|
chain->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP_TARGET(75, "vda", chain2, "vda[1]", 1, NULL, NULL, NULL);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP_TARGET(76, "vda", chain3, "vda[1]", 1, NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP_TARGET(77, "vda", NULL, "vda[2]", 2, chain3->path, chain3,
|
2014-06-13 14:44:09 +00:00
|
|
|
chain2->path);
|
2014-06-13 15:23:10 +00:00
|
|
|
TEST_LOOKUP_TARGET(78, "vda", chain, "vda[2]", 2, chain3->path, chain3,
|
|
|
|
chain2->path);
|
|
|
|
TEST_LOOKUP_TARGET(79, "vda", chain2, "vda[2]", 2, chain3->path, chain3,
|
|
|
|
chain2->path);
|
blockcommit: require base below top
The block commit code looks for an explicit base file relative
to the discovered top file; so for a chain of:
base <- snap1 <- snap2 <- snap3
and a command of:
virsh blockcommit $dom vda --base snap2 --top snap1
we got a sane message (here from libvirt 1.0.5):
error: invalid argument: could not find base 'snap2' below 'snap1' in chain for 'vda'
Meanwhile, recent refactoring has slightly reduced the quality of the
libvirt error messages, by losing the phrase 'below xyz':
error: invalid argument: could not find image 'snap2' in chain for 'snap3'
But we had a one-off, where we were not excluding the top file
itself in searching for the base; thankfully qemu still reports
the error, but the quality is worse:
virsh blockcommit $dom vda --base snap2 --top snap2
error: internal error unable to execute QEMU command 'block-commit': Base '/snap2' not found
Fix the one-off in blockcommit by changing the semantics of name
lookup - if a starting point is specified, then the result must
be below that point, rather than including that point. The only
other call to chain lookup was blockpull code, which was already
forcing the lookup to omit the active layer and only needs a
tweak to use the new semantics.
This also fixes the bug exposed in the testsuite, where when doing
a lookup pinned to an intermediate point in the chain, we were
unable to return the name of the parent also in the chain.
* src/util/virstoragefile.c (virStorageFileChainLookup): Change
semantics for non-NULL startFrom.
* src/qemu/qemu_driver.c (qemuDomainBlockJobImpl): Adjust caller,
to keep existing semantics.
* tests/virstoragetest.c (mymain): Adjust to expose new semantics.
Signed-off-by: Eric Blake <eblake@redhat.com>
2014-06-11 22:22:57 +00:00
|
|
|
TEST_LOOKUP_TARGET(80, "vda", chain3, "vda[2]", 2, NULL, NULL, NULL);
|
2014-06-13 16:01:14 +00:00
|
|
|
TEST_LOOKUP_TARGET(81, "vda", NULL, "vda[3]", 3, NULL, NULL, NULL);
|
2014-04-18 12:35:33 +00:00
|
|
|
|
2014-05-02 17:22:17 +00:00
|
|
|
#define TEST_PATH_CANONICALIZE(id, PATH, EXPECT) \
|
|
|
|
do { \
|
|
|
|
data3.path = PATH; \
|
|
|
|
data3.expect = EXPECT; \
|
|
|
|
if (virtTestRun("Path canonicalize " #id, \
|
|
|
|
testPathCanonicalize, &data3) < 0) \
|
|
|
|
ret = -1; \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
TEST_PATH_CANONICALIZE(1, "/", "/");
|
|
|
|
TEST_PATH_CANONICALIZE(2, "/path", "/path");
|
|
|
|
TEST_PATH_CANONICALIZE(3, "/path/to/blah", "/path/to/blah");
|
|
|
|
TEST_PATH_CANONICALIZE(4, "/path/", "/path");
|
|
|
|
TEST_PATH_CANONICALIZE(5, "///////", "/");
|
|
|
|
TEST_PATH_CANONICALIZE(6, "//", "//");
|
|
|
|
TEST_PATH_CANONICALIZE(7, "", "");
|
|
|
|
TEST_PATH_CANONICALIZE(8, ".", ".");
|
|
|
|
TEST_PATH_CANONICALIZE(9, "../", "..");
|
|
|
|
TEST_PATH_CANONICALIZE(10, "../../", "../..");
|
|
|
|
TEST_PATH_CANONICALIZE(11, "../../blah", "../../blah");
|
|
|
|
TEST_PATH_CANONICALIZE(12, "/./././blah", "/blah");
|
|
|
|
TEST_PATH_CANONICALIZE(13, ".././../././../blah", "../../../blah");
|
|
|
|
TEST_PATH_CANONICALIZE(14, "/././", "/");
|
|
|
|
TEST_PATH_CANONICALIZE(15, "./././", ".");
|
|
|
|
TEST_PATH_CANONICALIZE(16, "blah/../foo", "foo");
|
|
|
|
TEST_PATH_CANONICALIZE(17, "foo/bar/../blah", "foo/blah");
|
|
|
|
TEST_PATH_CANONICALIZE(18, "foo/bar/.././blah", "foo/blah");
|
|
|
|
TEST_PATH_CANONICALIZE(19, "/path/to/foo/bar/../../../../../../../../baz", "/baz");
|
|
|
|
TEST_PATH_CANONICALIZE(20, "path/to/foo/bar/../../../../../../../../baz", "../../../../baz");
|
|
|
|
TEST_PATH_CANONICALIZE(21, "path/to/foo/bar", "path/to/foo/bar");
|
|
|
|
TEST_PATH_CANONICALIZE(22, "//foo//bar", "//foo/bar");
|
|
|
|
TEST_PATH_CANONICALIZE(23, "/bar//foo", "/bar/foo");
|
|
|
|
TEST_PATH_CANONICALIZE(24, "//../blah", "//blah");
|
|
|
|
|
|
|
|
/* test paths with symlinks */
|
|
|
|
TEST_PATH_CANONICALIZE(25, "/path/blah", "/other/path/huzah");
|
|
|
|
TEST_PATH_CANONICALIZE(26, "/path/to/relative/symlink", "/path/actual/file");
|
|
|
|
TEST_PATH_CANONICALIZE(27, "/path/to/relative/symlink/blah", "/path/actual/file/blah");
|
|
|
|
TEST_PATH_CANONICALIZE(28, "/path/blah/yippee", "/other/path/huzah/yippee");
|
|
|
|
TEST_PATH_CANONICALIZE(29, "/cycle", NULL);
|
|
|
|
TEST_PATH_CANONICALIZE(30, "/cycle2/link", NULL);
|
|
|
|
TEST_PATH_CANONICALIZE(31, "///", "/");
|
|
|
|
|
2014-04-10 19:56:57 +00:00
|
|
|
cleanup:
|
2013-02-13 18:04:05 +00:00
|
|
|
/* Final cleanup */
|
2014-04-17 14:05:16 +00:00
|
|
|
virStorageSourceFree(chain);
|
2013-02-13 18:04:05 +00:00
|
|
|
testCleanupImages();
|
|
|
|
virCommandFree(cmd);
|
|
|
|
|
|
|
|
return ret == 0 ? EXIT_SUCCESS : EXIT_FAILURE;
|
|
|
|
}
|
|
|
|
|
|
|
|
VIRT_TEST_MAIN(mymain)
|