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
|
2015-08-18 04:42:27 +08:00
|
|
|
#include <linux/errno.h>
|
|
|
|
|
#include <linux/ip.h>
|
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
|
#include <linux/skbuff.h>
|
|
|
|
|
#include <linux/socket.h>
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
|
#include <net/checksum.h>
|
2016-10-15 02:25:37 +08:00
|
|
|
#include <net/dst_cache.h>
|
2015-08-18 04:42:27 +08:00
|
|
|
#include <net/ip.h>
|
|
|
|
|
#include <net/ip6_fib.h>
|
2016-10-15 02:25:37 +08:00
|
|
|
#include <net/ip6_route.h>
|
2015-08-18 04:42:27 +08:00
|
|
|
#include <net/lwtunnel.h>
|
|
|
|
|
#include <net/protocol.h>
|
|
|
|
|
#include <uapi/linux/ila.h>
|
2015-12-16 07:41:35 +08:00
|
|
|
#include "ila.h"
|
2015-08-18 04:42:27 +08:00
|
|
|
|
2016-10-15 02:25:37 +08:00
|
|
|
struct ila_lwt {
|
|
|
|
|
struct ila_params p;
|
|
|
|
|
struct dst_cache dst_cache;
|
|
|
|
|
u32 connected : 1;
|
2017-11-06 07:58:25 +08:00
|
|
|
u32 lwt_output : 1;
|
2016-10-15 02:25:37 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static inline struct ila_lwt *ila_lwt_lwtunnel(
|
|
|
|
|
struct lwtunnel_state *lwt)
|
|
|
|
|
{
|
|
|
|
|
return (struct ila_lwt *)lwt->data;
|
|
|
|
|
}
|
|
|
|
|
|
2015-08-18 04:42:27 +08:00
|
|
|
static inline struct ila_params *ila_params_lwtunnel(
|
2016-10-15 02:25:37 +08:00
|
|
|
struct lwtunnel_state *lwt)
|
2015-08-18 04:42:27 +08:00
|
|
|
{
|
2016-10-15 02:25:37 +08:00
|
|
|
return &ila_lwt_lwtunnel(lwt)->p;
|
2015-08-18 04:42:27 +08:00
|
|
|
}
|
|
|
|
|
|
2015-10-08 05:48:47 +08:00
|
|
|
static int ila_output(struct net *net, struct sock *sk, struct sk_buff *skb)
|
2015-08-18 04:42:27 +08:00
|
|
|
{
|
2016-10-15 02:25:37 +08:00
|
|
|
struct dst_entry *orig_dst = skb_dst(skb);
|
2016-10-17 12:25:35 +08:00
|
|
|
struct rt6_info *rt = (struct rt6_info *)orig_dst;
|
2016-10-15 02:25:37 +08:00
|
|
|
struct ila_lwt *ilwt = ila_lwt_lwtunnel(orig_dst->lwtstate);
|
|
|
|
|
struct dst_entry *dst;
|
|
|
|
|
int err = -EINVAL;
|
2015-08-18 04:42:27 +08:00
|
|
|
|
|
|
|
|
if (skb->protocol != htons(ETH_P_IPV6))
|
|
|
|
|
goto drop;
|
|
|
|
|
|
2017-11-06 07:58:25 +08:00
|
|
|
if (ilwt->lwt_output)
|
|
|
|
|
ila_update_ipv6_locator(skb,
|
|
|
|
|
ila_params_lwtunnel(orig_dst->lwtstate),
|
|
|
|
|
true);
|
2016-10-15 02:25:37 +08:00
|
|
|
|
2016-10-17 12:25:35 +08:00
|
|
|
if (rt->rt6i_flags & (RTF_GATEWAY | RTF_CACHE)) {
|
|
|
|
|
/* Already have a next hop address in route, no need for
|
|
|
|
|
* dest cache route.
|
|
|
|
|
*/
|
|
|
|
|
return orig_dst->lwtstate->orig_output(net, sk, skb);
|
|
|
|
|
}
|
|
|
|
|
|
2016-10-15 02:25:37 +08:00
|
|
|
dst = dst_cache_get(&ilwt->dst_cache);
|
|
|
|
|
if (unlikely(!dst)) {
|
|
|
|
|
struct ipv6hdr *ip6h = ipv6_hdr(skb);
|
|
|
|
|
struct flowi6 fl6;
|
|
|
|
|
|
|
|
|
|
/* Lookup a route for the new destination. Take into
|
|
|
|
|
* account that the base route may already have a gateway.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
memset(&fl6, 0, sizeof(fl6));
|
|
|
|
|
fl6.flowi6_oif = orig_dst->dev->ifindex;
|
|
|
|
|
fl6.flowi6_iif = LOOPBACK_IFINDEX;
|
|
|
|
|
fl6.daddr = *rt6_nexthop((struct rt6_info *)orig_dst,
|
|
|
|
|
&ip6h->daddr);
|
|
|
|
|
|
|
|
|
|
dst = ip6_route_output(net, NULL, &fl6);
|
|
|
|
|
if (dst->error) {
|
|
|
|
|
err = -EHOSTUNREACH;
|
|
|
|
|
dst_release(dst);
|
|
|
|
|
goto drop;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
dst = xfrm_lookup(net, dst, flowi6_to_flowi(&fl6), NULL, 0);
|
|
|
|
|
if (IS_ERR(dst)) {
|
|
|
|
|
err = PTR_ERR(dst);
|
|
|
|
|
goto drop;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (ilwt->connected)
|
|
|
|
|
dst_cache_set_ip6(&ilwt->dst_cache, dst, &fl6.saddr);
|
|
|
|
|
}
|
2015-08-18 04:42:27 +08:00
|
|
|
|
2016-10-15 02:25:37 +08:00
|
|
|
skb_dst_set(skb, dst);
|
|
|
|
|
return dst_output(net, sk, skb);
|
2015-08-18 04:42:27 +08:00
|
|
|
|
|
|
|
|
drop:
|
|
|
|
|
kfree_skb(skb);
|
2017-05-20 00:55:49 +08:00
|
|
|
return err;
|
2015-08-18 04:42:27 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int ila_input(struct sk_buff *skb)
|
|
|
|
|
{
|
|
|
|
|
struct dst_entry *dst = skb_dst(skb);
|
2017-11-06 07:58:25 +08:00
|
|
|
struct ila_lwt *ilwt = ila_lwt_lwtunnel(dst->lwtstate);
|
2015-08-18 04:42:27 +08:00
|
|
|
|
|
|
|
|
if (skb->protocol != htons(ETH_P_IPV6))
|
|
|
|
|
goto drop;
|
|
|
|
|
|
2017-11-06 07:58:25 +08:00
|
|
|
if (!ilwt->lwt_output)
|
|
|
|
|
ila_update_ipv6_locator(skb,
|
|
|
|
|
ila_params_lwtunnel(dst->lwtstate),
|
|
|
|
|
false);
|
2015-08-18 04:42:27 +08:00
|
|
|
|
2015-08-20 19:56:25 +08:00
|
|
|
return dst->lwtstate->orig_input(skb);
|
2015-08-18 04:42:27 +08:00
|
|
|
|
|
|
|
|
drop:
|
|
|
|
|
kfree_skb(skb);
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
|
|
|
|
|
2016-09-01 06:20:51 +08:00
|
|
|
static const struct nla_policy ila_nl_policy[ILA_ATTR_MAX + 1] = {
|
2015-08-18 04:42:27 +08:00
|
|
|
[ILA_ATTR_LOCATOR] = { .type = NLA_U64, },
|
2016-04-24 02:46:57 +08:00
|
|
|
[ILA_ATTR_CSUM_MODE] = { .type = NLA_U8, },
|
2017-11-06 07:58:24 +08:00
|
|
|
[ILA_ATTR_IDENT_TYPE] = { .type = NLA_U8, },
|
2017-11-06 07:58:25 +08:00
|
|
|
[ILA_ATTR_HOOK_TYPE] = { .type = NLA_U8, },
|
2015-08-18 04:42:27 +08:00
|
|
|
};
|
|
|
|
|
|
2020-03-28 06:00:21 +08:00
|
|
|
static int ila_build_state(struct net *net, struct nlattr *nla,
|
2015-08-25 00:45:41 +08:00
|
|
|
unsigned int family, const void *cfg,
|
2017-05-28 06:19:28 +08:00
|
|
|
struct lwtunnel_state **ts,
|
|
|
|
|
struct netlink_ext_ack *extack)
|
2015-08-18 04:42:27 +08:00
|
|
|
{
|
2016-10-15 02:25:37 +08:00
|
|
|
struct ila_lwt *ilwt;
|
2015-08-18 04:42:27 +08:00
|
|
|
struct ila_params *p;
|
|
|
|
|
struct nlattr *tb[ILA_ATTR_MAX + 1];
|
|
|
|
|
struct lwtunnel_state *newts;
|
2015-08-25 00:45:42 +08:00
|
|
|
const struct fib6_config *cfg6 = cfg;
|
2016-04-24 02:46:55 +08:00
|
|
|
struct ila_addr *iaddr;
|
2017-11-06 07:58:24 +08:00
|
|
|
u8 ident_type = ILA_ATYPE_USE_FORMAT;
|
2017-11-06 07:58:25 +08:00
|
|
|
u8 hook_type = ILA_HOOK_ROUTE_OUTPUT;
|
2017-11-06 07:58:23 +08:00
|
|
|
u8 csum_mode = ILA_CSUM_NO_ACTION;
|
2017-11-06 07:58:25 +08:00
|
|
|
bool lwt_output = true;
|
2017-11-06 07:58:24 +08:00
|
|
|
u8 eff_ident_type;
|
2015-08-18 04:42:27 +08:00
|
|
|
int ret;
|
|
|
|
|
|
2015-08-25 00:45:42 +08:00
|
|
|
if (family != AF_INET6)
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
netlink: make validation more configurable for future strictness
We currently have two levels of strict validation:
1) liberal (default)
- undefined (type >= max) & NLA_UNSPEC attributes accepted
- attribute length >= expected accepted
- garbage at end of message accepted
2) strict (opt-in)
- NLA_UNSPEC attributes accepted
- attribute length >= expected accepted
Split out parsing strictness into four different options:
* TRAILING - check that there's no trailing data after parsing
attributes (in message or nested)
* MAXTYPE - reject attrs > max known type
* UNSPEC - reject attributes with NLA_UNSPEC policy entries
* STRICT_ATTRS - strictly validate attribute size
The default for future things should be *everything*.
The current *_strict() is a combination of TRAILING and MAXTYPE,
and is renamed to _deprecated_strict().
The current regular parsing has none of this, and is renamed to
*_parse_deprecated().
Additionally it allows us to selectively set one of the new flags
even on old policies. Notably, the UNSPEC flag could be useful in
this case, since it can be arranged (by filling in the policy) to
not be an incompatible userspace ABI change, but would then going
forward prevent forgetting attribute entries. Similar can apply
to the POLICY flag.
We end up with the following renames:
* nla_parse -> nla_parse_deprecated
* nla_parse_strict -> nla_parse_deprecated_strict
* nlmsg_parse -> nlmsg_parse_deprecated
* nlmsg_parse_strict -> nlmsg_parse_deprecated_strict
* nla_parse_nested -> nla_parse_nested_deprecated
* nla_validate_nested -> nla_validate_nested_deprecated
Using spatch, of course:
@@
expression TB, MAX, HEAD, LEN, POL, EXT;
@@
-nla_parse(TB, MAX, HEAD, LEN, POL, EXT)
+nla_parse_deprecated(TB, MAX, HEAD, LEN, POL, EXT)
@@
expression NLH, HDRLEN, TB, MAX, POL, EXT;
@@
-nlmsg_parse(NLH, HDRLEN, TB, MAX, POL, EXT)
+nlmsg_parse_deprecated(NLH, HDRLEN, TB, MAX, POL, EXT)
@@
expression NLH, HDRLEN, TB, MAX, POL, EXT;
@@
-nlmsg_parse_strict(NLH, HDRLEN, TB, MAX, POL, EXT)
+nlmsg_parse_deprecated_strict(NLH, HDRLEN, TB, MAX, POL, EXT)
@@
expression TB, MAX, NLA, POL, EXT;
@@
-nla_parse_nested(TB, MAX, NLA, POL, EXT)
+nla_parse_nested_deprecated(TB, MAX, NLA, POL, EXT)
@@
expression START, MAX, POL, EXT;
@@
-nla_validate_nested(START, MAX, POL, EXT)
+nla_validate_nested_deprecated(START, MAX, POL, EXT)
@@
expression NLH, HDRLEN, MAX, POL, EXT;
@@
-nlmsg_validate(NLH, HDRLEN, MAX, POL, EXT)
+nlmsg_validate_deprecated(NLH, HDRLEN, MAX, POL, EXT)
For this patch, don't actually add the strict, non-renamed versions
yet so that it breaks compile if I get it wrong.
Also, while at it, make nla_validate and nla_parse go down to a
common __nla_validate_parse() function to avoid code duplication.
Ultimately, this allows us to have very strict validation for every
new caller of nla_parse()/nlmsg_parse() etc as re-introduced in the
next patch, while existing things will continue to work as is.
In effect then, this adds fully strict validation for any new command.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2019-04-26 20:07:28 +08:00
|
|
|
ret = nla_parse_nested_deprecated(tb, ILA_ATTR_MAX, nla,
|
|
|
|
|
ila_nl_policy, extack);
|
2015-08-18 04:42:27 +08:00
|
|
|
if (ret < 0)
|
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
|
|
if (!tb[ILA_ATTR_LOCATOR])
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
2017-11-06 07:58:23 +08:00
|
|
|
iaddr = (struct ila_addr *)&cfg6->fc_dst;
|
|
|
|
|
|
2017-11-06 07:58:24 +08:00
|
|
|
if (tb[ILA_ATTR_IDENT_TYPE])
|
|
|
|
|
ident_type = nla_get_u8(tb[ILA_ATTR_IDENT_TYPE]);
|
|
|
|
|
|
|
|
|
|
if (ident_type == ILA_ATYPE_USE_FORMAT) {
|
|
|
|
|
/* Infer identifier type from type field in formatted
|
|
|
|
|
* identifier.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
if (cfg6->fc_dst_len < 8 * sizeof(struct ila_locator) + 3) {
|
|
|
|
|
/* Need to have full locator and at least type field
|
|
|
|
|
* included in destination
|
|
|
|
|
*/
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
eff_ident_type = iaddr->ident.type;
|
|
|
|
|
} else {
|
|
|
|
|
eff_ident_type = ident_type;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
switch (eff_ident_type) {
|
|
|
|
|
case ILA_ATYPE_IID:
|
|
|
|
|
/* Don't allow ILA for IID type */
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
case ILA_ATYPE_LUID:
|
|
|
|
|
break;
|
|
|
|
|
case ILA_ATYPE_VIRT_V4:
|
|
|
|
|
case ILA_ATYPE_VIRT_UNI_V6:
|
|
|
|
|
case ILA_ATYPE_VIRT_MULTI_V6:
|
|
|
|
|
case ILA_ATYPE_NONLOCAL_ADDR:
|
|
|
|
|
/* These ILA formats are not supported yet. */
|
|
|
|
|
default:
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
|
|
|
|
|
2017-11-06 07:58:25 +08:00
|
|
|
if (tb[ILA_ATTR_HOOK_TYPE])
|
|
|
|
|
hook_type = nla_get_u8(tb[ILA_ATTR_HOOK_TYPE]);
|
|
|
|
|
|
|
|
|
|
switch (hook_type) {
|
|
|
|
|
case ILA_HOOK_ROUTE_OUTPUT:
|
|
|
|
|
lwt_output = true;
|
|
|
|
|
break;
|
|
|
|
|
case ILA_HOOK_ROUTE_INPUT:
|
|
|
|
|
lwt_output = false;
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
|
|
|
|
|
2017-11-06 07:58:23 +08:00
|
|
|
if (tb[ILA_ATTR_CSUM_MODE])
|
|
|
|
|
csum_mode = nla_get_u8(tb[ILA_ATTR_CSUM_MODE]);
|
|
|
|
|
|
|
|
|
|
if (csum_mode == ILA_CSUM_NEUTRAL_MAP &&
|
|
|
|
|
ila_csum_neutral_set(iaddr->ident)) {
|
|
|
|
|
/* Don't allow translation if checksum neutral bit is
|
|
|
|
|
* configured and it's set in the SIR address.
|
|
|
|
|
*/
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
}
|
|
|
|
|
|
2016-10-21 22:10:22 +08:00
|
|
|
newts = lwtunnel_state_alloc(sizeof(*ilwt));
|
2015-08-18 04:42:27 +08:00
|
|
|
if (!newts)
|
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
2016-10-15 02:25:37 +08:00
|
|
|
ilwt = ila_lwt_lwtunnel(newts);
|
|
|
|
|
ret = dst_cache_init(&ilwt->dst_cache, GFP_ATOMIC);
|
|
|
|
|
if (ret) {
|
|
|
|
|
kfree(newts);
|
|
|
|
|
return ret;
|
|
|
|
|
}
|
|
|
|
|
|
2017-11-06 07:58:25 +08:00
|
|
|
ilwt->lwt_output = !!lwt_output;
|
|
|
|
|
|
2015-08-18 04:42:27 +08:00
|
|
|
p = ila_params_lwtunnel(newts);
|
|
|
|
|
|
2017-11-06 07:58:23 +08:00
|
|
|
p->csum_mode = csum_mode;
|
2017-11-06 07:58:24 +08:00
|
|
|
p->ident_type = ident_type;
|
2016-04-24 02:46:55 +08:00
|
|
|
p->locator.v64 = (__force __be64)nla_get_u64(tb[ILA_ATTR_LOCATOR]);
|
2015-08-18 04:42:27 +08:00
|
|
|
|
2016-04-24 02:46:55 +08:00
|
|
|
/* Precompute checksum difference for translation since we
|
|
|
|
|
* know both the old locator and the new one.
|
|
|
|
|
*/
|
|
|
|
|
p->locator_match = iaddr->loc;
|
2016-04-24 02:46:57 +08:00
|
|
|
|
|
|
|
|
ila_init_saved_csum(p);
|
|
|
|
|
|
2015-08-18 04:42:27 +08:00
|
|
|
newts->type = LWTUNNEL_ENCAP_ILA;
|
|
|
|
|
newts->flags |= LWTUNNEL_STATE_OUTPUT_REDIRECT |
|
|
|
|
|
LWTUNNEL_STATE_INPUT_REDIRECT;
|
|
|
|
|
|
2016-10-15 02:25:37 +08:00
|
|
|
if (cfg6->fc_dst_len == 8 * sizeof(struct in6_addr))
|
|
|
|
|
ilwt->connected = 1;
|
|
|
|
|
|
2015-08-18 04:42:27 +08:00
|
|
|
*ts = newts;
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2016-10-15 02:25:37 +08:00
|
|
|
static void ila_destroy_state(struct lwtunnel_state *lwt)
|
|
|
|
|
{
|
|
|
|
|
dst_cache_destroy(&ila_lwt_lwtunnel(lwt)->dst_cache);
|
|
|
|
|
}
|
|
|
|
|
|
2015-08-18 04:42:27 +08:00
|
|
|
static int ila_fill_encap_info(struct sk_buff *skb,
|
|
|
|
|
struct lwtunnel_state *lwtstate)
|
|
|
|
|
{
|
|
|
|
|
struct ila_params *p = ila_params_lwtunnel(lwtstate);
|
2017-11-06 07:58:25 +08:00
|
|
|
struct ila_lwt *ilwt = ila_lwt_lwtunnel(lwtstate);
|
2015-08-18 04:42:27 +08:00
|
|
|
|
2016-04-24 02:46:55 +08:00
|
|
|
if (nla_put_u64_64bit(skb, ILA_ATTR_LOCATOR, (__force u64)p->locator.v64,
|
2016-04-25 16:25:16 +08:00
|
|
|
ILA_ATTR_PAD))
|
2015-08-18 04:42:27 +08:00
|
|
|
goto nla_put_failure;
|
2017-11-06 07:58:24 +08:00
|
|
|
|
2016-05-10 17:56:32 +08:00
|
|
|
if (nla_put_u8(skb, ILA_ATTR_CSUM_MODE, (__force u8)p->csum_mode))
|
2016-04-24 02:46:57 +08:00
|
|
|
goto nla_put_failure;
|
2015-08-18 04:42:27 +08:00
|
|
|
|
2017-11-06 07:58:24 +08:00
|
|
|
if (nla_put_u8(skb, ILA_ATTR_IDENT_TYPE, (__force u8)p->ident_type))
|
|
|
|
|
goto nla_put_failure;
|
|
|
|
|
|
2017-11-06 07:58:25 +08:00
|
|
|
if (nla_put_u8(skb, ILA_ATTR_HOOK_TYPE,
|
|
|
|
|
ilwt->lwt_output ? ILA_HOOK_ROUTE_OUTPUT :
|
|
|
|
|
ILA_HOOK_ROUTE_INPUT))
|
|
|
|
|
goto nla_put_failure;
|
|
|
|
|
|
2015-08-18 04:42:27 +08:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
nla_put_failure:
|
|
|
|
|
return -EMSGSIZE;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int ila_encap_nlsize(struct lwtunnel_state *lwtstate)
|
|
|
|
|
{
|
2016-05-10 17:56:32 +08:00
|
|
|
return nla_total_size_64bit(sizeof(u64)) + /* ILA_ATTR_LOCATOR */
|
|
|
|
|
nla_total_size(sizeof(u8)) + /* ILA_ATTR_CSUM_MODE */
|
2017-11-06 07:58:24 +08:00
|
|
|
nla_total_size(sizeof(u8)) + /* ILA_ATTR_IDENT_TYPE */
|
2017-11-06 07:58:25 +08:00
|
|
|
nla_total_size(sizeof(u8)) + /* ILA_ATTR_HOOK_TYPE */
|
2016-05-10 17:56:32 +08:00
|
|
|
0;
|
2015-08-18 04:42:27 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int ila_encap_cmp(struct lwtunnel_state *a, struct lwtunnel_state *b)
|
|
|
|
|
{
|
|
|
|
|
struct ila_params *a_p = ila_params_lwtunnel(a);
|
|
|
|
|
struct ila_params *b_p = ila_params_lwtunnel(b);
|
|
|
|
|
|
2016-04-24 02:46:55 +08:00
|
|
|
return (a_p->locator.v64 != b_p->locator.v64);
|
2015-08-18 04:42:27 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static const struct lwtunnel_encap_ops ila_encap_ops = {
|
|
|
|
|
.build_state = ila_build_state,
|
2016-10-15 02:25:37 +08:00
|
|
|
.destroy_state = ila_destroy_state,
|
2015-08-18 04:42:27 +08:00
|
|
|
.output = ila_output,
|
|
|
|
|
.input = ila_input,
|
|
|
|
|
.fill_encap = ila_fill_encap_info,
|
|
|
|
|
.get_encap_size = ila_encap_nlsize,
|
|
|
|
|
.cmp_encap = ila_encap_cmp,
|
2017-01-25 00:26:47 +08:00
|
|
|
.owner = THIS_MODULE,
|
2015-08-18 04:42:27 +08:00
|
|
|
};
|
|
|
|
|
|
2015-12-16 07:41:35 +08:00
|
|
|
int ila_lwt_init(void)
|
2015-08-18 04:42:27 +08:00
|
|
|
{
|
|
|
|
|
return lwtunnel_encap_add_ops(&ila_encap_ops, LWTUNNEL_ENCAP_ILA);
|
|
|
|
|
}
|
|
|
|
|
|
2015-12-16 07:41:35 +08:00
|
|
|
void ila_lwt_fini(void)
|
2015-08-18 04:42:27 +08:00
|
|
|
{
|
|
|
|
|
lwtunnel_encap_del_ops(&ila_encap_ops, LWTUNNEL_ENCAP_ILA);
|
|
|
|
|
}
|