2019-05-27 06:55:05 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Information interface for ALSA driver
|
2007-10-15 07:50:19 +00:00
|
|
|
* Copyright (c) by Jaroslav Kysela <perex@perex.cz>
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/time.h>
|
2008-07-24 04:28:13 +00:00
|
|
|
#include <linux/mm.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2005-06-23 07:09:02 +00:00
|
|
|
#include <linux/string.h>
|
2011-07-15 16:38:28 +00:00
|
|
|
#include <linux/module.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <sound/core.h>
|
|
|
|
#include <sound/minors.h>
|
|
|
|
#include <sound/info.h>
|
2012-09-04 09:21:45 +00:00
|
|
|
#include <linux/utsname.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/proc_fs.h>
|
2006-01-16 15:29:08 +00:00
|
|
|
#include <linux/mutex.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
int snd_info_check_reserved_words(const char *str)
|
|
|
|
{
|
2020-01-05 14:47:53 +00:00
|
|
|
static const char * const reserved[] =
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
"version",
|
|
|
|
"meminfo",
|
|
|
|
"memdebug",
|
|
|
|
"detect",
|
|
|
|
"devices",
|
|
|
|
"oss",
|
|
|
|
"cards",
|
|
|
|
"timers",
|
|
|
|
"synth",
|
|
|
|
"pcm",
|
|
|
|
"seq",
|
|
|
|
NULL
|
|
|
|
};
|
2020-01-05 14:47:53 +00:00
|
|
|
const char * const *xstr = reserved;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
while (*xstr) {
|
|
|
|
if (!strcmp(*xstr, str))
|
|
|
|
return 0;
|
|
|
|
xstr++;
|
|
|
|
}
|
|
|
|
if (!strncmp(str, "card", 4))
|
|
|
|
return 0;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2006-01-16 15:29:08 +00:00
|
|
|
static DEFINE_MUTEX(info_mutex);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_private_data {
|
|
|
|
struct snd_info_buffer *rbuffer;
|
|
|
|
struct snd_info_buffer *wbuffer;
|
|
|
|
struct snd_info_entry *entry;
|
2005-04-16 22:20:36 +00:00
|
|
|
void *file_private_data;
|
2005-11-17 12:58:48 +00:00
|
|
|
};
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
static int snd_info_version_init(void);
|
ALSA: info: Fix potential deadlock at disconnection
As reported recently, ALSA core info helper may cause a deadlock at
the forced device disconnection during the procfs operation.
The proc_remove() (that is called from the snd_card_disconnect()
helper) has a synchronization of the pending procfs accesses via
wait_for_completion(). Meanwhile, ALSA procfs helper takes the global
mutex_lock(&info_mutex) at both the proc_open callback and
snd_card_info_disconnect() helper. Since the proc_open can't finish
due to the mutex lock, wait_for_completion() never returns, either,
hence it deadlocks.
TASK#1 TASK#2
proc_reg_open()
takes use_pde()
snd_info_text_entry_open()
snd_card_disconnect()
snd_info_card_disconnect()
takes mutex_lock(&info_mutex)
proc_remove()
wait_for_completion(unused_pde)
... waiting task#1 closes
mutex_lock(&info_mutex)
=> DEADLOCK
This patch is a workaround for avoiding the deadlock scenario above.
The basic strategy is to move proc_remove() call outside the mutex
lock. proc_remove() can work gracefully without extra locking, and it
can delete the tree recursively alone. So, we call proc_remove() at
snd_info_card_disconnection() at first, then delete the rest resources
recursively within the info_mutex lock.
After the change, the function snd_info_disconnect() doesn't do
disconnection by itself any longer, but it merely clears the procfs
pointer. So rename the function to snd_info_clear_entries() for
avoiding confusion.
The similar change is applied to snd_info_free_entry(), too. Since
the proc_remove() is called only conditionally with the non-NULL
entry->p, it's skipped after the snd_info_clear_entries() call.
Reported-by: Shinhyung Kang <s47.kang@samsung.com>
Closes: https://lore.kernel.org/r/664457955.21699345385931.JavaMail.epsvc@epcpadp4
Reviewed-by: Jaroslav Kysela <perex@perex.cz>
Cc: <stable@vger.kernel.org>
Link: https://lore.kernel.org/r/20231109141954.4283-1-tiwai@suse.de
Signed-off-by: Takashi Iwai <tiwai@suse.de>
2023-11-09 14:19:54 +00:00
|
|
|
static void snd_info_clear_entries(struct snd_info_entry *entry);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
2015-04-22 20:14:41 +00:00
|
|
|
static struct snd_info_entry *snd_proc_root;
|
2006-05-17 15:14:51 +00:00
|
|
|
struct snd_info_entry *snd_seq_root;
|
2006-04-28 13:13:39 +00:00
|
|
|
EXPORT_SYMBOL(snd_seq_root);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#ifdef CONFIG_SND_OSSEMUL
|
2006-05-17 15:14:51 +00:00
|
|
|
struct snd_info_entry *snd_oss_root;
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif
|
|
|
|
|
2015-04-22 14:10:22 +00:00
|
|
|
static int alloc_info_private(struct snd_info_entry *entry,
|
|
|
|
struct snd_info_private_data **ret)
|
|
|
|
{
|
|
|
|
struct snd_info_private_data *data;
|
|
|
|
|
|
|
|
if (!entry || !entry->p)
|
|
|
|
return -ENODEV;
|
|
|
|
if (!try_module_get(entry->module))
|
|
|
|
return -EFAULT;
|
|
|
|
data = kzalloc(sizeof(*data), GFP_KERNEL);
|
|
|
|
if (!data) {
|
|
|
|
module_put(entry->module);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
data->entry = entry;
|
|
|
|
*ret = data;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool valid_pos(loff_t pos, size_t count)
|
|
|
|
{
|
|
|
|
if (pos < 0 || (long) pos != pos || (ssize_t) count < 0)
|
|
|
|
return false;
|
|
|
|
if ((unsigned long) pos + (unsigned long) count < (unsigned long) pos)
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* file ops for binary proc files
|
|
|
|
*/
|
2005-04-16 22:20:36 +00:00
|
|
|
static loff_t snd_info_entry_llseek(struct file *file, loff_t offset, int orig)
|
|
|
|
{
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_private_data *data;
|
2005-04-16 22:20:36 +00:00
|
|
|
struct snd_info_entry *entry;
|
2024-02-27 08:52:48 +00:00
|
|
|
loff_t size;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
data = file->private_data;
|
|
|
|
entry = data->entry;
|
2024-02-27 08:52:48 +00:00
|
|
|
guard(mutex)(&entry->access);
|
|
|
|
if (entry->c.ops->llseek)
|
|
|
|
return entry->c.ops->llseek(entry,
|
|
|
|
data->file_private_data,
|
|
|
|
file, offset, orig);
|
2015-04-22 14:10:22 +00:00
|
|
|
|
|
|
|
size = entry->size;
|
2010-04-13 09:39:47 +00:00
|
|
|
switch (orig) {
|
|
|
|
case SEEK_SET:
|
|
|
|
break;
|
|
|
|
case SEEK_CUR:
|
|
|
|
offset += file->f_pos;
|
2005-04-16 22:20:36 +00:00
|
|
|
break;
|
2010-04-13 09:39:47 +00:00
|
|
|
case SEEK_END:
|
|
|
|
if (!size)
|
2024-02-27 08:52:48 +00:00
|
|
|
return -EINVAL;
|
2010-04-13 09:39:47 +00:00
|
|
|
offset += size;
|
2005-04-16 22:20:36 +00:00
|
|
|
break;
|
2010-04-13 09:39:47 +00:00
|
|
|
default:
|
2024-02-27 08:52:48 +00:00
|
|
|
return -EINVAL;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2010-04-13 09:39:47 +00:00
|
|
|
if (offset < 0)
|
2024-02-27 08:52:48 +00:00
|
|
|
return -EINVAL;
|
2010-04-13 09:39:47 +00:00
|
|
|
if (size && offset > size)
|
|
|
|
offset = size;
|
|
|
|
file->f_pos = offset;
|
2024-02-27 08:52:48 +00:00
|
|
|
return offset;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t snd_info_entry_read(struct file *file, char __user *buffer,
|
|
|
|
size_t count, loff_t * offset)
|
|
|
|
{
|
2015-04-22 14:10:22 +00:00
|
|
|
struct snd_info_private_data *data = file->private_data;
|
|
|
|
struct snd_info_entry *entry = data->entry;
|
|
|
|
size_t size;
|
2005-04-16 22:20:36 +00:00
|
|
|
loff_t pos;
|
|
|
|
|
|
|
|
pos = *offset;
|
2015-04-22 14:10:22 +00:00
|
|
|
if (!valid_pos(pos, count))
|
2005-04-16 22:20:36 +00:00
|
|
|
return -EIO;
|
2015-04-22 14:10:22 +00:00
|
|
|
if (pos >= entry->size)
|
|
|
|
return 0;
|
|
|
|
size = entry->size - pos;
|
|
|
|
size = min(count, size);
|
|
|
|
size = entry->c.ops->read(entry, data->file_private_data,
|
|
|
|
file, buffer, size, pos);
|
2005-04-16 22:20:36 +00:00
|
|
|
if ((ssize_t) size > 0)
|
|
|
|
*offset = pos + size;
|
|
|
|
return size;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t snd_info_entry_write(struct file *file, const char __user *buffer,
|
|
|
|
size_t count, loff_t * offset)
|
|
|
|
{
|
2015-04-22 14:10:22 +00:00
|
|
|
struct snd_info_private_data *data = file->private_data;
|
|
|
|
struct snd_info_entry *entry = data->entry;
|
2006-04-28 13:13:40 +00:00
|
|
|
ssize_t size = 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
loff_t pos;
|
|
|
|
|
|
|
|
pos = *offset;
|
2015-04-22 14:10:22 +00:00
|
|
|
if (!valid_pos(pos, count))
|
2005-04-16 22:20:36 +00:00
|
|
|
return -EIO;
|
2015-04-22 14:10:22 +00:00
|
|
|
if (count > 0) {
|
|
|
|
size_t maxsize = entry->size - pos;
|
|
|
|
count = min(count, maxsize);
|
|
|
|
size = entry->c.ops->write(entry, data->file_private_data,
|
|
|
|
file, buffer, count, pos);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2015-04-22 14:10:22 +00:00
|
|
|
if (size > 0)
|
2005-04-16 22:20:36 +00:00
|
|
|
*offset = pos + size;
|
|
|
|
return size;
|
|
|
|
}
|
|
|
|
|
2017-07-03 03:27:36 +00:00
|
|
|
static __poll_t snd_info_entry_poll(struct file *file, poll_table *wait)
|
2015-04-22 14:10:22 +00:00
|
|
|
{
|
|
|
|
struct snd_info_private_data *data = file->private_data;
|
|
|
|
struct snd_info_entry *entry = data->entry;
|
2017-07-03 03:27:36 +00:00
|
|
|
__poll_t mask = 0;
|
2015-04-22 14:10:22 +00:00
|
|
|
|
|
|
|
if (entry->c.ops->poll)
|
|
|
|
return entry->c.ops->poll(entry,
|
|
|
|
data->file_private_data,
|
|
|
|
file, wait);
|
|
|
|
if (entry->c.ops->read)
|
2018-02-11 22:34:03 +00:00
|
|
|
mask |= EPOLLIN | EPOLLRDNORM;
|
2015-04-22 14:10:22 +00:00
|
|
|
if (entry->c.ops->write)
|
2018-02-11 22:34:03 +00:00
|
|
|
mask |= EPOLLOUT | EPOLLWRNORM;
|
2015-04-22 14:10:22 +00:00
|
|
|
return mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
static long snd_info_entry_ioctl(struct file *file, unsigned int cmd,
|
|
|
|
unsigned long arg)
|
|
|
|
{
|
|
|
|
struct snd_info_private_data *data = file->private_data;
|
|
|
|
struct snd_info_entry *entry = data->entry;
|
|
|
|
|
|
|
|
if (!entry->c.ops->ioctl)
|
|
|
|
return -ENOTTY;
|
|
|
|
return entry->c.ops->ioctl(entry, data->file_private_data,
|
|
|
|
file, cmd, arg);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int snd_info_entry_mmap(struct file *file, struct vm_area_struct *vma)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2015-04-22 14:10:22 +00:00
|
|
|
struct inode *inode = file_inode(file);
|
|
|
|
struct snd_info_private_data *data;
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_entry *entry;
|
2015-04-22 14:10:22 +00:00
|
|
|
|
|
|
|
data = file->private_data;
|
|
|
|
if (data == NULL)
|
|
|
|
return 0;
|
|
|
|
entry = data->entry;
|
|
|
|
if (!entry->c.ops->mmap)
|
|
|
|
return -ENXIO;
|
|
|
|
return entry->c.ops->mmap(entry, data->file_private_data,
|
|
|
|
inode, file, vma);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int snd_info_entry_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
2022-01-22 06:14:23 +00:00
|
|
|
struct snd_info_entry *entry = pde_data(inode);
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_private_data *data;
|
2005-04-16 22:20:36 +00:00
|
|
|
int mode, err;
|
|
|
|
|
2024-02-27 08:52:48 +00:00
|
|
|
guard(mutex)(&info_mutex);
|
2015-04-22 14:10:22 +00:00
|
|
|
err = alloc_info_private(entry, &data);
|
|
|
|
if (err < 0)
|
2024-02-27 08:52:48 +00:00
|
|
|
return err;
|
2015-04-22 14:10:22 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
mode = file->f_flags & O_ACCMODE;
|
2015-04-22 14:10:22 +00:00
|
|
|
if (((mode == O_RDONLY || mode == O_RDWR) && !entry->c.ops->read) ||
|
|
|
|
((mode == O_WRONLY || mode == O_RDWR) && !entry->c.ops->write)) {
|
|
|
|
err = -ENODEV;
|
|
|
|
goto error;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2015-04-22 14:10:22 +00:00
|
|
|
|
|
|
|
if (entry->c.ops->open) {
|
|
|
|
err = entry->c.ops->open(entry, mode, &data->file_private_data);
|
|
|
|
if (err < 0)
|
|
|
|
goto error;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2015-04-22 14:10:22 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
file->private_data = data;
|
|
|
|
return 0;
|
|
|
|
|
2015-04-22 14:10:22 +00:00
|
|
|
error:
|
2006-04-28 13:13:40 +00:00
|
|
|
kfree(data);
|
2005-04-16 22:20:36 +00:00
|
|
|
module_put(entry->module);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int snd_info_entry_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
2015-04-22 14:10:22 +00:00
|
|
|
struct snd_info_private_data *data = file->private_data;
|
|
|
|
struct snd_info_entry *entry = data->entry;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2015-04-22 14:10:22 +00:00
|
|
|
if (entry->c.ops->release)
|
|
|
|
entry->c.ops->release(entry, file->f_flags & O_ACCMODE,
|
|
|
|
data->file_private_data);
|
2005-04-16 22:20:36 +00:00
|
|
|
module_put(entry->module);
|
|
|
|
kfree(data);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-02-04 01:37:17 +00:00
|
|
|
static const struct proc_ops snd_info_entry_operations =
|
|
|
|
{
|
|
|
|
.proc_lseek = snd_info_entry_llseek,
|
|
|
|
.proc_read = snd_info_entry_read,
|
|
|
|
.proc_write = snd_info_entry_write,
|
|
|
|
.proc_poll = snd_info_entry_poll,
|
|
|
|
.proc_ioctl = snd_info_entry_ioctl,
|
|
|
|
.proc_mmap = snd_info_entry_mmap,
|
|
|
|
.proc_open = snd_info_entry_open,
|
|
|
|
.proc_release = snd_info_entry_release,
|
2015-04-22 14:10:22 +00:00
|
|
|
};
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2015-04-22 14:10:22 +00:00
|
|
|
/*
|
|
|
|
* file ops for text proc files
|
|
|
|
*/
|
|
|
|
static ssize_t snd_info_text_entry_write(struct file *file,
|
|
|
|
const char __user *buffer,
|
|
|
|
size_t count, loff_t *offset)
|
|
|
|
{
|
|
|
|
struct seq_file *m = file->private_data;
|
|
|
|
struct snd_info_private_data *data = m->private;
|
|
|
|
struct snd_info_entry *entry = data->entry;
|
|
|
|
struct snd_info_buffer *buf;
|
|
|
|
loff_t pos;
|
|
|
|
size_t next;
|
|
|
|
|
2016-10-30 21:13:19 +00:00
|
|
|
if (!entry->c.text.write)
|
|
|
|
return -EIO;
|
2015-04-22 14:10:22 +00:00
|
|
|
pos = *offset;
|
|
|
|
if (!valid_pos(pos, count))
|
|
|
|
return -EIO;
|
|
|
|
next = pos + count;
|
2016-10-30 21:18:45 +00:00
|
|
|
/* don't handle too large text inputs */
|
|
|
|
if (next > 16 * 1024)
|
|
|
|
return -EIO;
|
2024-02-27 08:52:48 +00:00
|
|
|
guard(mutex)(&entry->access);
|
2015-04-22 14:10:22 +00:00
|
|
|
buf = data->wbuffer;
|
|
|
|
if (!buf) {
|
|
|
|
data->wbuffer = buf = kzalloc(sizeof(*buf), GFP_KERNEL);
|
2024-02-27 08:52:48 +00:00
|
|
|
if (!buf)
|
|
|
|
return -ENOMEM;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2015-04-22 14:10:22 +00:00
|
|
|
if (next > buf->len) {
|
2017-05-22 15:39:13 +00:00
|
|
|
char *nbuf = kvzalloc(PAGE_ALIGN(next), GFP_KERNEL);
|
2024-02-27 08:52:48 +00:00
|
|
|
if (!nbuf)
|
|
|
|
return -ENOMEM;
|
2017-05-22 15:39:13 +00:00
|
|
|
kvfree(buf->buffer);
|
2015-04-22 14:10:22 +00:00
|
|
|
buf->buffer = nbuf;
|
|
|
|
buf->len = PAGE_ALIGN(next);
|
|
|
|
}
|
2024-02-27 08:52:48 +00:00
|
|
|
if (copy_from_user(buf->buffer + pos, buffer, count))
|
|
|
|
return -EFAULT;
|
2015-04-22 14:10:22 +00:00
|
|
|
buf->size = next;
|
|
|
|
*offset = next;
|
|
|
|
return count;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2015-04-22 14:10:22 +00:00
|
|
|
static int snd_info_seq_show(struct seq_file *seq, void *p)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2015-04-22 14:10:22 +00:00
|
|
|
struct snd_info_private_data *data = seq->private;
|
|
|
|
struct snd_info_entry *entry = data->entry;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2016-10-30 21:13:19 +00:00
|
|
|
if (!entry->c.text.read) {
|
|
|
|
return -EIO;
|
|
|
|
} else {
|
2015-04-22 14:10:22 +00:00
|
|
|
data->rbuffer->buffer = (char *)seq; /* XXX hack! */
|
|
|
|
entry->c.text.read(entry, data->rbuffer);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2015-04-22 14:10:22 +00:00
|
|
|
return 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2015-04-22 14:10:22 +00:00
|
|
|
static int snd_info_text_entry_open(struct inode *inode, struct file *file)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2022-01-22 06:14:23 +00:00
|
|
|
struct snd_info_entry *entry = pde_data(inode);
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_private_data *data;
|
2015-04-22 14:10:22 +00:00
|
|
|
int err;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2024-02-27 08:52:48 +00:00
|
|
|
guard(mutex)(&info_mutex);
|
2015-04-22 14:10:22 +00:00
|
|
|
err = alloc_info_private(entry, &data);
|
|
|
|
if (err < 0)
|
2024-02-27 08:52:48 +00:00
|
|
|
return err;
|
2015-04-22 14:10:22 +00:00
|
|
|
|
|
|
|
data->rbuffer = kzalloc(sizeof(*data->rbuffer), GFP_KERNEL);
|
|
|
|
if (!data->rbuffer) {
|
|
|
|
err = -ENOMEM;
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
if (entry->size)
|
|
|
|
err = single_open_size(file, snd_info_seq_show, data,
|
|
|
|
entry->size);
|
|
|
|
else
|
|
|
|
err = single_open(file, snd_info_seq_show, data);
|
|
|
|
if (err < 0)
|
|
|
|
goto error;
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
error:
|
|
|
|
kfree(data->rbuffer);
|
|
|
|
kfree(data);
|
|
|
|
module_put(entry->module);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int snd_info_text_entry_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
struct seq_file *m = file->private_data;
|
|
|
|
struct snd_info_private_data *data = m->private;
|
|
|
|
struct snd_info_entry *entry = data->entry;
|
|
|
|
|
|
|
|
if (data->wbuffer && entry->c.text.write)
|
|
|
|
entry->c.text.write(entry, data->wbuffer);
|
|
|
|
|
|
|
|
single_release(inode, file);
|
|
|
|
kfree(data->rbuffer);
|
|
|
|
if (data->wbuffer) {
|
2017-05-22 15:39:13 +00:00
|
|
|
kvfree(data->wbuffer->buffer);
|
2015-04-22 14:10:22 +00:00
|
|
|
kfree(data->wbuffer);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2015-04-22 14:10:22 +00:00
|
|
|
|
|
|
|
module_put(entry->module);
|
|
|
|
kfree(data);
|
|
|
|
return 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2020-02-04 01:37:17 +00:00
|
|
|
static const struct proc_ops snd_info_text_entry_ops =
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2020-02-04 01:37:17 +00:00
|
|
|
.proc_open = snd_info_text_entry_open,
|
|
|
|
.proc_release = snd_info_text_entry_release,
|
|
|
|
.proc_write = snd_info_text_entry_write,
|
|
|
|
.proc_lseek = seq_lseek,
|
|
|
|
.proc_read = seq_read,
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
2015-04-22 15:54:25 +00:00
|
|
|
static struct snd_info_entry *create_subdir(struct module *mod,
|
|
|
|
const char *name)
|
|
|
|
{
|
|
|
|
struct snd_info_entry *entry;
|
|
|
|
|
|
|
|
entry = snd_info_create_module_entry(mod, name, NULL);
|
|
|
|
if (!entry)
|
|
|
|
return NULL;
|
2018-05-23 19:20:59 +00:00
|
|
|
entry->mode = S_IFDIR | 0555;
|
2015-04-22 15:54:25 +00:00
|
|
|
if (snd_info_register(entry) < 0) {
|
|
|
|
snd_info_free_entry(entry);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return entry;
|
|
|
|
}
|
|
|
|
|
2015-05-18 07:43:30 +00:00
|
|
|
static struct snd_info_entry *
|
2019-02-05 15:17:48 +00:00
|
|
|
snd_info_create_entry(const char *name, struct snd_info_entry *parent,
|
|
|
|
struct module *module);
|
2015-04-22 20:14:41 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
int __init snd_info_init(void)
|
|
|
|
{
|
2019-02-05 15:17:48 +00:00
|
|
|
snd_proc_root = snd_info_create_entry("asound", NULL, THIS_MODULE);
|
2015-04-22 20:14:41 +00:00
|
|
|
if (!snd_proc_root)
|
2005-04-16 22:20:36 +00:00
|
|
|
return -ENOMEM;
|
2018-05-23 19:20:59 +00:00
|
|
|
snd_proc_root->mode = S_IFDIR | 0555;
|
2015-04-22 20:14:41 +00:00
|
|
|
snd_proc_root->p = proc_mkdir("asound", NULL);
|
|
|
|
if (!snd_proc_root->p)
|
|
|
|
goto error;
|
2005-04-16 22:20:36 +00:00
|
|
|
#ifdef CONFIG_SND_OSSEMUL
|
2015-04-22 15:54:25 +00:00
|
|
|
snd_oss_root = create_subdir(THIS_MODULE, "oss");
|
|
|
|
if (!snd_oss_root)
|
|
|
|
goto error;
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif
|
2014-02-10 08:48:47 +00:00
|
|
|
#if IS_ENABLED(CONFIG_SND_SEQUENCER)
|
2015-04-22 15:54:25 +00:00
|
|
|
snd_seq_root = create_subdir(THIS_MODULE, "seq");
|
|
|
|
if (!snd_seq_root)
|
|
|
|
goto error;
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif
|
2015-04-22 20:29:10 +00:00
|
|
|
if (snd_info_version_init() < 0 ||
|
|
|
|
snd_minor_info_init() < 0 ||
|
|
|
|
snd_minor_info_oss_init() < 0 ||
|
2015-04-23 08:56:21 +00:00
|
|
|
snd_card_info_init() < 0 ||
|
|
|
|
snd_info_minor_register() < 0)
|
2015-04-22 20:29:10 +00:00
|
|
|
goto error;
|
2005-04-16 22:20:36 +00:00
|
|
|
return 0;
|
2015-04-22 15:54:25 +00:00
|
|
|
|
|
|
|
error:
|
2015-04-22 20:14:41 +00:00
|
|
|
snd_info_free_entry(snd_proc_root);
|
2015-04-22 15:54:25 +00:00
|
|
|
return -ENOMEM;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int __exit snd_info_done(void)
|
|
|
|
{
|
2015-04-22 20:14:41 +00:00
|
|
|
snd_info_free_entry(snd_proc_root);
|
2005-04-16 22:20:36 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-02-05 15:26:06 +00:00
|
|
|
static void snd_card_id_read(struct snd_info_entry *entry,
|
|
|
|
struct snd_info_buffer *buffer)
|
|
|
|
{
|
|
|
|
struct snd_card *card = entry->private_data;
|
|
|
|
|
|
|
|
snd_iprintf(buffer, "%s\n", card->id);
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* create a card proc file
|
|
|
|
* called from init.c
|
|
|
|
*/
|
2005-11-17 12:58:48 +00:00
|
|
|
int snd_info_card_create(struct snd_card *card)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
char str[8];
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_entry *entry;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2008-08-08 15:09:09 +00:00
|
|
|
if (snd_BUG_ON(!card))
|
|
|
|
return -ENXIO;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
sprintf(str, "card%i", card->number);
|
2015-04-22 15:54:25 +00:00
|
|
|
entry = create_subdir(card->module, str);
|
|
|
|
if (!entry)
|
2005-04-16 22:20:36 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
card->proc_root = entry;
|
2019-02-05 15:26:06 +00:00
|
|
|
|
|
|
|
return snd_card_ro_proc_new(card, "id", card, snd_card_id_read);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* register the card proc file
|
|
|
|
* called from init.c
|
2015-05-18 07:20:24 +00:00
|
|
|
* can be called multiple times for reinitialization
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2005-11-17 12:58:48 +00:00
|
|
|
int snd_info_card_register(struct snd_card *card)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct proc_dir_entry *p;
|
2015-05-18 07:20:24 +00:00
|
|
|
int err;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2008-08-08 15:09:09 +00:00
|
|
|
if (snd_BUG_ON(!card))
|
|
|
|
return -ENXIO;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2019-02-05 11:31:42 +00:00
|
|
|
err = snd_info_register(card->proc_root);
|
2015-05-18 07:20:24 +00:00
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
if (!strcmp(card->id, card->proc_root->name))
|
|
|
|
return 0;
|
|
|
|
|
2015-05-18 07:20:24 +00:00
|
|
|
if (card->proc_root_link)
|
|
|
|
return 0;
|
2015-04-22 20:14:41 +00:00
|
|
|
p = proc_symlink(card->id, snd_proc_root->p, card->proc_root->name);
|
2015-05-18 07:20:24 +00:00
|
|
|
if (!p)
|
2005-04-16 22:20:36 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
card->proc_root_link = p;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-11-12 15:31:37 +00:00
|
|
|
/*
|
|
|
|
* called on card->id change
|
|
|
|
*/
|
|
|
|
void snd_info_card_id_change(struct snd_card *card)
|
|
|
|
{
|
2024-02-27 08:52:48 +00:00
|
|
|
guard(mutex)(&info_mutex);
|
2008-11-12 15:31:37 +00:00
|
|
|
if (card->proc_root_link) {
|
2013-04-12 16:27:28 +00:00
|
|
|
proc_remove(card->proc_root_link);
|
2008-11-12 15:31:37 +00:00
|
|
|
card->proc_root_link = NULL;
|
|
|
|
}
|
|
|
|
if (strcmp(card->id, card->proc_root->name))
|
|
|
|
card->proc_root_link = proc_symlink(card->id,
|
2015-04-22 20:14:41 +00:00
|
|
|
snd_proc_root->p,
|
2008-11-12 15:31:37 +00:00
|
|
|
card->proc_root->name);
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* de-register the card proc file
|
|
|
|
* called from init.c
|
|
|
|
*/
|
2006-06-23 12:37:59 +00:00
|
|
|
void snd_info_card_disconnect(struct snd_card *card)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2008-08-08 15:09:09 +00:00
|
|
|
if (!card)
|
|
|
|
return;
|
ALSA: info: Fix potential deadlock at disconnection
As reported recently, ALSA core info helper may cause a deadlock at
the forced device disconnection during the procfs operation.
The proc_remove() (that is called from the snd_card_disconnect()
helper) has a synchronization of the pending procfs accesses via
wait_for_completion(). Meanwhile, ALSA procfs helper takes the global
mutex_lock(&info_mutex) at both the proc_open callback and
snd_card_info_disconnect() helper. Since the proc_open can't finish
due to the mutex lock, wait_for_completion() never returns, either,
hence it deadlocks.
TASK#1 TASK#2
proc_reg_open()
takes use_pde()
snd_info_text_entry_open()
snd_card_disconnect()
snd_info_card_disconnect()
takes mutex_lock(&info_mutex)
proc_remove()
wait_for_completion(unused_pde)
... waiting task#1 closes
mutex_lock(&info_mutex)
=> DEADLOCK
This patch is a workaround for avoiding the deadlock scenario above.
The basic strategy is to move proc_remove() call outside the mutex
lock. proc_remove() can work gracefully without extra locking, and it
can delete the tree recursively alone. So, we call proc_remove() at
snd_info_card_disconnection() at first, then delete the rest resources
recursively within the info_mutex lock.
After the change, the function snd_info_disconnect() doesn't do
disconnection by itself any longer, but it merely clears the procfs
pointer. So rename the function to snd_info_clear_entries() for
avoiding confusion.
The similar change is applied to snd_info_free_entry(), too. Since
the proc_remove() is called only conditionally with the non-NULL
entry->p, it's skipped after the snd_info_clear_entries() call.
Reported-by: Shinhyung Kang <s47.kang@samsung.com>
Closes: https://lore.kernel.org/r/664457955.21699345385931.JavaMail.epsvc@epcpadp4
Reviewed-by: Jaroslav Kysela <perex@perex.cz>
Cc: <stable@vger.kernel.org>
Link: https://lore.kernel.org/r/20231109141954.4283-1-tiwai@suse.de
Signed-off-by: Takashi Iwai <tiwai@suse.de>
2023-11-09 14:19:54 +00:00
|
|
|
|
2013-04-12 16:27:28 +00:00
|
|
|
proc_remove(card->proc_root_link);
|
2006-06-23 12:37:59 +00:00
|
|
|
if (card->proc_root)
|
ALSA: info: Fix potential deadlock at disconnection
As reported recently, ALSA core info helper may cause a deadlock at
the forced device disconnection during the procfs operation.
The proc_remove() (that is called from the snd_card_disconnect()
helper) has a synchronization of the pending procfs accesses via
wait_for_completion(). Meanwhile, ALSA procfs helper takes the global
mutex_lock(&info_mutex) at both the proc_open callback and
snd_card_info_disconnect() helper. Since the proc_open can't finish
due to the mutex lock, wait_for_completion() never returns, either,
hence it deadlocks.
TASK#1 TASK#2
proc_reg_open()
takes use_pde()
snd_info_text_entry_open()
snd_card_disconnect()
snd_info_card_disconnect()
takes mutex_lock(&info_mutex)
proc_remove()
wait_for_completion(unused_pde)
... waiting task#1 closes
mutex_lock(&info_mutex)
=> DEADLOCK
This patch is a workaround for avoiding the deadlock scenario above.
The basic strategy is to move proc_remove() call outside the mutex
lock. proc_remove() can work gracefully without extra locking, and it
can delete the tree recursively alone. So, we call proc_remove() at
snd_info_card_disconnection() at first, then delete the rest resources
recursively within the info_mutex lock.
After the change, the function snd_info_disconnect() doesn't do
disconnection by itself any longer, but it merely clears the procfs
pointer. So rename the function to snd_info_clear_entries() for
avoiding confusion.
The similar change is applied to snd_info_free_entry(), too. Since
the proc_remove() is called only conditionally with the non-NULL
entry->p, it's skipped after the snd_info_clear_entries() call.
Reported-by: Shinhyung Kang <s47.kang@samsung.com>
Closes: https://lore.kernel.org/r/664457955.21699345385931.JavaMail.epsvc@epcpadp4
Reviewed-by: Jaroslav Kysela <perex@perex.cz>
Cc: <stable@vger.kernel.org>
Link: https://lore.kernel.org/r/20231109141954.4283-1-tiwai@suse.de
Signed-off-by: Takashi Iwai <tiwai@suse.de>
2023-11-09 14:19:54 +00:00
|
|
|
proc_remove(card->proc_root->p);
|
|
|
|
|
2024-02-27 08:52:48 +00:00
|
|
|
guard(mutex)(&info_mutex);
|
ALSA: info: Fix potential deadlock at disconnection
As reported recently, ALSA core info helper may cause a deadlock at
the forced device disconnection during the procfs operation.
The proc_remove() (that is called from the snd_card_disconnect()
helper) has a synchronization of the pending procfs accesses via
wait_for_completion(). Meanwhile, ALSA procfs helper takes the global
mutex_lock(&info_mutex) at both the proc_open callback and
snd_card_info_disconnect() helper. Since the proc_open can't finish
due to the mutex lock, wait_for_completion() never returns, either,
hence it deadlocks.
TASK#1 TASK#2
proc_reg_open()
takes use_pde()
snd_info_text_entry_open()
snd_card_disconnect()
snd_info_card_disconnect()
takes mutex_lock(&info_mutex)
proc_remove()
wait_for_completion(unused_pde)
... waiting task#1 closes
mutex_lock(&info_mutex)
=> DEADLOCK
This patch is a workaround for avoiding the deadlock scenario above.
The basic strategy is to move proc_remove() call outside the mutex
lock. proc_remove() can work gracefully without extra locking, and it
can delete the tree recursively alone. So, we call proc_remove() at
snd_info_card_disconnection() at first, then delete the rest resources
recursively within the info_mutex lock.
After the change, the function snd_info_disconnect() doesn't do
disconnection by itself any longer, but it merely clears the procfs
pointer. So rename the function to snd_info_clear_entries() for
avoiding confusion.
The similar change is applied to snd_info_free_entry(), too. Since
the proc_remove() is called only conditionally with the non-NULL
entry->p, it's skipped after the snd_info_clear_entries() call.
Reported-by: Shinhyung Kang <s47.kang@samsung.com>
Closes: https://lore.kernel.org/r/664457955.21699345385931.JavaMail.epsvc@epcpadp4
Reviewed-by: Jaroslav Kysela <perex@perex.cz>
Cc: <stable@vger.kernel.org>
Link: https://lore.kernel.org/r/20231109141954.4283-1-tiwai@suse.de
Signed-off-by: Takashi Iwai <tiwai@suse.de>
2023-11-09 14:19:54 +00:00
|
|
|
if (card->proc_root)
|
|
|
|
snd_info_clear_entries(card->proc_root);
|
|
|
|
card->proc_root_link = NULL;
|
|
|
|
card->proc_root = NULL;
|
2006-06-23 12:37:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* release the card proc file resources
|
|
|
|
* called from init.c
|
|
|
|
*/
|
|
|
|
int snd_info_card_free(struct snd_card *card)
|
|
|
|
{
|
2008-08-08 15:09:09 +00:00
|
|
|
if (!card)
|
|
|
|
return 0;
|
2006-06-23 12:37:59 +00:00
|
|
|
snd_info_free_entry(card->proc_root);
|
|
|
|
card->proc_root = NULL;
|
2005-04-16 22:20:36 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* snd_info_get_line - read one line from the procfs buffer
|
|
|
|
* @buffer: the procfs buffer
|
|
|
|
* @line: the buffer to store
|
2014-08-21 18:55:21 +00:00
|
|
|
* @len: the max. buffer size
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
* Reads one line from the buffer and stores the string.
|
|
|
|
*
|
2013-03-11 21:05:14 +00:00
|
|
|
* Return: Zero if successful, or 1 if error or EOF.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2005-11-17 12:58:48 +00:00
|
|
|
int snd_info_get_line(struct snd_info_buffer *buffer, char *line, int len)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2020-02-08 22:42:06 +00:00
|
|
|
int c;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2020-07-17 08:40:23 +00:00
|
|
|
if (snd_BUG_ON(!buffer))
|
|
|
|
return 1;
|
|
|
|
if (!buffer->buffer)
|
2013-03-13 11:11:13 +00:00
|
|
|
return 1;
|
2005-04-16 22:20:36 +00:00
|
|
|
if (len <= 0 || buffer->stop || buffer->error)
|
|
|
|
return 1;
|
2013-03-13 11:11:13 +00:00
|
|
|
while (!buffer->stop) {
|
2006-04-28 13:13:40 +00:00
|
|
|
c = buffer->buffer[buffer->curr++];
|
2013-03-13 11:11:13 +00:00
|
|
|
if (buffer->curr >= buffer->size)
|
2005-04-16 22:20:36 +00:00
|
|
|
buffer->stop = 1;
|
2013-03-13 11:11:13 +00:00
|
|
|
if (c == '\n')
|
2005-04-16 22:20:36 +00:00
|
|
|
break;
|
2014-08-21 18:55:21 +00:00
|
|
|
if (len > 1) {
|
2013-03-13 11:11:13 +00:00
|
|
|
len--;
|
|
|
|
*line++ = c;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
*line = '\0';
|
|
|
|
return 0;
|
|
|
|
}
|
2006-04-28 13:13:39 +00:00
|
|
|
EXPORT_SYMBOL(snd_info_get_line);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/**
|
2005-07-08 11:53:42 +00:00
|
|
|
* snd_info_get_str - parse a string token
|
2005-04-16 22:20:36 +00:00
|
|
|
* @dest: the buffer to store the string token
|
|
|
|
* @src: the original string
|
|
|
|
* @len: the max. length of token - 1
|
|
|
|
*
|
|
|
|
* Parses the original string and copy a token to the given
|
|
|
|
* string buffer.
|
|
|
|
*
|
2013-03-11 21:05:14 +00:00
|
|
|
* Return: The updated pointer of the original string so that
|
2005-04-16 22:20:36 +00:00
|
|
|
* it can be used for the next call.
|
|
|
|
*/
|
2009-09-08 12:29:58 +00:00
|
|
|
const char *snd_info_get_str(char *dest, const char *src, int len)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
int c;
|
|
|
|
|
|
|
|
while (*src == ' ' || *src == '\t')
|
|
|
|
src++;
|
|
|
|
if (*src == '"' || *src == '\'') {
|
|
|
|
c = *src++;
|
|
|
|
while (--len > 0 && *src && *src != c) {
|
|
|
|
*dest++ = *src++;
|
|
|
|
}
|
|
|
|
if (*src == c)
|
|
|
|
src++;
|
|
|
|
} else {
|
|
|
|
while (--len > 0 && *src && *src != ' ' && *src != '\t') {
|
|
|
|
*dest++ = *src++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*dest = 0;
|
|
|
|
while (*src == ' ' || *src == '\t')
|
|
|
|
src++;
|
|
|
|
return src;
|
|
|
|
}
|
2006-04-28 13:13:39 +00:00
|
|
|
EXPORT_SYMBOL(snd_info_get_str);
|
|
|
|
|
2015-05-18 07:45:11 +00:00
|
|
|
/*
|
2005-04-16 22:20:36 +00:00
|
|
|
* snd_info_create_entry - create an info entry
|
|
|
|
* @name: the proc file name
|
2015-05-18 07:43:30 +00:00
|
|
|
* @parent: the parent directory
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
* Creates an info entry with the given file name and initializes as
|
|
|
|
* the default state.
|
|
|
|
*
|
|
|
|
* Usually called from other functions such as
|
|
|
|
* snd_info_create_card_entry().
|
|
|
|
*
|
2013-03-11 21:05:14 +00:00
|
|
|
* Return: The pointer of the new instance, or %NULL on failure.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2015-05-18 07:43:30 +00:00
|
|
|
static struct snd_info_entry *
|
2019-02-05 15:17:48 +00:00
|
|
|
snd_info_create_entry(const char *name, struct snd_info_entry *parent,
|
|
|
|
struct module *module)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_entry *entry;
|
2005-09-09 12:20:23 +00:00
|
|
|
entry = kzalloc(sizeof(*entry), GFP_KERNEL);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (entry == NULL)
|
|
|
|
return NULL;
|
2005-06-23 07:09:02 +00:00
|
|
|
entry->name = kstrdup(name, GFP_KERNEL);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (entry->name == NULL) {
|
|
|
|
kfree(entry);
|
|
|
|
return NULL;
|
|
|
|
}
|
2018-05-23 19:20:59 +00:00
|
|
|
entry->mode = S_IFREG | 0444;
|
2005-04-16 22:20:36 +00:00
|
|
|
entry->content = SNDRV_INFO_CONTENT_TEXT;
|
2006-01-16 15:29:08 +00:00
|
|
|
mutex_init(&entry->access);
|
2006-06-23 12:37:59 +00:00
|
|
|
INIT_LIST_HEAD(&entry->children);
|
|
|
|
INIT_LIST_HEAD(&entry->list);
|
2015-05-18 07:43:30 +00:00
|
|
|
entry->parent = parent;
|
2019-02-05 15:17:48 +00:00
|
|
|
entry->module = module;
|
2019-04-16 13:25:00 +00:00
|
|
|
if (parent) {
|
2024-02-27 08:52:48 +00:00
|
|
|
guard(mutex)(&parent->access);
|
2015-05-18 07:43:30 +00:00
|
|
|
list_add_tail(&entry->list, &parent->children);
|
2019-04-16 13:25:00 +00:00
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
return entry;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* snd_info_create_module_entry - create an info entry for the given module
|
|
|
|
* @module: the module pointer
|
|
|
|
* @name: the file name
|
|
|
|
* @parent: the parent directory
|
|
|
|
*
|
|
|
|
* Creates a new info entry and assigns it to the given module.
|
|
|
|
*
|
2013-03-11 21:05:14 +00:00
|
|
|
* Return: The pointer of the new instance, or %NULL on failure.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_entry *snd_info_create_module_entry(struct module * module,
|
2005-04-16 22:20:36 +00:00
|
|
|
const char *name,
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_entry *parent)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2019-01-23 16:59:40 +00:00
|
|
|
if (!parent)
|
|
|
|
parent = snd_proc_root;
|
2019-02-05 15:17:48 +00:00
|
|
|
return snd_info_create_entry(name, parent, module);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2006-04-28 13:13:39 +00:00
|
|
|
EXPORT_SYMBOL(snd_info_create_module_entry);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/**
|
|
|
|
* snd_info_create_card_entry - create an info entry for the given card
|
|
|
|
* @card: the card instance
|
|
|
|
* @name: the file name
|
|
|
|
* @parent: the parent directory
|
|
|
|
*
|
|
|
|
* Creates a new info entry and assigns it to the given card.
|
|
|
|
*
|
2013-03-11 21:05:14 +00:00
|
|
|
* Return: The pointer of the new instance, or %NULL on failure.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_entry *snd_info_create_card_entry(struct snd_card *card,
|
2005-04-16 22:20:36 +00:00
|
|
|
const char *name,
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_entry * parent)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2019-01-23 16:59:40 +00:00
|
|
|
if (!parent)
|
|
|
|
parent = card->proc_root;
|
2019-02-05 15:17:48 +00:00
|
|
|
return snd_info_create_entry(name, parent, card->module);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2006-04-28 13:13:39 +00:00
|
|
|
EXPORT_SYMBOL(snd_info_create_card_entry);
|
|
|
|
|
ALSA: info: Fix potential deadlock at disconnection
As reported recently, ALSA core info helper may cause a deadlock at
the forced device disconnection during the procfs operation.
The proc_remove() (that is called from the snd_card_disconnect()
helper) has a synchronization of the pending procfs accesses via
wait_for_completion(). Meanwhile, ALSA procfs helper takes the global
mutex_lock(&info_mutex) at both the proc_open callback and
snd_card_info_disconnect() helper. Since the proc_open can't finish
due to the mutex lock, wait_for_completion() never returns, either,
hence it deadlocks.
TASK#1 TASK#2
proc_reg_open()
takes use_pde()
snd_info_text_entry_open()
snd_card_disconnect()
snd_info_card_disconnect()
takes mutex_lock(&info_mutex)
proc_remove()
wait_for_completion(unused_pde)
... waiting task#1 closes
mutex_lock(&info_mutex)
=> DEADLOCK
This patch is a workaround for avoiding the deadlock scenario above.
The basic strategy is to move proc_remove() call outside the mutex
lock. proc_remove() can work gracefully without extra locking, and it
can delete the tree recursively alone. So, we call proc_remove() at
snd_info_card_disconnection() at first, then delete the rest resources
recursively within the info_mutex lock.
After the change, the function snd_info_disconnect() doesn't do
disconnection by itself any longer, but it merely clears the procfs
pointer. So rename the function to snd_info_clear_entries() for
avoiding confusion.
The similar change is applied to snd_info_free_entry(), too. Since
the proc_remove() is called only conditionally with the non-NULL
entry->p, it's skipped after the snd_info_clear_entries() call.
Reported-by: Shinhyung Kang <s47.kang@samsung.com>
Closes: https://lore.kernel.org/r/664457955.21699345385931.JavaMail.epsvc@epcpadp4
Reviewed-by: Jaroslav Kysela <perex@perex.cz>
Cc: <stable@vger.kernel.org>
Link: https://lore.kernel.org/r/20231109141954.4283-1-tiwai@suse.de
Signed-off-by: Takashi Iwai <tiwai@suse.de>
2023-11-09 14:19:54 +00:00
|
|
|
static void snd_info_clear_entries(struct snd_info_entry *entry)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2015-05-18 06:59:12 +00:00
|
|
|
struct snd_info_entry *p;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2015-04-22 16:26:38 +00:00
|
|
|
if (!entry->p)
|
2006-06-23 12:37:59 +00:00
|
|
|
return;
|
2015-05-18 06:59:12 +00:00
|
|
|
list_for_each_entry(p, &entry->children, list)
|
ALSA: info: Fix potential deadlock at disconnection
As reported recently, ALSA core info helper may cause a deadlock at
the forced device disconnection during the procfs operation.
The proc_remove() (that is called from the snd_card_disconnect()
helper) has a synchronization of the pending procfs accesses via
wait_for_completion(). Meanwhile, ALSA procfs helper takes the global
mutex_lock(&info_mutex) at both the proc_open callback and
snd_card_info_disconnect() helper. Since the proc_open can't finish
due to the mutex lock, wait_for_completion() never returns, either,
hence it deadlocks.
TASK#1 TASK#2
proc_reg_open()
takes use_pde()
snd_info_text_entry_open()
snd_card_disconnect()
snd_info_card_disconnect()
takes mutex_lock(&info_mutex)
proc_remove()
wait_for_completion(unused_pde)
... waiting task#1 closes
mutex_lock(&info_mutex)
=> DEADLOCK
This patch is a workaround for avoiding the deadlock scenario above.
The basic strategy is to move proc_remove() call outside the mutex
lock. proc_remove() can work gracefully without extra locking, and it
can delete the tree recursively alone. So, we call proc_remove() at
snd_info_card_disconnection() at first, then delete the rest resources
recursively within the info_mutex lock.
After the change, the function snd_info_disconnect() doesn't do
disconnection by itself any longer, but it merely clears the procfs
pointer. So rename the function to snd_info_clear_entries() for
avoiding confusion.
The similar change is applied to snd_info_free_entry(), too. Since
the proc_remove() is called only conditionally with the non-NULL
entry->p, it's skipped after the snd_info_clear_entries() call.
Reported-by: Shinhyung Kang <s47.kang@samsung.com>
Closes: https://lore.kernel.org/r/664457955.21699345385931.JavaMail.epsvc@epcpadp4
Reviewed-by: Jaroslav Kysela <perex@perex.cz>
Cc: <stable@vger.kernel.org>
Link: https://lore.kernel.org/r/20231109141954.4283-1-tiwai@suse.de
Signed-off-by: Takashi Iwai <tiwai@suse.de>
2023-11-09 14:19:54 +00:00
|
|
|
snd_info_clear_entries(p);
|
2006-06-23 12:37:59 +00:00
|
|
|
entry->p = NULL;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* snd_info_free_entry - release the info entry
|
|
|
|
* @entry: the info entry
|
|
|
|
*
|
2015-04-22 16:26:38 +00:00
|
|
|
* Releases the info entry.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2005-11-17 12:58:48 +00:00
|
|
|
void snd_info_free_entry(struct snd_info_entry * entry)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2015-04-22 16:26:38 +00:00
|
|
|
struct snd_info_entry *p, *n;
|
|
|
|
|
|
|
|
if (!entry)
|
2005-04-16 22:20:36 +00:00
|
|
|
return;
|
2006-06-23 12:37:59 +00:00
|
|
|
if (entry->p) {
|
ALSA: info: Fix potential deadlock at disconnection
As reported recently, ALSA core info helper may cause a deadlock at
the forced device disconnection during the procfs operation.
The proc_remove() (that is called from the snd_card_disconnect()
helper) has a synchronization of the pending procfs accesses via
wait_for_completion(). Meanwhile, ALSA procfs helper takes the global
mutex_lock(&info_mutex) at both the proc_open callback and
snd_card_info_disconnect() helper. Since the proc_open can't finish
due to the mutex lock, wait_for_completion() never returns, either,
hence it deadlocks.
TASK#1 TASK#2
proc_reg_open()
takes use_pde()
snd_info_text_entry_open()
snd_card_disconnect()
snd_info_card_disconnect()
takes mutex_lock(&info_mutex)
proc_remove()
wait_for_completion(unused_pde)
... waiting task#1 closes
mutex_lock(&info_mutex)
=> DEADLOCK
This patch is a workaround for avoiding the deadlock scenario above.
The basic strategy is to move proc_remove() call outside the mutex
lock. proc_remove() can work gracefully without extra locking, and it
can delete the tree recursively alone. So, we call proc_remove() at
snd_info_card_disconnection() at first, then delete the rest resources
recursively within the info_mutex lock.
After the change, the function snd_info_disconnect() doesn't do
disconnection by itself any longer, but it merely clears the procfs
pointer. So rename the function to snd_info_clear_entries() for
avoiding confusion.
The similar change is applied to snd_info_free_entry(), too. Since
the proc_remove() is called only conditionally with the non-NULL
entry->p, it's skipped after the snd_info_clear_entries() call.
Reported-by: Shinhyung Kang <s47.kang@samsung.com>
Closes: https://lore.kernel.org/r/664457955.21699345385931.JavaMail.epsvc@epcpadp4
Reviewed-by: Jaroslav Kysela <perex@perex.cz>
Cc: <stable@vger.kernel.org>
Link: https://lore.kernel.org/r/20231109141954.4283-1-tiwai@suse.de
Signed-off-by: Takashi Iwai <tiwai@suse.de>
2023-11-09 14:19:54 +00:00
|
|
|
proc_remove(entry->p);
|
2024-02-27 08:52:48 +00:00
|
|
|
guard(mutex)(&info_mutex);
|
ALSA: info: Fix potential deadlock at disconnection
As reported recently, ALSA core info helper may cause a deadlock at
the forced device disconnection during the procfs operation.
The proc_remove() (that is called from the snd_card_disconnect()
helper) has a synchronization of the pending procfs accesses via
wait_for_completion(). Meanwhile, ALSA procfs helper takes the global
mutex_lock(&info_mutex) at both the proc_open callback and
snd_card_info_disconnect() helper. Since the proc_open can't finish
due to the mutex lock, wait_for_completion() never returns, either,
hence it deadlocks.
TASK#1 TASK#2
proc_reg_open()
takes use_pde()
snd_info_text_entry_open()
snd_card_disconnect()
snd_info_card_disconnect()
takes mutex_lock(&info_mutex)
proc_remove()
wait_for_completion(unused_pde)
... waiting task#1 closes
mutex_lock(&info_mutex)
=> DEADLOCK
This patch is a workaround for avoiding the deadlock scenario above.
The basic strategy is to move proc_remove() call outside the mutex
lock. proc_remove() can work gracefully without extra locking, and it
can delete the tree recursively alone. So, we call proc_remove() at
snd_info_card_disconnection() at first, then delete the rest resources
recursively within the info_mutex lock.
After the change, the function snd_info_disconnect() doesn't do
disconnection by itself any longer, but it merely clears the procfs
pointer. So rename the function to snd_info_clear_entries() for
avoiding confusion.
The similar change is applied to snd_info_free_entry(), too. Since
the proc_remove() is called only conditionally with the non-NULL
entry->p, it's skipped after the snd_info_clear_entries() call.
Reported-by: Shinhyung Kang <s47.kang@samsung.com>
Closes: https://lore.kernel.org/r/664457955.21699345385931.JavaMail.epsvc@epcpadp4
Reviewed-by: Jaroslav Kysela <perex@perex.cz>
Cc: <stable@vger.kernel.org>
Link: https://lore.kernel.org/r/20231109141954.4283-1-tiwai@suse.de
Signed-off-by: Takashi Iwai <tiwai@suse.de>
2023-11-09 14:19:54 +00:00
|
|
|
snd_info_clear_entries(entry);
|
2006-06-23 12:37:59 +00:00
|
|
|
}
|
2015-04-22 16:26:38 +00:00
|
|
|
|
|
|
|
/* free all children at first */
|
|
|
|
list_for_each_entry_safe(p, n, &entry->children, list)
|
|
|
|
snd_info_free_entry(p);
|
|
|
|
|
2019-04-16 13:25:00 +00:00
|
|
|
p = entry->parent;
|
|
|
|
if (p) {
|
2024-02-27 08:52:48 +00:00
|
|
|
guard(mutex)(&p->access);
|
2019-04-16 13:25:00 +00:00
|
|
|
list_del(&entry->list);
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
kfree(entry->name);
|
|
|
|
if (entry->private_free)
|
|
|
|
entry->private_free(entry);
|
|
|
|
kfree(entry);
|
|
|
|
}
|
2006-04-28 13:13:39 +00:00
|
|
|
EXPORT_SYMBOL(snd_info_free_entry);
|
|
|
|
|
2019-02-05 11:31:42 +00:00
|
|
|
static int __snd_info_register(struct snd_info_entry *entry)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct proc_dir_entry *root, *p = NULL;
|
|
|
|
|
2008-08-08 15:09:09 +00:00
|
|
|
if (snd_BUG_ON(!entry))
|
|
|
|
return -ENXIO;
|
2015-04-22 20:14:41 +00:00
|
|
|
root = entry->parent == NULL ? snd_proc_root->p : entry->parent->p;
|
2024-02-27 08:52:48 +00:00
|
|
|
guard(mutex)(&info_mutex);
|
2019-02-05 11:31:42 +00:00
|
|
|
if (entry->p || !root)
|
2024-02-27 08:52:48 +00:00
|
|
|
return 0;
|
2013-03-29 03:01:34 +00:00
|
|
|
if (S_ISDIR(entry->mode)) {
|
|
|
|
p = proc_mkdir_mode(entry->name, entry->mode, root);
|
2024-02-27 08:52:48 +00:00
|
|
|
if (!p)
|
2013-03-29 03:01:34 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
} else {
|
2020-02-04 01:37:17 +00:00
|
|
|
const struct proc_ops *ops;
|
2015-04-22 14:10:22 +00:00
|
|
|
if (entry->content == SNDRV_INFO_CONTENT_DATA)
|
|
|
|
ops = &snd_info_entry_operations;
|
|
|
|
else
|
|
|
|
ops = &snd_info_text_entry_ops;
|
2013-03-29 03:01:34 +00:00
|
|
|
p = proc_create_data(entry->name, entry->mode, root,
|
2015-04-22 14:10:22 +00:00
|
|
|
ops, entry);
|
2024-02-27 08:52:48 +00:00
|
|
|
if (!p)
|
2013-03-29 03:01:34 +00:00
|
|
|
return -ENOMEM;
|
2013-04-11 23:38:51 +00:00
|
|
|
proc_set_size(p, entry->size);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
entry->p = p;
|
|
|
|
return 0;
|
|
|
|
}
|
2019-02-05 11:31:42 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* snd_info_register - register the info entry
|
|
|
|
* @entry: the info entry
|
|
|
|
*
|
|
|
|
* Registers the proc info entry.
|
|
|
|
* The all children entries are registered recursively.
|
|
|
|
*
|
|
|
|
* Return: Zero if successful, or a negative error code on failure.
|
|
|
|
*/
|
|
|
|
int snd_info_register(struct snd_info_entry *entry)
|
|
|
|
{
|
|
|
|
struct snd_info_entry *p;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
if (!entry->p) {
|
|
|
|
err = __snd_info_register(entry);
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
list_for_each_entry(p, &entry->children, list) {
|
|
|
|
err = snd_info_register(p);
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2006-04-28 13:13:39 +00:00
|
|
|
EXPORT_SYMBOL(snd_info_register);
|
|
|
|
|
2019-02-04 13:53:04 +00:00
|
|
|
/**
|
|
|
|
* snd_card_rw_proc_new - Create a read/write text proc file entry for the card
|
|
|
|
* @card: the card instance
|
|
|
|
* @name: the file name
|
|
|
|
* @private_data: the arbitrary private data
|
|
|
|
* @read: the read callback
|
|
|
|
* @write: the write callback, NULL for read-only
|
|
|
|
*
|
|
|
|
* This proc file entry will be registered via snd_card_register() call, and
|
|
|
|
* it will be removed automatically at the card removal, too.
|
2022-07-13 10:47:59 +00:00
|
|
|
*
|
|
|
|
* Return: zero if successful, or a negative error code
|
2019-02-04 13:53:04 +00:00
|
|
|
*/
|
|
|
|
int snd_card_rw_proc_new(struct snd_card *card, const char *name,
|
|
|
|
void *private_data,
|
|
|
|
void (*read)(struct snd_info_entry *,
|
|
|
|
struct snd_info_buffer *),
|
|
|
|
void (*write)(struct snd_info_entry *entry,
|
|
|
|
struct snd_info_buffer *buffer))
|
|
|
|
{
|
|
|
|
struct snd_info_entry *entry;
|
|
|
|
|
|
|
|
entry = snd_info_create_card_entry(card, name, card->proc_root);
|
|
|
|
if (!entry)
|
|
|
|
return -ENOMEM;
|
|
|
|
snd_info_set_text_ops(entry, private_data, read);
|
|
|
|
if (write) {
|
|
|
|
entry->mode |= 0200;
|
|
|
|
entry->c.text.write = write;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(snd_card_rw_proc_new);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
2005-11-17 12:58:48 +00:00
|
|
|
static void snd_info_version_read(struct snd_info_entry *entry, struct snd_info_buffer *buffer)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
snd_iprintf(buffer,
|
2012-09-04 09:21:45 +00:00
|
|
|
"Advanced Linux Sound Architecture Driver Version k%s.\n",
|
|
|
|
init_utsname()->release);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int __init snd_info_version_init(void)
|
|
|
|
{
|
2005-11-17 12:58:48 +00:00
|
|
|
struct snd_info_entry *entry;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
entry = snd_info_create_module_entry(THIS_MODULE, "version", NULL);
|
|
|
|
if (entry == NULL)
|
|
|
|
return -ENOMEM;
|
|
|
|
entry->c.text.read = snd_info_version_read;
|
2015-04-22 20:29:10 +00:00
|
|
|
return snd_info_register(entry); /* freed in error path */
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|