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 22:07:57 +08:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2005-04-17 06:20:36 +08:00
|
|
|
#ifndef _NET_IP6_ROUTE_H
|
|
|
|
#define _NET_IP6_ROUTE_H
|
|
|
|
|
2006-03-21 09:06:24 +08:00
|
|
|
struct route_info {
|
|
|
|
__u8 type;
|
|
|
|
__u8 length;
|
|
|
|
__u8 prefix_len;
|
|
|
|
#if defined(__BIG_ENDIAN_BITFIELD)
|
|
|
|
__u8 reserved_h:3,
|
|
|
|
route_pref:2,
|
|
|
|
reserved_l:3;
|
|
|
|
#elif defined(__LITTLE_ENDIAN_BITFIELD)
|
|
|
|
__u8 reserved_l:3,
|
|
|
|
route_pref:2,
|
|
|
|
reserved_h:3;
|
|
|
|
#endif
|
2006-11-15 12:56:00 +08:00
|
|
|
__be32 lifetime;
|
2006-03-21 09:06:24 +08:00
|
|
|
__u8 prefix[0]; /* 0,8 or 16 */
|
|
|
|
};
|
|
|
|
|
2016-06-17 07:24:24 +08:00
|
|
|
#include <net/addrconf.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <net/flow.h>
|
|
|
|
#include <net/ip6_fib.h>
|
|
|
|
#include <net/sock.h>
|
2017-07-06 04:41:46 +08:00
|
|
|
#include <net/lwtunnel.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/ip.h>
|
|
|
|
#include <linux/ipv6.h>
|
2013-01-17 20:53:48 +08:00
|
|
|
#include <linux/route.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-03-25 08:37:42 +08:00
|
|
|
#define RT6_LOOKUP_F_IFACE 0x00000001
|
|
|
|
#define RT6_LOOKUP_F_REACHABLE 0x00000002
|
|
|
|
#define RT6_LOOKUP_F_HAS_SADDR 0x00000004
|
|
|
|
#define RT6_LOOKUP_F_SRCPREF_TMP 0x00000008
|
|
|
|
#define RT6_LOOKUP_F_SRCPREF_PUBLIC 0x00000010
|
|
|
|
#define RT6_LOOKUP_F_SRCPREF_COA 0x00000020
|
2016-10-25 03:27:23 +08:00
|
|
|
#define RT6_LOOKUP_F_IGNORE_LINKSTATE 0x00000040
|
2006-08-24 08:25:05 +08:00
|
|
|
|
2014-04-11 12:23:36 +08:00
|
|
|
/* We do not (yet ?) support IPv6 jumbograms (RFC 2675)
|
|
|
|
* Unlike IPv4, hdr->seg_len doesn't include the IPv6 header
|
|
|
|
*/
|
|
|
|
#define IP6_MAX_MTU (0xFFFF + sizeof(struct ipv6hdr))
|
|
|
|
|
2010-03-07 08:14:44 +08:00
|
|
|
/*
|
|
|
|
* rt6_srcprefs2flags() and rt6_flags2srcprefs() translate
|
|
|
|
* between IPV6_ADDR_PREFERENCES socket option values
|
|
|
|
* IPV6_PREFER_SRC_TMP = 0x1
|
|
|
|
* IPV6_PREFER_SRC_PUBLIC = 0x2
|
|
|
|
* IPV6_PREFER_SRC_COA = 0x4
|
|
|
|
* and above RT6_LOOKUP_F_SRCPREF_xxx flags.
|
|
|
|
*/
|
|
|
|
static inline int rt6_srcprefs2flags(unsigned int srcprefs)
|
|
|
|
{
|
|
|
|
/* No need to bitmask because srcprefs have only 3 bits. */
|
|
|
|
return srcprefs << 3;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned int rt6_flags2srcprefs(int flags)
|
|
|
|
{
|
|
|
|
return (flags >> 3) & 7;
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2014-03-29 09:27:30 +08:00
|
|
|
static inline bool rt6_need_strict(const struct in6_addr *daddr)
|
|
|
|
{
|
|
|
|
return ipv6_addr_type(daddr) &
|
|
|
|
(IPV6_ADDR_MULTICAST | IPV6_ADDR_LINKLOCAL | IPV6_ADDR_LOOPBACK);
|
|
|
|
}
|
2012-06-09 14:24:18 +08:00
|
|
|
|
2018-04-19 06:38:59 +08:00
|
|
|
static inline bool rt6_qualify_for_ecmp(const struct fib6_info *f6i)
|
2018-01-09 22:40:25 +08:00
|
|
|
{
|
2018-04-19 06:38:59 +08:00
|
|
|
return (f6i->fib6_flags & (RTF_GATEWAY|RTF_ADDRCONF|RTF_DYNAMIC)) ==
|
2018-01-09 22:40:25 +08:00
|
|
|
RTF_GATEWAY;
|
|
|
|
}
|
|
|
|
|
2013-09-22 01:22:42 +08:00
|
|
|
void ip6_route_input(struct sk_buff *skb);
|
2016-09-17 03:59:08 +08:00
|
|
|
struct dst_entry *ip6_route_input_lookup(struct net *net,
|
|
|
|
struct net_device *dev,
|
2018-03-03 00:32:17 +08:00
|
|
|
struct flowi6 *fl6,
|
|
|
|
const struct sk_buff *skb, int flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2016-01-29 19:30:19 +08:00
|
|
|
struct dst_entry *ip6_route_output_flags(struct net *net, const struct sock *sk,
|
|
|
|
struct flowi6 *fl6, int flags);
|
|
|
|
|
|
|
|
static inline struct dst_entry *ip6_route_output(struct net *net,
|
|
|
|
const struct sock *sk,
|
|
|
|
struct flowi6 *fl6)
|
|
|
|
{
|
|
|
|
return ip6_route_output_flags(net, sk, fl6, 0);
|
|
|
|
}
|
|
|
|
|
2013-09-22 01:22:42 +08:00
|
|
|
struct dst_entry *ip6_route_lookup(struct net *net, struct flowi6 *fl6,
|
2018-03-03 00:32:17 +08:00
|
|
|
const struct sk_buff *skb, int flags);
|
2016-06-14 04:44:19 +08:00
|
|
|
struct rt6_info *ip6_pol_route(struct net *net, struct fib6_table *table,
|
2018-03-03 00:32:17 +08:00
|
|
|
int ifindex, struct flowi6 *fl6,
|
|
|
|
const struct sk_buff *skb, int flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2017-05-04 13:07:31 +08:00
|
|
|
void ip6_route_init_special_entries(void);
|
2013-09-22 01:22:42 +08:00
|
|
|
int ip6_route_init(void);
|
|
|
|
void ip6_route_cleanup(void);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2013-09-22 01:22:42 +08:00
|
|
|
int ipv6_route_ioctl(struct net *net, unsigned int cmd, void __user *arg);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2018-04-18 08:33:22 +08:00
|
|
|
int ip6_route_add(struct fib6_config *cfg, gfp_t gfp_flags,
|
|
|
|
struct netlink_ext_ack *extack);
|
2018-04-19 06:38:59 +08:00
|
|
|
int ip6_ins_rt(struct net *net, struct fib6_info *f6i);
|
|
|
|
int ip6_del_rt(struct net *net, struct fib6_info *f6i);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2018-04-19 06:38:59 +08:00
|
|
|
void rt6_flush_exceptions(struct fib6_info *f6i);
|
|
|
|
void rt6_age_exceptions(struct fib6_info *f6i, struct fib6_gc_args *gc_args,
|
2017-10-07 03:06:01 +08:00
|
|
|
unsigned long now);
|
2017-10-07 03:05:57 +08:00
|
|
|
|
2018-04-19 06:38:59 +08:00
|
|
|
static inline int ip6_route_get_saddr(struct net *net, struct fib6_info *f6i,
|
2016-06-17 07:24:24 +08:00
|
|
|
const struct in6_addr *daddr,
|
|
|
|
unsigned int prefs,
|
|
|
|
struct in6_addr *saddr)
|
|
|
|
{
|
2018-04-19 06:38:59 +08:00
|
|
|
struct inet6_dev *idev = f6i ? f6i->fib6_idev : NULL;
|
2016-06-17 07:24:24 +08:00
|
|
|
int err = 0;
|
|
|
|
|
2018-04-19 06:38:59 +08:00
|
|
|
if (f6i && f6i->fib6_prefsrc.plen)
|
|
|
|
*saddr = f6i->fib6_prefsrc.addr;
|
2016-06-17 07:24:24 +08:00
|
|
|
else
|
|
|
|
err = ipv6_dev_get_saddr(net, idev ? idev->dev : NULL,
|
|
|
|
daddr, prefs, saddr);
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
2011-04-14 05:10:57 +08:00
|
|
|
|
2013-09-22 01:22:42 +08:00
|
|
|
struct rt6_info *rt6_lookup(struct net *net, const struct in6_addr *daddr,
|
2018-03-03 00:32:17 +08:00
|
|
|
const struct in6_addr *saddr, int oif,
|
|
|
|
const struct sk_buff *skb, int flags);
|
2018-03-03 00:32:18 +08:00
|
|
|
u32 rt6_multipath_hash(const struct net *net, const struct flowi6 *fl6,
|
|
|
|
const struct sk_buff *skb, struct flow_keys *hkeys);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2013-09-22 01:22:42 +08:00
|
|
|
struct dst_entry *icmp6_dst_alloc(struct net_device *dev, struct flowi6 *fl6);
|
2007-12-07 08:11:48 +08:00
|
|
|
|
2013-09-22 01:22:42 +08:00
|
|
|
void fib6_force_start_gc(struct net *net);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2018-04-19 06:39:00 +08:00
|
|
|
struct fib6_info *addrconf_f6i_alloc(struct net *net, struct inet6_dev *idev,
|
2018-04-18 08:33:26 +08:00
|
|
|
const struct in6_addr *addr, bool anycast,
|
|
|
|
gfp_t gfp_flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2016-04-08 02:10:06 +08:00
|
|
|
struct rt6_info *ip6_dst_alloc(struct net *net, struct net_device *dev,
|
|
|
|
int flags);
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* support functions for ND
|
|
|
|
*
|
|
|
|
*/
|
2018-04-18 08:33:26 +08:00
|
|
|
struct fib6_info *rt6_get_dflt_router(struct net *net,
|
2018-04-18 08:33:11 +08:00
|
|
|
const struct in6_addr *addr,
|
2013-09-22 01:22:42 +08:00
|
|
|
struct net_device *dev);
|
2018-04-18 08:33:26 +08:00
|
|
|
struct fib6_info *rt6_add_dflt_router(struct net *net,
|
2018-04-18 08:33:11 +08:00
|
|
|
const struct in6_addr *gwaddr,
|
2013-09-22 01:22:42 +08:00
|
|
|
struct net_device *dev, unsigned int pref);
|
|
|
|
|
|
|
|
void rt6_purge_dflt_routers(struct net *net);
|
|
|
|
|
|
|
|
int rt6_route_rcv(struct net_device *dev, u8 *opt, int len,
|
|
|
|
const struct in6_addr *gwaddr);
|
|
|
|
|
|
|
|
void ip6_update_pmtu(struct sk_buff *skb, struct net *net, __be32 mtu, int oif,
|
2016-11-04 01:23:43 +08:00
|
|
|
u32 mark, kuid_t uid);
|
2013-09-22 01:22:42 +08:00
|
|
|
void ip6_sk_update_pmtu(struct sk_buff *skb, struct sock *sk, __be32 mtu);
|
2016-11-04 01:23:43 +08:00
|
|
|
void ip6_redirect(struct sk_buff *skb, struct net *net, int oif, u32 mark,
|
|
|
|
kuid_t uid);
|
2013-09-22 01:22:42 +08:00
|
|
|
void ip6_redirect_no_header(struct sk_buff *skb, struct net *net, int oif,
|
|
|
|
u32 mark);
|
|
|
|
void ip6_sk_redirect(struct sk_buff *skb, struct sock *sk);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
struct netlink_callback;
|
|
|
|
|
2009-11-03 11:26:03 +08:00
|
|
|
struct rt6_rtnl_dump_arg {
|
2006-08-11 14:11:17 +08:00
|
|
|
struct sk_buff *skb;
|
|
|
|
struct netlink_callback *cb;
|
2008-08-15 06:33:21 +08:00
|
|
|
struct net *net;
|
2006-08-11 14:11:17 +08:00
|
|
|
};
|
|
|
|
|
2018-04-19 06:38:59 +08:00
|
|
|
int rt6_dump_route(struct fib6_info *f6i, void *p_arg);
|
2013-09-22 01:22:42 +08:00
|
|
|
void rt6_mtu_change(struct net_device *dev, unsigned int mtu);
|
|
|
|
void rt6_remove_prefsrc(struct inet6_ifaddr *ifp);
|
2014-05-15 15:56:14 +08:00
|
|
|
void rt6_clean_tohost(struct net *net, struct in6_addr *gateway);
|
2018-01-07 18:45:03 +08:00
|
|
|
void rt6_sync_up(struct net_device *dev, unsigned int nh_flags);
|
2018-01-07 18:45:04 +08:00
|
|
|
void rt6_disable_ip(struct net_device *dev, unsigned long event);
|
2018-01-07 18:45:05 +08:00
|
|
|
void rt6_sync_down_dev(struct net_device *dev, unsigned long event);
|
2018-04-19 06:38:59 +08:00
|
|
|
void rt6_multipath_rebalance(struct fib6_info *f6i);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
xfrm: reuse uncached_list to track xdsts
In early time, when freeing a xdst, it would be inserted into
dst_garbage.list first. Then if it's refcnt was still held
somewhere, later it would be put into dst_busy_list in
dst_gc_task().
When one dev was being unregistered, the dev of these dsts in
dst_busy_list would be set with loopback_dev and put this dev.
So that this dev's removal wouldn't get blocked, and avoid the
kmsg warning:
kernel:unregister_netdevice: waiting for veth0 to become \
free. Usage count = 2
However after Commit 52df157f17e5 ("xfrm: take refcnt of dst
when creating struct xfrm_dst bundle"), the xdst will not be
freed with dst gc, and this warning happens.
To fix it, we need to find these xdsts that are still held by
others when removing the dev, and free xdst's dev and set it
with loopback_dev.
But unfortunately after flow_cache for xfrm was deleted, no
list tracks them anymore. So we need to save these xdsts
somewhere to release the xdst's dev later.
To make this easier, this patch is to reuse uncached_list to
track xdsts, so that the dev refcnt can be released in the
event NETDEV_UNREGISTER process of fib_netdev_notifier.
Thanks to Florian, we could move forward this fix quickly.
Fixes: 52df157f17e5 ("xfrm: take refcnt of dst when creating struct xfrm_dst bundle")
Reported-by: Jianlin Shi <jishi@redhat.com>
Reported-by: Hangbin Liu <liuhangbin@gmail.com>
Tested-by: Eyal Birger <eyal.birger@gmail.com>
Signed-off-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Steffen Klassert <steffen.klassert@secunet.com>
2018-02-14 19:06:02 +08:00
|
|
|
void rt6_uncached_list_add(struct rt6_info *rt);
|
|
|
|
void rt6_uncached_list_del(struct rt6_info *rt);
|
|
|
|
|
2017-08-29 04:53:34 +08:00
|
|
|
static inline const struct rt6_info *skb_rt6_info(const struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
const struct dst_entry *dst = skb_dst(skb);
|
|
|
|
const struct rt6_info *rt6 = NULL;
|
|
|
|
|
|
|
|
if (dst)
|
|
|
|
rt6 = container_of(dst, struct rt6_info, dst);
|
|
|
|
|
|
|
|
return rt6;
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Store a destination cache entry in a socket
|
|
|
|
*/
|
2015-12-03 13:53:57 +08:00
|
|
|
static inline void ip6_dst_store(struct sock *sk, struct dst_entry *dst,
|
|
|
|
const struct in6_addr *daddr,
|
|
|
|
const struct in6_addr *saddr)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
struct ipv6_pinfo *np = inet6_sk(sk);
|
|
|
|
|
2015-12-03 13:53:57 +08:00
|
|
|
np->dst_cookie = rt6_get_cookie((struct rt6_info *)dst);
|
2006-07-01 04:37:03 +08:00
|
|
|
sk_setup_caps(sk, dst);
|
2005-04-17 06:20:36 +08:00
|
|
|
np->daddr_cache = daddr;
|
2006-08-30 08:15:09 +08:00
|
|
|
#ifdef CONFIG_IPV6_SUBTREES
|
|
|
|
np->saddr_cache = saddr;
|
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2018-04-03 20:00:07 +08:00
|
|
|
void ip6_sk_dst_store_flow(struct sock *sk, struct dst_entry *dst,
|
|
|
|
const struct flowi6 *fl6);
|
|
|
|
|
2012-05-19 02:57:34 +08:00
|
|
|
static inline bool ipv6_unicast_destination(const struct sk_buff *skb)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2009-06-02 13:19:30 +08:00
|
|
|
struct rt6_info *rt = (struct rt6_info *) skb_dst(skb);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
return rt->rt6i_flags & RTF_LOCAL;
|
|
|
|
}
|
|
|
|
|
2015-05-23 11:55:58 +08:00
|
|
|
static inline bool ipv6_anycast_destination(const struct dst_entry *dst,
|
|
|
|
const struct in6_addr *daddr)
|
2014-01-07 21:57:27 +08:00
|
|
|
{
|
2015-05-23 11:55:58 +08:00
|
|
|
struct rt6_info *rt = (struct rt6_info *)dst;
|
2014-01-07 21:57:27 +08:00
|
|
|
|
2015-05-23 11:55:58 +08:00
|
|
|
return rt->rt6i_flags & RTF_ANYCAST ||
|
2017-07-16 01:40:20 +08:00
|
|
|
(rt->rt6i_dst.plen < 127 &&
|
2015-05-23 11:55:58 +08:00
|
|
|
ipv6_addr_equal(&rt->rt6i_dst.addr, daddr));
|
2014-01-07 21:57:27 +08:00
|
|
|
}
|
|
|
|
|
2015-06-13 11:12:04 +08:00
|
|
|
int ip6_fragment(struct net *net, struct sock *sk, struct sk_buff *skb,
|
|
|
|
int (*output)(struct net *, struct sock *, struct sk_buff *));
|
2010-12-17 19:42:42 +08:00
|
|
|
|
|
|
|
static inline int ip6_skb_dst_mtu(struct sk_buff *skb)
|
|
|
|
{
|
2015-04-01 23:07:44 +08:00
|
|
|
struct ipv6_pinfo *np = skb->sk && !dev_recursion_level() ?
|
|
|
|
inet6_sk(skb->sk) : NULL;
|
2010-12-17 19:42:42 +08:00
|
|
|
|
2013-12-15 10:41:14 +08:00
|
|
|
return (np && np->pmtudisc >= IPV6_PMTUDISC_PROBE) ?
|
2010-12-17 19:42:42 +08:00
|
|
|
skb_dst(skb)->dev->mtu : dst_mtu(skb_dst(skb));
|
|
|
|
}
|
|
|
|
|
2013-12-15 10:41:14 +08:00
|
|
|
static inline bool ip6_sk_accept_pmtu(const struct sock *sk)
|
|
|
|
{
|
2014-02-26 08:20:43 +08:00
|
|
|
return inet6_sk(sk)->pmtudisc != IPV6_PMTUDISC_INTERFACE &&
|
|
|
|
inet6_sk(sk)->pmtudisc != IPV6_PMTUDISC_OMIT;
|
|
|
|
}
|
|
|
|
|
2014-05-05 07:39:18 +08:00
|
|
|
static inline bool ip6_sk_ignore_df(const struct sock *sk)
|
2014-02-26 08:20:43 +08:00
|
|
|
{
|
|
|
|
return inet6_sk(sk)->pmtudisc < IPV6_PMTUDISC_DO ||
|
|
|
|
inet6_sk(sk)->pmtudisc == IPV6_PMTUDISC_OMIT;
|
2013-12-15 10:41:14 +08:00
|
|
|
}
|
|
|
|
|
2015-05-23 11:55:58 +08:00
|
|
|
static inline struct in6_addr *rt6_nexthop(struct rt6_info *rt,
|
|
|
|
struct in6_addr *daddr)
|
2013-01-17 20:53:48 +08:00
|
|
|
{
|
2015-05-23 11:55:58 +08:00
|
|
|
if (rt->rt6i_flags & RTF_GATEWAY)
|
|
|
|
return &rt->rt6i_gateway;
|
2015-05-23 11:56:00 +08:00
|
|
|
else if (unlikely(rt->rt6i_flags & RTF_CACHE))
|
2015-05-23 11:55:58 +08:00
|
|
|
return &rt->rt6i_dst.addr;
|
|
|
|
else
|
|
|
|
return daddr;
|
2013-01-17 20:53:48 +08:00
|
|
|
}
|
|
|
|
|
2018-04-18 08:33:26 +08:00
|
|
|
static inline bool rt6_duplicate_nexthop(struct fib6_info *a, struct fib6_info *b)
|
2017-07-06 04:41:46 +08:00
|
|
|
{
|
2018-04-18 08:33:14 +08:00
|
|
|
return a->fib6_nh.nh_dev == b->fib6_nh.nh_dev &&
|
2018-04-19 06:38:59 +08:00
|
|
|
a->fib6_idev == b->fib6_idev &&
|
2018-04-18 08:33:14 +08:00
|
|
|
ipv6_addr_equal(&a->fib6_nh.nh_gw, &b->fib6_nh.nh_gw) &&
|
|
|
|
!lwtunnel_cmp_encap(a->fib6_nh.nh_lwtstate, b->fib6_nh.nh_lwtstate);
|
2017-07-06 04:41:46 +08:00
|
|
|
}
|
2018-03-01 11:43:22 +08:00
|
|
|
|
2018-04-18 08:33:21 +08:00
|
|
|
struct neighbour *ip6_neigh_lookup(const struct in6_addr *gw,
|
|
|
|
struct net_device *dev, struct sk_buff *skb,
|
|
|
|
const void *daddr);
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif
|