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
|
|
|
#ifndef __LINUX_NETLINK_H
|
|
|
|
#define __LINUX_NETLINK_H
|
|
|
|
|
|
|
|
|
|
|
|
#include <linux/capability.h>
|
|
|
|
#include <linux/skbuff.h>
|
2012-09-21 09:35:38 +00:00
|
|
|
#include <linux/export.h>
|
2012-09-06 18:20:01 +00:00
|
|
|
#include <net/scm.h>
|
2012-10-13 09:46:48 +00:00
|
|
|
#include <uapi/linux/netlink.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2010-09-22 05:54:54 +00:00
|
|
|
struct net;
|
|
|
|
|
2007-04-26 02:08:35 +00:00
|
|
|
static inline struct nlmsghdr *nlmsg_hdr(const struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
return (struct nlmsghdr *)skb->data;
|
|
|
|
}
|
|
|
|
|
2013-04-17 06:47:02 +00:00
|
|
|
enum netlink_skb_flags {
|
2014-05-30 18:04:00 +00:00
|
|
|
NETLINK_SKB_DST = 0x8, /* Dst set in sendto or sendmsg */
|
2013-04-17 06:47:02 +00:00
|
|
|
};
|
|
|
|
|
2009-11-04 17:50:58 +00:00
|
|
|
struct netlink_skb_parms {
|
2012-09-06 18:20:01 +00:00
|
|
|
struct scm_creds creds; /* Skb credentials */
|
2012-09-07 20:12:54 +00:00
|
|
|
__u32 portid;
|
2005-08-15 02:27:50 +00:00
|
|
|
__u32 dst_group;
|
2013-04-17 06:47:02 +00:00
|
|
|
__u32 flags;
|
2013-04-17 06:46:57 +00:00
|
|
|
struct sock *sk;
|
2015-05-07 09:02:53 +00:00
|
|
|
bool nsid_is_set;
|
|
|
|
int nsid;
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
#define NETLINK_CB(skb) (*(struct netlink_skb_parms*)&((skb)->cb))
|
|
|
|
#define NETLINK_CREDS(skb) (&NETLINK_CB((skb)).creds)
|
|
|
|
|
|
|
|
|
2009-09-12 03:03:15 +00:00
|
|
|
extern void netlink_table_grab(void);
|
|
|
|
extern void netlink_table_ungrab(void);
|
|
|
|
|
2012-09-08 02:53:53 +00:00
|
|
|
#define NL_CFG_F_NONROOT_RECV (1 << 0)
|
|
|
|
#define NL_CFG_F_NONROOT_SEND (1 << 1)
|
|
|
|
|
2012-06-29 06:15:21 +00:00
|
|
|
/* optional Netlink kernel configuration parameters */
|
|
|
|
struct netlink_kernel_cfg {
|
|
|
|
unsigned int groups;
|
2012-09-23 06:09:23 +00:00
|
|
|
unsigned int flags;
|
2012-06-29 06:15:21 +00:00
|
|
|
void (*input)(struct sk_buff *skb);
|
|
|
|
struct mutex *cb_mutex;
|
2014-12-23 20:00:06 +00:00
|
|
|
int (*bind)(struct net *net, int group);
|
|
|
|
void (*unbind)(struct net *net, int group);
|
2013-06-06 06:49:11 +00:00
|
|
|
bool (*compare)(struct net *net, struct sock *sk);
|
2012-06-29 06:15:21 +00:00
|
|
|
};
|
|
|
|
|
2012-09-08 02:53:54 +00:00
|
|
|
extern struct sock *__netlink_kernel_create(struct net *net, int unit,
|
|
|
|
struct module *module,
|
|
|
|
struct netlink_kernel_cfg *cfg);
|
|
|
|
static inline struct sock *
|
|
|
|
netlink_kernel_create(struct net *net, int unit, struct netlink_kernel_cfg *cfg)
|
|
|
|
{
|
|
|
|
return __netlink_kernel_create(net, unit, THIS_MODULE, cfg);
|
|
|
|
}
|
|
|
|
|
2017-04-12 12:34:06 +00:00
|
|
|
/* this can be increased when necessary - don't expose to userland */
|
|
|
|
#define NETLINK_MAX_COOKIE_LEN 20
|
|
|
|
|
2017-04-12 12:34:04 +00:00
|
|
|
/**
|
|
|
|
* struct netlink_ext_ack - netlink extended ACK report struct
|
|
|
|
* @_msg: message string to report - don't access directly, use
|
|
|
|
* %NL_SET_ERR_MSG
|
|
|
|
* @bad_attr: attribute with error
|
2017-04-12 12:34:06 +00:00
|
|
|
* @cookie: cookie data to return to userspace (for success)
|
|
|
|
* @cookie_len: actual cookie data length
|
2017-04-12 12:34:04 +00:00
|
|
|
*/
|
|
|
|
struct netlink_ext_ack {
|
|
|
|
const char *_msg;
|
|
|
|
const struct nlattr *bad_attr;
|
2017-04-12 12:34:06 +00:00
|
|
|
u8 cookie[NETLINK_MAX_COOKIE_LEN];
|
|
|
|
u8 cookie_len;
|
2017-04-12 12:34:04 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/* Always use this macro, this allows later putting the
|
|
|
|
* message into a separate section or such for things
|
|
|
|
* like translation or listing all possible messages.
|
|
|
|
* Currently string formatting is not supported (due
|
|
|
|
* to the lack of an output buffer.)
|
|
|
|
*/
|
2017-05-02 22:39:17 +00:00
|
|
|
#define NL_SET_ERR_MSG(extack, msg) do { \
|
2018-01-15 11:42:25 +00:00
|
|
|
static const char __msg[] = msg; \
|
2017-05-02 22:39:17 +00:00
|
|
|
struct netlink_ext_ack *__extack = (extack); \
|
|
|
|
\
|
|
|
|
if (__extack) \
|
|
|
|
__extack->_msg = __msg; \
|
2017-04-12 12:34:04 +00:00
|
|
|
} while (0)
|
|
|
|
|
2017-05-02 22:39:17 +00:00
|
|
|
#define NL_SET_ERR_MSG_MOD(extack, msg) \
|
|
|
|
NL_SET_ERR_MSG((extack), KBUILD_MODNAME ": " msg)
|
2017-05-01 04:46:45 +00:00
|
|
|
|
2017-05-21 16:12:03 +00:00
|
|
|
#define NL_SET_BAD_ATTR(extack, attr) do { \
|
|
|
|
if ((extack)) \
|
|
|
|
(extack)->bad_attr = (attr); \
|
|
|
|
} while (0)
|
|
|
|
|
2017-05-27 22:19:28 +00:00
|
|
|
#define NL_SET_ERR_MSG_ATTR(extack, attr, msg) do { \
|
2018-01-15 11:42:25 +00:00
|
|
|
static const char __msg[] = msg; \
|
2017-05-27 22:19:28 +00:00
|
|
|
struct netlink_ext_ack *__extack = (extack); \
|
|
|
|
\
|
|
|
|
if (__extack) { \
|
|
|
|
__extack->_msg = __msg; \
|
|
|
|
__extack->bad_attr = (attr); \
|
|
|
|
} \
|
|
|
|
} while (0)
|
|
|
|
|
2008-01-28 22:41:19 +00:00
|
|
|
extern void netlink_kernel_release(struct sock *sk);
|
2009-09-12 03:03:15 +00:00
|
|
|
extern int __netlink_change_ngroups(struct sock *sk, unsigned int groups);
|
2007-07-18 22:46:06 +00:00
|
|
|
extern int netlink_change_ngroups(struct sock *sk, unsigned int groups);
|
2009-09-24 22:44:05 +00:00
|
|
|
extern void __netlink_clear_multicast_users(struct sock *sk, unsigned int group);
|
2017-04-12 12:34:04 +00:00
|
|
|
extern void netlink_ack(struct sk_buff *in_skb, struct nlmsghdr *nlh, int err,
|
|
|
|
const struct netlink_ext_ack *extack);
|
2006-03-21 02:52:01 +00:00
|
|
|
extern int netlink_has_listeners(struct sock *sk, unsigned int group);
|
netlink, mmap: fix edge-case leakages in nf queue zero-copy
When netlink mmap on receive side is the consumer of nf queue data,
it can happen that in some edge cases, we write skb shared info into
the user space mmap buffer:
Assume a possible rx ring frame size of only 4096, and the network skb,
which is being zero-copied into the netlink skb, contains page frags
with an overall skb->len larger than the linear part of the netlink
skb.
skb_zerocopy(), which is generic and thus not aware of the fact that
shared info cannot be accessed for such skbs then tries to write and
fill frags, thus leaking kernel data/pointers and in some corner cases
possibly writing out of bounds of the mmap area (when filling the
last slot in the ring buffer this way).
I.e. the ring buffer slot is then of status NL_MMAP_STATUS_VALID, has
an advertised length larger than 4096, where the linear part is visible
at the slot beginning, and the leaked sizeof(struct skb_shared_info)
has been written to the beginning of the next slot (also corrupting
the struct nl_mmap_hdr slot header incl. status etc), since skb->end
points to skb->data + ring->frame_size - NL_MMAP_HDRLEN.
The fix adds and lets __netlink_alloc_skb() take the actual needed
linear room for the network skb + meta data into account. It's completely
irrelevant for non-mmaped netlink sockets, but in case mmap sockets
are used, it can be decided whether the available skb_tailroom() is
really large enough for the buffer, or whether it needs to internally
fallback to a normal alloc_skb().
>From nf queue side, the information whether the destination port is
an mmap RX ring is not really available without extra port-to-socket
lookup, thus it can only be determined in lower layers i.e. when
__netlink_alloc_skb() is called that checks internally for this. I
chose to add the extra ldiff parameter as mmap will then still work:
We have data_len and hlen in nfqnl_build_packet_message(), data_len
is the full length (capped at queue->copy_range) for skb_zerocopy()
and hlen some possible part of data_len that needs to be copied; the
rem_len variable indicates the needed remaining linear mmap space.
The only other workaround in nf queue internally would be after
allocation time by f.e. cap'ing the data_len to the skb_tailroom()
iff we deal with an mmap skb, but that would 1) expose the fact that
we use a mmap skb to upper layers, and 2) trim the skb where we
otherwise could just have moved the full skb into the normal receive
queue.
After the patch, in my test case the ring slot doesn't fit and therefore
shows NL_MMAP_STATUS_COPY, where a full skb carries all the data and
thus needs to be picked up via recv().
Fixes: 3ab1f683bf8b ("nfnetlink: add support for memory mapped netlink")
Signed-off-by: Daniel Borkmann <daniel@iogearbox.net>
Signed-off-by: David S. Miller <davem@davemloft.net>
2015-09-10 00:10:57 +00:00
|
|
|
|
2012-09-07 20:12:54 +00:00
|
|
|
extern int netlink_unicast(struct sock *ssk, struct sk_buff *skb, __u32 portid, int nonblock);
|
|
|
|
extern int netlink_broadcast(struct sock *ssk, struct sk_buff *skb, __u32 portid,
|
2005-10-07 06:46:04 +00:00
|
|
|
__u32 group, gfp_t allocation);
|
2010-05-05 00:36:46 +00:00
|
|
|
extern int netlink_broadcast_filtered(struct sock *ssk, struct sk_buff *skb,
|
2012-09-07 20:12:54 +00:00
|
|
|
__u32 portid, __u32 group, gfp_t allocation,
|
2010-05-05 00:36:46 +00:00
|
|
|
int (*filter)(struct sock *dsk, struct sk_buff *skb, void *data),
|
|
|
|
void *filter_data);
|
2012-09-07 20:12:54 +00:00
|
|
|
extern int netlink_set_err(struct sock *ssk, __u32 portid, __u32 group, int code);
|
2005-04-16 22:20:36 +00:00
|
|
|
extern int netlink_register_notifier(struct notifier_block *nb);
|
|
|
|
extern int netlink_unregister_notifier(struct notifier_block *nb);
|
|
|
|
|
|
|
|
/* finegrained unicast helpers: */
|
|
|
|
struct sock *netlink_getsockbyfilp(struct file *filp);
|
2008-06-05 18:23:39 +00:00
|
|
|
int netlink_attachskb(struct sock *sk, struct sk_buff *skb,
|
2007-11-07 10:42:09 +00:00
|
|
|
long *timeo, struct sock *ssk);
|
2005-04-16 22:20:36 +00:00
|
|
|
void netlink_detachskb(struct sock *sk, struct sk_buff *skb);
|
2007-10-11 04:14:03 +00:00
|
|
|
int netlink_sendskb(struct sock *sk, struct sk_buff *skb);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2013-06-28 01:04:23 +00:00
|
|
|
static inline struct sk_buff *
|
|
|
|
netlink_skb_clone(struct sk_buff *skb, gfp_t gfp_mask)
|
|
|
|
{
|
|
|
|
struct sk_buff *nskb;
|
|
|
|
|
|
|
|
nskb = skb_clone(skb, gfp_mask);
|
|
|
|
if (!nskb)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* This is a large skb, set destructor callback to release head */
|
|
|
|
if (is_vmalloc_addr(skb->head))
|
|
|
|
nskb->destructor = skb->destructor;
|
|
|
|
|
|
|
|
return nskb;
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* skb should fit one page. This choice is good for headerless malloc.
|
2007-03-26 03:27:59 +00:00
|
|
|
* But we should limit to 8K so that userspace does not have to
|
|
|
|
* use enormous buffer sizes on recvmsg() calls just to avoid
|
|
|
|
* MSG_TRUNC when PAGE_SIZE is very large.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2007-03-26 03:27:59 +00:00
|
|
|
#if PAGE_SIZE < 8192UL
|
|
|
|
#define NLMSG_GOODSIZE SKB_WITH_OVERHEAD(PAGE_SIZE)
|
|
|
|
#else
|
|
|
|
#define NLMSG_GOODSIZE SKB_WITH_OVERHEAD(8192UL)
|
|
|
|
#endif
|
|
|
|
|
2006-11-10 22:10:15 +00:00
|
|
|
#define NLMSG_DEFAULT_SIZE (NLMSG_GOODSIZE - NLMSG_HDRLEN)
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
2009-11-04 17:50:58 +00:00
|
|
|
struct netlink_callback {
|
2009-08-25 14:07:40 +00:00
|
|
|
struct sk_buff *skb;
|
|
|
|
const struct nlmsghdr *nlh;
|
|
|
|
int (*dump)(struct sk_buff * skb,
|
|
|
|
struct netlink_callback *cb);
|
|
|
|
int (*done)(struct netlink_callback *cb);
|
2012-02-24 14:30:16 +00:00
|
|
|
void *data;
|
2012-10-04 20:15:48 +00:00
|
|
|
/* the module that dump function belong to */
|
|
|
|
struct module *module;
|
2018-10-08 03:16:22 +00:00
|
|
|
struct netlink_ext_ack *extack;
|
2011-06-10 01:27:09 +00:00
|
|
|
u16 family;
|
|
|
|
u16 min_dump_alloc;
|
netlink: advertise incomplete dumps
Consider the following situation:
* a dump that would show 8 entries, four in the first
round, and four in the second
* between the first and second rounds, 6 entries are
removed
* now the second round will not show any entry, and
even if there is a sequence/generation counter the
application will not know
To solve this problem, add a new flag NLM_F_DUMP_INTR
to the netlink header that indicates the dump wasn't
consistent, this flag can also be set on the MSG_DONE
message that terminates the dump, and as such above
situation can be detected.
To achieve this, add a sequence counter to the netlink
callback struct. Of course, netlink code still needs
to use this new functionality. The correct way to do
that is to always set cb->seq when a dumpit callback
is invoked and call nl_dump_check_consistent() for
each new message. The core code will also call this
function for the final MSG_DONE message.
To make it usable with generic netlink, a new function
genlmsg_nlhdr() is needed to obtain the netlink header
from the genetlink user header.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
Acked-by: David S. Miller <davem@davemloft.net>
Signed-off-by: John W. Linville <linville@tuxdriver.com>
2011-06-20 11:40:46 +00:00
|
|
|
unsigned int prev_seq, seq;
|
2009-08-25 14:07:40 +00:00
|
|
|
long args[6];
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
2009-11-04 17:50:58 +00:00
|
|
|
struct netlink_notify {
|
2007-09-12 11:05:38 +00:00
|
|
|
struct net *net;
|
2015-04-12 22:52:35 +00:00
|
|
|
u32 portid;
|
2005-04-16 22:20:36 +00:00
|
|
|
int protocol;
|
|
|
|
};
|
|
|
|
|
2012-01-30 20:22:06 +00:00
|
|
|
struct nlmsghdr *
|
2012-09-07 20:12:54 +00:00
|
|
|
__nlmsg_put(struct sk_buff *skb, u32 portid, u32 seq, int type, int len, int flags);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2012-02-24 14:30:15 +00:00
|
|
|
struct netlink_dump_control {
|
2015-12-15 23:41:37 +00:00
|
|
|
int (*start)(struct netlink_callback *);
|
2012-02-24 14:30:15 +00:00
|
|
|
int (*dump)(struct sk_buff *skb, struct netlink_callback *);
|
2012-10-04 20:15:48 +00:00
|
|
|
int (*done)(struct netlink_callback *);
|
2012-02-24 14:30:16 +00:00
|
|
|
void *data;
|
2012-10-04 20:15:48 +00:00
|
|
|
struct module *module;
|
2012-02-24 14:30:15 +00:00
|
|
|
u16 min_dump_alloc;
|
|
|
|
};
|
|
|
|
|
2012-10-04 20:15:48 +00:00
|
|
|
extern int __netlink_dump_start(struct sock *ssk, struct sk_buff *skb,
|
|
|
|
const struct nlmsghdr *nlh,
|
|
|
|
struct netlink_dump_control *control);
|
|
|
|
static inline int netlink_dump_start(struct sock *ssk, struct sk_buff *skb,
|
|
|
|
const struct nlmsghdr *nlh,
|
|
|
|
struct netlink_dump_control *control)
|
|
|
|
{
|
|
|
|
if (!control->module)
|
|
|
|
control->module = THIS_MODULE;
|
|
|
|
|
|
|
|
return __netlink_dump_start(ssk, skb, nlh, control);
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2013-06-21 17:38:07 +00:00
|
|
|
struct netlink_tap {
|
|
|
|
struct net_device *dev;
|
|
|
|
struct module *module;
|
|
|
|
struct list_head list;
|
|
|
|
};
|
|
|
|
|
|
|
|
extern int netlink_add_tap(struct netlink_tap *nt);
|
|
|
|
extern int netlink_remove_tap(struct netlink_tap *nt);
|
|
|
|
|
2014-04-23 21:28:03 +00:00
|
|
|
bool __netlink_ns_capable(const struct netlink_skb_parms *nsp,
|
|
|
|
struct user_namespace *ns, int cap);
|
|
|
|
bool netlink_ns_capable(const struct sk_buff *skb,
|
|
|
|
struct user_namespace *ns, int cap);
|
|
|
|
bool netlink_capable(const struct sk_buff *skb, int cap);
|
|
|
|
bool netlink_net_capable(const struct sk_buff *skb, int cap);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif /* __LINUX_NETLINK_H */
|