ALSA: info: Fix racy addition/deletion of nodes [Linux 5.1]

ALSA: info: Fix racy addition/deletion of nodes [Linux 5.1]

This Linux kernel change "ALSA: info: Fix racy addition/deletion of nodes" is included in the Linux 5.1 release. This change is authored by Takashi Iwai <tiwai [at]> on Tue Apr 16 15:25:00 2019 +0200. The commit for this change in Linux stable tree is 8c2f870 (patch).

ALSA: info: Fix racy addition/deletion of nodes

The ALSA proc helper manages the child nodes in a linked list, but its
addition and deletion is done without any lock.  This leads to a
corruption if they are operated concurrently.  Usually this isn't a
problem because the proc entries are added sequentially in the driver
probe procedure itself.  But the card registrations are done often
asynchronously, and the crash could be actually reproduced with

This patch papers over it by protecting the link addition and deletion
with the parent's mutex.  There is "access" mutex that is used for the
file access, and this can be reused for this purpose as well.

Cc: <>
Signed-off-by: Takashi Iwai <>

There are 12 lines of Linux source code added/deleted in this change. Code changes to Linux kernel are as follows.

 sound/core/info.c | 12 ++++++++++--
 1 file changed, 10 insertions(+), 2 deletions(-)

diff --git a/sound/core/info.c b/sound/core/info.c
index 96a0740..0eb169a 100644
--- a/sound/core/info.c
+++ b/sound/core/info.c
@@ -713,8 +713,11 @@ const char *snd_info_get_str(char *dest, const char *src, int len)
    entry->parent = parent;
    entry->module = module;
-   if (parent)
+   if (parent) {
+       mutex_lock(&parent->access);
        list_add_tail(&entry->list, &parent->children);
+       mutex_unlock(&parent->access);
+   }
    return entry;

@@ -792,7 +795,12 @@ void snd_info_free_entry(struct snd_info_entry * entry)
    list_for_each_entry_safe(p, n, &entry->children, list)

-   list_del(&entry->list);
+   p = entry->parent;
+   if (p) {
+       mutex_lock(&p->access);
+       list_del(&entry->list);
+       mutex_unlock(&p->access);
+   }
    if (entry->private_free)

Leave a Reply

Your email address will not be published. Required fields are marked *