[PATCH RFC 1/1] nvme-core: register namespaces in order during async scan
Maurizio Lombardi
mlombard at bsdbackstore.eu
Fri Sep 26 01:43:16 PDT 2025
On Mon Sep 22, 2025 at 7:30 PM CEST, Christoph Hellwig wrote:
> This idea looks fine to me, but I hate duplicating the logic
> from SCSI here. Any chance you could try to factor the logic
> into a common helper?
Ok, let's try. What do you think about something like this?
I am not good with function names so I am open to suggestions:
lib: Introduce completion chain helper
Introduce a new helper library, the completion chain, designed
to serialize asynchronous operations that must execute
in a strict First-In, First-Out (FIFO) order.
Certain workflows, particularly in block or
storage drivers, require asynchronous operations to complete in the
same sequence they were submitted.
This helper provides a generic mechanism to enforce this ordering.
struct compl_chain: The main structure representing the queue of operations.
struct compl_chain_entry: An entry embedded in a per-operation structure.
The typical usage pattern is:
* An operation is enqueued by calling compl_chain_add().
* The worker thread for the operation calls
compl_chain_wait(), which blocks until the previously
enqueued operation has finished.
* After the work is done, the thread calls compl_chain_complete().
This signals the next operation in the chain that it can now
proceed and removes the current entry from the list.
Signed-off-by: Maurizio Lombardi <mlombard at redhat.com>
---
include/linux/compl_chain.h | 34 ++++++++++++++++++
lib/Makefile | 2 +-
lib/compl_chain.c | 72 +++++++++++++++++++++++++++++++++++++
3 files changed, 107 insertions(+), 1 deletion(-)
create mode 100644 include/linux/compl_chain.h
create mode 100644 lib/compl_chain.c
diff --git a/include/linux/compl_chain.h b/include/linux/compl_chain.h
new file mode 100644
index 000000000000..663c105b6605
--- /dev/null
+++ b/include/linux/compl_chain.h
@@ -0,0 +1,34 @@
+/* SPDX-License-Identifier: GPL-2.0 */
+#ifndef _LINUX_COMPLETION_CHAIN_H
+#define _LINUX_COMPLETION_CHAIN_H
+
+#include <linux/list.h>
+#include <linux/completion.h>
+#include <linux/spinlock.h>
+
+struct compl_chain {
+ spinlock_t lock;
+ struct list_head list;
+};
+
+#define COMPL_CHAIN_INIT(name) \
+ { .lock = __SPIN_LOCK_UNLOCKED((name).lock), \
+ .list = LIST_HEAD_INIT((name).list) }
+
+#define DEFINE_COMPL_CHAIN(name) \
+ struct compl_chain name = COMPL_CHAIN_INIT(name)
+
+struct compl_chain_entry {
+ struct compl_chain *chain;
+ struct list_head list;
+ struct completion prev_finished;
+};
+
+void compl_chain_init(struct compl_chain *chain);
+void compl_chain_add(struct compl_chain *chain,
+ struct compl_chain_entry *entry);
+void compl_chain_wait(struct compl_chain_entry *entry);
+void compl_chain_complete(struct compl_chain_entry *entry);
+bool compl_chain_empty(struct compl_chain *chain);
+
+#endif /* _LINUX_COMPL_CHAIN_H */
diff --git a/lib/Makefile b/lib/Makefile
index 392ff808c9b9..8eea23c22b45 100644
--- a/lib/Makefile
+++ b/lib/Makefile
@@ -56,7 +56,7 @@ obj-y += bcd.o sort.o parser.o debug_locks.o random32.o \
bsearch.o find_bit.o llist.o lwq.o memweight.o kfifo.o \
percpu-refcount.o rhashtable.o base64.o \
once.o refcount.o rcuref.o usercopy.o errseq.o bucket_locks.o \
- generic-radix-tree.o bitmap-str.o
+ generic-radix-tree.o bitmap-str.o compl_chain.o
obj-y += string_helpers.o
obj-y += hexdump.o
obj-$(CONFIG_TEST_HEXDUMP) += test_hexdump.o
diff --git a/lib/compl_chain.c b/lib/compl_chain.c
new file mode 100644
index 000000000000..7f7063802286
--- /dev/null
+++ b/lib/compl_chain.c
@@ -0,0 +1,72 @@
+// SPDX-License-Identifier: GPL-2.0
+#include <linux/compl_chain.h>
+
+void compl_chain_init(struct compl_chain *chain)
+{
+
+ spin_lock_init(&chain->lock);
+ INIT_LIST_HEAD(&chain->list);
+}
+EXPORT_SYMBOL_GPL(compl_chain_init);
+
+void compl_chain_add(struct compl_chain *chain,
+ struct compl_chain_entry *entry)
+{
+
+ init_completion(&entry->prev_finished);
+ INIT_LIST_HEAD(&entry->list);
+
+ entry->chain = chain;
+
+ spin_lock(&chain->lock);
+ if (list_empty(&chain->list))
+ complete_all(&entry->prev_finished);
+ list_add_tail(&entry->list, &chain->list);
+ spin_unlock(&chain->lock);
+}
+EXPORT_SYMBOL_GPL(compl_chain_add);
+
+void compl_chain_wait(struct compl_chain_entry *entry)
+{
+
+ WARN_ON(!entry->chain);
+
+ wait_for_completion(&entry->prev_finished);
+}
+EXPORT_SYMBOL_GPL(compl_chain_wait);
+
+void compl_chain_complete(struct compl_chain_entry *entry)
+{
+
+ struct compl_chain *chain = entry->chain;
+
+ WARN_ON(!chain);
+
+ wait_for_completion(&entry->prev_finished);
+
+ spin_lock(&chain->lock);
+ list_del(&entry->list);
+ if (!list_empty(&chain->list)) {
+ struct compl_chain_entry *next =
+ list_first_entry(&chain->list,
+ struct compl_chain_entry, list);
+ complete_all(&next->prev_finished);
+ }
+ spin_unlock(&chain->lock);
+
+ entry->chain = NULL;
+}
+EXPORT_SYMBOL_GPL(compl_chain_complete);
+
+bool compl_chain_empty(struct compl_chain *chain)
+{
+
+ bool r;
+
+ spin_lock(&chain->lock);
+ r = list_empty(&chain->list);
+ spin_unlock(&chain->lock);
+
+ return r;
+}
+EXPORT_SYMBOL_GPL(compl_chain_empty);
And this is like scsi/scsi_scan.c would be changed:
diff --git a/drivers/scsi/scsi_scan.c b/drivers/scsi/scsi_scan.c
index 3c6e089e80c3..0f833c5888b5 100644
--- a/drivers/scsi/scsi_scan.c
+++ b/drivers/scsi/scsi_scan.c
@@ -36,6 +36,7 @@
#include <linux/async.h>
#include <linux/slab.h>
#include <linux/unaligned.h>
+#include <linux/compl_chain.h>
#include <scsi/scsi.h>
#include <scsi/scsi_cmnd.h>
@@ -112,14 +113,11 @@ MODULE_PARM_DESC(inq_timeout,
"Timeout (in seconds) waiting for devices to answer INQUIRY."
" Default is 20. Some devices may need more; most need less.");
-/* This lock protects only this list */
-static DEFINE_SPINLOCK(async_scan_lock);
-static LIST_HEAD(scanning_hosts);
+DEFINE_COMPL_CHAIN(scanning_hosts);
struct async_scan_data {
- struct list_head list;
+ struct compl_chain_entry entry;
struct Scsi_Host *shost;
- struct completion prev_finished;
};
/*
@@ -151,9 +149,8 @@ int scsi_complete_async_scans(void)
struct async_scan_data *data;
do {
- scoped_guard(spinlock, &async_scan_lock)
- if (list_empty(&scanning_hosts))
- return 0;
+ if (compl_chain_empty(&scanning_hosts))
+ return 0;
/* If we can't get memory immediately, that's OK. Just
* sleep a little. Even if we never get memory, the async
* scans will finish eventually.
@@ -164,27 +161,11 @@ int scsi_complete_async_scans(void)
} while (!data);
data->shost = NULL;
- init_completion(&data->prev_finished);
- spin_lock(&async_scan_lock);
- /* Check that there's still somebody else on the list */
- if (list_empty(&scanning_hosts))
- goto done;
- list_add_tail(&data->list, &scanning_hosts);
- spin_unlock(&async_scan_lock);
+ compl_chain_add(&scanning_hosts, &data->entry);
printk(KERN_INFO "scsi: waiting for bus probes to complete ...\n");
- wait_for_completion(&data->prev_finished);
-
- spin_lock(&async_scan_lock);
- list_del(&data->list);
- if (!list_empty(&scanning_hosts)) {
- struct async_scan_data *next = list_entry(scanning_hosts.next,
- struct async_scan_data, list);
- complete(&next->prev_finished);
- }
- done:
- spin_unlock(&async_scan_lock);
+ compl_chain_complete(&data->entry);
kfree(data);
return 0;
@@ -1947,18 +1928,13 @@ static struct async_scan_data *scsi_prep_async_scan(struct Scsi_Host *shost)
data->shost = scsi_host_get(shost);
if (!data->shost)
goto err;
- init_completion(&data->prev_finished);
spin_lock_irqsave(shost->host_lock, flags);
shost->async_scan = 1;
spin_unlock_irqrestore(shost->host_lock, flags);
mutex_unlock(&shost->scan_mutex);
- spin_lock(&async_scan_lock);
- if (list_empty(&scanning_hosts))
- complete(&data->prev_finished);
- list_add_tail(&data->list, &scanning_hosts);
- spin_unlock(&async_scan_lock);
+ compl_chain_add(&scanning_hosts, &data->entry);
return data;
@@ -1995,7 +1971,7 @@ static void scsi_finish_async_scan(struct async_scan_data *data)
return;
}
- wait_for_completion(&data->prev_finished);
+ compl_chain_wait(&data->entry);
scsi_sysfs_add_devices(shost);
@@ -2005,14 +1981,7 @@ static void scsi_finish_async_scan(struct async_scan_data *data)
mutex_unlock(&shost->scan_mutex);
- spin_lock(&async_scan_lock);
- list_del(&data->list);
- if (!list_empty(&scanning_hosts)) {
- struct async_scan_data *next = list_entry(scanning_hosts.next,
- struct async_scan_data, list);
- complete(&next->prev_finished);
- }
- spin_unlock(&async_scan_lock);
+ compl_chain_complete(&data->entry);
scsi_autopm_put_host(shost);
scsi_host_put(shost);
More information about the Linux-nvme
mailing list