2:05 p.m.
This series converts the storage volume forward linked list into
an object that contains hash tables of volume objects.
The first two patches resolve issues seen during testing with
the Disk backend which had some special cased code to handle
the Create/Delete paths and interactions with the partition logic.
The first patch was much more quickly seen with object free logic
in place.
The second two patches make the conversion to objects and hash
tables in "smaller chunks", but they could easily be combined.
John Ferlan (4):
storage: When delete volume avoid disk backend removal
storage: Modify virStorageBackendDiskMakeDataVol logic
storage: Introduce _virStorageVolObj[List]
storage: Complete implementation volume by hash object
src/conf/virstorageobj.c | 540 ++++++++++++++++++++++++++++++-------
src/storage/storage_backend_disk.c | 40 +--
src/storage/storage_driver.c | 14 +-
3 files changed, 471 insertions(+), 123 deletions(-)
--
2.13.6
2:05 p.m.
New subject: [libvirt] [PATCH 1/4] storage: When delete volume avoid disk backend removal
For a disk backend, the deleteVol code will clear all the
volumes in the pool and perform a pool refresh, thus the
storageVolDeleteInternal should not use access @voldef
after deleteVol succeeds.
Signed-off-by: John Ferlan <jferlan(a)redhat.com>
---
src/storage/storage_driver.c | 14 ++++++++++----
1 file changed, 10 insertions(+), 4 deletions(-)
diff --git a/src/storage/storage_driver.c b/src/storage/storage_driver.c
index f590f6b9b..3b66d5171 100644
--- a/src/storage/storage_driver.c
+++ b/src/storage/storage_driver.c
@@ -1670,15 +1670,21 @@ storageVolDeleteInternal(virStorageVolPtr vol,
if (backend->deleteVol(vol->conn, obj, voldef, flags) < 0)
goto cleanup;
+ /* The disk backend updated the pool data including removing the
+ * voldef from the pool (for both the deleteVol and the createVol
+ * failure path. */
+ if (def->type == VIR_STORAGE_POOL_DISK) {
+ ret = 0;
+ goto cleanup;
+ }
+
/* Update pool metadata - don't update meta data from error paths
* in this module since the allocation/available weren't adjusted yet.
* Ignore the disk backend since it updates the pool values.
*/
if (updateMeta) {
- if (def->type != VIR_STORAGE_POOL_DISK) {
- def->allocation -= voldef->target.allocation;
- def->available += voldef->target.allocation;
- }
+ def->allocation -= voldef->target.allocation;
+ def->available += voldef->target.allocation;
}
virStoragePoolObjRemoveVol(obj, voldef);
--
2.13.6
2:05 p.m.
New subject: [libvirt] [PATCH 2/4] storage: Modify virStorageBackendDiskMakeDataVol logic
Alter the logic such that we only add the volume to the pool once
we've filled in all the information and cause failure to go to a
common error: label. Patches to place the @vol into a few hash tables
will soon "require" that at least the keys (name, target.path, and key)
be populated with valid data.
Signed-off-by: John Ferlan <jferlan(a)redhat.com>
---
src/storage/storage_backend_disk.c | 40 ++++++++++++++++++++++++--------------
1 file changed, 25 insertions(+), 15 deletions(-)
diff --git a/src/storage/storage_backend_disk.c b/src/storage/storage_backend_disk.c
index 44c135d80..f862a896b 100644
--- a/src/storage/storage_backend_disk.c
+++ b/src/storage/storage_backend_disk.c
@@ -61,6 +61,7 @@ virStorageBackendDiskMakeDataVol(virStoragePoolObjPtr pool,
{
virStoragePoolDefPtr def = virStoragePoolObjGetDef(pool);
char *tmp, *devpath, *partname;
+ bool addVol = false;
/* Prepended path will be same for all partitions, so we can
* strip the path to form a reasonable pool-unique name
@@ -74,18 +75,16 @@ virStorageBackendDiskMakeDataVol(virStoragePoolObjPtr pool,
/* This is typically a reload/restart/refresh path where
* we're discovering the existing partitions for the pool
*/
+ addVol = true;
if (VIR_ALLOC(vol) < 0)
return -1;
- if (VIR_STRDUP(vol->name, partname) < 0 ||
- virStoragePoolObjAddVol(pool, vol) < 0) {
- virStorageVolDefFree(vol);
- return -1;
- }
+ if (VIR_STRDUP(vol->name, partname) < 0)
+ goto error;
}
if (vol->target.path == NULL) {
if (VIR_STRDUP(devpath, groups[0]) < 0)
- return -1;
+ goto error;
/* Now figure out the stable path
*
@@ -96,7 +95,7 @@ virStorageBackendDiskMakeDataVol(virStoragePoolObjPtr pool,
vol->target.path = virStorageBackendStablePath(pool, devpath, true);
VIR_FREE(devpath);
if (vol->target.path == NULL)
- return -1;
+ goto error;
}
/* Enforce provided vol->name is the same as what parted created.
@@ -129,37 +128,37 @@ virStorageBackendDiskMakeDataVol(virStoragePoolObjPtr pool,
(tmp = strrchr(vol->target.path, 'p')))
memmove(tmp, tmp + 1, strlen(tmp));
}
- return -1;
+ goto error;
}
if (vol->key == NULL) {
/* XXX base off a unique key of the underlying disk */
if (VIR_STRDUP(vol->key, vol->target.path) < 0)
- return -1;
+ goto error;
}
if (vol->source.extents == NULL) {
if (VIR_ALLOC(vol->source.extents) < 0)
- return -1;
+ goto error;
vol->source.nextent = 1;
if (virStrToLong_ull(groups[3], NULL, 10,
&vol->source.extents[0].start) < 0) {
virReportError(VIR_ERR_INTERNAL_ERROR,
"%s", _("cannot parse device start
location"));
- return -1;
+ goto error;
}
if (virStrToLong_ull(groups[4], NULL, 10,
&vol->source.extents[0].end) < 0) {
virReportError(VIR_ERR_INTERNAL_ERROR,
"%s", _("cannot parse device end
location"));
- return -1;
+ goto error;
}
if (VIR_STRDUP(vol->source.extents[0].path,
def->source.devices[0].path) < 0)
- return -1;
+ goto error;
}
/* set partition type */
@@ -190,16 +189,22 @@ virStorageBackendDiskMakeDataVol(virStoragePoolObjPtr pool,
VIR_STORAGE_VOL_OPEN_DEFAULT |
VIR_STORAGE_VOL_OPEN_NOERROR,
0) == -1)
- return -1;
+ goto error;
vol->target.allocation = 0;
vol->target.capacity =
(vol->source.extents[0].end - vol->source.extents[0].start);
} else {
if (virStorageBackendUpdateVolInfo(vol, false,
VIR_STORAGE_VOL_OPEN_DEFAULT, 0) < 0)
- return -1;
+ goto error;
}
+ /* Now that we've updated @vol enough, let's add it to the pool
+ * if it's not already there so that the subsequent pool search
+ * pool def adjustments will work properly */
+ if (addVol && virStoragePoolObjAddVol(pool, vol) < 0)
+ goto error;
+
/* Find the extended partition and increase the allocation value */
if (vol->source.partType == VIR_STORAGE_VOL_DISK_TYPE_LOGICAL) {
virStorageVolDefPtr voldef;
@@ -217,6 +222,11 @@ virStorageBackendDiskMakeDataVol(virStoragePoolObjPtr pool,
def->capacity = vol->source.extents[0].end;
return 0;
+
+ error:
+ if (addVol)
+ virStorageVolDefFree(vol);
+ return -1;
}
static int
--
2.13.6
2:05 p.m.
New subject: [libvirt] [PATCH 3/4] storage: Introduce _virStorageVolObj[List]
Prepare for hash table volume lists by creating the object infrastructure
for a Volume Object and Volume Object List
The _virStorageVolObj will contain just a pointer to the "current"
(and live) volume definition.
The _virStorageVolObjList will contain three hash tables, one for
each of the lookup options allowed for a volume.
Signed-off-by: John Ferlan <jferlan(a)redhat.com>
---
src/conf/virstorageobj.c | 130 +++++++++++++++++++++++++++++++++++++++++++++++
1 file changed, 130 insertions(+)
diff --git a/src/conf/virstorageobj.c b/src/conf/virstorageobj.c
index 1eaa53423..8a1c6f782 100644
--- a/src/conf/virstorageobj.c
+++ b/src/conf/virstorageobj.c
@@ -39,11 +39,18 @@ VIR_LOG_INIT("conf.virstorageobj");
static virClassPtr virStoragePoolObjClass;
static virClassPtr virStoragePoolObjListClass;
+static virClassPtr virStorageVolObjClass;
+static virClassPtr virStorageVolObjListClass;
static void
virStoragePoolObjDispose(void *opaque);
static void
virStoragePoolObjListDispose(void *opaque);
+static void
+virStorageVolObjDispose(void *opaque);
+static void
+virStorageVolObjListDispose(void *opaque);
+
struct _virStorageVolDefList {
@@ -51,6 +58,32 @@ struct _virStorageVolDefList {
virStorageVolDefPtr *objs;
};
+typedef struct _virStorageVolObj virStorageVolObj;
+typedef virStorageVolObj *virStorageVolObjPtr;
+struct _virStorageVolObj {
+ virObjectLockable parent;
+
+ virStorageVolDefPtr voldef;
+};
+
+typedef struct _virStorageVolObjList virStorageVolObjList;
+typedef virStorageVolObjList *virStorageVolObjListPtr;
+struct _virStorageVolObjList {
+ virObjectRWLockable parent;
+
+ /* key string -> virStorageVolObj mapping
+ * for (1), lockless lookup-by-key */
+ virHashTable *objsKey;
+
+ /* name string -> virStorageVolObj mapping
+ * for (1), lockless lookup-by-name */
+ virHashTable *objsName;
+
+ /* path string -> virStorageVolObj mapping
+ * for (1), lockless lookup-by-path */
+ virHashTable *objsPath;
+};
+
struct _virStoragePoolObj {
virObjectLockable parent;
@@ -80,6 +113,103 @@ struct _virStoragePoolObjList {
static int
+virStorageVolObjOnceInit(void)
+{
+ if (!(virStorageVolObjClass = virClassNew(virClassForObjectLockable(),
+ "virStorageVolObj",
+ sizeof(virStorageVolObj),
+ virStorageVolObjDispose)))
+ return -1;
+
+ if (!(virStorageVolObjListClass = virClassNew(virClassForObjectRWLockable(),
+ "virStorageVolObjList",
+ sizeof(virStorageVolObjList),
+ virStorageVolObjListDispose)))
+ return -1;
+
+ return 0;
+}
+
+VIR_ONCE_GLOBAL_INIT(virStorageVolObj)
+
+
+static virStorageVolObjPtr ATTRIBUTE_UNUSED
+virStorageVolObjNew(void)
+{
+ virStorageVolObjPtr obj;
+
+ if (virStorageVolObjInitialize() < 0)
+ return NULL;
+
+ if (!(obj = virObjectLockableNew(virStorageVolObjClass)))
+ return NULL;
+
+ virObjectLock(obj);
+ return obj;
+}
+
+
+static void ATTRIBUTE_UNUSED
+virStorageVolObjEndAPI(virStorageVolObjPtr *obj)
+{
+ if (!*obj)
+ return;
+
+ virObjectUnlock(*obj);
+ virObjectUnref(*obj);
+ *obj = NULL;
+}
+
+
+static void
+virStorageVolObjDispose(void *opaque)
+{
+ virStorageVolObjPtr obj = opaque;
+
+ if (!obj)
+ return;
+
+ virStorageVolDefFree(obj->voldef);
+}
+
+
+static virStorageVolObjListPtr ATTRIBUTE_UNUSED
+virStorageVolObjListNew(void)
+{
+ virStorageVolObjListPtr vols;
+
+ if (virStorageVolObjInitialize() < 0)
+ return NULL;
+
+ if (!(vols = virObjectRWLockableNew(virStorageVolObjListClass)))
+ return NULL;
+
+ if (!(vols->objsKey = virHashCreate(10, virObjectFreeHashData)) ||
+ !(vols->objsName = virHashCreate(10, virObjectFreeHashData)) ||
+ !(vols->objsPath = virHashCreate(10, virObjectFreeHashData))) {
+ virObjectUnref(vols);
+ return NULL;
+ }
+
+ return vols;
+}
+
+
+static void
+virStorageVolObjListDispose(void *opaque)
+{
+ virStorageVolObjListPtr vols = opaque;
+
+ if (!vols)
+ return;
+
+ virHashFree(vols->objsKey);
+ virHashFree(vols->objsName);
+ virHashFree(vols->objsPath);
+}
+
+
+static int
virStoragePoolObjOnceInit(void)
{
if (!(virStoragePoolObjClass = virClassNew(virClassForObjectLockable(),
--
2.13.6
2:05 p.m.
New subject: [libvirt] [PATCH 4/4] storage: Complete implementation volume by hash object
Alter the volume logic to use the hash tables instead of forward
linked lists. There are three hash tables to allow for fast lookup
by name, target.path, and key.
Modify the virStoragePoolObjAddVol to place the object in all 3
tables if possible using self locking RWLock on the volumes object.
Conversely when removing the volume, it's a removal of the object
from the various hash tables.
Implement functions to handle remote ForEach and Search Volume
type helpers. These are used by the disk backend in order to
facilitate adding a primary, extended, or logical partition.
Implement the various VolDefFindBy* helpers as simple (and fast)
hash lookups. The NumOfVolumes, GetNames, and ListExport helpers
are all implemented using standard for each hash table calls.
Signed-off-by: John Ferlan <jferlan(a)redhat.com>
---
src/conf/virstorageobj.c | 420 +++++++++++++++++++++++++++++++++++------------
1 file changed, 311 insertions(+), 109 deletions(-)
diff --git a/src/conf/virstorageobj.c b/src/conf/virstorageobj.c
index 8a1c6f782..d92b2b2e3 100644
--- a/src/conf/virstorageobj.c
+++ b/src/conf/virstorageobj.c
@@ -53,11 +53,6 @@ virStorageVolObjListDispose(void *opaque);
-struct _virStorageVolDefList {
- size_t count;
- virStorageVolDefPtr *objs;
-};
-
typedef struct _virStorageVolObj virStorageVolObj;
typedef virStorageVolObj *virStorageVolObjPtr;
struct _virStorageVolObj {
@@ -96,7 +91,7 @@ struct _virStoragePoolObj {
virStoragePoolDefPtr def;
virStoragePoolDefPtr newDef;
- virStorageVolDefList volumes;
+ virStorageVolObjListPtr volumes;
};
struct _virStoragePoolObjList {
@@ -133,7 +128,7 @@ virStorageVolObjOnceInit(void)
VIR_ONCE_GLOBAL_INIT(virStorageVolObj)
-static virStorageVolObjPtr ATTRIBUTE_UNUSED
+static virStorageVolObjPtr
virStorageVolObjNew(void)
{
virStorageVolObjPtr obj;
@@ -149,7 +144,7 @@ virStorageVolObjNew(void)
}
-static void ATTRIBUTE_UNUSED
+static void
virStorageVolObjEndAPI(virStorageVolObjPtr *obj)
{
if (!*obj)
@@ -173,7 +168,7 @@ virStorageVolObjDispose(void *opaque)
}
-static virStorageVolObjListPtr ATTRIBUTE_UNUSED
+static virStorageVolObjListPtr
virStorageVolObjListNew(void)
{
virStorageVolObjListPtr vols;
@@ -241,6 +236,11 @@ virStoragePoolObjNew(void)
if (!(obj = virObjectLockableNew(virStoragePoolObjClass)))
return NULL;
+ if (!(obj->volumes = virStorageVolObjListNew())) {
+ virObjectUnref(obj);
+ return NULL;
+ }
+
virObjectLock(obj);
obj->active = false;
return obj;
@@ -377,6 +377,7 @@ virStoragePoolObjDispose(void *opaque)
return;
virStoragePoolObjClearVols(obj);
+ virObjectUnref(obj->volumes);
virStoragePoolDefFree(obj->def);
virStoragePoolDefFree(obj->newDef);
@@ -625,12 +626,9 @@ virStoragePoolSourceFindDuplicateDevices(virStoragePoolObjPtr obj,
void
virStoragePoolObjClearVols(virStoragePoolObjPtr obj)
{
- size_t i;
- for (i = 0; i < obj->volumes.count; i++)
- virStorageVolDefFree(obj->volumes.objs[i]);
-
- VIR_FREE(obj->volumes.objs);
- obj->volumes.count = 0;
+ virHashRemoveAll(obj->volumes->objsKey);
+ virHashRemoveAll(obj->volumes->objsName);
+ virHashRemoveAll(obj->volumes->objsPath);
}
@@ -638,9 +636,40 @@ int
virStoragePoolObjAddVol(virStoragePoolObjPtr obj,
virStorageVolDefPtr voldef)
{
- if (VIR_APPEND_ELEMENT(obj->volumes.objs, obj->volumes.count, voldef) < 0)
- return -1;
+ virStorageVolObjPtr volobj = NULL;
+ virStorageVolObjListPtr volumes = obj->volumes;
+
+ virObjectRWLockWrite(volumes);
+
+ if (!(volobj = virStorageVolObjNew()))
+ goto error;
+
+ if (virHashAddEntry(volumes->objsKey, voldef->key, volobj) < 0)
+ goto error;
+ virObjectRef(volobj);
+
+ if (virHashAddEntry(volumes->objsName, voldef->name, volobj) < 0) {
+ virHashRemoveEntry(volumes->objsKey, voldef->key);
+ goto error;
+ }
+ virObjectRef(volobj);
+
+ if (virHashAddEntry(volumes->objsPath, voldef->target.path, volobj) < 0) {
+ virHashRemoveEntry(volumes->objsKey, voldef->key);
+ virHashRemoveEntry(volumes->objsName, voldef->name);
+ goto error;
+ }
+ virObjectRef(volobj);
+
+ volobj->voldef = voldef;
+ virObjectRWUnlock(volumes);
+ virStorageVolObjEndAPI(&volobj);
return 0;
+
+ error:
+ virStorageVolObjEndAPI(&volobj);
+ virObjectRWUnlock(volumes);
+ return -1;
}
@@ -648,26 +677,58 @@ void
virStoragePoolObjRemoveVol(virStoragePoolObjPtr obj,
virStorageVolDefPtr voldef)
{
- virStoragePoolDefPtr def = virStoragePoolObjGetDef(obj);
- size_t i;
-
- for (i = 0; i < obj->volumes.count; i++) {
- if (obj->volumes.objs[i] == voldef) {
- VIR_INFO("Deleting volume '%s' from storage pool
'%s'",
- voldef->name, def->name);
- virStorageVolDefFree(voldef);
+ virStorageVolObjListPtr volumes = obj->volumes;
+ virStorageVolObjPtr volobj;
- VIR_DELETE_ELEMENT(obj->volumes.objs, i, obj->volumes.count);
- return;
- }
+ virObjectRWLockWrite(volumes);
+ volobj = virHashLookup(volumes->objsName, voldef->name);
+ if (!volobj) {
+ VIR_INFO("Cannot find volume '%s' from storage pool
'%s'",
+ voldef->name, obj->def->name);
+ virObjectRWUnlock(volumes);
+ return;
}
+ VIR_INFO("Deleting volume '%s' from storage pool '%s'",
+ voldef->name, obj->def->name);
+
+ virObjectRef(volobj);
+ virObjectLock(volobj);
+ virHashRemoveEntry(volumes->objsKey, voldef->key);
+ virHashRemoveEntry(volumes->objsName, voldef->name);
+ virHashRemoveEntry(volumes->objsPath, voldef->target.path);
+ virStorageVolObjEndAPI(&volobj);
+
+ virObjectRWUnlock(volumes);
}
size_t
virStoragePoolObjGetVolumesCount(virStoragePoolObjPtr obj)
{
- return obj->volumes.count;
+ return virHashSize(obj->volumes->objsKey);
+}
+
+
+struct _virStoragePoolObjForEachVolData {
+ virStorageVolObjListIterator iter;
+ const void *opaque;
+};
+
+static int
+virStoragePoolObjForEachVolumeCb(void *payload,
+ const void *name ATTRIBUTE_UNUSED,
+ void *opaque)
+{
+ int ret = 0;
+ virStorageVolObjPtr volobj = payload;
+ struct _virStoragePoolObjForEachVolData *data = opaque;
+
+ virObjectLock(volobj);
+ if (data->iter(volobj->voldef, data->opaque) < 0)
+ ret = -1;
+ virObjectUnlock(volobj);
+
+ return ret;
}
@@ -676,28 +737,58 @@ virStoragePoolObjForEachVolume(virStoragePoolObjPtr obj,
virStorageVolObjListIterator iter,
const void *opaque)
{
- size_t i;
-
- for (i = 0; i < obj->volumes.count; i++) {
- if (iter(obj->volumes.objs[i], opaque) < 0)
- return -1;
- }
+ struct _virStoragePoolObjForEachVolData data = {
+ .iter = iter, .opaque = opaque };
+ virObjectRWLockRead(obj->volumes);
+ virHashForEach(obj->volumes->objsKey, virStoragePoolObjForEachVolumeCb,
+ &data);
+ virObjectRWUnlock(obj->volumes);
return 0;
}
+struct _virStoragePoolObjSearchVolData {
+ virStorageVolObjListSearcher iter;
+ const void *opaque;
+};
+
+static int
+virStoragePoolObjSearchVolumeCb(const void *payload,
+ const void *name ATTRIBUTE_UNUSED,
+ const void *opaque)
+{
+ virStorageVolObjPtr volobj = (virStorageVolObjPtr) payload;
+ struct _virStoragePoolObjSearchVolData *data =
+ (struct _virStoragePoolObjSearchVolData *) opaque;
+ int found = 0;
+
+ virObjectLock(volobj);
+ if (data->iter(volobj->voldef, data->opaque))
+ found = 1;
+ virObjectUnlock(volobj);
+
+ return found;
+}
+
+
virStorageVolDefPtr
virStoragePoolObjSearchVolume(virStoragePoolObjPtr obj,
virStorageVolObjListSearcher iter,
const void *opaque)
{
- size_t i;
+ virStorageVolObjPtr volobj;
+ struct _virStoragePoolObjSearchVolData data = {
+ .iter = iter, .opaque = opaque };
- for (i = 0; i < obj->volumes.count; i++) {
- if (iter(obj->volumes.objs[i], opaque))
- return obj->volumes.objs[i];
- }
+ virObjectRWLockRead(obj->volumes);
+ volobj = virHashSearch(obj->volumes->objsKey,
+ virStoragePoolObjSearchVolumeCb,
+ &data, NULL);
+ virObjectRWUnlock(obj->volumes);
+
+ if (volobj)
+ return volobj->voldef;
return NULL;
}
@@ -707,12 +798,14 @@ virStorageVolDefPtr
virStorageVolDefFindByKey(virStoragePoolObjPtr obj,
const char *key)
{
- size_t i;
+ virStorageVolObjPtr volobj;
- for (i = 0; i < obj->volumes.count; i++)
- if (STREQ(obj->volumes.objs[i]->key, key))
- return obj->volumes.objs[i];
+ virObjectRWLockRead(obj->volumes);
+ volobj = virHashLookup(obj->volumes->objsKey, key);
+ virObjectRWUnlock(obj->volumes);
+ if (volobj)
+ return volobj->voldef;
return NULL;
}
@@ -721,12 +814,14 @@ virStorageVolDefPtr
virStorageVolDefFindByPath(virStoragePoolObjPtr obj,
const char *path)
{
- size_t i;
+ virStorageVolObjPtr volobj;
- for (i = 0; i < obj->volumes.count; i++)
- if (STREQ(obj->volumes.objs[i]->target.path, path))
- return obj->volumes.objs[i];
+ virObjectRWLockRead(obj->volumes);
+ volobj = virHashLookup(obj->volumes->objsPath, path);
+ virObjectRWUnlock(obj->volumes);
+ if (volobj)
+ return volobj->voldef;
return NULL;
}
@@ -735,34 +830,107 @@ virStorageVolDefPtr
virStorageVolDefFindByName(virStoragePoolObjPtr obj,
const char *name)
{
- size_t i;
+ virStorageVolObjPtr volobj;
- for (i = 0; i < obj->volumes.count; i++)
- if (STREQ(obj->volumes.objs[i]->name, name))
- return obj->volumes.objs[i];
+ virObjectRWLockRead(obj->volumes);
+ volobj = virHashLookup(obj->volumes->objsName, name);
+ virObjectRWUnlock(obj->volumes);
+ if (volobj)
+ return volobj->voldef;
return NULL;
}
+struct _virStorageVolObjCountData {
+ virConnectPtr conn;
+ virStoragePoolVolumeACLFilter filter;
+ virStoragePoolDefPtr pooldef;
+ int count;
+};
+
+
+static int
+virStoragePoolObjNumOfVolumesCb(void *payload,
+ const void *name ATTRIBUTE_UNUSED,
+ void *opaque)
+{
+ virStorageVolObjPtr volobj = payload;
+ struct _virStorageVolObjCountData *data = opaque;
+
+ virObjectLock(volobj);
+
+ if (data->filter && !data->filter(data->conn, data->pooldef,
+ volobj->voldef))
+ goto cleanup;
+
+ data->count++;
+
+ cleanup:
+ virObjectUnlock(volobj);
+ return 0;
+}
+
+
int
virStoragePoolObjNumOfVolumes(virStoragePoolObjPtr obj,
virConnectPtr conn,
virStoragePoolVolumeACLFilter filter)
{
- virStoragePoolDefPtr pooldef = obj->def;
- virStorageVolDefListPtr volumes = &obj->volumes;
- int nvolumes = 0;
- size_t i;
+ virStorageVolObjListPtr volumes = obj->volumes;
+ struct _virStorageVolObjCountData data = {
+ .conn = conn, .filter = filter, .pooldef = obj->def, .count = 0 };
- for (i = 0; i < volumes->count; i++) {
- virStorageVolDefPtr def = volumes->objs[i];
- if (filter && !filter(conn, pooldef, def))
- continue;
- nvolumes++;
+ virObjectRWLockRead(volumes);
+ virHashForEach(volumes->objsName, virStoragePoolObjNumOfVolumesCb, &data);
+ virObjectRWUnlock(volumes);
+
+ return data.count;
+}
+
+
+struct _virStorageVolObjNameData {
+ virConnectPtr conn;
+ virStoragePoolVolumeACLFilter filter;
+ virStoragePoolDefPtr pooldef;
+ bool error;
+ int nnames;
+ int maxnames;
+ char **const names;
+};
+
+static int
+virStoragePoolObjVolumeGetNamesCb(void *payload,
+ const void *name ATTRIBUTE_UNUSED,
+ void *opaque)
+{
+ virStorageVolObjPtr volobj = payload;
+ struct _virStorageVolObjNameData *data = opaque;
+
+ if (data->error)
+ return 0;
+
+ if (data->maxnames >= 0 && data->nnames == data->maxnames)
+ return 0;
+
+ virObjectLock(volobj);
+
+ if (data->filter && !data->filter(data->conn, data->pooldef,
+ volobj->voldef))
+ goto cleanup;
+
+ if (data->names) {
+ if (VIR_STRDUP(data->names[data->nnames], volobj->voldef->name) <
0) {
+ data->error = true;
+ goto cleanup;
+ }
}
- return nvolumes;
+ data->nnames++;
+
+ cleanup:
+ virObjectUnlock(volobj);
+ return 0;
}
@@ -773,75 +941,109 @@ virStoragePoolObjVolumeGetNames(virStoragePoolObjPtr obj,
char **const names,
int maxnames)
{
- virStoragePoolDefPtr pooldef = obj->def;
- virStorageVolDefListPtr volumes = &obj->volumes;
- int nnames = 0;
- size_t i;
+ virStorageVolObjListPtr volumes = obj->volumes;
+ struct _virStorageVolObjNameData data = {
+ .conn = conn, .filter = filter, .pooldef = obj->def, .error = false,
+ .nnames = 0, .maxnames = maxnames, .names = names };
- for (i = 0; i < volumes->count && nnames < maxnames; i++) {
- virStorageVolDefPtr def = volumes->objs[i];
- if (filter && !filter(conn, pooldef, def))
- continue;
- if (VIR_STRDUP(names[nnames], def->name) < 0)
- goto failure;
- nnames++;
- }
+ virObjectRWLockRead(volumes);
+ virHashForEach(volumes->objsName, virStoragePoolObjVolumeGetNamesCb, &data);
+ virObjectRWUnlock(volumes);
- return nnames;
+ if (data.error)
+ goto error;
- failure:
- while (--nnames >= 0)
- VIR_FREE(names[nnames]);
+ return data.nnames;
+ error:
+ while (--data.nnames)
+ VIR_FREE(data.names[data.nnames]);
return -1;
}
+struct _virStorageVolObjExportData {
+ virConnectPtr conn;
+ virStoragePoolVolumeACLFilter filter;
+ virStoragePoolDefPtr pooldef;
+ bool error;
+ int nvols;
+ virStorageVolPtr *vols;
+};
+
+static int
+virStoragePoolObjVolumeListExportCb(void *payload,
+ const void *name ATTRIBUTE_UNUSED,
+ void *opaque)
+{
+ virStorageVolObjPtr volobj = payload;
+ struct _virStorageVolObjExportData *data = opaque;
+ virStorageVolPtr vol = NULL;
+
+ if (data->error)
+ return 0;
+
+ virObjectLock(volobj);
+
+ if (data->filter && !data->filter(data->conn, data->pooldef,
+ volobj->voldef))
+ goto cleanup;
+
+ if (data->vols) {
+ if (!(vol = virGetStorageVol(data->conn, data->pooldef->name,
+ volobj->voldef->name,
volobj->voldef->key,
+ NULL, NULL))) {
+ data->error = true;
+ goto cleanup;
+ }
+ data->vols[data->nvols] = vol;
+ }
+
+ data->nvols++;
+
+ cleanup:
+ virObjectUnlock(volobj);
+ return 0;
+}
+
+
int
virStoragePoolObjVolumeListExport(virConnectPtr conn,
virStoragePoolObjPtr obj,
virStorageVolPtr **vols,
virStoragePoolVolumeACLFilter filter)
{
- virStoragePoolDefPtr pooldef = obj->def;
- virStorageVolDefListPtr volumes = &obj->volumes;
- int ret = -1;
- size_t i;
- virStorageVolPtr *tmp_vols = NULL;
- virStorageVolPtr vol = NULL;
- int nvols = 0;
+ virStorageVolObjListPtr volumes = obj->volumes;
+ struct _virStorageVolObjExportData data = {
+ .conn = conn, .filter = filter, .pooldef = obj->def, .error = false,
+ .nvols = 0, .vols = NULL };
+
+ virObjectRWLockRead(volumes);
- /* Just returns the volumes count */
if (!vols) {
- ret = volumes->count;
- goto cleanup;
+ int ret = virHashSize(volumes->objsName);
+ virObjectRWUnlock(volumes);
+ return ret;
}
- if (VIR_ALLOC_N(tmp_vols, volumes->count + 1) < 0)
- goto cleanup;
-
- for (i = 0; i < volumes->count; i++) {
- virStorageVolDefPtr def = volumes->objs[i];
- if (filter && !filter(conn, pooldef, def))
- continue;
- if (!(vol = virGetStorageVol(conn, pooldef->name, def->name, def->key,
- NULL, NULL)))
- goto cleanup;
- tmp_vols[nvols++] = vol;
+ if (VIR_ALLOC_N(data.vols, virHashSize(volumes->objsName) + 1) < 0) {
+ virObjectRWUnlock(volumes);
+ return -1;
}
- *vols = tmp_vols;
- tmp_vols = NULL;
- ret = nvols;
+ virHashForEach(volumes->objsName, virStoragePoolObjVolumeListExportCb,
&data);
+ virObjectRWUnlock(volumes);
- cleanup:
- if (tmp_vols) {
- for (i = 0; i < nvols; i++)
- virObjectUnref(tmp_vols[i]);
- VIR_FREE(tmp_vols);
- }
+ if (data.error)
+ goto error;
- return ret;
+ *vols = data.vols;
+
+ return data.nvols;
+
+ error:
+ virObjectListFree(data.vols);
+ return -1;
}
--
2.13.6
3:16 a.m.
New subject: [libvirt] [PATCH 4/4] storage: Complete implementation volume by hash object
On 01/09/2018 09:05 PM, John Ferlan wrote:
Alter the volume logic to use the hash tables instead of forward
linked lists. There are three hash tables to allow for fast lookup
by name, target.path, and key.
Modify the virStoragePoolObjAddVol to place the object in all 3
tables if possible using self locking RWLock on the volumes object.
Conversely when removing the volume, it's a removal of the object
from the various hash tables.
Implement functions to handle remote ForEach and Search Volume
type helpers. These are used by the disk backend in order to
facilitate adding a primary, extended, or logical partition.
Implement the various VolDefFindBy* helpers as simple (and fast)
hash lookups. The NumOfVolumes, GetNames, and ListExport helpers
are all implemented using standard for each hash table calls.
Signed-off-by: John Ferlan <jferlan(a)redhat.com>
---
src/conf/virstorageobj.c | 420 +++++++++++++++++++++++++++++++++++------------
1 file changed, 311 insertions(+), 109 deletions(-)
diff --git a/src/conf/virstorageobj.c b/src/conf/virstorageobj.c
index 8a1c6f782..d92b2b2e3 100644
--- a/src/conf/virstorageobj.c
+++ b/src/conf/virstorageobj.c
@@ -53,11 +53,6 @@ virStorageVolObjListDispose(void *opaque);
size_t
virStoragePoolObjGetVolumesCount(virStoragePoolObjPtr obj)
{
- return obj->volumes.count;
+ return virHashSize(obj->volumes->objsKey);
How come we don't need a read lock here? ... I think we should grab a
read lock from obj->volumes just like you're doing in
virStorageVolDefFindByKey() for instance.
+}
+
+
+
+static int
+virStoragePoolObjNumOfVolumesCb(void *payload,
+ const void *name ATTRIBUTE_UNUSED,
+ void *opaque)
+{
+ virStorageVolObjPtr volobj = payload;
+ struct _virStorageVolObjCountData *data = opaque;
+
+ virObjectLock(volobj);
+
+ if (data->filter && !data->filter(data->conn, data->pooldef,
+ volobj->voldef))
If you'd break the line after logical and it would look nicer ;-)
+ goto cleanup;
+
+ data->count++;
+
+ cleanup:
+ virObjectUnlock(volobj);
+ return 0;
+}
Michal
5:39 a.m.
New subject: [libvirt] [PATCH 4/4] storage: Complete implementation volume by hash object
On 01/10/2018 04:16 AM, Michal Privoznik wrote:
On 01/09/2018 09:05 PM, John Ferlan wrote:
> Alter the volume logic to use the hash tables instead of forward
> linked lists. There are three hash tables to allow for fast lookup
> by name, target.path, and key.
>
> Modify the virStoragePoolObjAddVol to place the object in all 3
> tables if possible using self locking RWLock on the volumes object.
> Conversely when removing the volume, it's a removal of the object
> from the various hash tables.
>
> Implement functions to handle remote ForEach and Search Volume
> type helpers. These are used by the disk backend in order to
> facilitate adding a primary, extended, or logical partition.
>
> Implement the various VolDefFindBy* helpers as simple (and fast)
> hash lookups. The NumOfVolumes, GetNames, and ListExport helpers
> are all implemented using standard for each hash table calls.
>
> Signed-off-by: John Ferlan <jferlan(a)redhat.com>
> ---
> src/conf/virstorageobj.c | 420 +++++++++++++++++++++++++++++++++++------------
> 1 file changed, 311 insertions(+), 109 deletions(-)
>
> diff --git a/src/conf/virstorageobj.c b/src/conf/virstorageobj.c
> index 8a1c6f782..d92b2b2e3 100644
> --- a/src/conf/virstorageobj.c
> +++ b/src/conf/virstorageobj.c
> @@ -53,11 +53,6 @@ virStorageVolObjListDispose(void *opaque);
>
>
> size_t
> virStoragePoolObjGetVolumesCount(virStoragePoolObjPtr obj)
> {
> - return obj->volumes.count;
> + return virHashSize(obj->volumes->objsKey);
How come we don't need a read lock here? ... I think we should grab a
read lock from obj->volumes just like you're doing in
virStorageVolDefFindByKey() for instance.
This doesn't traverse volumes->objs - it gets the size directly from the
hash table stored @objsKey. I'm not against adding an RWLock here, but
that's probably what the distinguishing factor was (I wrote the code 3
months ago ;-) - it's just been waiting it's turn).
> +}
> +
> +
> +
> +static int
> +virStoragePoolObjNumOfVolumesCb(void *payload,
> + const void *name ATTRIBUTE_UNUSED,
> + void *opaque)
> +{
> + virStorageVolObjPtr volobj = payload;
> + struct _virStorageVolObjCountData *data = opaque;
> +
> + virObjectLock(volobj);
> +
> + if (data->filter && !data->filter(data->conn,
data->pooldef,
> + volobj->voldef))
If you'd break the line after logical and it would look nicer ;-)
Sure, np. Same for GetNamesCb and ListExportCb too
TKs -
John
> + goto cleanup;
> +
> + data->count++;
> +
> + cleanup:
> + virObjectUnlock(volobj);
> + return 0;
> +}
Michal
5:58 a.m.
New subject: [libvirt] [PATCH 4/4] storage: Complete implementation volume by hash object
On 01/10/2018 12:39 PM, John Ferlan wrote:
On 01/10/2018 04:16 AM, Michal Privoznik wrote:
> On 01/09/2018 09:05 PM, John Ferlan wrote:
>> Alter the volume logic to use the hash tables instead of forward
>> linked lists. There are three hash tables to allow for fast lookup
>> by name, target.path, and key.
>>
>> Modify the virStoragePoolObjAddVol to place the object in all 3
>> tables if possible using self locking RWLock on the volumes object.
>> Conversely when removing the volume, it's a removal of the object
>> from the various hash tables.
>>
>> Implement functions to handle remote ForEach and Search Volume
>> type helpers. These are used by the disk backend in order to
>> facilitate adding a primary, extended, or logical partition.
>>
>> Implement the various VolDefFindBy* helpers as simple (and fast)
>> hash lookups. The NumOfVolumes, GetNames, and ListExport helpers
>> are all implemented using standard for each hash table calls.
>>
>> Signed-off-by: John Ferlan <jferlan(a)redhat.com>
>> ---
>> src/conf/virstorageobj.c | 420 +++++++++++++++++++++++++++++++++++------------
>> 1 file changed, 311 insertions(+), 109 deletions(-)
>>
>> diff --git a/src/conf/virstorageobj.c b/src/conf/virstorageobj.c
>> index 8a1c6f782..d92b2b2e3 100644
>> --- a/src/conf/virstorageobj.c
>> +++ b/src/conf/virstorageobj.c
>> @@ -53,11 +53,6 @@ virStorageVolObjListDispose(void *opaque);
>>
>
>>
>> size_t
>> virStoragePoolObjGetVolumesCount(virStoragePoolObjPtr obj)
>> {
>> - return obj->volumes.count;
>> + return virHashSize(obj->volumes->objsKey);
>
> How come we don't need a read lock here? ... I think we should grab a
> read lock from obj->volumes just like you're doing in
> virStorageVolDefFindByKey() for instance.
This doesn't traverse volumes->objs - it gets the size directly from the
hash table stored @objsKey.
Exactly the reason why we need a lock here. What if another thread is
already modifying the table? True, this is not that problematic since we
don't really care if we get N or N+1 result here (moreover, this
function is used only at one place and that is VIR_DEBUG, so not a big
problem), but still I think we need a read lock here.
I'm not against adding an RWLock here, but
that's probably what the distinguishing factor was (I wrote the code 3
months ago ;-) - it's just been waiting it's turn).
Sure, no problem.
Michal
3:16 a.m.
On 01/09/2018 09:05 PM, John Ferlan wrote:
This series converts the storage volume forward linked list into
an object that contains hash tables of volume objects.
The first two patches resolve issues seen during testing with
the Disk backend which had some special cased code to handle
the Create/Delete paths and interactions with the partition logic.
The first patch was much more quickly seen with object free logic
in place.
The second two patches make the conversion to objects and hash
tables in "smaller chunks", but they could easily be combined.
John Ferlan (4):
storage: When delete volume avoid disk backend removal
storage: Modify virStorageBackendDiskMakeDataVol logic
storage: Introduce _virStorageVolObj[List]
storage: Complete implementation volume by hash object
src/conf/virstorageobj.c | 540 ++++++++++++++++++++++++++++++-------
src/storage/storage_backend_disk.c | 40 +--
src/storage/storage_driver.c | 14 +-
3 files changed, 471 insertions(+), 123 deletions(-)
ACK series, but see my points in 4/4 before pushing please.
Michal
2508
days inactive
2509
days old
8 comments
2 participants
participants (2)
-
John Ferlan -
Michal Privoznik