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 08:07:57 -06:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2005-11-09 18:25:56 -07:00
|
|
|
/*
|
|
|
|
* NETLINK Generic Netlink Family
|
|
|
|
*
|
|
|
|
* Authors: Jamal Hadi Salim
|
|
|
|
* Thomas Graf <tgraf@suug.ch>
|
2007-07-18 16:47:52 -06:00
|
|
|
* Johannes Berg <johannes@sipsolutions.net>
|
2005-11-09 18:25:56 -07:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/kernel.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 02:04:11 -06:00
|
|
|
#include <linux/slab.h>
|
2005-11-09 18:25:56 -07:00
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/socket.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/skbuff.h>
|
2006-03-26 02:37:14 -07:00
|
|
|
#include <linux/mutex.h>
|
2007-07-18 16:47:52 -06:00
|
|
|
#include <linux/bitmap.h>
|
2013-04-23 01:48:30 -06:00
|
|
|
#include <linux/rwsem.h>
|
2016-10-24 06:40:04 -06:00
|
|
|
#include <linux/idr.h>
|
2005-11-09 18:25:56 -07:00
|
|
|
#include <net/sock.h>
|
|
|
|
#include <net/genetlink.h>
|
|
|
|
|
2006-03-26 02:37:14 -07:00
|
|
|
static DEFINE_MUTEX(genl_mutex); /* serialization of message processing */
|
2013-04-23 01:48:30 -06:00
|
|
|
static DECLARE_RWSEM(cb_lock);
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2015-01-16 03:37:14 -07:00
|
|
|
atomic_t genl_sk_destructing_cnt = ATOMIC_INIT(0);
|
|
|
|
DECLARE_WAIT_QUEUE_HEAD(genl_sk_destructing_waitq);
|
|
|
|
|
2010-04-02 00:19:05 -06:00
|
|
|
void genl_lock(void)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
2006-03-26 02:37:14 -07:00
|
|
|
mutex_lock(&genl_mutex);
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
2010-04-02 00:19:05 -06:00
|
|
|
EXPORT_SYMBOL(genl_lock);
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2010-04-02 00:19:05 -06:00
|
|
|
void genl_unlock(void)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
2006-03-26 02:37:14 -07:00
|
|
|
mutex_unlock(&genl_mutex);
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
2010-04-02 00:19:05 -06:00
|
|
|
EXPORT_SYMBOL(genl_unlock);
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2012-07-23 23:44:01 -06:00
|
|
|
#ifdef CONFIG_LOCKDEP
|
2015-10-08 07:28:54 -06:00
|
|
|
bool lockdep_genl_is_held(void)
|
2011-11-10 20:14:51 -07:00
|
|
|
{
|
|
|
|
return lockdep_is_held(&genl_mutex);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(lockdep_genl_is_held);
|
|
|
|
#endif
|
|
|
|
|
2013-04-23 01:48:30 -06:00
|
|
|
static void genl_lock_all(void)
|
|
|
|
{
|
|
|
|
down_write(&cb_lock);
|
|
|
|
genl_lock();
|
|
|
|
}
|
|
|
|
|
|
|
|
static void genl_unlock_all(void)
|
|
|
|
{
|
|
|
|
genl_unlock();
|
|
|
|
up_write(&cb_lock);
|
|
|
|
}
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
static DEFINE_IDR(genl_fam_idr);
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2007-07-18 16:47:52 -06:00
|
|
|
/*
|
|
|
|
* Bitmap of multicast groups that are currently in use.
|
|
|
|
*
|
|
|
|
* To avoid an allocation at boot of just one unsigned long,
|
|
|
|
* declare it global instead.
|
|
|
|
* Bit 0 is marked as already used since group 0 is invalid.
|
2013-11-19 07:19:32 -07:00
|
|
|
* Bit 1 is marked as already used since the drop-monitor code
|
|
|
|
* abuses the API and thinks it can statically use group 1.
|
|
|
|
* That group will typically conflict with other groups that
|
|
|
|
* any proper users use.
|
2013-11-19 07:19:39 -07:00
|
|
|
* Bit 16 is marked as used since it's used for generic netlink
|
|
|
|
* and the code no longer marks pre-reserved IDs as used.
|
2013-11-19 07:19:33 -07:00
|
|
|
* Bit 17 is marked as already used since the VFS quota code
|
|
|
|
* also abused this API and relied on family == group ID, we
|
|
|
|
* cater to that by giving it a static family and group ID.
|
2013-11-24 13:09:26 -07:00
|
|
|
* Bit 18 is marked as already used since the PMCRAID driver
|
|
|
|
* did the same thing as the VFS quota code (maybe copied?)
|
2007-07-18 16:47:52 -06:00
|
|
|
*/
|
2013-11-19 07:19:39 -07:00
|
|
|
static unsigned long mc_group_start = 0x3 | BIT(GENL_ID_CTRL) |
|
2013-11-24 13:09:26 -07:00
|
|
|
BIT(GENL_ID_VFS_DQUOT) |
|
|
|
|
BIT(GENL_ID_PMCRAID);
|
2007-07-18 16:47:52 -06:00
|
|
|
static unsigned long *mc_groups = &mc_group_start;
|
|
|
|
static unsigned long mc_groups_longs = 1;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
static int genl_ctrl_event(int event, const struct genl_family *family,
|
2013-11-19 07:19:39 -07:00
|
|
|
const struct genl_multicast_group *grp,
|
|
|
|
int grp_id);
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
static const struct genl_family *genl_family_find_byid(unsigned int id)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
2016-10-24 06:40:04 -06:00
|
|
|
return idr_find(&genl_fam_idr, id);
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
static const struct genl_family *genl_family_find_byname(char *name)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
2016-10-24 06:40:04 -06:00
|
|
|
const struct genl_family *family;
|
|
|
|
unsigned int id;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
idr_for_each_entry(&genl_fam_idr, family, id)
|
|
|
|
if (strcmp(family->name, name) == 0)
|
|
|
|
return family;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
static const struct genl_ops *genl_get_cmd(u8 cmd,
|
|
|
|
const struct genl_family *family)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
2013-11-14 09:14:44 -07:00
|
|
|
int i;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2013-11-14 09:14:44 -07:00
|
|
|
for (i = 0; i < family->n_ops; i++)
|
|
|
|
if (family->ops[i].cmd == cmd)
|
|
|
|
return &family->ops[i];
|
2005-11-09 18:25:56 -07:00
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
static int genl_allocate_reserve_groups(int n_groups, int *first_id)
|
2007-07-18 16:47:52 -06:00
|
|
|
{
|
|
|
|
unsigned long *new_groups;
|
2013-11-19 07:19:39 -07:00
|
|
|
int start = 0;
|
|
|
|
int i;
|
|
|
|
int id;
|
|
|
|
bool fits;
|
|
|
|
|
|
|
|
do {
|
|
|
|
if (start == 0)
|
|
|
|
id = find_first_zero_bit(mc_groups,
|
|
|
|
mc_groups_longs *
|
|
|
|
BITS_PER_LONG);
|
|
|
|
else
|
|
|
|
id = find_next_zero_bit(mc_groups,
|
|
|
|
mc_groups_longs * BITS_PER_LONG,
|
|
|
|
start);
|
|
|
|
|
|
|
|
fits = true;
|
|
|
|
for (i = id;
|
|
|
|
i < min_t(int, id + n_groups,
|
|
|
|
mc_groups_longs * BITS_PER_LONG);
|
|
|
|
i++) {
|
|
|
|
if (test_bit(i, mc_groups)) {
|
|
|
|
start = i;
|
|
|
|
fits = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2007-07-18 16:47:52 -06:00
|
|
|
|
2016-01-13 08:28:06 -07:00
|
|
|
if (id + n_groups > mc_groups_longs * BITS_PER_LONG) {
|
2013-11-19 07:19:39 -07:00
|
|
|
unsigned long new_longs = mc_groups_longs +
|
|
|
|
BITS_TO_LONGS(n_groups);
|
|
|
|
size_t nlen = new_longs * sizeof(unsigned long);
|
|
|
|
|
|
|
|
if (mc_groups == &mc_group_start) {
|
|
|
|
new_groups = kzalloc(nlen, GFP_KERNEL);
|
|
|
|
if (!new_groups)
|
|
|
|
return -ENOMEM;
|
|
|
|
mc_groups = new_groups;
|
|
|
|
*mc_groups = mc_group_start;
|
|
|
|
} else {
|
|
|
|
new_groups = krealloc(mc_groups, nlen,
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (!new_groups)
|
|
|
|
return -ENOMEM;
|
|
|
|
mc_groups = new_groups;
|
|
|
|
for (i = 0; i < BITS_TO_LONGS(n_groups); i++)
|
|
|
|
mc_groups[mc_groups_longs + i] = 0;
|
|
|
|
}
|
|
|
|
mc_groups_longs = new_longs;
|
|
|
|
}
|
|
|
|
} while (!fits);
|
2007-07-18 16:47:52 -06:00
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
for (i = id; i < id + n_groups; i++)
|
|
|
|
set_bit(i, mc_groups);
|
|
|
|
*first_id = id;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct genl_family genl_ctrl;
|
|
|
|
|
|
|
|
static int genl_validate_assign_mc_groups(struct genl_family *family)
|
|
|
|
{
|
|
|
|
int first_id;
|
|
|
|
int n_groups = family->n_mcgrps;
|
2013-11-23 05:01:50 -07:00
|
|
|
int err = 0, i;
|
2013-11-19 07:19:39 -07:00
|
|
|
bool groups_allocated = false;
|
|
|
|
|
|
|
|
if (!n_groups)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
for (i = 0; i < n_groups; i++) {
|
|
|
|
const struct genl_multicast_group *grp = &family->mcgrps[i];
|
|
|
|
|
|
|
|
if (WARN_ON(grp->name[0] == '\0'))
|
|
|
|
return -EINVAL;
|
|
|
|
if (WARN_ON(memchr(grp->name, '\0', GENL_NAMSIZ) == NULL))
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
2007-07-18 16:47:52 -06:00
|
|
|
|
2013-11-19 07:19:32 -07:00
|
|
|
/* special-case our own group and hacks */
|
2013-11-19 07:19:39 -07:00
|
|
|
if (family == &genl_ctrl) {
|
|
|
|
first_id = GENL_ID_CTRL;
|
|
|
|
BUG_ON(n_groups != 1);
|
|
|
|
} else if (strcmp(family->name, "NET_DM") == 0) {
|
|
|
|
first_id = 1;
|
|
|
|
BUG_ON(n_groups != 1);
|
2013-11-24 13:09:26 -07:00
|
|
|
} else if (family->id == GENL_ID_VFS_DQUOT) {
|
2013-11-19 07:19:39 -07:00
|
|
|
first_id = GENL_ID_VFS_DQUOT;
|
|
|
|
BUG_ON(n_groups != 1);
|
2013-11-24 13:09:26 -07:00
|
|
|
} else if (family->id == GENL_ID_PMCRAID) {
|
|
|
|
first_id = GENL_ID_PMCRAID;
|
|
|
|
BUG_ON(n_groups != 1);
|
2013-11-19 07:19:39 -07:00
|
|
|
} else {
|
|
|
|
groups_allocated = true;
|
|
|
|
err = genl_allocate_reserve_groups(n_groups, &first_id);
|
|
|
|
if (err)
|
|
|
|
return err;
|
2007-07-18 16:47:52 -06:00
|
|
|
}
|
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
family->mcgrp_offset = first_id;
|
|
|
|
|
|
|
|
/* if still initializing, can't and don't need to to realloc bitmaps */
|
|
|
|
if (!init_net.genl_sock)
|
|
|
|
return 0;
|
|
|
|
|
2009-07-10 03:51:34 -06:00
|
|
|
if (family->netnsok) {
|
|
|
|
struct net *net;
|
|
|
|
|
2009-09-11 21:03:15 -06:00
|
|
|
netlink_table_grab();
|
2009-07-10 03:51:34 -06:00
|
|
|
rcu_read_lock();
|
|
|
|
for_each_net_rcu(net) {
|
2009-09-11 21:03:15 -06:00
|
|
|
err = __netlink_change_ngroups(net->genl_sock,
|
2009-07-10 03:51:34 -06:00
|
|
|
mc_groups_longs * BITS_PER_LONG);
|
|
|
|
if (err) {
|
|
|
|
/*
|
|
|
|
* No need to roll back, can only fail if
|
|
|
|
* memory allocation fails and then the
|
|
|
|
* number of _possible_ groups has been
|
|
|
|
* increased on some sockets which is ok.
|
|
|
|
*/
|
2013-11-19 07:19:39 -07:00
|
|
|
break;
|
2009-07-10 03:51:34 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
2009-09-11 21:03:15 -06:00
|
|
|
netlink_table_ungrab();
|
2009-07-10 03:51:34 -06:00
|
|
|
} else {
|
|
|
|
err = netlink_change_ngroups(init_net.genl_sock,
|
|
|
|
mc_groups_longs * BITS_PER_LONG);
|
|
|
|
}
|
2007-07-18 16:47:52 -06:00
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
if (groups_allocated && err) {
|
|
|
|
for (i = 0; i < family->n_mcgrps; i++)
|
|
|
|
clear_bit(family->mcgrp_offset + i, mc_groups);
|
|
|
|
}
|
2007-07-18 16:47:52 -06:00
|
|
|
|
2007-07-24 16:34:53 -06:00
|
|
|
return err;
|
2007-07-18 16:47:52 -06:00
|
|
|
}
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
static void genl_unregister_mc_groups(const struct genl_family *family)
|
2007-07-24 16:32:46 -06:00
|
|
|
{
|
2009-07-10 03:51:34 -06:00
|
|
|
struct net *net;
|
2013-11-19 07:19:39 -07:00
|
|
|
int i;
|
2009-07-10 03:51:34 -06:00
|
|
|
|
2009-09-24 16:44:05 -06:00
|
|
|
netlink_table_grab();
|
2009-07-10 03:51:34 -06:00
|
|
|
rcu_read_lock();
|
2013-11-19 07:19:39 -07:00
|
|
|
for_each_net_rcu(net) {
|
|
|
|
for (i = 0; i < family->n_mcgrps; i++)
|
|
|
|
__netlink_clear_multicast_users(
|
|
|
|
net->genl_sock, family->mcgrp_offset + i);
|
|
|
|
}
|
2009-07-10 03:51:34 -06:00
|
|
|
rcu_read_unlock();
|
2009-09-24 16:44:05 -06:00
|
|
|
netlink_table_ungrab();
|
2009-07-10 03:51:34 -06:00
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
for (i = 0; i < family->n_mcgrps; i++) {
|
|
|
|
int grp_id = family->mcgrp_offset + i;
|
2007-07-18 16:47:52 -06:00
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
if (grp_id != 1)
|
|
|
|
clear_bit(grp_id, mc_groups);
|
|
|
|
genl_ctrl_event(CTRL_CMD_DELMCAST_GRP, family,
|
|
|
|
&family->mcgrps[i], grp_id);
|
|
|
|
}
|
2007-07-18 16:47:52 -06:00
|
|
|
}
|
|
|
|
|
2014-06-02 02:18:01 -06:00
|
|
|
static int genl_validate_ops(const struct genl_family *family)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
2013-11-15 06:19:08 -07:00
|
|
|
const struct genl_ops *ops = family->ops;
|
|
|
|
unsigned int n_ops = family->n_ops;
|
2013-11-14 09:14:44 -07:00
|
|
|
int i, j;
|
|
|
|
|
2013-11-15 06:19:08 -07:00
|
|
|
if (WARN_ON(n_ops && !ops))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (!n_ops)
|
|
|
|
return 0;
|
|
|
|
|
2013-11-14 09:14:44 -07:00
|
|
|
for (i = 0; i < n_ops; i++) {
|
|
|
|
if (ops[i].dumpit == NULL && ops[i].doit == NULL)
|
|
|
|
return -EINVAL;
|
|
|
|
for (j = i + 1; j < n_ops; j++)
|
|
|
|
if (ops[i].cmd == ops[j].cmd)
|
|
|
|
return -EINVAL;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
2013-11-14 09:14:44 -07:00
|
|
|
return 0;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2016-10-24 06:40:03 -06:00
|
|
|
* genl_register_family - register a generic netlink family
|
2005-11-09 18:25:56 -07:00
|
|
|
* @family: generic netlink family
|
|
|
|
*
|
|
|
|
* Registers the specified family after validating it first. Only one
|
|
|
|
* family may be registered with the same family name or identifier.
|
|
|
|
*
|
2016-10-24 06:40:03 -06:00
|
|
|
* The family's ops, multicast groups and module pointer must already
|
|
|
|
* be assigned.
|
2013-11-15 06:19:08 -07:00
|
|
|
*
|
2005-11-09 18:25:56 -07:00
|
|
|
* Return 0 on success or a negative error code.
|
|
|
|
*/
|
2016-10-24 06:40:03 -06:00
|
|
|
int genl_register_family(struct genl_family *family)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
2016-10-24 06:40:02 -06:00
|
|
|
int err, i;
|
2016-10-24 06:40:04 -06:00
|
|
|
int start = GENL_START_ALLOC, end = GENL_MAX_ID;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2013-11-15 06:19:08 -07:00
|
|
|
err = genl_validate_ops(family);
|
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
|
2013-04-23 01:48:30 -06:00
|
|
|
genl_lock_all();
|
2005-11-09 18:25:56 -07:00
|
|
|
|
|
|
|
if (genl_family_find_byname(family->name)) {
|
|
|
|
err = -EEXIST;
|
|
|
|
goto errout_locked;
|
|
|
|
}
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
/*
|
|
|
|
* Sadly, a few cases need to be special-cased
|
|
|
|
* due to them having previously abused the API
|
|
|
|
* and having used their family ID also as their
|
|
|
|
* multicast group ID, so we use reserved IDs
|
|
|
|
* for both to be sure we can do that mapping.
|
|
|
|
*/
|
2016-10-24 06:40:02 -06:00
|
|
|
if (family == &genl_ctrl) {
|
2016-10-24 06:40:04 -06:00
|
|
|
/* and this needs to be special for initial family lookups */
|
|
|
|
start = end = GENL_ID_CTRL;
|
|
|
|
} else if (strcmp(family->name, "pmcraid") == 0) {
|
|
|
|
start = end = GENL_ID_PMCRAID;
|
|
|
|
} else if (strcmp(family->name, "VFS_DQUOT") == 0) {
|
|
|
|
start = end = GENL_ID_VFS_DQUOT;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
2013-04-23 01:48:30 -06:00
|
|
|
if (family->maxattr && !family->parallel_ops) {
|
treewide: kmalloc() -> kmalloc_array()
The kmalloc() function has a 2-factor argument form, kmalloc_array(). This
patch replaces cases of:
kmalloc(a * b, gfp)
with:
kmalloc_array(a * b, gfp)
as well as handling cases of:
kmalloc(a * b * c, gfp)
with:
kmalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kmalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kmalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The tools/ directory was manually excluded, since it has its own
implementation of kmalloc().
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kmalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kmalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kmalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kmalloc
+ kmalloc_array
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kmalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kmalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kmalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kmalloc(sizeof(THING) * C2, ...)
|
kmalloc(sizeof(TYPE) * C2, ...)
|
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(C1 * C2, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * E2
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-12 14:55:00 -06:00
|
|
|
family->attrbuf = kmalloc_array(family->maxattr + 1,
|
|
|
|
sizeof(struct nlattr *),
|
|
|
|
GFP_KERNEL);
|
2005-11-09 18:25:56 -07:00
|
|
|
if (family->attrbuf == NULL) {
|
|
|
|
err = -ENOMEM;
|
2006-02-13 16:51:24 -07:00
|
|
|
goto errout_locked;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
} else
|
|
|
|
family->attrbuf = NULL;
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
family->id = idr_alloc(&genl_fam_idr, family,
|
|
|
|
start, end + 1, GFP_KERNEL);
|
2016-11-01 08:45:52 -06:00
|
|
|
if (family->id < 0) {
|
|
|
|
err = family->id;
|
2019-03-21 01:02:50 -06:00
|
|
|
goto errout_free;
|
2016-11-01 08:45:52 -06:00
|
|
|
}
|
2016-10-24 06:40:04 -06:00
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
err = genl_validate_assign_mc_groups(family);
|
|
|
|
if (err)
|
2016-10-24 06:40:04 -06:00
|
|
|
goto errout_remove;
|
2013-11-19 07:19:39 -07:00
|
|
|
|
2013-04-23 01:48:30 -06:00
|
|
|
genl_unlock_all();
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
/* send all events */
|
|
|
|
genl_ctrl_event(CTRL_CMD_NEWFAMILY, family, NULL, 0);
|
|
|
|
for (i = 0; i < family->n_mcgrps; i++)
|
|
|
|
genl_ctrl_event(CTRL_CMD_NEWMCAST_GRP, family,
|
|
|
|
&family->mcgrps[i], family->mcgrp_offset + i);
|
2005-11-09 18:25:56 -07:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
errout_remove:
|
|
|
|
idr_remove(&genl_fam_idr, family->id);
|
2019-03-21 01:02:50 -06:00
|
|
|
errout_free:
|
2016-11-03 10:42:35 -06:00
|
|
|
kfree(family->attrbuf);
|
2005-11-09 18:25:56 -07:00
|
|
|
errout_locked:
|
2013-04-23 01:48:30 -06:00
|
|
|
genl_unlock_all();
|
2005-11-09 18:25:56 -07:00
|
|
|
return err;
|
|
|
|
}
|
2016-10-24 06:40:03 -06:00
|
|
|
EXPORT_SYMBOL(genl_register_family);
|
2005-11-09 18:25:56 -07:00
|
|
|
|
|
|
|
/**
|
|
|
|
* genl_unregister_family - unregister generic netlink family
|
|
|
|
* @family: generic netlink family
|
|
|
|
*
|
|
|
|
* Unregisters the specified family.
|
|
|
|
*
|
|
|
|
* Returns 0 on success or a negative error code.
|
|
|
|
*/
|
2016-10-24 06:40:04 -06:00
|
|
|
int genl_unregister_family(const struct genl_family *family)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
2013-04-23 01:48:30 -06:00
|
|
|
genl_lock_all();
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-28 17:01:41 -06:00
|
|
|
if (!genl_family_find_byid(family->id)) {
|
2016-10-24 06:40:04 -06:00
|
|
|
genl_unlock_all();
|
|
|
|
return -ENOENT;
|
|
|
|
}
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
genl_unregister_mc_groups(family);
|
2015-01-16 03:37:14 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
idr_remove(&genl_fam_idr, family->id);
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
up_write(&cb_lock);
|
|
|
|
wait_event(genl_sk_destructing_waitq,
|
|
|
|
atomic_read(&genl_sk_destructing_cnt) == 0);
|
|
|
|
genl_unlock();
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
kfree(family->attrbuf);
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
genl_ctrl_event(CTRL_CMD_DELFAMILY, family, NULL, 0);
|
|
|
|
|
|
|
|
return 0;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
2010-07-25 14:46:01 -06:00
|
|
|
EXPORT_SYMBOL(genl_unregister_family);
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2012-01-30 13:22:06 -07:00
|
|
|
/**
|
|
|
|
* genlmsg_put - Add generic netlink header to netlink message
|
|
|
|
* @skb: socket buffer holding the message
|
2012-09-07 14:12:54 -06:00
|
|
|
* @portid: netlink portid the message is addressed to
|
2012-01-30 13:22:06 -07:00
|
|
|
* @seq: sequence number (usually the one of the sender)
|
|
|
|
* @family: generic netlink family
|
2012-07-10 04:55:09 -06:00
|
|
|
* @flags: netlink message flags
|
2012-01-30 13:22:06 -07:00
|
|
|
* @cmd: generic netlink command
|
|
|
|
*
|
|
|
|
* Returns pointer to user specific header
|
|
|
|
*/
|
2012-09-07 14:12:54 -06:00
|
|
|
void *genlmsg_put(struct sk_buff *skb, u32 portid, u32 seq,
|
2016-10-24 06:40:04 -06:00
|
|
|
const struct genl_family *family, int flags, u8 cmd)
|
2012-01-30 13:22:06 -07:00
|
|
|
{
|
|
|
|
struct nlmsghdr *nlh;
|
|
|
|
struct genlmsghdr *hdr;
|
|
|
|
|
2012-09-07 14:12:54 -06:00
|
|
|
nlh = nlmsg_put(skb, portid, seq, family->id, GENL_HDRLEN +
|
2012-01-30 13:22:06 -07:00
|
|
|
family->hdrsize, flags);
|
|
|
|
if (nlh == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
hdr = nlmsg_data(nlh);
|
|
|
|
hdr->cmd = cmd;
|
|
|
|
hdr->version = family->version;
|
|
|
|
hdr->reserved = 0;
|
|
|
|
|
|
|
|
return (char *) hdr + GENL_HDRLEN;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(genlmsg_put);
|
|
|
|
|
2015-12-15 16:41:37 -07:00
|
|
|
static int genl_lock_start(struct netlink_callback *cb)
|
|
|
|
{
|
|
|
|
/* our ops are always const - netlink API doesn't propagate that */
|
|
|
|
const struct genl_ops *ops = cb->data;
|
|
|
|
int rc = 0;
|
|
|
|
|
|
|
|
if (ops->start) {
|
|
|
|
genl_lock();
|
|
|
|
rc = ops->start(cb);
|
|
|
|
genl_unlock();
|
|
|
|
}
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2013-08-23 13:44:55 -06:00
|
|
|
static int genl_lock_dumpit(struct sk_buff *skb, struct netlink_callback *cb)
|
|
|
|
{
|
2013-11-14 09:14:45 -07:00
|
|
|
/* our ops are always const - netlink API doesn't propagate that */
|
|
|
|
const struct genl_ops *ops = cb->data;
|
2013-08-23 13:44:55 -06:00
|
|
|
int rc;
|
|
|
|
|
|
|
|
genl_lock();
|
|
|
|
rc = ops->dumpit(skb, cb);
|
|
|
|
genl_unlock();
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int genl_lock_done(struct netlink_callback *cb)
|
|
|
|
{
|
2013-11-14 09:14:45 -07:00
|
|
|
/* our ops are always const - netlink API doesn't propagate that */
|
|
|
|
const struct genl_ops *ops = cb->data;
|
2013-08-23 13:44:55 -06:00
|
|
|
int rc = 0;
|
|
|
|
|
|
|
|
if (ops->done) {
|
|
|
|
genl_lock();
|
|
|
|
rc = ops->done(cb);
|
|
|
|
genl_unlock();
|
|
|
|
}
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
static int genl_family_rcv_msg(const struct genl_family *family,
|
2013-04-23 01:48:30 -06:00
|
|
|
struct sk_buff *skb,
|
2017-04-12 06:34:05 -06:00
|
|
|
struct nlmsghdr *nlh,
|
|
|
|
struct netlink_ext_ack *extack)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
2013-11-14 09:14:45 -07:00
|
|
|
const struct genl_ops *ops;
|
2009-07-10 03:51:34 -06:00
|
|
|
struct net *net = sock_net(skb->sk);
|
2005-11-09 18:25:56 -07:00
|
|
|
struct genl_info info;
|
|
|
|
struct genlmsghdr *hdr = nlmsg_data(nlh);
|
2013-04-23 01:48:30 -06:00
|
|
|
struct nlattr **attrbuf;
|
2007-03-23 00:30:12 -06:00
|
|
|
int hdrlen, err;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2009-07-10 03:51:34 -06:00
|
|
|
/* this family doesn't exist in this netns */
|
|
|
|
if (!family->netnsok && !net_eq(net, &init_net))
|
|
|
|
return -ENOENT;
|
|
|
|
|
2005-11-09 18:25:56 -07:00
|
|
|
hdrlen = GENL_HDRLEN + family->hdrsize;
|
|
|
|
if (nlh->nlmsg_len < nlmsg_msg_size(hdrlen))
|
2007-03-23 00:30:12 -06:00
|
|
|
return -EINVAL;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
|
|
|
ops = genl_get_cmd(hdr->cmd, family);
|
2007-03-23 00:30:12 -06:00
|
|
|
if (ops == NULL)
|
|
|
|
return -EOPNOTSUPP;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2007-03-23 00:30:12 -06:00
|
|
|
if ((ops->flags & GENL_ADMIN_PERM) &&
|
2014-04-23 15:29:27 -06:00
|
|
|
!netlink_capable(skb, CAP_NET_ADMIN))
|
2007-03-23 00:30:12 -06:00
|
|
|
return -EPERM;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-02-05 09:20:52 -07:00
|
|
|
if ((ops->flags & GENL_UNS_ADMIN_PERM) &&
|
|
|
|
!netlink_ns_capable(skb, net->user_ns, CAP_NET_ADMIN))
|
|
|
|
return -EPERM;
|
|
|
|
|
2013-07-29 04:30:04 -06:00
|
|
|
if ((nlh->nlmsg_flags & NLM_F_DUMP) == NLM_F_DUMP) {
|
2013-08-23 13:44:55 -06:00
|
|
|
int rc;
|
2013-04-23 01:48:30 -06:00
|
|
|
|
2007-03-23 00:30:12 -06:00
|
|
|
if (ops->dumpit == NULL)
|
|
|
|
return -EOPNOTSUPP;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2013-08-23 13:44:55 -06:00
|
|
|
if (!family->parallel_ops) {
|
|
|
|
struct netlink_dump_control c = {
|
2013-08-23 13:45:04 -06:00
|
|
|
.module = family->module,
|
2013-11-14 09:14:45 -07:00
|
|
|
/* we have const, but the netlink API doesn't */
|
|
|
|
.data = (void *)ops,
|
2015-12-15 16:41:37 -07:00
|
|
|
.start = genl_lock_start,
|
2013-08-23 13:44:55 -06:00
|
|
|
.dump = genl_lock_dumpit,
|
|
|
|
.done = genl_lock_done,
|
|
|
|
};
|
|
|
|
|
|
|
|
genl_unlock();
|
2013-08-23 13:45:04 -06:00
|
|
|
rc = __netlink_dump_start(net->genl_sock, skb, nlh, &c);
|
2013-08-23 13:44:55 -06:00
|
|
|
genl_lock();
|
|
|
|
|
|
|
|
} else {
|
|
|
|
struct netlink_dump_control c = {
|
2013-08-23 13:45:04 -06:00
|
|
|
.module = family->module,
|
2015-12-15 16:41:37 -07:00
|
|
|
.start = ops->start,
|
2013-08-23 13:44:55 -06:00
|
|
|
.dump = ops->dumpit,
|
|
|
|
.done = ops->done,
|
|
|
|
};
|
|
|
|
|
2013-08-23 13:45:04 -06:00
|
|
|
rc = __netlink_dump_start(net->genl_sock, skb, nlh, &c);
|
2013-08-23 13:44:55 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
return rc;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
2007-03-23 00:30:12 -06:00
|
|
|
if (ops->doit == NULL)
|
|
|
|
return -EOPNOTSUPP;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2013-04-23 01:48:30 -06:00
|
|
|
if (family->maxattr && family->parallel_ops) {
|
treewide: kmalloc() -> kmalloc_array()
The kmalloc() function has a 2-factor argument form, kmalloc_array(). This
patch replaces cases of:
kmalloc(a * b, gfp)
with:
kmalloc_array(a * b, gfp)
as well as handling cases of:
kmalloc(a * b * c, gfp)
with:
kmalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kmalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kmalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The tools/ directory was manually excluded, since it has its own
implementation of kmalloc().
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kmalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kmalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kmalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kmalloc
+ kmalloc_array
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kmalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kmalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kmalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kmalloc(sizeof(THING) * C2, ...)
|
kmalloc(sizeof(TYPE) * C2, ...)
|
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(C1 * C2, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * E2
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-12 14:55:00 -06:00
|
|
|
attrbuf = kmalloc_array(family->maxattr + 1,
|
|
|
|
sizeof(struct nlattr *),
|
|
|
|
GFP_KERNEL);
|
2013-04-23 01:48:30 -06:00
|
|
|
if (attrbuf == NULL)
|
|
|
|
return -ENOMEM;
|
|
|
|
} else
|
|
|
|
attrbuf = family->attrbuf;
|
|
|
|
|
|
|
|
if (attrbuf) {
|
|
|
|
err = nlmsg_parse(nlh, hdrlen, attrbuf, family->maxattr,
|
netlink: pass extended ACK struct where available
This is an add-on to the previous patch that passes the extended ACK
structure where it's already available by existing genl_info or extack
function arguments.
This was done with this spatch (with some manual adjustment of
indentation):
@@
expression A, B, C, D, E;
identifier fn, info;
@@
fn(..., struct genl_info *info, ...) {
...
-nlmsg_parse(A, B, C, D, E, NULL)
+nlmsg_parse(A, B, C, D, E, info->extack)
...
}
@@
expression A, B, C, D, E;
identifier fn, info;
@@
fn(..., struct genl_info *info, ...) {
<...
-nla_parse_nested(A, B, C, D, NULL)
+nla_parse_nested(A, B, C, D, info->extack)
...>
}
@@
expression A, B, C, D, E;
identifier fn, extack;
@@
fn(..., struct netlink_ext_ack *extack, ...) {
<...
-nlmsg_parse(A, B, C, D, E, NULL)
+nlmsg_parse(A, B, C, D, E, extack)
...>
}
@@
expression A, B, C, D, E;
identifier fn, extack;
@@
fn(..., struct netlink_ext_ack *extack, ...) {
<...
-nla_parse(A, B, C, D, E, NULL)
+nla_parse(A, B, C, D, E, extack)
...>
}
@@
expression A, B, C, D, E;
identifier fn, extack;
@@
fn(..., struct netlink_ext_ack *extack, ...) {
...
-nlmsg_parse(A, B, C, D, E, NULL)
+nlmsg_parse(A, B, C, D, E, extack)
...
}
@@
expression A, B, C, D;
identifier fn, extack;
@@
fn(..., struct netlink_ext_ack *extack, ...) {
<...
-nla_parse_nested(A, B, C, D, NULL)
+nla_parse_nested(A, B, C, D, extack)
...>
}
@@
expression A, B, C, D;
identifier fn, extack;
@@
fn(..., struct netlink_ext_ack *extack, ...) {
<...
-nlmsg_validate(A, B, C, D, NULL)
+nlmsg_validate(A, B, C, D, extack)
...>
}
@@
expression A, B, C, D;
identifier fn, extack;
@@
fn(..., struct netlink_ext_ack *extack, ...) {
<...
-nla_validate(A, B, C, D, NULL)
+nla_validate(A, B, C, D, extack)
...>
}
@@
expression A, B, C;
identifier fn, extack;
@@
fn(..., struct netlink_ext_ack *extack, ...) {
<...
-nla_validate_nested(A, B, C, NULL)
+nla_validate_nested(A, B, C, extack)
...>
}
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
Reviewed-by: Jiri Pirko <jiri@mellanox.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-04-12 06:34:08 -06:00
|
|
|
ops->policy, extack);
|
2005-11-09 18:25:56 -07:00
|
|
|
if (err < 0)
|
2013-04-26 09:34:16 -06:00
|
|
|
goto out;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
info.snd_seq = nlh->nlmsg_seq;
|
2012-09-07 14:12:54 -06:00
|
|
|
info.snd_portid = NETLINK_CB(skb).portid;
|
2005-11-09 18:25:56 -07:00
|
|
|
info.nlhdr = nlh;
|
|
|
|
info.genlhdr = nlmsg_data(nlh);
|
|
|
|
info.userhdr = nlmsg_data(nlh) + GENL_HDRLEN;
|
2013-04-23 01:48:30 -06:00
|
|
|
info.attrs = attrbuf;
|
2017-04-12 06:34:05 -06:00
|
|
|
info.extack = extack;
|
2009-07-10 03:51:34 -06:00
|
|
|
genl_info_net_set(&info, net);
|
2010-10-04 13:14:03 -06:00
|
|
|
memset(&info.user_ptr, 0, sizeof(info.user_ptr));
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2010-10-04 13:14:03 -06:00
|
|
|
if (family->pre_doit) {
|
|
|
|
err = family->pre_doit(ops, skb, &info);
|
|
|
|
if (err)
|
2013-04-26 09:34:16 -06:00
|
|
|
goto out;
|
2010-10-04 13:14:03 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
err = ops->doit(skb, &info);
|
|
|
|
|
|
|
|
if (family->post_doit)
|
|
|
|
family->post_doit(ops, skb, &info);
|
|
|
|
|
2013-04-26 09:34:16 -06:00
|
|
|
out:
|
2013-04-23 01:48:30 -06:00
|
|
|
if (family->parallel_ops)
|
|
|
|
kfree(attrbuf);
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2017-04-12 06:34:04 -06:00
|
|
|
static int genl_rcv_msg(struct sk_buff *skb, struct nlmsghdr *nlh,
|
|
|
|
struct netlink_ext_ack *extack)
|
2013-04-23 01:48:30 -06:00
|
|
|
{
|
2016-10-24 06:40:04 -06:00
|
|
|
const struct genl_family *family;
|
2013-04-23 01:48:30 -06:00
|
|
|
int err;
|
|
|
|
|
|
|
|
family = genl_family_find_byid(nlh->nlmsg_type);
|
|
|
|
if (family == NULL)
|
|
|
|
return -ENOENT;
|
|
|
|
|
|
|
|
if (!family->parallel_ops)
|
|
|
|
genl_lock();
|
|
|
|
|
2017-04-12 06:34:05 -06:00
|
|
|
err = genl_family_rcv_msg(family, skb, nlh, extack);
|
2013-04-23 01:48:30 -06:00
|
|
|
|
|
|
|
if (!family->parallel_ops)
|
|
|
|
genl_unlock();
|
|
|
|
|
2010-10-04 13:14:03 -06:00
|
|
|
return err;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
2007-10-10 22:15:29 -06:00
|
|
|
static void genl_rcv(struct sk_buff *skb)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
2013-04-23 01:48:30 -06:00
|
|
|
down_read(&cb_lock);
|
2007-10-10 22:15:29 -06:00
|
|
|
netlink_rcv_skb(skb, &genl_rcv_msg);
|
2013-04-23 01:48:30 -06:00
|
|
|
up_read(&cb_lock);
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
/**************************************************************************
|
|
|
|
* Controller
|
|
|
|
**************************************************************************/
|
|
|
|
|
2016-10-24 06:40:03 -06:00
|
|
|
static struct genl_family genl_ctrl;
|
2006-11-14 20:46:02 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
static int ctrl_fill_info(const struct genl_family *family, u32 portid, u32 seq,
|
2005-11-09 18:25:56 -07:00
|
|
|
u32 flags, struct sk_buff *skb, u8 cmd)
|
|
|
|
{
|
|
|
|
void *hdr;
|
|
|
|
|
2012-09-07 14:12:54 -06:00
|
|
|
hdr = genlmsg_put(skb, portid, seq, &genl_ctrl, flags, cmd);
|
2005-11-09 18:25:56 -07:00
|
|
|
if (hdr == NULL)
|
|
|
|
return -1;
|
|
|
|
|
2012-03-29 21:25:11 -06:00
|
|
|
if (nla_put_string(skb, CTRL_ATTR_FAMILY_NAME, family->name) ||
|
|
|
|
nla_put_u16(skb, CTRL_ATTR_FAMILY_ID, family->id) ||
|
|
|
|
nla_put_u32(skb, CTRL_ATTR_VERSION, family->version) ||
|
|
|
|
nla_put_u32(skb, CTRL_ATTR_HDRSIZE, family->hdrsize) ||
|
|
|
|
nla_put_u32(skb, CTRL_ATTR_MAXATTR, family->maxattr))
|
|
|
|
goto nla_put_failure;
|
2006-09-18 01:01:59 -06:00
|
|
|
|
2013-11-14 09:14:44 -07:00
|
|
|
if (family->n_ops) {
|
2006-11-23 12:44:37 -07:00
|
|
|
struct nlattr *nla_ops;
|
2013-11-14 09:14:44 -07:00
|
|
|
int i;
|
2006-09-18 01:01:59 -06:00
|
|
|
|
2006-11-23 12:44:37 -07:00
|
|
|
nla_ops = nla_nest_start(skb, CTRL_ATTR_OPS);
|
|
|
|
if (nla_ops == NULL)
|
2006-09-18 01:01:59 -06:00
|
|
|
goto nla_put_failure;
|
|
|
|
|
2013-11-14 09:14:44 -07:00
|
|
|
for (i = 0; i < family->n_ops; i++) {
|
2006-11-23 12:44:37 -07:00
|
|
|
struct nlattr *nest;
|
2013-11-14 09:14:45 -07:00
|
|
|
const struct genl_ops *ops = &family->ops[i];
|
2013-11-18 12:54:58 -07:00
|
|
|
u32 op_flags = ops->flags;
|
2013-11-14 09:14:45 -07:00
|
|
|
|
|
|
|
if (ops->dumpit)
|
2013-11-18 12:54:58 -07:00
|
|
|
op_flags |= GENL_CMD_CAP_DUMP;
|
2013-11-14 09:14:45 -07:00
|
|
|
if (ops->doit)
|
2013-11-18 12:54:58 -07:00
|
|
|
op_flags |= GENL_CMD_CAP_DO;
|
2013-11-14 09:14:45 -07:00
|
|
|
if (ops->policy)
|
2013-11-18 12:54:58 -07:00
|
|
|
op_flags |= GENL_CMD_CAP_HASPOL;
|
2006-09-18 01:01:59 -06:00
|
|
|
|
2013-11-14 09:14:44 -07:00
|
|
|
nest = nla_nest_start(skb, i + 1);
|
2006-11-23 12:44:37 -07:00
|
|
|
if (nest == NULL)
|
|
|
|
goto nla_put_failure;
|
2006-09-18 01:01:59 -06:00
|
|
|
|
2012-03-29 21:25:11 -06:00
|
|
|
if (nla_put_u32(skb, CTRL_ATTR_OP_ID, ops->cmd) ||
|
2013-11-18 12:54:58 -07:00
|
|
|
nla_put_u32(skb, CTRL_ATTR_OP_FLAGS, op_flags))
|
2012-03-29 21:25:11 -06:00
|
|
|
goto nla_put_failure;
|
2006-09-18 01:01:59 -06:00
|
|
|
|
2006-11-23 12:44:37 -07:00
|
|
|
nla_nest_end(skb, nest);
|
|
|
|
}
|
|
|
|
|
|
|
|
nla_nest_end(skb, nla_ops);
|
|
|
|
}
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
if (family->n_mcgrps) {
|
2007-07-18 16:47:52 -06:00
|
|
|
struct nlattr *nla_grps;
|
2013-11-19 07:19:39 -07:00
|
|
|
int i;
|
2007-07-18 16:47:52 -06:00
|
|
|
|
|
|
|
nla_grps = nla_nest_start(skb, CTRL_ATTR_MCAST_GROUPS);
|
|
|
|
if (nla_grps == NULL)
|
|
|
|
goto nla_put_failure;
|
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
for (i = 0; i < family->n_mcgrps; i++) {
|
2007-07-18 16:47:52 -06:00
|
|
|
struct nlattr *nest;
|
2013-11-19 07:19:39 -07:00
|
|
|
const struct genl_multicast_group *grp;
|
2007-07-18 16:47:52 -06:00
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
grp = &family->mcgrps[i];
|
|
|
|
|
|
|
|
nest = nla_nest_start(skb, i + 1);
|
2007-07-18 16:47:52 -06:00
|
|
|
if (nest == NULL)
|
|
|
|
goto nla_put_failure;
|
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
if (nla_put_u32(skb, CTRL_ATTR_MCAST_GRP_ID,
|
|
|
|
family->mcgrp_offset + i) ||
|
2012-03-29 21:25:11 -06:00
|
|
|
nla_put_string(skb, CTRL_ATTR_MCAST_GRP_NAME,
|
|
|
|
grp->name))
|
|
|
|
goto nla_put_failure;
|
2007-07-18 16:47:52 -06:00
|
|
|
|
|
|
|
nla_nest_end(skb, nest);
|
|
|
|
}
|
|
|
|
nla_nest_end(skb, nla_grps);
|
|
|
|
}
|
|
|
|
|
2015-01-16 14:09:00 -07:00
|
|
|
genlmsg_end(skb, hdr);
|
|
|
|
return 0;
|
2007-07-18 16:47:52 -06:00
|
|
|
|
|
|
|
nla_put_failure:
|
2008-06-03 17:36:54 -06:00
|
|
|
genlmsg_cancel(skb, hdr);
|
|
|
|
return -EMSGSIZE;
|
2007-07-18 16:47:52 -06:00
|
|
|
}
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
static int ctrl_fill_mcgrp_info(const struct genl_family *family,
|
2013-11-19 07:19:39 -07:00
|
|
|
const struct genl_multicast_group *grp,
|
|
|
|
int grp_id, u32 portid, u32 seq, u32 flags,
|
|
|
|
struct sk_buff *skb, u8 cmd)
|
2007-07-18 16:47:52 -06:00
|
|
|
{
|
|
|
|
void *hdr;
|
|
|
|
struct nlattr *nla_grps;
|
|
|
|
struct nlattr *nest;
|
|
|
|
|
2012-09-07 14:12:54 -06:00
|
|
|
hdr = genlmsg_put(skb, portid, seq, &genl_ctrl, flags, cmd);
|
2007-07-18 16:47:52 -06:00
|
|
|
if (hdr == NULL)
|
|
|
|
return -1;
|
|
|
|
|
2013-11-19 07:19:36 -07:00
|
|
|
if (nla_put_string(skb, CTRL_ATTR_FAMILY_NAME, family->name) ||
|
|
|
|
nla_put_u16(skb, CTRL_ATTR_FAMILY_ID, family->id))
|
2012-03-29 21:25:11 -06:00
|
|
|
goto nla_put_failure;
|
2007-07-18 16:47:52 -06:00
|
|
|
|
|
|
|
nla_grps = nla_nest_start(skb, CTRL_ATTR_MCAST_GROUPS);
|
|
|
|
if (nla_grps == NULL)
|
|
|
|
goto nla_put_failure;
|
|
|
|
|
|
|
|
nest = nla_nest_start(skb, 1);
|
|
|
|
if (nest == NULL)
|
|
|
|
goto nla_put_failure;
|
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
if (nla_put_u32(skb, CTRL_ATTR_MCAST_GRP_ID, grp_id) ||
|
2012-03-29 21:25:11 -06:00
|
|
|
nla_put_string(skb, CTRL_ATTR_MCAST_GRP_NAME,
|
|
|
|
grp->name))
|
|
|
|
goto nla_put_failure;
|
2007-07-18 16:47:52 -06:00
|
|
|
|
|
|
|
nla_nest_end(skb, nest);
|
|
|
|
nla_nest_end(skb, nla_grps);
|
|
|
|
|
2015-01-16 14:09:00 -07:00
|
|
|
genlmsg_end(skb, hdr);
|
|
|
|
return 0;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
|
|
|
nla_put_failure:
|
2008-06-03 17:36:54 -06:00
|
|
|
genlmsg_cancel(skb, hdr);
|
|
|
|
return -EMSGSIZE;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
static int ctrl_dumpfamily(struct sk_buff *skb, struct netlink_callback *cb)
|
|
|
|
{
|
2016-10-24 06:40:04 -06:00
|
|
|
int n = 0;
|
2005-11-09 18:25:56 -07:00
|
|
|
struct genl_family *rt;
|
2009-07-10 03:51:34 -06:00
|
|
|
struct net *net = sock_net(skb->sk);
|
2016-10-24 06:40:04 -06:00
|
|
|
int fams_to_skip = cb->args[0];
|
|
|
|
unsigned int id;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
idr_for_each_entry(&genl_fam_idr, rt, id) {
|
|
|
|
if (!rt->netnsok && !net_eq(net, &init_net))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (n++ < fams_to_skip)
|
|
|
|
continue;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
if (ctrl_fill_info(rt, NETLINK_CB(cb->skb).portid,
|
|
|
|
cb->nlh->nlmsg_seq, NLM_F_MULTI,
|
2017-03-22 09:08:33 -06:00
|
|
|
skb, CTRL_CMD_NEWFAMILY) < 0) {
|
|
|
|
n--;
|
2016-10-24 06:40:04 -06:00
|
|
|
break;
|
2017-03-22 09:08:33 -06:00
|
|
|
}
|
2016-10-24 06:40:04 -06:00
|
|
|
}
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
cb->args[0] = n;
|
2005-11-09 18:25:56 -07:00
|
|
|
return skb->len;
|
|
|
|
}
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
static struct sk_buff *ctrl_build_family_msg(const struct genl_family *family,
|
2012-09-07 14:12:54 -06:00
|
|
|
u32 portid, int seq, u8 cmd)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
|
|
|
struct sk_buff *skb;
|
|
|
|
int err;
|
|
|
|
|
2006-11-10 15:10:15 -07:00
|
|
|
skb = nlmsg_new(NLMSG_DEFAULT_SIZE, GFP_KERNEL);
|
2005-11-09 18:25:56 -07:00
|
|
|
if (skb == NULL)
|
|
|
|
return ERR_PTR(-ENOBUFS);
|
|
|
|
|
2012-09-07 14:12:54 -06:00
|
|
|
err = ctrl_fill_info(family, portid, seq, 0, skb, cmd);
|
2005-11-09 18:25:56 -07:00
|
|
|
if (err < 0) {
|
|
|
|
nlmsg_free(skb);
|
|
|
|
return ERR_PTR(err);
|
|
|
|
}
|
|
|
|
|
|
|
|
return skb;
|
|
|
|
}
|
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
static struct sk_buff *
|
2016-10-24 06:40:04 -06:00
|
|
|
ctrl_build_mcgrp_msg(const struct genl_family *family,
|
2013-11-19 07:19:39 -07:00
|
|
|
const struct genl_multicast_group *grp,
|
|
|
|
int grp_id, u32 portid, int seq, u8 cmd)
|
2007-07-18 16:47:52 -06:00
|
|
|
{
|
|
|
|
struct sk_buff *skb;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
skb = nlmsg_new(NLMSG_DEFAULT_SIZE, GFP_KERNEL);
|
|
|
|
if (skb == NULL)
|
|
|
|
return ERR_PTR(-ENOBUFS);
|
|
|
|
|
2013-11-19 07:19:39 -07:00
|
|
|
err = ctrl_fill_mcgrp_info(family, grp, grp_id, portid,
|
|
|
|
seq, 0, skb, cmd);
|
2007-07-18 16:47:52 -06:00
|
|
|
if (err < 0) {
|
|
|
|
nlmsg_free(skb);
|
|
|
|
return ERR_PTR(err);
|
|
|
|
}
|
|
|
|
|
|
|
|
return skb;
|
|
|
|
}
|
|
|
|
|
2007-06-05 13:38:30 -06:00
|
|
|
static const struct nla_policy ctrl_policy[CTRL_ATTR_MAX+1] = {
|
2005-11-09 18:25:56 -07:00
|
|
|
[CTRL_ATTR_FAMILY_ID] = { .type = NLA_U16 },
|
2006-08-26 21:13:18 -06:00
|
|
|
[CTRL_ATTR_FAMILY_NAME] = { .type = NLA_NUL_STRING,
|
|
|
|
.len = GENL_NAMSIZ - 1 },
|
2005-11-09 18:25:56 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
static int ctrl_getfamily(struct sk_buff *skb, struct genl_info *info)
|
|
|
|
{
|
|
|
|
struct sk_buff *msg;
|
2016-10-24 06:40:04 -06:00
|
|
|
const struct genl_family *res = NULL;
|
2005-11-09 18:25:56 -07:00
|
|
|
int err = -EINVAL;
|
|
|
|
|
|
|
|
if (info->attrs[CTRL_ATTR_FAMILY_ID]) {
|
|
|
|
u16 id = nla_get_u16(info->attrs[CTRL_ATTR_FAMILY_ID]);
|
|
|
|
res = genl_family_find_byid(id);
|
2009-07-10 03:51:34 -06:00
|
|
|
err = -ENOENT;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
if (info->attrs[CTRL_ATTR_FAMILY_NAME]) {
|
2006-08-26 21:13:18 -06:00
|
|
|
char *name;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2006-08-26 21:13:18 -06:00
|
|
|
name = nla_data(info->attrs[CTRL_ATTR_FAMILY_NAME]);
|
2005-11-09 18:25:56 -07:00
|
|
|
res = genl_family_find_byname(name);
|
2011-12-28 11:48:55 -07:00
|
|
|
#ifdef CONFIG_MODULES
|
|
|
|
if (res == NULL) {
|
|
|
|
genl_unlock();
|
2013-07-26 03:00:10 -06:00
|
|
|
up_read(&cb_lock);
|
2012-05-29 03:30:41 -06:00
|
|
|
request_module("net-pf-%d-proto-%d-family-%s",
|
2011-12-28 11:48:55 -07:00
|
|
|
PF_NETLINK, NETLINK_GENERIC, name);
|
2013-07-26 03:00:10 -06:00
|
|
|
down_read(&cb_lock);
|
2011-12-28 11:48:55 -07:00
|
|
|
genl_lock();
|
|
|
|
res = genl_family_find_byname(name);
|
|
|
|
}
|
|
|
|
#endif
|
2009-07-10 03:51:34 -06:00
|
|
|
err = -ENOENT;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
2009-07-10 03:51:34 -06:00
|
|
|
if (res == NULL)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
if (!res->netnsok && !net_eq(genl_info_net(info), &init_net)) {
|
|
|
|
/* family doesn't exist here */
|
|
|
|
return -ENOENT;
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
2012-09-07 14:12:54 -06:00
|
|
|
msg = ctrl_build_family_msg(res, info->snd_portid, info->snd_seq,
|
2007-07-18 16:47:52 -06:00
|
|
|
CTRL_CMD_NEWFAMILY);
|
2009-07-10 03:51:34 -06:00
|
|
|
if (IS_ERR(msg))
|
|
|
|
return PTR_ERR(msg);
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2009-07-10 03:51:34 -06:00
|
|
|
return genlmsg_reply(msg, info);
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
static int genl_ctrl_event(int event, const struct genl_family *family,
|
2013-11-19 07:19:39 -07:00
|
|
|
const struct genl_multicast_group *grp,
|
|
|
|
int grp_id)
|
2005-11-09 18:25:56 -07:00
|
|
|
{
|
|
|
|
struct sk_buff *msg;
|
|
|
|
|
2009-07-10 03:51:34 -06:00
|
|
|
/* genl is still initialising */
|
|
|
|
if (!init_net.genl_sock)
|
2005-11-09 18:25:56 -07:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
switch (event) {
|
|
|
|
case CTRL_CMD_NEWFAMILY:
|
|
|
|
case CTRL_CMD_DELFAMILY:
|
2013-11-19 07:19:36 -07:00
|
|
|
WARN_ON(grp);
|
2009-07-10 03:51:34 -06:00
|
|
|
msg = ctrl_build_family_msg(family, 0, 0, event);
|
2007-07-18 16:47:52 -06:00
|
|
|
break;
|
|
|
|
case CTRL_CMD_NEWMCAST_GRP:
|
|
|
|
case CTRL_CMD_DELMCAST_GRP:
|
2013-11-19 07:19:36 -07:00
|
|
|
BUG_ON(!grp);
|
2013-11-19 07:19:39 -07:00
|
|
|
msg = ctrl_build_mcgrp_msg(family, grp, grp_id, 0, 0, event);
|
2005-11-09 18:25:56 -07:00
|
|
|
break;
|
2009-07-10 03:51:34 -06:00
|
|
|
default:
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (IS_ERR(msg))
|
|
|
|
return PTR_ERR(msg);
|
|
|
|
|
|
|
|
if (!family->netnsok) {
|
2013-11-19 07:19:38 -07:00
|
|
|
genlmsg_multicast_netns(&genl_ctrl, &init_net, msg, 0,
|
2013-11-19 07:19:39 -07:00
|
|
|
0, GFP_KERNEL);
|
2009-07-10 03:51:34 -06:00
|
|
|
} else {
|
|
|
|
rcu_read_lock();
|
2013-11-19 07:19:38 -07:00
|
|
|
genlmsg_multicast_allns(&genl_ctrl, msg, 0,
|
2013-11-19 07:19:39 -07:00
|
|
|
0, GFP_ATOMIC);
|
2009-07-10 03:51:34 -06:00
|
|
|
rcu_read_unlock();
|
2005-11-09 18:25:56 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2016-08-31 16:22:00 -06:00
|
|
|
static const struct genl_ops genl_ctrl_ops[] = {
|
2013-11-19 07:19:31 -07:00
|
|
|
{
|
|
|
|
.cmd = CTRL_CMD_GETFAMILY,
|
|
|
|
.doit = ctrl_getfamily,
|
|
|
|
.dumpit = ctrl_dumpfamily,
|
|
|
|
.policy = ctrl_policy,
|
|
|
|
},
|
2005-11-09 18:25:56 -07:00
|
|
|
};
|
|
|
|
|
2016-08-31 16:22:00 -06:00
|
|
|
static const struct genl_multicast_group genl_ctrl_groups[] = {
|
2013-11-19 07:19:39 -07:00
|
|
|
{ .name = "notify", },
|
2007-07-18 16:47:52 -06:00
|
|
|
};
|
|
|
|
|
2016-10-24 06:40:05 -06:00
|
|
|
static struct genl_family genl_ctrl __ro_after_init = {
|
2016-10-24 06:40:03 -06:00
|
|
|
.module = THIS_MODULE,
|
|
|
|
.ops = genl_ctrl_ops,
|
|
|
|
.n_ops = ARRAY_SIZE(genl_ctrl_ops),
|
|
|
|
.mcgrps = genl_ctrl_groups,
|
|
|
|
.n_mcgrps = ARRAY_SIZE(genl_ctrl_groups),
|
|
|
|
.id = GENL_ID_CTRL,
|
|
|
|
.name = "nlctrl",
|
|
|
|
.version = 0x2,
|
|
|
|
.maxattr = CTRL_ATTR_MAX,
|
|
|
|
.netnsok = true,
|
|
|
|
};
|
|
|
|
|
2014-12-23 13:00:06 -07:00
|
|
|
static int genl_bind(struct net *net, int group)
|
2014-12-23 12:54:40 -07:00
|
|
|
{
|
2016-10-24 06:40:04 -06:00
|
|
|
struct genl_family *f;
|
|
|
|
int err = -ENOENT;
|
|
|
|
unsigned int id;
|
2014-12-23 12:54:40 -07:00
|
|
|
|
|
|
|
down_read(&cb_lock);
|
2016-10-24 06:40:04 -06:00
|
|
|
|
|
|
|
idr_for_each_entry(&genl_fam_idr, f, id) {
|
|
|
|
if (group >= f->mcgrp_offset &&
|
|
|
|
group < f->mcgrp_offset + f->n_mcgrps) {
|
|
|
|
int fam_grp = group - f->mcgrp_offset;
|
|
|
|
|
|
|
|
if (!f->netnsok && net != &init_net)
|
|
|
|
err = -ENOENT;
|
|
|
|
else if (f->mcast_bind)
|
|
|
|
err = f->mcast_bind(net, fam_grp);
|
|
|
|
else
|
|
|
|
err = 0;
|
|
|
|
break;
|
2014-12-23 12:54:40 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
up_read(&cb_lock);
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2014-12-23 13:00:06 -07:00
|
|
|
static void genl_unbind(struct net *net, int group)
|
2014-12-23 12:54:40 -07:00
|
|
|
{
|
2016-10-24 06:40:04 -06:00
|
|
|
struct genl_family *f;
|
|
|
|
unsigned int id;
|
2014-12-23 12:54:40 -07:00
|
|
|
|
|
|
|
down_read(&cb_lock);
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
idr_for_each_entry(&genl_fam_idr, f, id) {
|
|
|
|
if (group >= f->mcgrp_offset &&
|
|
|
|
group < f->mcgrp_offset + f->n_mcgrps) {
|
|
|
|
int fam_grp = group - f->mcgrp_offset;
|
2014-12-23 12:54:40 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
if (f->mcast_unbind)
|
|
|
|
f->mcast_unbind(net, fam_grp);
|
|
|
|
break;
|
2014-12-23 12:54:40 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
up_read(&cb_lock);
|
|
|
|
}
|
|
|
|
|
2009-07-10 03:51:34 -06:00
|
|
|
static int __net_init genl_pernet_init(struct net *net)
|
|
|
|
{
|
2012-06-29 00:15:21 -06:00
|
|
|
struct netlink_kernel_cfg cfg = {
|
|
|
|
.input = genl_rcv,
|
2012-09-07 20:53:53 -06:00
|
|
|
.flags = NL_CFG_F_NONROOT_RECV,
|
2014-12-23 12:54:40 -07:00
|
|
|
.bind = genl_bind,
|
|
|
|
.unbind = genl_unbind,
|
2012-06-29 00:15:21 -06:00
|
|
|
};
|
|
|
|
|
2009-07-10 03:51:34 -06:00
|
|
|
/* we'll bump the group number right afterwards */
|
2012-09-07 20:53:54 -06:00
|
|
|
net->genl_sock = netlink_kernel_create(net, NETLINK_GENERIC, &cfg);
|
2009-07-10 03:51:34 -06:00
|
|
|
|
|
|
|
if (!net->genl_sock && net_eq(net, &init_net))
|
|
|
|
panic("GENL: Cannot initialize generic netlink\n");
|
|
|
|
|
|
|
|
if (!net->genl_sock)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __net_exit genl_pernet_exit(struct net *net)
|
|
|
|
{
|
|
|
|
netlink_kernel_release(net->genl_sock);
|
|
|
|
net->genl_sock = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct pernet_operations genl_pernet_ops = {
|
|
|
|
.init = genl_pernet_init,
|
|
|
|
.exit = genl_pernet_exit,
|
|
|
|
};
|
|
|
|
|
2005-11-09 18:25:56 -07:00
|
|
|
static int __init genl_init(void)
|
|
|
|
{
|
2016-10-24 06:40:04 -06:00
|
|
|
int err;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2016-10-24 06:40:03 -06:00
|
|
|
err = genl_register_family(&genl_ctrl);
|
2005-11-09 18:25:56 -07:00
|
|
|
if (err < 0)
|
2009-07-10 03:51:34 -06:00
|
|
|
goto problem;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
2009-07-10 03:51:34 -06:00
|
|
|
err = register_pernet_subsys(&genl_pernet_ops);
|
|
|
|
if (err)
|
|
|
|
goto problem;
|
2005-11-09 18:25:56 -07:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
2009-07-10 03:51:34 -06:00
|
|
|
problem:
|
2005-11-09 18:25:56 -07:00
|
|
|
panic("GENL: Cannot register controller: %d\n", err);
|
|
|
|
}
|
|
|
|
|
|
|
|
subsys_initcall(genl_init);
|
|
|
|
|
2016-10-24 06:40:01 -06:00
|
|
|
/**
|
|
|
|
* genl_family_attrbuf - return family's attrbuf
|
|
|
|
* @family: the family
|
|
|
|
*
|
|
|
|
* Return the family's attrbuf, while validating that it's
|
|
|
|
* actually valid to access it.
|
|
|
|
*
|
|
|
|
* You cannot use this function with a family that has parallel_ops
|
|
|
|
* and you can only use it within (pre/post) doit/dumpit callbacks.
|
|
|
|
*/
|
2016-10-24 06:40:04 -06:00
|
|
|
struct nlattr **genl_family_attrbuf(const struct genl_family *family)
|
2016-10-24 06:40:01 -06:00
|
|
|
{
|
|
|
|
if (!WARN_ON(family->parallel_ops))
|
|
|
|
lockdep_assert_held(&genl_mutex);
|
|
|
|
|
|
|
|
return family->attrbuf;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(genl_family_attrbuf);
|
|
|
|
|
2012-09-07 14:12:54 -06:00
|
|
|
static int genlmsg_mcast(struct sk_buff *skb, u32 portid, unsigned long group,
|
2009-07-10 03:51:34 -06:00
|
|
|
gfp_t flags)
|
|
|
|
{
|
|
|
|
struct sk_buff *tmp;
|
|
|
|
struct net *net, *prev = NULL;
|
2018-02-06 06:48:32 -07:00
|
|
|
bool delivered = false;
|
2009-07-10 03:51:34 -06:00
|
|
|
int err;
|
|
|
|
|
|
|
|
for_each_net_rcu(net) {
|
|
|
|
if (prev) {
|
|
|
|
tmp = skb_clone(skb, flags);
|
|
|
|
if (!tmp) {
|
|
|
|
err = -ENOMEM;
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
err = nlmsg_multicast(prev->genl_sock, tmp,
|
2012-09-07 14:12:54 -06:00
|
|
|
portid, group, flags);
|
2018-02-06 06:48:32 -07:00
|
|
|
if (!err)
|
|
|
|
delivered = true;
|
|
|
|
else if (err != -ESRCH)
|
2009-07-10 03:51:34 -06:00
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
|
|
|
prev = net;
|
|
|
|
}
|
|
|
|
|
2018-02-06 06:48:32 -07:00
|
|
|
err = nlmsg_multicast(prev->genl_sock, skb, portid, group, flags);
|
|
|
|
if (!err)
|
|
|
|
delivered = true;
|
|
|
|
else if (err != -ESRCH)
|
2018-03-14 14:10:23 -06:00
|
|
|
return err;
|
2018-02-06 06:48:32 -07:00
|
|
|
return delivered ? 0 : -ESRCH;
|
2009-07-10 03:51:34 -06:00
|
|
|
error:
|
|
|
|
kfree_skb(skb);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
int genlmsg_multicast_allns(const struct genl_family *family,
|
|
|
|
struct sk_buff *skb, u32 portid,
|
|
|
|
unsigned int group, gfp_t flags)
|
2009-07-10 03:51:34 -06:00
|
|
|
{
|
2013-11-21 10:17:04 -07:00
|
|
|
if (WARN_ON_ONCE(group >= family->n_mcgrps))
|
2013-11-19 07:19:39 -07:00
|
|
|
return -EINVAL;
|
|
|
|
group = family->mcgrp_offset + group;
|
2012-09-07 14:12:54 -06:00
|
|
|
return genlmsg_mcast(skb, portid, group, flags);
|
2009-07-10 03:51:34 -06:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(genlmsg_multicast_allns);
|
2011-11-10 20:14:37 -07:00
|
|
|
|
2016-10-24 06:40:04 -06:00
|
|
|
void genl_notify(const struct genl_family *family, struct sk_buff *skb,
|
2015-09-22 10:56:43 -06:00
|
|
|
struct genl_info *info, u32 group, gfp_t flags)
|
2011-11-10 20:14:37 -07:00
|
|
|
{
|
2015-09-22 10:56:43 -06:00
|
|
|
struct net *net = genl_info_net(info);
|
2011-11-10 20:14:37 -07:00
|
|
|
struct sock *sk = net->genl_sock;
|
|
|
|
int report = 0;
|
|
|
|
|
2015-09-22 10:56:43 -06:00
|
|
|
if (info->nlhdr)
|
|
|
|
report = nlmsg_report(info->nlhdr);
|
2011-11-10 20:14:37 -07:00
|
|
|
|
2013-11-21 10:17:04 -07:00
|
|
|
if (WARN_ON_ONCE(group >= family->n_mcgrps))
|
2013-11-19 07:19:39 -07:00
|
|
|
return;
|
|
|
|
group = family->mcgrp_offset + group;
|
2015-09-22 10:56:43 -06:00
|
|
|
nlmsg_notify(sk, skb, info->snd_portid, group, report, flags);
|
2011-11-10 20:14:37 -07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(genl_notify);
|