diff options
| author | Alexander Aring <aahringo@redhat.com> | 2024-05-28 17:12:36 -0400 |
|---|---|---|
| committer | David Teigland <teigland@redhat.com> | 2024-05-31 11:04:54 -0500 |
| commit | 1ffefc19c4ac7c61e5acb29c7a915ce494fe448c (patch) | |
| tree | ef54d3404f3baa96838e4e650720dd9da93f4226 /fs/dlm/lockspace.c | |
| parent | 4db41bf4f04f75d5bcf52c500cbec11a2e159a06 (diff) | |
dlm: drop own rsb pre allocation mechanism
This patch drops the own written rsb pre allocation mechanism as this is
already done by using kmem caches, we don't need another layer on top of
that to running some pre allocation scheme.
Signed-off-by: Alexander Aring <aahringo@redhat.com>
Signed-off-by: David Teigland <teigland@redhat.com>
Diffstat (limited to 'fs/dlm/lockspace.c')
| -rw-r--r-- | fs/dlm/lockspace.c | 11 |
1 files changed, 0 insertions, 11 deletions
diff --git a/fs/dlm/lockspace.c b/fs/dlm/lockspace.c index 8155d7475c79..b96f2d05992d 100644 --- a/fs/dlm/lockspace.c +++ b/fs/dlm/lockspace.c @@ -428,9 +428,6 @@ static int new_lockspace(const char *name, const char *cluster, INIT_LIST_HEAD(&ls->ls_orphans); spin_lock_init(&ls->ls_orphans_lock); - INIT_LIST_HEAD(&ls->ls_new_rsb); - spin_lock_init(&ls->ls_new_rsb_spin); - INIT_LIST_HEAD(&ls->ls_nodes); INIT_LIST_HEAD(&ls->ls_nodes_gone); ls->ls_num_nodes = 0; @@ -688,7 +685,6 @@ static void rhash_free_rsb(void *ptr, void *arg) static int release_lockspace(struct dlm_ls *ls, int force) { - struct dlm_rsb *rsb; int busy, rv; busy = lockspace_busy(ls, force); @@ -756,13 +752,6 @@ static int release_lockspace(struct dlm_ls *ls, int force) */ rhashtable_free_and_destroy(&ls->ls_rsbtbl, rhash_free_rsb, NULL); - while (!list_empty(&ls->ls_new_rsb)) { - rsb = list_first_entry(&ls->ls_new_rsb, struct dlm_rsb, - res_hashchain); - list_del(&rsb->res_hashchain); - dlm_free_rsb(rsb); - } - /* * Free structures on any other lists */ |