License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 14:07:57 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* linux/fs/char_dev.c
|
|
|
|
*
|
|
|
|
* Copyright (C) 1991, 1992 Linus Torvalds
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/fs.h>
|
2007-02-20 21:57:48 +00:00
|
|
|
#include <linux/kdev_t.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
|
|
|
|
#include <linux/major.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/module.h>
|
2006-03-31 10:30:32 +00:00
|
|
|
#include <linux/seq_file.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
#include <linux/kobject.h>
|
|
|
|
#include <linux/kobj_map.h>
|
|
|
|
#include <linux/cdev.h>
|
2006-02-06 22:12:43 +00:00
|
|
|
#include <linux/mutex.h>
|
2006-09-27 08:50:16 +00:00
|
|
|
#include <linux/backing-dev.h>
|
2010-08-06 15:34:43 +00:00
|
|
|
#include <linux/tty.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2006-09-30 18:52:18 +00:00
|
|
|
#include "internal.h"
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
static struct kobj_map *cdev_map;
|
|
|
|
|
2006-02-06 22:12:43 +00:00
|
|
|
static DEFINE_MUTEX(chrdevs_lock);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2017-06-15 20:05:21 +00:00
|
|
|
#define CHRDEV_MAJOR_HASH_SIZE 255
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
static struct char_device_struct {
|
|
|
|
struct char_device_struct *next;
|
|
|
|
unsigned int major;
|
|
|
|
unsigned int baseminor;
|
|
|
|
int minorct;
|
2006-01-14 21:20:38 +00:00
|
|
|
char name[64];
|
2005-04-16 22:20:36 +00:00
|
|
|
struct cdev *cdev; /* will die */
|
2006-03-31 10:30:32 +00:00
|
|
|
} *chrdevs[CHRDEV_MAJOR_HASH_SIZE];
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/* index in the above */
|
2010-12-17 08:00:18 +00:00
|
|
|
static inline int major_to_index(unsigned major)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2006-03-31 10:30:32 +00:00
|
|
|
return major % CHRDEV_MAJOR_HASH_SIZE;
|
2006-01-14 21:20:38 +00:00
|
|
|
}
|
|
|
|
|
2006-03-31 10:30:32 +00:00
|
|
|
#ifdef CONFIG_PROC_FS
|
2006-01-14 21:20:38 +00:00
|
|
|
|
2006-03-31 10:30:32 +00:00
|
|
|
void chrdev_show(struct seq_file *f, off_t offset)
|
2006-01-14 21:20:38 +00:00
|
|
|
{
|
|
|
|
struct char_device_struct *cd;
|
|
|
|
|
2017-06-15 20:05:21 +00:00
|
|
|
mutex_lock(&chrdevs_lock);
|
|
|
|
for (cd = chrdevs[major_to_index(offset)]; cd; cd = cd->next) {
|
|
|
|
if (cd->major == offset)
|
2006-03-31 10:30:32 +00:00
|
|
|
seq_printf(f, "%3d %s\n", cd->major, cd->name);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2017-06-15 20:05:21 +00:00
|
|
|
mutex_unlock(&chrdevs_lock);
|
2006-01-14 21:20:38 +00:00
|
|
|
}
|
|
|
|
|
2006-03-31 10:30:32 +00:00
|
|
|
#endif /* CONFIG_PROC_FS */
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2017-06-15 20:05:20 +00:00
|
|
|
static int find_dynamic_major(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct char_device_struct *cd;
|
|
|
|
|
2018-02-06 02:25:09 +00:00
|
|
|
for (i = ARRAY_SIZE(chrdevs)-1; i >= CHRDEV_MAJOR_DYN_END; i--) {
|
2017-06-15 20:05:20 +00:00
|
|
|
if (chrdevs[i] == NULL)
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = CHRDEV_MAJOR_DYN_EXT_START;
|
2018-02-06 02:25:09 +00:00
|
|
|
i >= CHRDEV_MAJOR_DYN_EXT_END; i--) {
|
2017-06-15 20:05:20 +00:00
|
|
|
for (cd = chrdevs[major_to_index(i)]; cd; cd = cd->next)
|
|
|
|
if (cd->major == i)
|
|
|
|
break;
|
|
|
|
|
2018-02-06 02:25:09 +00:00
|
|
|
if (cd == NULL)
|
2017-06-15 20:05:20 +00:00
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
return -EBUSY;
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Register a single major with a specified minor range.
|
|
|
|
*
|
2019-02-15 12:27:14 +00:00
|
|
|
* If major == 0 this function will dynamically allocate an unused major.
|
|
|
|
* If major > 0 this function will attempt to reserve the range of minors
|
|
|
|
* with given major.
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
static struct char_device_struct *
|
|
|
|
__register_chrdev_region(unsigned int major, unsigned int baseminor,
|
|
|
|
int minorct, const char *name)
|
|
|
|
{
|
2019-02-15 12:27:13 +00:00
|
|
|
struct char_device_struct *cd, *curr, *prev = NULL;
|
2019-05-02 12:15:05 +00:00
|
|
|
int ret;
|
2005-04-16 22:20:36 +00:00
|
|
|
int i;
|
|
|
|
|
2019-02-15 12:27:13 +00:00
|
|
|
if (major >= CHRDEV_MAJOR_MAX) {
|
|
|
|
pr_err("CHRDEV \"%s\" major requested (%u) is greater than the maximum (%u)\n",
|
|
|
|
name, major, CHRDEV_MAJOR_MAX-1);
|
|
|
|
return ERR_PTR(-EINVAL);
|
|
|
|
}
|
|
|
|
|
2019-02-15 12:27:12 +00:00
|
|
|
if (minorct > MINORMASK + 1 - baseminor) {
|
|
|
|
pr_err("CHRDEV \"%s\" minor range requested (%u-%u) is out of range of maximum range (%u-%u) for a single major\n",
|
|
|
|
name, baseminor, baseminor + minorct - 1, 0, MINORMASK);
|
|
|
|
return ERR_PTR(-EINVAL);
|
|
|
|
}
|
|
|
|
|
2006-03-25 11:08:13 +00:00
|
|
|
cd = kzalloc(sizeof(struct char_device_struct), GFP_KERNEL);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (cd == NULL)
|
|
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
|
2006-02-06 22:12:43 +00:00
|
|
|
mutex_lock(&chrdevs_lock);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
if (major == 0) {
|
2017-06-15 20:05:20 +00:00
|
|
|
ret = find_dynamic_major();
|
|
|
|
if (ret < 0) {
|
|
|
|
pr_err("CHRDEV \"%s\" dynamic allocation region is full\n",
|
|
|
|
name);
|
2005-04-16 22:20:36 +00:00
|
|
|
goto out;
|
|
|
|
}
|
2017-06-15 20:05:20 +00:00
|
|
|
major = ret;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2019-05-02 12:15:05 +00:00
|
|
|
ret = -EBUSY;
|
2005-04-16 22:20:36 +00:00
|
|
|
i = major_to_index(major);
|
2019-02-15 12:27:13 +00:00
|
|
|
for (curr = chrdevs[i]; curr; prev = curr, curr = curr->next) {
|
|
|
|
if (curr->major < major)
|
|
|
|
continue;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2019-02-15 12:27:13 +00:00
|
|
|
if (curr->major > major)
|
2005-04-16 22:20:36 +00:00
|
|
|
break;
|
2006-09-29 09:00:08 +00:00
|
|
|
|
2019-02-15 12:27:13 +00:00
|
|
|
if (curr->baseminor + curr->minorct <= baseminor)
|
|
|
|
continue;
|
2006-09-29 09:00:08 +00:00
|
|
|
|
2019-02-15 12:27:13 +00:00
|
|
|
if (curr->baseminor >= baseminor + minorct)
|
|
|
|
break;
|
2006-09-29 09:00:08 +00:00
|
|
|
|
2019-02-15 12:27:13 +00:00
|
|
|
goto out;
|
|
|
|
}
|
2019-02-15 12:27:11 +00:00
|
|
|
|
2019-02-15 12:27:13 +00:00
|
|
|
cd->major = major;
|
|
|
|
cd->baseminor = baseminor;
|
|
|
|
cd->minorct = minorct;
|
|
|
|
strlcpy(cd->name, name, sizeof(cd->name));
|
2019-02-15 12:27:11 +00:00
|
|
|
|
2019-02-15 12:27:13 +00:00
|
|
|
if (!prev) {
|
|
|
|
cd->next = curr;
|
|
|
|
chrdevs[i] = cd;
|
|
|
|
} else {
|
|
|
|
cd->next = prev->next;
|
|
|
|
prev->next = cd;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2006-09-29 09:00:08 +00:00
|
|
|
|
2006-02-06 22:12:43 +00:00
|
|
|
mutex_unlock(&chrdevs_lock);
|
2005-04-16 22:20:36 +00:00
|
|
|
return cd;
|
|
|
|
out:
|
2006-02-06 22:12:43 +00:00
|
|
|
mutex_unlock(&chrdevs_lock);
|
2005-04-16 22:20:36 +00:00
|
|
|
kfree(cd);
|
|
|
|
return ERR_PTR(ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct char_device_struct *
|
|
|
|
__unregister_chrdev_region(unsigned major, unsigned baseminor, int minorct)
|
|
|
|
{
|
|
|
|
struct char_device_struct *cd = NULL, **cp;
|
|
|
|
int i = major_to_index(major);
|
|
|
|
|
2006-02-06 22:12:43 +00:00
|
|
|
mutex_lock(&chrdevs_lock);
|
2005-04-16 22:20:36 +00:00
|
|
|
for (cp = &chrdevs[i]; *cp; cp = &(*cp)->next)
|
|
|
|
if ((*cp)->major == major &&
|
|
|
|
(*cp)->baseminor == baseminor &&
|
|
|
|
(*cp)->minorct == minorct)
|
|
|
|
break;
|
|
|
|
if (*cp) {
|
|
|
|
cd = *cp;
|
|
|
|
*cp = cd->next;
|
|
|
|
}
|
2006-02-06 22:12:43 +00:00
|
|
|
mutex_unlock(&chrdevs_lock);
|
2005-04-16 22:20:36 +00:00
|
|
|
return cd;
|
|
|
|
}
|
|
|
|
|
2006-09-29 09:00:44 +00:00
|
|
|
/**
|
|
|
|
* register_chrdev_region() - register a range of device numbers
|
|
|
|
* @from: the first in the desired range of device numbers; must include
|
|
|
|
* the major number.
|
|
|
|
* @count: the number of consecutive device numbers required
|
|
|
|
* @name: the name of the device or driver.
|
|
|
|
*
|
|
|
|
* Return value is zero on success, a negative error code on failure.
|
|
|
|
*/
|
2005-04-16 22:20:36 +00:00
|
|
|
int register_chrdev_region(dev_t from, unsigned count, const char *name)
|
|
|
|
{
|
|
|
|
struct char_device_struct *cd;
|
|
|
|
dev_t to = from + count;
|
|
|
|
dev_t n, next;
|
|
|
|
|
|
|
|
for (n = from; n < to; n = next) {
|
|
|
|
next = MKDEV(MAJOR(n)+1, 0);
|
|
|
|
if (next > to)
|
|
|
|
next = to;
|
|
|
|
cd = __register_chrdev_region(MAJOR(n), MINOR(n),
|
|
|
|
next - n, name);
|
|
|
|
if (IS_ERR(cd))
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
fail:
|
|
|
|
to = n;
|
|
|
|
for (n = from; n < to; n = next) {
|
|
|
|
next = MKDEV(MAJOR(n)+1, 0);
|
|
|
|
kfree(__unregister_chrdev_region(MAJOR(n), MINOR(n), next - n));
|
|
|
|
}
|
|
|
|
return PTR_ERR(cd);
|
|
|
|
}
|
|
|
|
|
2006-09-29 09:00:44 +00:00
|
|
|
/**
|
|
|
|
* alloc_chrdev_region() - register a range of char device numbers
|
|
|
|
* @dev: output parameter for first assigned number
|
|
|
|
* @baseminor: first of the requested range of minor numbers
|
|
|
|
* @count: the number of minor numbers required
|
|
|
|
* @name: the name of the associated device or driver
|
|
|
|
*
|
|
|
|
* Allocates a range of char device numbers. The major number will be
|
|
|
|
* chosen dynamically, and returned (along with the first minor number)
|
|
|
|
* in @dev. Returns zero or a negative error code.
|
|
|
|
*/
|
2005-04-16 22:20:36 +00:00
|
|
|
int alloc_chrdev_region(dev_t *dev, unsigned baseminor, unsigned count,
|
|
|
|
const char *name)
|
|
|
|
{
|
|
|
|
struct char_device_struct *cd;
|
|
|
|
cd = __register_chrdev_region(0, baseminor, count, name);
|
|
|
|
if (IS_ERR(cd))
|
|
|
|
return PTR_ERR(cd);
|
|
|
|
*dev = MKDEV(cd->major, cd->baseminor);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-07-14 07:24:23 +00:00
|
|
|
/**
|
2009-08-06 09:13:23 +00:00
|
|
|
* __register_chrdev() - create and register a cdev occupying a range of minors
|
2006-07-14 07:24:23 +00:00
|
|
|
* @major: major device number or 0 for dynamic allocation
|
2009-08-06 09:13:23 +00:00
|
|
|
* @baseminor: first of the requested range of minor numbers
|
|
|
|
* @count: the number of minor numbers required
|
2006-07-14 07:24:23 +00:00
|
|
|
* @name: name of this range of devices
|
|
|
|
* @fops: file operations associated with this devices
|
|
|
|
*
|
|
|
|
* If @major == 0 this functions will dynamically allocate a major and return
|
|
|
|
* its number.
|
|
|
|
*
|
|
|
|
* If @major > 0 this function will attempt to reserve a device with the given
|
|
|
|
* major number and will return zero on success.
|
|
|
|
*
|
|
|
|
* Returns a -ve errno on failure.
|
|
|
|
*
|
|
|
|
* The name of this device has nothing to do with the name of the device in
|
|
|
|
* /dev. It only helps to keep track of the different owners of devices. If
|
|
|
|
* your module name has only one type of devices it's ok to use e.g. the name
|
|
|
|
* of the module here.
|
|
|
|
*/
|
2009-08-06 09:13:23 +00:00
|
|
|
int __register_chrdev(unsigned int major, unsigned int baseminor,
|
|
|
|
unsigned int count, const char *name,
|
|
|
|
const struct file_operations *fops)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct char_device_struct *cd;
|
|
|
|
struct cdev *cdev;
|
|
|
|
int err = -ENOMEM;
|
|
|
|
|
2009-08-06 09:13:23 +00:00
|
|
|
cd = __register_chrdev_region(major, baseminor, count, name);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (IS_ERR(cd))
|
|
|
|
return PTR_ERR(cd);
|
2011-12-13 19:06:49 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
cdev = cdev_alloc();
|
|
|
|
if (!cdev)
|
|
|
|
goto out2;
|
|
|
|
|
|
|
|
cdev->owner = fops->owner;
|
|
|
|
cdev->ops = fops;
|
|
|
|
kobject_set_name(&cdev->kobj, "%s", name);
|
2011-12-13 19:06:49 +00:00
|
|
|
|
2009-08-06 09:13:23 +00:00
|
|
|
err = cdev_add(cdev, MKDEV(cd->major, baseminor), count);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (err)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
cd->cdev = cdev;
|
|
|
|
|
|
|
|
return major ? 0 : cd->major;
|
|
|
|
out:
|
|
|
|
kobject_put(&cdev->kobj);
|
|
|
|
out2:
|
2009-08-06 09:13:23 +00:00
|
|
|
kfree(__unregister_chrdev_region(cd->major, baseminor, count));
|
2005-04-16 22:20:36 +00:00
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2006-09-29 09:00:44 +00:00
|
|
|
/**
|
2015-07-27 23:15:19 +00:00
|
|
|
* unregister_chrdev_region() - unregister a range of device numbers
|
2006-09-29 09:00:44 +00:00
|
|
|
* @from: the first in the range of numbers to unregister
|
|
|
|
* @count: the number of device numbers to unregister
|
|
|
|
*
|
|
|
|
* This function will unregister a range of @count device numbers,
|
|
|
|
* starting with @from. The caller should normally be the one who
|
|
|
|
* allocated those numbers in the first place...
|
|
|
|
*/
|
2005-04-16 22:20:36 +00:00
|
|
|
void unregister_chrdev_region(dev_t from, unsigned count)
|
|
|
|
{
|
|
|
|
dev_t to = from + count;
|
|
|
|
dev_t n, next;
|
|
|
|
|
|
|
|
for (n = from; n < to; n = next) {
|
|
|
|
next = MKDEV(MAJOR(n)+1, 0);
|
|
|
|
if (next > to)
|
|
|
|
next = to;
|
|
|
|
kfree(__unregister_chrdev_region(MAJOR(n), MINOR(n), next - n));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-08-06 09:13:23 +00:00
|
|
|
/**
|
|
|
|
* __unregister_chrdev - unregister and destroy a cdev
|
|
|
|
* @major: major device number
|
|
|
|
* @baseminor: first of the range of minor numbers
|
|
|
|
* @count: the number of minor numbers this cdev is occupying
|
|
|
|
* @name: name of this range of devices
|
|
|
|
*
|
|
|
|
* Unregister and destroy the cdev occupying the region described by
|
|
|
|
* @major, @baseminor and @count. This function undoes what
|
|
|
|
* __register_chrdev() did.
|
|
|
|
*/
|
|
|
|
void __unregister_chrdev(unsigned int major, unsigned int baseminor,
|
|
|
|
unsigned int count, const char *name)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct char_device_struct *cd;
|
2009-08-06 09:13:23 +00:00
|
|
|
|
|
|
|
cd = __unregister_chrdev_region(major, baseminor, count);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (cd && cd->cdev)
|
|
|
|
cdev_del(cd->cdev);
|
|
|
|
kfree(cd);
|
|
|
|
}
|
|
|
|
|
|
|
|
static DEFINE_SPINLOCK(cdev_lock);
|
|
|
|
|
|
|
|
static struct kobject *cdev_get(struct cdev *p)
|
|
|
|
{
|
|
|
|
struct module *owner = p->owner;
|
|
|
|
struct kobject *kobj;
|
|
|
|
|
|
|
|
if (owner && !try_module_get(owner))
|
|
|
|
return NULL;
|
chardev: Avoid potential use-after-free in 'chrdev_open()'
'chrdev_open()' calls 'cdev_get()' to obtain a reference to the
'struct cdev *' stashed in the 'i_cdev' field of the target inode
structure. If the pointer is NULL, then it is initialised lazily by
looking up the kobject in the 'cdev_map' and so the whole procedure is
protected by the 'cdev_lock' spinlock to serialise initialisation of
the shared pointer.
Unfortunately, it is possible for the initialising thread to fail *after*
installing the new pointer, for example if the subsequent '->open()' call
on the file fails. In this case, 'cdev_put()' is called, the reference
count on the kobject is dropped and, if nobody else has taken a reference,
the release function is called which finally clears 'inode->i_cdev' from
'cdev_purge()' before potentially freeing the object. The problem here
is that a racing thread can happily take the 'cdev_lock' and see the
non-NULL pointer in the inode, which can result in a refcount increment
from zero and a warning:
| ------------[ cut here ]------------
| refcount_t: addition on 0; use-after-free.
| WARNING: CPU: 2 PID: 6385 at lib/refcount.c:25 refcount_warn_saturate+0x6d/0xf0
| Modules linked in:
| CPU: 2 PID: 6385 Comm: repro Not tainted 5.5.0-rc2+ #22
| Hardware name: QEMU Standard PC (i440FX + PIIX, 1996), BIOS 1.12.0-1 04/01/2014
| RIP: 0010:refcount_warn_saturate+0x6d/0xf0
| Code: 05 55 9a 15 01 01 e8 9d aa c8 ff 0f 0b c3 80 3d 45 9a 15 01 00 75 ce 48 c7 c7 00 9c 62 b3 c6 08
| RSP: 0018:ffffb524c1b9bc70 EFLAGS: 00010282
| RAX: 0000000000000000 RBX: ffff9e9da1f71390 RCX: 0000000000000000
| RDX: ffff9e9dbbd27618 RSI: ffff9e9dbbd18798 RDI: ffff9e9dbbd18798
| RBP: 0000000000000000 R08: 000000000000095f R09: 0000000000000039
| R10: 0000000000000000 R11: ffffb524c1b9bb20 R12: ffff9e9da1e8c700
| R13: ffffffffb25ee8b0 R14: 0000000000000000 R15: ffff9e9da1e8c700
| FS: 00007f3b87d26700(0000) GS:ffff9e9dbbd00000(0000) knlGS:0000000000000000
| CS: 0010 DS: 0000 ES: 0000 CR0: 0000000080050033
| CR2: 00007fc16909c000 CR3: 000000012df9c000 CR4: 00000000000006e0
| DR0: 0000000000000000 DR1: 0000000000000000 DR2: 0000000000000000
| DR3: 0000000000000000 DR6: 00000000fffe0ff0 DR7: 0000000000000400
| Call Trace:
| kobject_get+0x5c/0x60
| cdev_get+0x2b/0x60
| chrdev_open+0x55/0x220
| ? cdev_put.part.3+0x20/0x20
| do_dentry_open+0x13a/0x390
| path_openat+0x2c8/0x1470
| do_filp_open+0x93/0x100
| ? selinux_file_ioctl+0x17f/0x220
| do_sys_open+0x186/0x220
| do_syscall_64+0x48/0x150
| entry_SYSCALL_64_after_hwframe+0x44/0xa9
| RIP: 0033:0x7f3b87efcd0e
| Code: 89 54 24 08 e8 a3 f4 ff ff 8b 74 24 0c 48 8b 3c 24 41 89 c0 44 8b 54 24 08 b8 01 01 00 00 89 f4
| RSP: 002b:00007f3b87d259f0 EFLAGS: 00000293 ORIG_RAX: 0000000000000101
| RAX: ffffffffffffffda RBX: 0000000000000000 RCX: 00007f3b87efcd0e
| RDX: 0000000000000000 RSI: 00007f3b87d25a80 RDI: 00000000ffffff9c
| RBP: 00007f3b87d25e90 R08: 0000000000000000 R09: 0000000000000000
| R10: 0000000000000000 R11: 0000000000000293 R12: 00007ffe188f504e
| R13: 00007ffe188f504f R14: 00007f3b87d26700 R15: 0000000000000000
| ---[ end trace 24f53ca58db8180a ]---
Since 'cdev_get()' can already fail to obtain a reference, simply move
it over to use 'kobject_get_unless_zero()' instead of 'kobject_get()',
which will cause the racing thread to return -ENXIO if the initialising
thread fails unexpectedly.
Cc: Hillf Danton <hdanton@sina.com>
Cc: Andrew Morton <akpm@linux-foundation.org>
Cc: Al Viro <viro@zeniv.linux.org.uk>
Reported-by: syzbot+82defefbbd8527e1c2cb@syzkaller.appspotmail.com
Signed-off-by: Will Deacon <will@kernel.org>
Cc: stable <stable@vger.kernel.org>
Link: https://lore.kernel.org/r/20191219120203.32691-1-will@kernel.org
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2019-12-19 12:02:03 +00:00
|
|
|
kobj = kobject_get_unless_zero(&p->kobj);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (!kobj)
|
|
|
|
module_put(owner);
|
|
|
|
return kobj;
|
|
|
|
}
|
|
|
|
|
|
|
|
void cdev_put(struct cdev *p)
|
|
|
|
{
|
|
|
|
if (p) {
|
2005-07-12 20:58:30 +00:00
|
|
|
struct module *owner = p->owner;
|
2005-04-16 22:20:36 +00:00
|
|
|
kobject_put(&p->kobj);
|
2005-07-12 20:58:30 +00:00
|
|
|
module_put(owner);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Called every time a character special file is opened
|
|
|
|
*/
|
2008-02-08 12:22:00 +00:00
|
|
|
static int chrdev_open(struct inode *inode, struct file *filp)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2013-09-22 18:17:15 +00:00
|
|
|
const struct file_operations *fops;
|
2005-04-16 22:20:36 +00:00
|
|
|
struct cdev *p;
|
|
|
|
struct cdev *new = NULL;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
spin_lock(&cdev_lock);
|
|
|
|
p = inode->i_cdev;
|
|
|
|
if (!p) {
|
|
|
|
struct kobject *kobj;
|
|
|
|
int idx;
|
|
|
|
spin_unlock(&cdev_lock);
|
|
|
|
kobj = kobj_lookup(cdev_map, inode->i_rdev, &idx);
|
|
|
|
if (!kobj)
|
|
|
|
return -ENXIO;
|
|
|
|
new = container_of(kobj, struct cdev, kobj);
|
|
|
|
spin_lock(&cdev_lock);
|
2008-05-18 21:39:11 +00:00
|
|
|
/* Check i_cdev again in case somebody beat us to it while
|
|
|
|
we dropped the lock. */
|
2005-04-16 22:20:36 +00:00
|
|
|
p = inode->i_cdev;
|
|
|
|
if (!p) {
|
|
|
|
inode->i_cdev = p = new;
|
|
|
|
list_add(&inode->i_devices, &p->list);
|
|
|
|
new = NULL;
|
|
|
|
} else if (!cdev_get(p))
|
|
|
|
ret = -ENXIO;
|
|
|
|
} else if (!cdev_get(p))
|
|
|
|
ret = -ENXIO;
|
|
|
|
spin_unlock(&cdev_lock);
|
|
|
|
cdev_put(new);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
2008-08-11 13:34:22 +00:00
|
|
|
|
|
|
|
ret = -ENXIO;
|
2013-09-22 18:17:15 +00:00
|
|
|
fops = fops_get(p->ops);
|
|
|
|
if (!fops)
|
2008-08-11 13:34:22 +00:00
|
|
|
goto out_cdev_put;
|
|
|
|
|
2013-09-22 18:17:15 +00:00
|
|
|
replace_fops(filp, fops);
|
2008-08-11 13:34:22 +00:00
|
|
|
if (filp->f_op->open) {
|
2011-12-13 19:06:49 +00:00
|
|
|
ret = filp->f_op->open(inode, filp);
|
2008-08-11 13:34:22 +00:00
|
|
|
if (ret)
|
|
|
|
goto out_cdev_put;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
out_cdev_put:
|
|
|
|
cdev_put(p);
|
2005-04-16 22:20:36 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void cd_forget(struct inode *inode)
|
|
|
|
{
|
|
|
|
spin_lock(&cdev_lock);
|
|
|
|
list_del_init(&inode->i_devices);
|
|
|
|
inode->i_cdev = NULL;
|
2016-07-25 04:55:45 +00:00
|
|
|
inode->i_mapping = &inode->i_data;
|
2005-04-16 22:20:36 +00:00
|
|
|
spin_unlock(&cdev_lock);
|
|
|
|
}
|
|
|
|
|
2005-05-05 23:16:09 +00:00
|
|
|
static void cdev_purge(struct cdev *cdev)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
spin_lock(&cdev_lock);
|
|
|
|
while (!list_empty(&cdev->list)) {
|
|
|
|
struct inode *inode;
|
|
|
|
inode = container_of(cdev->list.next, struct inode, i_devices);
|
|
|
|
list_del_init(&inode->i_devices);
|
|
|
|
inode->i_cdev = NULL;
|
|
|
|
}
|
|
|
|
spin_unlock(&cdev_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Dummy default file-operations: the only thing this does
|
|
|
|
* is contain the open that then fills in the correct operations
|
|
|
|
* depending on the special file...
|
|
|
|
*/
|
2006-03-28 09:56:42 +00:00
|
|
|
const struct file_operations def_chr_fops = {
|
2005-04-16 22:20:36 +00:00
|
|
|
.open = chrdev_open,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 16:52:59 +00:00
|
|
|
.llseek = noop_llseek,
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct kobject *exact_match(dev_t dev, int *part, void *data)
|
|
|
|
{
|
|
|
|
struct cdev *p = data;
|
|
|
|
return &p->kobj;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int exact_lock(dev_t dev, void *data)
|
|
|
|
{
|
|
|
|
struct cdev *p = data;
|
|
|
|
return cdev_get(p) ? 0 : -1;
|
|
|
|
}
|
|
|
|
|
2006-09-29 09:00:44 +00:00
|
|
|
/**
|
|
|
|
* cdev_add() - add a char device to the system
|
|
|
|
* @p: the cdev structure for the device
|
|
|
|
* @dev: the first device number for which this device is responsible
|
|
|
|
* @count: the number of consecutive minor numbers corresponding to this
|
|
|
|
* device
|
|
|
|
*
|
|
|
|
* cdev_add() adds the device represented by @p to the system, making it
|
|
|
|
* live immediately. A negative error code is returned on failure.
|
|
|
|
*/
|
2005-04-16 22:20:36 +00:00
|
|
|
int cdev_add(struct cdev *p, dev_t dev, unsigned count)
|
|
|
|
{
|
2012-10-22 00:57:19 +00:00
|
|
|
int error;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
p->dev = dev;
|
|
|
|
p->count = count;
|
2012-10-22 00:57:19 +00:00
|
|
|
|
2020-05-14 14:44:23 +00:00
|
|
|
if (WARN_ON(dev == WHITEOUT_DEV))
|
|
|
|
return -EBUSY;
|
|
|
|
|
2012-10-22 00:57:19 +00:00
|
|
|
error = kobj_map(cdev_map, dev, count, NULL,
|
|
|
|
exact_match, exact_lock, p);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
kobject_get(p->kobj.parent);
|
|
|
|
|
|
|
|
return 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
chardev: add helper function to register char devs with a struct device
Credit for this patch goes is shared with Dan Williams [1]. I've
taken things one step further to make the helper function more
useful and clean up calling code.
There's a common pattern in the kernel whereby a struct cdev is placed
in a structure along side a struct device which manages the life-cycle
of both. In the naive approach, the reference counting is broken and
the struct device can free everything before the chardev code
is entirely released.
Many developers have solved this problem by linking the internal kobjs
in this fashion:
cdev.kobj.parent = &parent_dev.kobj;
The cdev code explicitly gets and puts a reference to it's kobj parent.
So this seems like it was intended to be used this way. Dmitrty Torokhov
first put this in place in 2012 with this commit:
2f0157f char_dev: pin parent kobject
and the first instance of the fix was then done in the input subsystem
in the following commit:
4a215aa Input: fix use-after-free introduced with dynamic minor changes
Subsequently over the years, however, this issue seems to have tripped
up multiple developers independently. For example, see these commits:
0d5b7da iio: Prevent race between IIO chardev opening and IIO device
(by Lars-Peter Clausen in 2013)
ba0ef85 tpm: Fix initialization of the cdev
(by Jason Gunthorpe in 2015)
5b28dde [media] media: fix use-after-free in cdev_put() when app exits
after driver unbind
(by Shauh Khan in 2016)
This technique is similarly done in at least 15 places within the kernel
and probably should have been done so in another, at least, 5 places.
The kobj line also looks very suspect in that one would not expect
drivers to have to mess with kobject internals in this way.
Even highly experienced kernel developers can be surprised by this
code, as seen in [2].
To help alleviate this situation, and hopefully prevent future
wasted effort on this problem, this patch introduces a helper function
to register a char device along with its parent struct device.
This creates a more regular API for tying a char device to its parent
without the developer having to set members in the underlying kobject.
This patch introduce cdev_device_add and cdev_device_del which
replaces a common pattern including setting the kobj parent, calling
cdev_add and then calling device_add. It also introduces cdev_set_parent
for the few cases that set the kobject parent without using device_add.
[1] https://lkml.org/lkml/2017/2/13/700
[2] https://lkml.org/lkml/2017/2/10/370
Signed-off-by: Logan Gunthorpe <logang@deltatee.com>
Signed-off-by: Dan Williams <dan.j.williams@intel.com>
Reviewed-by: Hans Verkuil <hans.verkuil@cisco.com>
Reviewed-by: Alexandre Belloni <alexandre.belloni@free-electrons.com>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-03-17 18:48:08 +00:00
|
|
|
/**
|
|
|
|
* cdev_set_parent() - set the parent kobject for a char device
|
|
|
|
* @p: the cdev structure
|
|
|
|
* @kobj: the kobject to take a reference to
|
|
|
|
*
|
|
|
|
* cdev_set_parent() sets a parent kobject which will be referenced
|
|
|
|
* appropriately so the parent is not freed before the cdev. This
|
|
|
|
* should be called before cdev_add.
|
|
|
|
*/
|
|
|
|
void cdev_set_parent(struct cdev *p, struct kobject *kobj)
|
|
|
|
{
|
|
|
|
WARN_ON(!kobj->state_initialized);
|
|
|
|
p->kobj.parent = kobj;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* cdev_device_add() - add a char device and it's corresponding
|
|
|
|
* struct device, linkink
|
|
|
|
* @dev: the device structure
|
|
|
|
* @cdev: the cdev structure
|
|
|
|
*
|
|
|
|
* cdev_device_add() adds the char device represented by @cdev to the system,
|
|
|
|
* just as cdev_add does. It then adds @dev to the system using device_add
|
|
|
|
* The dev_t for the char device will be taken from the struct device which
|
|
|
|
* needs to be initialized first. This helper function correctly takes a
|
|
|
|
* reference to the parent device so the parent will not get released until
|
|
|
|
* all references to the cdev are released.
|
|
|
|
*
|
|
|
|
* This helper uses dev->devt for the device number. If it is not set
|
|
|
|
* it will not add the cdev and it will be equivalent to device_add.
|
|
|
|
*
|
|
|
|
* This function should be used whenever the struct cdev and the
|
|
|
|
* struct device are members of the same structure whose lifetime is
|
|
|
|
* managed by the struct device.
|
|
|
|
*
|
|
|
|
* NOTE: Callers must assume that userspace was able to open the cdev and
|
|
|
|
* can call cdev fops callbacks at any time, even if this function fails.
|
|
|
|
*/
|
|
|
|
int cdev_device_add(struct cdev *cdev, struct device *dev)
|
|
|
|
{
|
|
|
|
int rc = 0;
|
|
|
|
|
|
|
|
if (dev->devt) {
|
|
|
|
cdev_set_parent(cdev, &dev->kobj);
|
|
|
|
|
|
|
|
rc = cdev_add(cdev, dev->devt, 1);
|
|
|
|
if (rc)
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
rc = device_add(dev);
|
|
|
|
if (rc)
|
|
|
|
cdev_del(cdev);
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* cdev_device_del() - inverse of cdev_device_add
|
|
|
|
* @dev: the device structure
|
|
|
|
* @cdev: the cdev structure
|
|
|
|
*
|
|
|
|
* cdev_device_del() is a helper function to call cdev_del and device_del.
|
|
|
|
* It should be used whenever cdev_device_add is used.
|
|
|
|
*
|
|
|
|
* If dev->devt is not set it will not remove the cdev and will be equivalent
|
|
|
|
* to device_del.
|
|
|
|
*
|
|
|
|
* NOTE: This guarantees that associated sysfs callbacks are not running
|
|
|
|
* or runnable, however any cdevs already open will remain and their fops
|
|
|
|
* will still be callable even after this function returns.
|
|
|
|
*/
|
|
|
|
void cdev_device_del(struct cdev *cdev, struct device *dev)
|
|
|
|
{
|
|
|
|
device_del(dev);
|
|
|
|
if (dev->devt)
|
|
|
|
cdev_del(cdev);
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
static void cdev_unmap(dev_t dev, unsigned count)
|
|
|
|
{
|
|
|
|
kobj_unmap(cdev_map, dev, count);
|
|
|
|
}
|
|
|
|
|
2006-09-29 09:00:44 +00:00
|
|
|
/**
|
|
|
|
* cdev_del() - remove a cdev from the system
|
|
|
|
* @p: the cdev structure to be removed
|
|
|
|
*
|
|
|
|
* cdev_del() removes @p from the system, possibly freeing the structure
|
|
|
|
* itself.
|
chardev: add helper function to register char devs with a struct device
Credit for this patch goes is shared with Dan Williams [1]. I've
taken things one step further to make the helper function more
useful and clean up calling code.
There's a common pattern in the kernel whereby a struct cdev is placed
in a structure along side a struct device which manages the life-cycle
of both. In the naive approach, the reference counting is broken and
the struct device can free everything before the chardev code
is entirely released.
Many developers have solved this problem by linking the internal kobjs
in this fashion:
cdev.kobj.parent = &parent_dev.kobj;
The cdev code explicitly gets and puts a reference to it's kobj parent.
So this seems like it was intended to be used this way. Dmitrty Torokhov
first put this in place in 2012 with this commit:
2f0157f char_dev: pin parent kobject
and the first instance of the fix was then done in the input subsystem
in the following commit:
4a215aa Input: fix use-after-free introduced with dynamic minor changes
Subsequently over the years, however, this issue seems to have tripped
up multiple developers independently. For example, see these commits:
0d5b7da iio: Prevent race between IIO chardev opening and IIO device
(by Lars-Peter Clausen in 2013)
ba0ef85 tpm: Fix initialization of the cdev
(by Jason Gunthorpe in 2015)
5b28dde [media] media: fix use-after-free in cdev_put() when app exits
after driver unbind
(by Shauh Khan in 2016)
This technique is similarly done in at least 15 places within the kernel
and probably should have been done so in another, at least, 5 places.
The kobj line also looks very suspect in that one would not expect
drivers to have to mess with kobject internals in this way.
Even highly experienced kernel developers can be surprised by this
code, as seen in [2].
To help alleviate this situation, and hopefully prevent future
wasted effort on this problem, this patch introduces a helper function
to register a char device along with its parent struct device.
This creates a more regular API for tying a char device to its parent
without the developer having to set members in the underlying kobject.
This patch introduce cdev_device_add and cdev_device_del which
replaces a common pattern including setting the kobj parent, calling
cdev_add and then calling device_add. It also introduces cdev_set_parent
for the few cases that set the kobject parent without using device_add.
[1] https://lkml.org/lkml/2017/2/13/700
[2] https://lkml.org/lkml/2017/2/10/370
Signed-off-by: Logan Gunthorpe <logang@deltatee.com>
Signed-off-by: Dan Williams <dan.j.williams@intel.com>
Reviewed-by: Hans Verkuil <hans.verkuil@cisco.com>
Reviewed-by: Alexandre Belloni <alexandre.belloni@free-electrons.com>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-03-17 18:48:08 +00:00
|
|
|
*
|
|
|
|
* NOTE: This guarantees that cdev device will no longer be able to be
|
|
|
|
* opened, however any cdevs already open will remain and their fops will
|
|
|
|
* still be callable even after cdev_del returns.
|
2006-09-29 09:00:44 +00:00
|
|
|
*/
|
2005-04-16 22:20:36 +00:00
|
|
|
void cdev_del(struct cdev *p)
|
|
|
|
{
|
|
|
|
cdev_unmap(p->dev, p->count);
|
|
|
|
kobject_put(&p->kobj);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void cdev_default_release(struct kobject *kobj)
|
|
|
|
{
|
|
|
|
struct cdev *p = container_of(kobj, struct cdev, kobj);
|
2012-10-22 00:57:19 +00:00
|
|
|
struct kobject *parent = kobj->parent;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
cdev_purge(p);
|
2012-10-22 00:57:19 +00:00
|
|
|
kobject_put(parent);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void cdev_dynamic_release(struct kobject *kobj)
|
|
|
|
{
|
|
|
|
struct cdev *p = container_of(kobj, struct cdev, kobj);
|
2012-10-22 00:57:19 +00:00
|
|
|
struct kobject *parent = kobj->parent;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
cdev_purge(p);
|
|
|
|
kfree(p);
|
2012-10-22 00:57:19 +00:00
|
|
|
kobject_put(parent);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct kobj_type ktype_cdev_default = {
|
|
|
|
.release = cdev_default_release,
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct kobj_type ktype_cdev_dynamic = {
|
|
|
|
.release = cdev_dynamic_release,
|
|
|
|
};
|
|
|
|
|
2006-09-29 09:00:44 +00:00
|
|
|
/**
|
|
|
|
* cdev_alloc() - allocate a cdev structure
|
|
|
|
*
|
|
|
|
* Allocates and returns a cdev structure, or NULL on failure.
|
|
|
|
*/
|
2005-04-16 22:20:36 +00:00
|
|
|
struct cdev *cdev_alloc(void)
|
|
|
|
{
|
2006-03-25 11:08:13 +00:00
|
|
|
struct cdev *p = kzalloc(sizeof(struct cdev), GFP_KERNEL);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (p) {
|
|
|
|
INIT_LIST_HEAD(&p->list);
|
2007-12-18 06:05:35 +00:00
|
|
|
kobject_init(&p->kobj, &ktype_cdev_dynamic);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2006-09-29 09:00:44 +00:00
|
|
|
/**
|
|
|
|
* cdev_init() - initialize a cdev structure
|
|
|
|
* @cdev: the structure to initialize
|
|
|
|
* @fops: the file_operations for this device
|
|
|
|
*
|
|
|
|
* Initializes @cdev, remembering @fops, making it ready to add to the
|
|
|
|
* system with cdev_add().
|
|
|
|
*/
|
2006-03-28 09:56:41 +00:00
|
|
|
void cdev_init(struct cdev *cdev, const struct file_operations *fops)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
memset(cdev, 0, sizeof *cdev);
|
|
|
|
INIT_LIST_HEAD(&cdev->list);
|
2007-12-18 06:05:35 +00:00
|
|
|
kobject_init(&cdev->kobj, &ktype_cdev_default);
|
2005-04-16 22:20:36 +00:00
|
|
|
cdev->ops = fops;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct kobject *base_probe(dev_t dev, int *part, void *data)
|
|
|
|
{
|
|
|
|
if (request_module("char-major-%d-%d", MAJOR(dev), MINOR(dev)) > 0)
|
|
|
|
/* Make old-style 2.4 aliases work */
|
|
|
|
request_module("char-major-%d", MAJOR(dev));
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void __init chrdev_init(void)
|
|
|
|
{
|
|
|
|
cdev_map = kobj_map_init(base_probe, &chrdevs_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Let modules do char dev stuff */
|
|
|
|
EXPORT_SYMBOL(register_chrdev_region);
|
|
|
|
EXPORT_SYMBOL(unregister_chrdev_region);
|
|
|
|
EXPORT_SYMBOL(alloc_chrdev_region);
|
|
|
|
EXPORT_SYMBOL(cdev_init);
|
|
|
|
EXPORT_SYMBOL(cdev_alloc);
|
|
|
|
EXPORT_SYMBOL(cdev_del);
|
|
|
|
EXPORT_SYMBOL(cdev_add);
|
chardev: add helper function to register char devs with a struct device
Credit for this patch goes is shared with Dan Williams [1]. I've
taken things one step further to make the helper function more
useful and clean up calling code.
There's a common pattern in the kernel whereby a struct cdev is placed
in a structure along side a struct device which manages the life-cycle
of both. In the naive approach, the reference counting is broken and
the struct device can free everything before the chardev code
is entirely released.
Many developers have solved this problem by linking the internal kobjs
in this fashion:
cdev.kobj.parent = &parent_dev.kobj;
The cdev code explicitly gets and puts a reference to it's kobj parent.
So this seems like it was intended to be used this way. Dmitrty Torokhov
first put this in place in 2012 with this commit:
2f0157f char_dev: pin parent kobject
and the first instance of the fix was then done in the input subsystem
in the following commit:
4a215aa Input: fix use-after-free introduced with dynamic minor changes
Subsequently over the years, however, this issue seems to have tripped
up multiple developers independently. For example, see these commits:
0d5b7da iio: Prevent race between IIO chardev opening and IIO device
(by Lars-Peter Clausen in 2013)
ba0ef85 tpm: Fix initialization of the cdev
(by Jason Gunthorpe in 2015)
5b28dde [media] media: fix use-after-free in cdev_put() when app exits
after driver unbind
(by Shauh Khan in 2016)
This technique is similarly done in at least 15 places within the kernel
and probably should have been done so in another, at least, 5 places.
The kobj line also looks very suspect in that one would not expect
drivers to have to mess with kobject internals in this way.
Even highly experienced kernel developers can be surprised by this
code, as seen in [2].
To help alleviate this situation, and hopefully prevent future
wasted effort on this problem, this patch introduces a helper function
to register a char device along with its parent struct device.
This creates a more regular API for tying a char device to its parent
without the developer having to set members in the underlying kobject.
This patch introduce cdev_device_add and cdev_device_del which
replaces a common pattern including setting the kobj parent, calling
cdev_add and then calling device_add. It also introduces cdev_set_parent
for the few cases that set the kobject parent without using device_add.
[1] https://lkml.org/lkml/2017/2/13/700
[2] https://lkml.org/lkml/2017/2/10/370
Signed-off-by: Logan Gunthorpe <logang@deltatee.com>
Signed-off-by: Dan Williams <dan.j.williams@intel.com>
Reviewed-by: Hans Verkuil <hans.verkuil@cisco.com>
Reviewed-by: Alexandre Belloni <alexandre.belloni@free-electrons.com>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-03-17 18:48:08 +00:00
|
|
|
EXPORT_SYMBOL(cdev_set_parent);
|
|
|
|
EXPORT_SYMBOL(cdev_device_add);
|
|
|
|
EXPORT_SYMBOL(cdev_device_del);
|
2009-08-06 09:13:23 +00:00
|
|
|
EXPORT_SYMBOL(__register_chrdev);
|
|
|
|
EXPORT_SYMBOL(__unregister_chrdev);
|