2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* INET An implementation of the TCP/IP protocol suite for the LINUX
|
|
|
|
* operating system. INET is implemented using the BSD Socket
|
|
|
|
* interface as the means of communication with the user level.
|
|
|
|
*
|
|
|
|
* The Internet Protocol (IP) output module.
|
|
|
|
*
|
2005-05-06 03:16:16 +04:00
|
|
|
* Authors: Ross Biro
|
2005-04-17 02:20:36 +04:00
|
|
|
* Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
|
|
|
|
* Donald Becker, <becker@super.org>
|
|
|
|
* Alan Cox, <Alan.Cox@linux.org>
|
|
|
|
* Richard Underwood
|
|
|
|
* Stefan Becker, <stefanb@yello.ping.de>
|
|
|
|
* Jorge Cwik, <jorge@laser.satlink.net>
|
|
|
|
* Arnt Gulbrandsen, <agulbra@nvg.unit.no>
|
|
|
|
* Hirokazu Takahashi, <taka@valinux.co.jp>
|
|
|
|
*
|
|
|
|
* See ip_input.c for original log
|
|
|
|
*
|
|
|
|
* Fixes:
|
|
|
|
* Alan Cox : Missing nonblock feature in ip_build_xmit.
|
|
|
|
* Mike Kilburn : htons() missing in ip_build_xmit.
|
2007-02-09 17:24:47 +03:00
|
|
|
* Bradford Johnson: Fix faulty handling of some frames when
|
2005-04-17 02:20:36 +04:00
|
|
|
* no route is found.
|
|
|
|
* Alexander Demenshin: Missing sk/skb free in ip_queue_xmit
|
|
|
|
* (in case if packet not accepted by
|
|
|
|
* output firewall rules)
|
|
|
|
* Mike McLagan : Routing by source
|
|
|
|
* Alexey Kuznetsov: use new route cache
|
|
|
|
* Andi Kleen: Fix broken PMTU recovery and remove
|
|
|
|
* some redundant tests.
|
|
|
|
* Vitaly E. Lavrov : Transparent proxy revived after year coma.
|
|
|
|
* Andi Kleen : Replace ip_reply with ip_send_reply.
|
2007-02-09 17:24:47 +03:00
|
|
|
* Andi Kleen : Split fast and slow ip_build_xmit path
|
|
|
|
* for decreased register pressure on x86
|
|
|
|
* and more readibility.
|
2005-04-17 02:20:36 +04:00
|
|
|
* Marc Boucher : When call_out_firewall returns FW_QUEUE,
|
|
|
|
* silently drop skb instead of failing with -EPERM.
|
|
|
|
* Detlev Wengorz : Copy protocol for fragments.
|
|
|
|
* Hirokazu Takahashi: HW checksumming for outgoing UDP
|
|
|
|
* datagrams.
|
|
|
|
* Hirokazu Takahashi: sendfile() on UDP works now.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/errno.h>
|
2006-10-20 00:08:53 +04:00
|
|
|
#include <linux/highmem.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 11:04:11 +03:00
|
|
|
#include <linux/slab.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
#include <linux/socket.h>
|
|
|
|
#include <linux/sockios.h>
|
|
|
|
#include <linux/in.h>
|
|
|
|
#include <linux/inet.h>
|
|
|
|
#include <linux/netdevice.h>
|
|
|
|
#include <linux/etherdevice.h>
|
|
|
|
#include <linux/proc_fs.h>
|
|
|
|
#include <linux/stat.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
|
|
|
|
#include <net/snmp.h>
|
|
|
|
#include <net/ip.h>
|
|
|
|
#include <net/protocol.h>
|
|
|
|
#include <net/route.h>
|
2006-01-09 09:36:54 +03:00
|
|
|
#include <net/xfrm.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
#include <linux/skbuff.h>
|
|
|
|
#include <net/sock.h>
|
|
|
|
#include <net/arp.h>
|
|
|
|
#include <net/icmp.h>
|
|
|
|
#include <net/checksum.h>
|
|
|
|
#include <net/inetpeer.h>
|
|
|
|
#include <linux/igmp.h>
|
|
|
|
#include <linux/netfilter_ipv4.h>
|
|
|
|
#include <linux/netfilter_bridge.h>
|
|
|
|
#include <linux/mroute.h>
|
|
|
|
#include <linux/netlink.h>
|
2005-08-10 06:49:02 +04:00
|
|
|
#include <linux/tcp.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2006-09-23 01:15:41 +04:00
|
|
|
int sysctl_ip_default_ttl __read_mostly = IPDEFTTL;
|
2010-12-13 08:55:08 +03:00
|
|
|
EXPORT_SYMBOL(sysctl_ip_default_ttl);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/* Generate a checksum for an outgoing IP datagram. */
|
2013-05-09 03:19:42 +04:00
|
|
|
void ip_send_check(struct iphdr *iph)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
|
|
|
iph->check = 0;
|
|
|
|
iph->check = ip_fast_csum((unsigned char *)iph, iph->ihl);
|
|
|
|
}
|
2010-07-10 01:22:10 +04:00
|
|
|
EXPORT_SYMBOL(ip_send_check);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2008-01-12 06:14:00 +03:00
|
|
|
int __ip_local_out(struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
struct iphdr *iph = ip_hdr(skb);
|
|
|
|
|
|
|
|
iph->tot_len = htons(skb->len);
|
|
|
|
ip_send_check(iph);
|
2010-03-23 06:07:29 +03:00
|
|
|
return nf_hook(NFPROTO_IPV4, NF_INET_LOCAL_OUT, skb, NULL,
|
|
|
|
skb_dst(skb)->dev, dst_output);
|
2008-01-12 06:14:00 +03:00
|
|
|
}
|
|
|
|
|
2014-04-15 21:47:15 +04:00
|
|
|
int ip_local_out_sk(struct sock *sk, struct sk_buff *skb)
|
2008-01-12 06:14:00 +03:00
|
|
|
{
|
|
|
|
int err;
|
|
|
|
|
|
|
|
err = __ip_local_out(skb);
|
|
|
|
if (likely(err == 1))
|
2014-04-15 21:47:15 +04:00
|
|
|
err = dst_output_sk(sk, skb);
|
2008-01-12 06:14:00 +03:00
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
2014-04-15 21:47:15 +04:00
|
|
|
EXPORT_SYMBOL_GPL(ip_local_out_sk);
|
2008-01-12 06:14:00 +03:00
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
static inline int ip_select_ttl(struct inet_sock *inet, struct dst_entry *dst)
|
|
|
|
{
|
|
|
|
int ttl = inet->uc_ttl;
|
|
|
|
|
|
|
|
if (ttl < 0)
|
2010-12-13 08:55:08 +03:00
|
|
|
ttl = ip4_dst_hoplimit(dst);
|
2005-04-17 02:20:36 +04:00
|
|
|
return ttl;
|
|
|
|
}
|
|
|
|
|
2007-02-09 17:24:47 +03:00
|
|
|
/*
|
2005-04-17 02:20:36 +04:00
|
|
|
* Add an ip header to a skbuff and send it out.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
int ip_build_and_send_pkt(struct sk_buff *skb, struct sock *sk,
|
2011-04-21 13:45:37 +04:00
|
|
|
__be32 saddr, __be32 daddr, struct ip_options_rcu *opt)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
|
|
|
struct inet_sock *inet = inet_sk(sk);
|
2009-06-02 09:14:27 +04:00
|
|
|
struct rtable *rt = skb_rtable(skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
struct iphdr *iph;
|
|
|
|
|
|
|
|
/* Build the IP header. */
|
2011-04-21 13:45:37 +04:00
|
|
|
skb_push(skb, sizeof(struct iphdr) + (opt ? opt->opt.optlen : 0));
|
2007-03-11 01:40:39 +03:00
|
|
|
skb_reset_network_header(skb);
|
2007-04-21 09:47:35 +04:00
|
|
|
iph = ip_hdr(skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
iph->version = 4;
|
|
|
|
iph->ihl = 5;
|
|
|
|
iph->tos = inet->tos;
|
2010-06-11 10:31:35 +04:00
|
|
|
if (ip_dont_fragment(sk, &rt->dst))
|
2005-04-17 02:20:36 +04:00
|
|
|
iph->frag_off = htons(IP_DF);
|
|
|
|
else
|
|
|
|
iph->frag_off = 0;
|
2010-06-11 10:31:35 +04:00
|
|
|
iph->ttl = ip_select_ttl(inet, &rt->dst);
|
2011-05-04 23:03:30 +04:00
|
|
|
iph->daddr = (opt && opt->opt.srr ? opt->opt.faddr : daddr);
|
|
|
|
iph->saddr = saddr;
|
2005-04-17 02:20:36 +04:00
|
|
|
iph->protocol = sk->sk_protocol;
|
inetpeer: get rid of ip_id_count
Ideally, we would need to generate IP ID using a per destination IP
generator.
linux kernels used inet_peer cache for this purpose, but this had a huge
cost on servers disabling MTU discovery.
1) each inet_peer struct consumes 192 bytes
2) inetpeer cache uses a binary tree of inet_peer structs,
with a nominal size of ~66000 elements under load.
3) lookups in this tree are hitting a lot of cache lines, as tree depth
is about 20.
4) If server deals with many tcp flows, we have a high probability of
not finding the inet_peer, allocating a fresh one, inserting it in
the tree with same initial ip_id_count, (cf secure_ip_id())
5) We garbage collect inet_peer aggressively.
IP ID generation do not have to be 'perfect'
Goal is trying to avoid duplicates in a short period of time,
so that reassembly units have a chance to complete reassembly of
fragments belonging to one message before receiving other fragments
with a recycled ID.
We simply use an array of generators, and a Jenkin hash using the dst IP
as a key.
ipv6_select_ident() is put back into net/ipv6/ip6_output.c where it
belongs (it is only used from this file)
secure_ip_id() and secure_ipv6_id() no longer are needed.
Rename ip_select_ident_more() to ip_select_ident_segs() to avoid
unnecessary decrement/increment of the number of segments.
Signed-off-by: Eric Dumazet <edumazet@google.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2014-06-02 16:26:03 +04:00
|
|
|
ip_select_ident(skb, sk);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2011-04-21 13:45:37 +04:00
|
|
|
if (opt && opt->opt.optlen) {
|
|
|
|
iph->ihl += opt->opt.optlen>>2;
|
|
|
|
ip_options_build(skb, &opt->opt, daddr, rt, 0);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
skb->priority = sk->sk_priority;
|
2008-01-31 06:08:16 +03:00
|
|
|
skb->mark = sk->sk_mark;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/* Send it out. */
|
2008-01-12 06:14:00 +03:00
|
|
|
return ip_local_out(skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
2005-08-10 07:12:12 +04:00
|
|
|
EXPORT_SYMBOL_GPL(ip_build_and_send_pkt);
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
static inline int ip_finish_output2(struct sk_buff *skb)
|
|
|
|
{
|
2009-06-02 09:19:30 +04:00
|
|
|
struct dst_entry *dst = skb_dst(skb);
|
2007-04-30 11:48:20 +04:00
|
|
|
struct rtable *rt = (struct rtable *)dst;
|
2005-04-17 02:20:36 +04:00
|
|
|
struct net_device *dev = dst->dev;
|
2007-10-24 08:07:32 +04:00
|
|
|
unsigned int hh_len = LL_RESERVED_SPACE(dev);
|
2011-07-14 18:53:20 +04:00
|
|
|
struct neighbour *neigh;
|
2012-07-02 13:02:15 +04:00
|
|
|
u32 nexthop;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2009-04-27 13:45:02 +04:00
|
|
|
if (rt->rt_type == RTN_MULTICAST) {
|
|
|
|
IP_UPD_PO_STATS(dev_net(dev), IPSTATS_MIB_OUTMCAST, skb->len);
|
|
|
|
} else if (rt->rt_type == RTN_BROADCAST)
|
|
|
|
IP_UPD_PO_STATS(dev_net(dev), IPSTATS_MIB_OUTBCAST, skb->len);
|
2007-04-30 11:48:20 +04:00
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/* Be paranoid, rather than too clever. */
|
2007-10-09 12:40:57 +04:00
|
|
|
if (unlikely(skb_headroom(skb) < hh_len && dev->header_ops)) {
|
2005-04-17 02:20:36 +04:00
|
|
|
struct sk_buff *skb2;
|
|
|
|
|
|
|
|
skb2 = skb_realloc_headroom(skb, LL_RESERVED_SPACE(dev));
|
|
|
|
if (skb2 == NULL) {
|
|
|
|
kfree_skb(skb);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
if (skb->sk)
|
|
|
|
skb_set_owner_w(skb2, skb->sk);
|
2012-06-04 05:17:19 +04:00
|
|
|
consume_skb(skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
skb = skb2;
|
|
|
|
}
|
|
|
|
|
2012-07-02 13:02:15 +04:00
|
|
|
rcu_read_lock_bh();
|
2012-10-08 15:41:18 +04:00
|
|
|
nexthop = (__force u32) rt_nexthop(rt, ip_hdr(skb)->daddr);
|
2012-07-02 13:02:15 +04:00
|
|
|
neigh = __ipv4_neigh_lookup_noref(dev, nexthop);
|
|
|
|
if (unlikely(!neigh))
|
|
|
|
neigh = __neigh_create(&arp_tbl, &nexthop, dev, false);
|
2012-08-06 07:55:29 +04:00
|
|
|
if (!IS_ERR(neigh)) {
|
2012-07-02 13:21:03 +04:00
|
|
|
int res = dst_neigh_output(dst, neigh, skb);
|
2011-07-29 23:00:53 +04:00
|
|
|
|
2012-07-02 13:02:15 +04:00
|
|
|
rcu_read_unlock_bh();
|
2011-07-29 23:00:53 +04:00
|
|
|
return res;
|
|
|
|
}
|
2012-07-02 13:02:15 +04:00
|
|
|
rcu_read_unlock_bh();
|
2011-07-17 04:26:00 +04:00
|
|
|
|
2012-05-14 01:56:26 +04:00
|
|
|
net_dbg_ratelimited("%s: No header cache and no neighbour!\n",
|
|
|
|
__func__);
|
2005-04-17 02:20:36 +04:00
|
|
|
kfree_skb(skb);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
2014-05-05 17:00:43 +04:00
|
|
|
static int ip_finish_output_gso(struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
netdev_features_t features;
|
|
|
|
struct sk_buff *segs;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
/* common case: locally created skb or seglen is <= mtu */
|
|
|
|
if (((IPCB(skb)->flags & IPSKB_FORWARDED) == 0) ||
|
|
|
|
skb_gso_network_seglen(skb) <= ip_skb_dst_mtu(skb))
|
|
|
|
return ip_finish_output2(skb);
|
|
|
|
|
|
|
|
/* Slowpath - GSO segment length is exceeding the dst MTU.
|
|
|
|
*
|
|
|
|
* This can happen in two cases:
|
|
|
|
* 1) TCP GRO packet, DF bit not set
|
|
|
|
* 2) skb arrived via virtio-net, we thus get TSO/GSO skbs directly
|
|
|
|
* from host network stack.
|
|
|
|
*/
|
|
|
|
features = netif_skb_features(skb);
|
|
|
|
segs = skb_gso_segment(skb, features & ~NETIF_F_GSO_MASK);
|
|
|
|
if (IS_ERR(segs)) {
|
|
|
|
kfree_skb(skb);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
consume_skb(skb);
|
|
|
|
|
|
|
|
do {
|
|
|
|
struct sk_buff *nskb = segs->next;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
segs->next = NULL;
|
|
|
|
err = ip_fragment(segs, ip_finish_output2);
|
|
|
|
|
|
|
|
if (err && ret == 0)
|
|
|
|
ret = err;
|
|
|
|
segs = nskb;
|
|
|
|
} while (segs);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2007-10-15 12:48:39 +04:00
|
|
|
static int ip_finish_output(struct sk_buff *skb)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
2006-01-07 10:05:36 +03:00
|
|
|
#if defined(CONFIG_NETFILTER) && defined(CONFIG_XFRM)
|
|
|
|
/* Policy lookup after SNAT yielded a new policy */
|
2009-06-02 09:19:30 +04:00
|
|
|
if (skb_dst(skb)->xfrm != NULL) {
|
2006-02-16 02:10:22 +03:00
|
|
|
IPCB(skb)->flags |= IPSKB_REROUTED;
|
|
|
|
return dst_output(skb);
|
|
|
|
}
|
2006-01-07 10:05:36 +03:00
|
|
|
#endif
|
2014-05-05 17:00:43 +04:00
|
|
|
if (skb_is_gso(skb))
|
|
|
|
return ip_finish_output_gso(skb);
|
|
|
|
|
|
|
|
if (skb->len > ip_skb_dst_mtu(skb))
|
2006-01-05 23:20:59 +03:00
|
|
|
return ip_fragment(skb, ip_finish_output2);
|
2014-05-05 17:00:43 +04:00
|
|
|
|
|
|
|
return ip_finish_output2(skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2014-04-15 21:47:15 +04:00
|
|
|
int ip_mc_output(struct sock *sk, struct sk_buff *skb)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
2009-06-02 09:14:27 +04:00
|
|
|
struct rtable *rt = skb_rtable(skb);
|
2010-06-11 10:31:35 +04:00
|
|
|
struct net_device *dev = rt->dst.dev;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If the indicated interface is up and running, send the packet.
|
|
|
|
*/
|
2009-04-27 13:45:02 +04:00
|
|
|
IP_UPD_PO_STATS(dev_net(dev), IPSTATS_MIB_OUT, skb->len);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
skb->dev = dev;
|
|
|
|
skb->protocol = htons(ETH_P_IP);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Multicasts are looped back for other local users
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (rt->rt_flags&RTCF_MULTICAST) {
|
2010-01-07 07:37:01 +03:00
|
|
|
if (sk_mc_loop(sk)
|
2005-04-17 02:20:36 +04:00
|
|
|
#ifdef CONFIG_IP_MROUTE
|
|
|
|
/* Small optimization: do not loopback not local frames,
|
|
|
|
which returned after forwarding; they will be dropped
|
|
|
|
by ip_mr_input in any case.
|
|
|
|
Note, that local frames are looped back to be delivered
|
|
|
|
to local recipients.
|
|
|
|
|
|
|
|
This check is duplicated in ip_mr_input at the moment.
|
|
|
|
*/
|
2009-11-23 21:41:23 +03:00
|
|
|
&&
|
|
|
|
((rt->rt_flags & RTCF_LOCAL) ||
|
|
|
|
!(IPCB(skb)->flags & IPSKB_FORWARDED))
|
2005-04-17 02:20:36 +04:00
|
|
|
#endif
|
2009-11-23 21:41:23 +03:00
|
|
|
) {
|
2005-04-17 02:20:36 +04:00
|
|
|
struct sk_buff *newskb = skb_clone(skb, GFP_ATOMIC);
|
|
|
|
if (newskb)
|
2010-03-23 06:07:29 +03:00
|
|
|
NF_HOOK(NFPROTO_IPV4, NF_INET_POST_ROUTING,
|
|
|
|
newskb, NULL, newskb->dev,
|
2012-06-12 14:16:35 +04:00
|
|
|
dev_loopback_xmit);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Multicasts with ttl 0 must not go beyond the host */
|
|
|
|
|
2007-04-21 09:47:35 +04:00
|
|
|
if (ip_hdr(skb)->ttl == 0) {
|
2005-04-17 02:20:36 +04:00
|
|
|
kfree_skb(skb);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (rt->rt_flags&RTCF_BROADCAST) {
|
|
|
|
struct sk_buff *newskb = skb_clone(skb, GFP_ATOMIC);
|
|
|
|
if (newskb)
|
2010-03-23 06:07:29 +03:00
|
|
|
NF_HOOK(NFPROTO_IPV4, NF_INET_POST_ROUTING, newskb,
|
2012-06-12 14:16:35 +04:00
|
|
|
NULL, newskb->dev, dev_loopback_xmit);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2010-03-23 06:07:29 +03:00
|
|
|
return NF_HOOK_COND(NFPROTO_IPV4, NF_INET_POST_ROUTING, skb, NULL,
|
|
|
|
skb->dev, ip_finish_output,
|
2006-02-16 02:10:22 +03:00
|
|
|
!(IPCB(skb)->flags & IPSKB_REROUTED));
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2014-04-15 21:47:15 +04:00
|
|
|
int ip_output(struct sock *sk, struct sk_buff *skb)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
2009-06-02 09:19:30 +04:00
|
|
|
struct net_device *dev = skb_dst(skb)->dev;
|
2006-01-05 23:20:59 +03:00
|
|
|
|
2009-04-27 13:45:02 +04:00
|
|
|
IP_UPD_PO_STATS(dev_net(dev), IPSTATS_MIB_OUT, skb->len);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2006-01-05 23:20:59 +03:00
|
|
|
skb->dev = dev;
|
|
|
|
skb->protocol = htons(ETH_P_IP);
|
|
|
|
|
2010-03-23 06:07:29 +03:00
|
|
|
return NF_HOOK_COND(NFPROTO_IPV4, NF_INET_POST_ROUTING, skb, NULL, dev,
|
2007-02-09 17:24:47 +03:00
|
|
|
ip_finish_output,
|
2006-02-16 02:10:22 +03:00
|
|
|
!(IPCB(skb)->flags & IPSKB_REROUTED));
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2011-11-30 23:00:53 +04:00
|
|
|
/*
|
|
|
|
* copy saddr and daddr, possibly using 64bit load/stores
|
|
|
|
* Equivalent to :
|
|
|
|
* iph->saddr = fl4->saddr;
|
|
|
|
* iph->daddr = fl4->daddr;
|
|
|
|
*/
|
|
|
|
static void ip_copy_addrs(struct iphdr *iph, const struct flowi4 *fl4)
|
|
|
|
{
|
|
|
|
BUILD_BUG_ON(offsetof(typeof(*fl4), daddr) !=
|
|
|
|
offsetof(typeof(*fl4), saddr) + sizeof(fl4->saddr));
|
|
|
|
memcpy(&iph->saddr, &fl4->saddr,
|
|
|
|
sizeof(fl4->saddr) + sizeof(fl4->daddr));
|
|
|
|
}
|
|
|
|
|
2014-04-15 20:58:34 +04:00
|
|
|
/* Note: skb->sk can be different from sk, in case of tunnels */
|
|
|
|
int ip_queue_xmit(struct sock *sk, struct sk_buff *skb, struct flowi *fl)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
|
|
|
struct inet_sock *inet = inet_sk(sk);
|
2011-04-21 13:45:37 +04:00
|
|
|
struct ip_options_rcu *inet_opt;
|
2011-05-07 03:24:06 +04:00
|
|
|
struct flowi4 *fl4;
|
2005-04-17 02:20:36 +04:00
|
|
|
struct rtable *rt;
|
|
|
|
struct iphdr *iph;
|
2010-05-10 15:31:49 +04:00
|
|
|
int res;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/* Skip all of this if the packet is already routed,
|
|
|
|
* f.e. by something like SCTP.
|
|
|
|
*/
|
2010-05-10 15:31:49 +04:00
|
|
|
rcu_read_lock();
|
2011-04-21 13:45:37 +04:00
|
|
|
inet_opt = rcu_dereference(inet->inet_opt);
|
2011-05-07 09:30:20 +04:00
|
|
|
fl4 = &fl->u.ip4;
|
2009-06-02 09:14:27 +04:00
|
|
|
rt = skb_rtable(skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
if (rt != NULL)
|
|
|
|
goto packet_routed;
|
|
|
|
|
|
|
|
/* Make sure we can route this packet. */
|
|
|
|
rt = (struct rtable *)__sk_dst_check(sk, 0);
|
|
|
|
if (rt == NULL) {
|
2006-09-28 05:28:07 +04:00
|
|
|
__be32 daddr;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/* Use correct destination address if we have options. */
|
2009-10-15 10:30:45 +04:00
|
|
|
daddr = inet->inet_daddr;
|
2011-04-21 13:45:37 +04:00
|
|
|
if (inet_opt && inet_opt->opt.srr)
|
|
|
|
daddr = inet_opt->opt.faddr;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2011-03-12 08:00:52 +03:00
|
|
|
/* If this fails, retransmit mechanism of transport layer will
|
|
|
|
* keep trying until route appears or the connection times
|
|
|
|
* itself out.
|
|
|
|
*/
|
2011-05-07 03:24:06 +04:00
|
|
|
rt = ip_route_output_ports(sock_net(sk), fl4, sk,
|
2011-03-12 08:00:52 +03:00
|
|
|
daddr, inet->inet_saddr,
|
|
|
|
inet->inet_dport,
|
|
|
|
inet->inet_sport,
|
|
|
|
sk->sk_protocol,
|
|
|
|
RT_CONN_FLAGS(sk),
|
|
|
|
sk->sk_bound_dev_if);
|
|
|
|
if (IS_ERR(rt))
|
|
|
|
goto no_route;
|
2010-06-11 10:31:35 +04:00
|
|
|
sk_setup_caps(sk, &rt->dst);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
2010-06-11 10:31:35 +04:00
|
|
|
skb_dst_set_noref(skb, &rt->dst);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
packet_routed:
|
2012-10-08 15:41:18 +04:00
|
|
|
if (inet_opt && inet_opt->opt.is_strictroute && rt->rt_uses_gateway)
|
2005-04-17 02:20:36 +04:00
|
|
|
goto no_route;
|
|
|
|
|
|
|
|
/* OK, we know where to send it, allocate and build IP header. */
|
2011-04-21 13:45:37 +04:00
|
|
|
skb_push(skb, sizeof(struct iphdr) + (inet_opt ? inet_opt->opt.optlen : 0));
|
2007-03-11 01:40:39 +03:00
|
|
|
skb_reset_network_header(skb);
|
2007-04-21 09:47:35 +04:00
|
|
|
iph = ip_hdr(skb);
|
2006-11-15 07:51:49 +03:00
|
|
|
*((__be16 *)iph) = htons((4 << 12) | (5 << 8) | (inet->tos & 0xff));
|
2014-05-05 03:39:18 +04:00
|
|
|
if (ip_dont_fragment(sk, &rt->dst) && !skb->ignore_df)
|
2005-04-17 02:20:36 +04:00
|
|
|
iph->frag_off = htons(IP_DF);
|
|
|
|
else
|
|
|
|
iph->frag_off = 0;
|
2010-06-11 10:31:35 +04:00
|
|
|
iph->ttl = ip_select_ttl(inet, &rt->dst);
|
2005-04-17 02:20:36 +04:00
|
|
|
iph->protocol = sk->sk_protocol;
|
2011-11-30 23:00:53 +04:00
|
|
|
ip_copy_addrs(iph, fl4);
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/* Transport layer set skb->h.foo itself. */
|
|
|
|
|
2011-04-21 13:45:37 +04:00
|
|
|
if (inet_opt && inet_opt->opt.optlen) {
|
|
|
|
iph->ihl += inet_opt->opt.optlen >> 2;
|
|
|
|
ip_options_build(skb, &inet_opt->opt, inet->inet_daddr, rt, 0);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
inetpeer: get rid of ip_id_count
Ideally, we would need to generate IP ID using a per destination IP
generator.
linux kernels used inet_peer cache for this purpose, but this had a huge
cost on servers disabling MTU discovery.
1) each inet_peer struct consumes 192 bytes
2) inetpeer cache uses a binary tree of inet_peer structs,
with a nominal size of ~66000 elements under load.
3) lookups in this tree are hitting a lot of cache lines, as tree depth
is about 20.
4) If server deals with many tcp flows, we have a high probability of
not finding the inet_peer, allocating a fresh one, inserting it in
the tree with same initial ip_id_count, (cf secure_ip_id())
5) We garbage collect inet_peer aggressively.
IP ID generation do not have to be 'perfect'
Goal is trying to avoid duplicates in a short period of time,
so that reassembly units have a chance to complete reassembly of
fragments belonging to one message before receiving other fragments
with a recycled ID.
We simply use an array of generators, and a Jenkin hash using the dst IP
as a key.
ipv6_select_ident() is put back into net/ipv6/ip6_output.c where it
belongs (it is only used from this file)
secure_ip_id() and secure_ipv6_id() no longer are needed.
Rename ip_select_ident_more() to ip_select_ident_segs() to avoid
unnecessary decrement/increment of the number of segments.
Signed-off-by: Eric Dumazet <edumazet@google.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2014-06-02 16:26:03 +04:00
|
|
|
ip_select_ident_segs(skb, sk, skb_shinfo(skb)->gso_segs ?: 1);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2014-04-15 20:58:34 +04:00
|
|
|
/* TODO : should we use skb->sk here instead of sk ? */
|
2005-04-17 02:20:36 +04:00
|
|
|
skb->priority = sk->sk_priority;
|
2008-01-31 06:08:16 +03:00
|
|
|
skb->mark = sk->sk_mark;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2010-05-10 15:31:49 +04:00
|
|
|
res = ip_local_out(skb);
|
|
|
|
rcu_read_unlock();
|
|
|
|
return res;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
no_route:
|
2010-05-10 15:31:49 +04:00
|
|
|
rcu_read_unlock();
|
2008-07-17 07:19:49 +04:00
|
|
|
IP_INC_STATS(sock_net(sk), IPSTATS_MIB_OUTNOROUTES);
|
2005-04-17 02:20:36 +04:00
|
|
|
kfree_skb(skb);
|
|
|
|
return -EHOSTUNREACH;
|
|
|
|
}
|
2010-07-10 01:22:10 +04:00
|
|
|
EXPORT_SYMBOL(ip_queue_xmit);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
|
|
|
|
static void ip_copy_metadata(struct sk_buff *to, struct sk_buff *from)
|
|
|
|
{
|
|
|
|
to->pkt_type = from->pkt_type;
|
|
|
|
to->priority = from->priority;
|
|
|
|
to->protocol = from->protocol;
|
2009-06-02 09:19:30 +04:00
|
|
|
skb_dst_drop(to);
|
2010-07-02 03:48:22 +04:00
|
|
|
skb_dst_copy(to, from);
|
2005-04-17 02:20:36 +04:00
|
|
|
to->dev = from->dev;
|
2006-11-10 02:19:14 +03:00
|
|
|
to->mark = from->mark;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/* Copy the flags to each fragment. */
|
|
|
|
IPCB(to)->flags = IPCB(from)->flags;
|
|
|
|
|
|
|
|
#ifdef CONFIG_NET_SCHED
|
|
|
|
to->tc_index = from->tc_index;
|
|
|
|
#endif
|
2007-03-15 02:44:01 +03:00
|
|
|
nf_copy(to, from);
|
2005-10-22 14:39:21 +04:00
|
|
|
#if defined(CONFIG_IP_VS) || defined(CONFIG_IP_VS_MODULE)
|
|
|
|
to->ipvs_property = from->ipvs_property;
|
2005-04-17 02:20:36 +04:00
|
|
|
#endif
|
2006-06-09 11:29:17 +04:00
|
|
|
skb_copy_secmark(to, from);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This IP datagram is too large to be sent in one piece. Break it up into
|
|
|
|
* smaller pieces (each of size equal to IP header plus
|
|
|
|
* a block of the data of the original IP data part) that will yet fit in a
|
|
|
|
* single device frame, and queue such a frame for sending.
|
|
|
|
*/
|
|
|
|
|
2008-11-03 11:23:42 +03:00
|
|
|
int ip_fragment(struct sk_buff *skb, int (*output)(struct sk_buff *))
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
|
|
|
struct iphdr *iph;
|
|
|
|
int ptr;
|
|
|
|
struct net_device *dev;
|
|
|
|
struct sk_buff *skb2;
|
2010-07-31 17:25:08 +04:00
|
|
|
unsigned int mtu, hlen, left, len, ll_rs;
|
2005-04-17 02:20:36 +04:00
|
|
|
int offset;
|
2006-01-07 00:24:29 +03:00
|
|
|
__be16 not_last_frag;
|
2009-06-02 09:14:27 +04:00
|
|
|
struct rtable *rt = skb_rtable(skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
int err = 0;
|
|
|
|
|
2010-06-11 10:31:35 +04:00
|
|
|
dev = rt->dst.dev;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Point into the IP datagram header.
|
|
|
|
*/
|
|
|
|
|
2007-04-21 09:47:35 +04:00
|
|
|
iph = ip_hdr(skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2014-02-26 04:20:41 +04:00
|
|
|
mtu = ip_skb_dst_mtu(skb);
|
2014-05-05 03:39:18 +04:00
|
|
|
if (unlikely(((iph->frag_off & htons(IP_DF)) && !skb->ignore_df) ||
|
2012-08-26 21:13:55 +04:00
|
|
|
(IPCB(skb)->frag_max_size &&
|
2014-01-09 13:01:15 +04:00
|
|
|
IPCB(skb)->frag_max_size > mtu))) {
|
2008-07-17 07:19:49 +04:00
|
|
|
IP_INC_STATS(dev_net(dev), IPSTATS_MIB_FRAGFAILS);
|
2005-04-17 02:20:36 +04:00
|
|
|
icmp_send(skb, ICMP_DEST_UNREACH, ICMP_FRAG_NEEDED,
|
2014-01-09 13:01:15 +04:00
|
|
|
htonl(mtu));
|
2005-04-17 02:20:36 +04:00
|
|
|
kfree_skb(skb);
|
|
|
|
return -EMSGSIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Setup starting values.
|
|
|
|
*/
|
|
|
|
|
|
|
|
hlen = iph->ihl * 4;
|
2014-01-09 13:01:15 +04:00
|
|
|
mtu = mtu - hlen; /* Size of data space */
|
2010-04-20 18:22:01 +04:00
|
|
|
#ifdef CONFIG_BRIDGE_NETFILTER
|
|
|
|
if (skb->nf_bridge)
|
|
|
|
mtu -= nf_bridge_mtu_reduction(skb);
|
|
|
|
#endif
|
2005-12-14 10:14:27 +03:00
|
|
|
IPCB(skb)->flags |= IPSKB_FRAG_COMPLETE;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/* When frag_list is given, use it. First, check its validity:
|
|
|
|
* some transformers could create wrong frag_list or break existing
|
|
|
|
* one, it is not prohibited. In this case fall back to copying.
|
|
|
|
*
|
|
|
|
* LATER: this step can be merged to real generation of fragments,
|
|
|
|
* we can switch to copy when see the first bad fragment.
|
|
|
|
*/
|
2010-08-23 11:13:46 +04:00
|
|
|
if (skb_has_frag_list(skb)) {
|
2010-09-21 12:47:45 +04:00
|
|
|
struct sk_buff *frag, *frag2;
|
2005-04-17 02:20:36 +04:00
|
|
|
int first_len = skb_pagelen(skb);
|
|
|
|
|
|
|
|
if (first_len - hlen > mtu ||
|
|
|
|
((first_len - hlen) & 7) ||
|
2011-06-22 07:33:34 +04:00
|
|
|
ip_is_fragment(iph) ||
|
2005-04-17 02:20:36 +04:00
|
|
|
skb_cloned(skb))
|
|
|
|
goto slow_path;
|
|
|
|
|
2009-06-09 11:19:37 +04:00
|
|
|
skb_walk_frags(skb, frag) {
|
2005-04-17 02:20:36 +04:00
|
|
|
/* Correct geometry. */
|
|
|
|
if (frag->len > mtu ||
|
|
|
|
((frag->len & 7) && frag->next) ||
|
|
|
|
skb_headroom(frag) < hlen)
|
2010-09-21 12:47:45 +04:00
|
|
|
goto slow_path_clean;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/* Partially cloned skb? */
|
|
|
|
if (skb_shared(frag))
|
2010-09-21 12:47:45 +04:00
|
|
|
goto slow_path_clean;
|
2005-05-19 09:52:33 +04:00
|
|
|
|
|
|
|
BUG_ON(frag->sk);
|
|
|
|
if (skb->sk) {
|
|
|
|
frag->sk = skb->sk;
|
|
|
|
frag->destructor = sock_wfree;
|
|
|
|
}
|
2010-09-21 12:47:45 +04:00
|
|
|
skb->truesize -= frag->truesize;
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Everything is OK. Generate! */
|
|
|
|
|
|
|
|
err = 0;
|
|
|
|
offset = 0;
|
|
|
|
frag = skb_shinfo(skb)->frag_list;
|
2009-06-09 11:19:37 +04:00
|
|
|
skb_frag_list_init(skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
skb->data_len = first_len - skb_headlen(skb);
|
|
|
|
skb->len = first_len;
|
|
|
|
iph->tot_len = htons(first_len);
|
|
|
|
iph->frag_off = htons(IP_MF);
|
|
|
|
ip_send_check(iph);
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
/* Prepare header of the next frame,
|
|
|
|
* before previous one went down. */
|
|
|
|
if (frag) {
|
|
|
|
frag->ip_summed = CHECKSUM_NONE;
|
2007-03-13 19:06:52 +03:00
|
|
|
skb_reset_transport_header(frag);
|
2007-04-11 07:46:21 +04:00
|
|
|
__skb_push(frag, hlen);
|
|
|
|
skb_reset_network_header(frag);
|
2007-04-11 07:50:43 +04:00
|
|
|
memcpy(skb_network_header(frag), iph, hlen);
|
2007-04-21 09:47:35 +04:00
|
|
|
iph = ip_hdr(frag);
|
2005-04-17 02:20:36 +04:00
|
|
|
iph->tot_len = htons(frag->len);
|
|
|
|
ip_copy_metadata(frag, skb);
|
|
|
|
if (offset == 0)
|
|
|
|
ip_options_fragment(frag);
|
|
|
|
offset += skb->len - hlen;
|
|
|
|
iph->frag_off = htons(offset>>3);
|
|
|
|
if (frag->next != NULL)
|
|
|
|
iph->frag_off |= htons(IP_MF);
|
|
|
|
/* Ready, complete checksum */
|
|
|
|
ip_send_check(iph);
|
|
|
|
}
|
|
|
|
|
|
|
|
err = output(skb);
|
|
|
|
|
2006-08-03 00:41:21 +04:00
|
|
|
if (!err)
|
2008-07-17 07:19:49 +04:00
|
|
|
IP_INC_STATS(dev_net(dev), IPSTATS_MIB_FRAGCREATES);
|
2005-04-17 02:20:36 +04:00
|
|
|
if (err || !frag)
|
|
|
|
break;
|
|
|
|
|
|
|
|
skb = frag;
|
|
|
|
frag = skb->next;
|
|
|
|
skb->next = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (err == 0) {
|
2008-07-17 07:19:49 +04:00
|
|
|
IP_INC_STATS(dev_net(dev), IPSTATS_MIB_FRAGOKS);
|
2005-04-17 02:20:36 +04:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (frag) {
|
|
|
|
skb = frag->next;
|
|
|
|
kfree_skb(frag);
|
|
|
|
frag = skb;
|
|
|
|
}
|
2008-07-17 07:19:49 +04:00
|
|
|
IP_INC_STATS(dev_net(dev), IPSTATS_MIB_FRAGFAILS);
|
2005-04-17 02:20:36 +04:00
|
|
|
return err;
|
2010-09-21 12:47:45 +04:00
|
|
|
|
|
|
|
slow_path_clean:
|
|
|
|
skb_walk_frags(skb, frag2) {
|
|
|
|
if (frag2 == frag)
|
|
|
|
break;
|
|
|
|
frag2->sk = NULL;
|
|
|
|
frag2->destructor = NULL;
|
|
|
|
skb->truesize += frag2->truesize;
|
|
|
|
}
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
slow_path:
|
2012-12-07 18:14:15 +04:00
|
|
|
/* for offloaded checksums cleanup checksum before fragmentation */
|
|
|
|
if ((skb->ip_summed == CHECKSUM_PARTIAL) && skb_checksum_help(skb))
|
|
|
|
goto fail;
|
2013-02-11 13:27:41 +04:00
|
|
|
iph = ip_hdr(skb);
|
2012-12-07 18:14:15 +04:00
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
left = skb->len - hlen; /* Space per frame */
|
2010-07-06 15:44:12 +04:00
|
|
|
ptr = hlen; /* Where to start from */
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/* for bridged IP traffic encapsulated inside f.e. a vlan header,
|
2006-08-30 04:48:57 +04:00
|
|
|
* we need to make room for the encapsulating header
|
|
|
|
*/
|
2010-07-31 17:25:08 +04:00
|
|
|
ll_rs = LL_RESERVED_SPACE_EXTRA(rt->dst.dev, nf_bridge_pad(skb));
|
2006-08-30 04:48:57 +04:00
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* Fragment the datagram.
|
|
|
|
*/
|
|
|
|
|
|
|
|
offset = (ntohs(iph->frag_off) & IP_OFFSET) << 3;
|
|
|
|
not_last_frag = iph->frag_off & htons(IP_MF);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Keep copying data until we run out.
|
|
|
|
*/
|
|
|
|
|
2007-03-09 07:44:43 +03:00
|
|
|
while (left > 0) {
|
2005-04-17 02:20:36 +04:00
|
|
|
len = left;
|
|
|
|
/* IF: it doesn't fit, use 'mtu' - the data space left */
|
|
|
|
if (len > mtu)
|
|
|
|
len = mtu;
|
2011-03-31 05:57:33 +04:00
|
|
|
/* IF: we are not sending up to and including the packet end
|
2005-04-17 02:20:36 +04:00
|
|
|
then align the next start on an eight byte boundary */
|
|
|
|
if (len < left) {
|
|
|
|
len &= ~7;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Allocate buffer.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if ((skb2 = alloc_skb(len+hlen+ll_rs, GFP_ATOMIC)) == NULL) {
|
2005-08-10 07:50:53 +04:00
|
|
|
NETDEBUG(KERN_INFO "IP: frag: no memory for new fragment!\n");
|
2005-04-17 02:20:36 +04:00
|
|
|
err = -ENOMEM;
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set up data on packet
|
|
|
|
*/
|
|
|
|
|
|
|
|
ip_copy_metadata(skb2, skb);
|
|
|
|
skb_reserve(skb2, ll_rs);
|
|
|
|
skb_put(skb2, len + hlen);
|
2007-04-11 07:45:18 +04:00
|
|
|
skb_reset_network_header(skb2);
|
2007-04-11 08:21:55 +04:00
|
|
|
skb2->transport_header = skb2->network_header + hlen;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Charge the memory for the fragment to any owner
|
|
|
|
* it might possess
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (skb->sk)
|
|
|
|
skb_set_owner_w(skb2, skb->sk);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy the packet header into the new buffer.
|
|
|
|
*/
|
|
|
|
|
2007-03-28 01:55:52 +04:00
|
|
|
skb_copy_from_linear_data(skb, skb_network_header(skb2), hlen);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy a block of the IP datagram.
|
|
|
|
*/
|
2007-03-16 23:19:57 +03:00
|
|
|
if (skb_copy_bits(skb, ptr, skb_transport_header(skb2), len))
|
2005-04-17 02:20:36 +04:00
|
|
|
BUG();
|
|
|
|
left -= len;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Fill in the new header fields.
|
|
|
|
*/
|
2007-04-21 09:47:35 +04:00
|
|
|
iph = ip_hdr(skb2);
|
2005-04-17 02:20:36 +04:00
|
|
|
iph->frag_off = htons((offset >> 3));
|
|
|
|
|
|
|
|
/* ANK: dirty, but effective trick. Upgrade options only if
|
|
|
|
* the segment to be fragmented was THE FIRST (otherwise,
|
|
|
|
* options are already fixed) and make it ONCE
|
|
|
|
* on the initial skb, so that all the following fragments
|
|
|
|
* will inherit fixed options.
|
|
|
|
*/
|
|
|
|
if (offset == 0)
|
|
|
|
ip_options_fragment(skb);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Added AC : If we are fragmenting a fragment that's not the
|
|
|
|
* last fragment then keep MF on each bit
|
|
|
|
*/
|
|
|
|
if (left > 0 || not_last_frag)
|
|
|
|
iph->frag_off |= htons(IP_MF);
|
|
|
|
ptr += len;
|
|
|
|
offset += len;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Put this fragment into the sending queue.
|
|
|
|
*/
|
|
|
|
iph->tot_len = htons(len + hlen);
|
|
|
|
|
|
|
|
ip_send_check(iph);
|
|
|
|
|
|
|
|
err = output(skb2);
|
|
|
|
if (err)
|
|
|
|
goto fail;
|
2006-08-03 00:41:21 +04:00
|
|
|
|
2008-07-17 07:19:49 +04:00
|
|
|
IP_INC_STATS(dev_net(dev), IPSTATS_MIB_FRAGCREATES);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
2012-06-04 05:17:19 +04:00
|
|
|
consume_skb(skb);
|
2008-07-17 07:19:49 +04:00
|
|
|
IP_INC_STATS(dev_net(dev), IPSTATS_MIB_FRAGOKS);
|
2005-04-17 02:20:36 +04:00
|
|
|
return err;
|
|
|
|
|
|
|
|
fail:
|
2007-02-09 17:24:47 +03:00
|
|
|
kfree_skb(skb);
|
2008-07-17 07:19:49 +04:00
|
|
|
IP_INC_STATS(dev_net(dev), IPSTATS_MIB_FRAGFAILS);
|
2005-04-17 02:20:36 +04:00
|
|
|
return err;
|
|
|
|
}
|
2006-04-05 00:42:35 +04:00
|
|
|
EXPORT_SYMBOL(ip_fragment);
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
int
|
|
|
|
ip_generic_getfrag(void *from, char *to, int offset, int len, int odd, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
struct iovec *iov = from;
|
|
|
|
|
2006-08-30 03:44:56 +04:00
|
|
|
if (skb->ip_summed == CHECKSUM_PARTIAL) {
|
2005-04-17 02:20:36 +04:00
|
|
|
if (memcpy_fromiovecend(to, iov, offset, len) < 0)
|
|
|
|
return -EFAULT;
|
|
|
|
} else {
|
2006-11-15 08:36:14 +03:00
|
|
|
__wsum csum = 0;
|
2005-04-17 02:20:36 +04:00
|
|
|
if (csum_partial_copy_fromiovecend(to, iov, offset, len, &csum) < 0)
|
|
|
|
return -EFAULT;
|
|
|
|
skb->csum = csum_block_add(skb->csum, csum, odd);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2010-07-10 01:22:10 +04:00
|
|
|
EXPORT_SYMBOL(ip_generic_getfrag);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2006-11-15 08:36:14 +03:00
|
|
|
static inline __wsum
|
2005-04-17 02:20:36 +04:00
|
|
|
csum_page(struct page *page, int offset, int copy)
|
|
|
|
{
|
|
|
|
char *kaddr;
|
2006-11-15 08:36:14 +03:00
|
|
|
__wsum csum;
|
2005-04-17 02:20:36 +04:00
|
|
|
kaddr = kmap(page);
|
|
|
|
csum = csum_partial(kaddr + offset, copy, 0);
|
|
|
|
kunmap(page);
|
|
|
|
return csum;
|
|
|
|
}
|
|
|
|
|
2005-11-30 03:27:20 +03:00
|
|
|
static inline int ip_ufo_append_data(struct sock *sk,
|
2011-03-01 05:36:47 +03:00
|
|
|
struct sk_buff_head *queue,
|
2005-10-19 02:46:41 +04:00
|
|
|
int getfrag(void *from, char *to, int offset, int len,
|
|
|
|
int odd, struct sk_buff *skb),
|
|
|
|
void *from, int length, int hh_len, int fragheaderlen,
|
2011-07-19 19:22:33 +04:00
|
|
|
int transhdrlen, int maxfraglen, unsigned int flags)
|
2005-10-19 02:46:41 +04:00
|
|
|
{
|
|
|
|
struct sk_buff *skb;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
/* There is support for UDP fragmentation offload by network
|
|
|
|
* device, so create one single skb packet containing complete
|
|
|
|
* udp datagram
|
|
|
|
*/
|
2011-03-01 05:36:47 +03:00
|
|
|
if ((skb = skb_peek_tail(queue)) == NULL) {
|
2005-10-19 02:46:41 +04:00
|
|
|
skb = sock_alloc_send_skb(sk,
|
|
|
|
hh_len + fragheaderlen + transhdrlen + 20,
|
|
|
|
(flags & MSG_DONTWAIT), &err);
|
|
|
|
|
|
|
|
if (skb == NULL)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
/* reserve space for Hardware header */
|
|
|
|
skb_reserve(skb, hh_len);
|
|
|
|
|
|
|
|
/* create space for UDP/IP header */
|
2008-11-03 11:23:42 +03:00
|
|
|
skb_put(skb, fragheaderlen + transhdrlen);
|
2005-10-19 02:46:41 +04:00
|
|
|
|
|
|
|
/* initialize network header pointer */
|
2007-04-11 07:45:18 +04:00
|
|
|
skb_reset_network_header(skb);
|
2005-10-19 02:46:41 +04:00
|
|
|
|
|
|
|
/* initialize protocol header pointer */
|
2007-04-11 08:21:55 +04:00
|
|
|
skb->transport_header = skb->network_header + fragheaderlen;
|
2005-10-19 02:46:41 +04:00
|
|
|
|
|
|
|
skb->csum = 0;
|
|
|
|
|
2013-10-19 14:29:17 +04:00
|
|
|
|
2011-03-01 05:36:47 +03:00
|
|
|
__skb_queue_tail(queue, skb);
|
2013-10-19 14:29:17 +04:00
|
|
|
} else if (skb_is_gso(skb)) {
|
|
|
|
goto append;
|
2005-10-19 02:46:41 +04:00
|
|
|
}
|
2008-04-30 09:36:30 +04:00
|
|
|
|
2013-10-19 14:29:17 +04:00
|
|
|
skb->ip_summed = CHECKSUM_PARTIAL;
|
|
|
|
/* specify the length of each IP datagram fragment */
|
|
|
|
skb_shinfo(skb)->gso_size = maxfraglen - fragheaderlen;
|
|
|
|
skb_shinfo(skb)->gso_type = SKB_GSO_UDP;
|
|
|
|
|
|
|
|
append:
|
2008-04-30 09:36:30 +04:00
|
|
|
return skb_append_datato_frags(sk, skb, getfrag, from,
|
|
|
|
(length - transhdrlen));
|
2005-10-19 02:46:41 +04:00
|
|
|
}
|
|
|
|
|
2011-05-09 04:24:10 +04:00
|
|
|
static int __ip_append_data(struct sock *sk,
|
|
|
|
struct flowi4 *fl4,
|
|
|
|
struct sk_buff_head *queue,
|
2011-03-01 05:36:47 +03:00
|
|
|
struct inet_cork *cork,
|
net: use a per task frag allocator
We currently use a per socket order-0 page cache for tcp_sendmsg()
operations.
This page is used to build fragments for skbs.
Its done to increase probability of coalescing small write() into
single segments in skbs still in write queue (not yet sent)
But it wastes a lot of memory for applications handling many mostly
idle sockets, since each socket holds one page in sk->sk_sndmsg_page
Its also quite inefficient to build TSO 64KB packets, because we need
about 16 pages per skb on arches where PAGE_SIZE = 4096, so we hit
page allocator more than wanted.
This patch adds a per task frag allocator and uses bigger pages,
if available. An automatic fallback is done in case of memory pressure.
(up to 32768 bytes per frag, thats order-3 pages on x86)
This increases TCP stream performance by 20% on loopback device,
but also benefits on other network devices, since 8x less frags are
mapped on transmit and unmapped on tx completion. Alexander Duyck
mentioned a probable performance win on systems with IOMMU enabled.
Its possible some SG enabled hardware cant cope with bigger fragments,
but their ndo_start_xmit() should already handle this, splitting a
fragment in sub fragments, since some arches have PAGE_SIZE=65536
Successfully tested on various ethernet devices.
(ixgbe, igb, bnx2x, tg3, mellanox mlx4)
Signed-off-by: Eric Dumazet <edumazet@google.com>
Cc: Ben Hutchings <bhutchings@solarflare.com>
Cc: Vijay Subramanian <subramanian.vijay@gmail.com>
Cc: Alexander Duyck <alexander.h.duyck@intel.com>
Tested-by: Vijay Subramanian <subramanian.vijay@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2012-09-24 03:04:42 +04:00
|
|
|
struct page_frag *pfrag,
|
2011-03-01 05:36:47 +03:00
|
|
|
int getfrag(void *from, char *to, int offset,
|
|
|
|
int len, int odd, struct sk_buff *skb),
|
|
|
|
void *from, int length, int transhdrlen,
|
|
|
|
unsigned int flags)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
|
|
|
struct inet_sock *inet = inet_sk(sk);
|
|
|
|
struct sk_buff *skb;
|
|
|
|
|
2011-03-02 10:00:58 +03:00
|
|
|
struct ip_options *opt = cork->opt;
|
2005-04-17 02:20:36 +04:00
|
|
|
int hh_len;
|
|
|
|
int exthdrlen;
|
|
|
|
int mtu;
|
|
|
|
int copy;
|
|
|
|
int err;
|
|
|
|
int offset = 0;
|
2013-10-27 20:29:11 +04:00
|
|
|
unsigned int maxfraglen, fragheaderlen, maxnonfragsize;
|
2005-04-17 02:20:36 +04:00
|
|
|
int csummode = CHECKSUM_NONE;
|
2011-03-01 05:36:47 +03:00
|
|
|
struct rtable *rt = (struct rtable *)cork->dst;
|
2014-08-05 06:11:47 +04:00
|
|
|
u32 tskey = 0;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2011-06-06 00:48:47 +04:00
|
|
|
skb = skb_peek_tail(queue);
|
|
|
|
|
|
|
|
exthdrlen = !skb ? rt->dst.header_len : 0;
|
2011-03-02 10:00:58 +03:00
|
|
|
mtu = cork->fragsize;
|
2014-08-05 06:11:47 +04:00
|
|
|
if (cork->tx_flags & SKBTX_ANY_SW_TSTAMP &&
|
|
|
|
sk->sk_tsflags & SOF_TIMESTAMPING_OPT_ID)
|
|
|
|
tskey = sk->sk_tskey++;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2010-06-11 10:31:35 +04:00
|
|
|
hh_len = LL_RESERVED_SPACE(rt->dst.dev);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
fragheaderlen = sizeof(struct iphdr) + (opt ? opt->optlen : 0);
|
|
|
|
maxfraglen = ((mtu - fragheaderlen) & ~7) + fragheaderlen;
|
2014-05-05 03:39:18 +04:00
|
|
|
maxnonfragsize = ip_sk_ignore_df(sk) ? 0xFFFF : mtu;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2013-10-27 20:29:11 +04:00
|
|
|
if (cork->length + length > maxnonfragsize - fragheaderlen) {
|
2011-05-09 04:24:10 +04:00
|
|
|
ip_local_error(sk, EMSGSIZE, fl4->daddr, inet->inet_dport,
|
2013-12-19 05:13:36 +04:00
|
|
|
mtu - (opt ? opt->optlen : 0));
|
2005-04-17 02:20:36 +04:00
|
|
|
return -EMSGSIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* transhdrlen > 0 means that this is the first fragment and we wish
|
|
|
|
* it won't be fragmented in the future.
|
|
|
|
*/
|
|
|
|
if (transhdrlen &&
|
|
|
|
length + fragheaderlen <= mtu &&
|
2010-06-11 10:31:35 +04:00
|
|
|
rt->dst.dev->features & NETIF_F_V4_CSUM &&
|
2005-04-17 02:20:36 +04:00
|
|
|
!exthdrlen)
|
2006-08-30 03:44:56 +04:00
|
|
|
csummode = CHECKSUM_PARTIAL;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2011-03-01 05:36:47 +03:00
|
|
|
cork->length += length;
|
2010-06-15 05:52:25 +04:00
|
|
|
if (((length > mtu) || (skb && skb_is_gso(skb))) &&
|
2008-04-30 09:36:30 +04:00
|
|
|
(sk->sk_protocol == IPPROTO_UDP) &&
|
2011-06-30 03:19:32 +04:00
|
|
|
(rt->dst.dev->features & NETIF_F_UFO) && !rt->dst.header_len) {
|
2011-03-01 05:36:47 +03:00
|
|
|
err = ip_ufo_append_data(sk, queue, getfrag, from, length,
|
|
|
|
hh_len, fragheaderlen, transhdrlen,
|
2011-07-19 19:22:33 +04:00
|
|
|
maxfraglen, flags);
|
2006-03-13 07:35:12 +03:00
|
|
|
if (err)
|
2005-10-19 02:46:41 +04:00
|
|
|
goto error;
|
|
|
|
return 0;
|
|
|
|
}
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/* So, what's going on in the loop below?
|
|
|
|
*
|
|
|
|
* We use calculated fragment length to generate chained skb,
|
|
|
|
* each of segments is IP fragment ready for sending to network after
|
|
|
|
* adding appropriate IP header.
|
|
|
|
*/
|
|
|
|
|
2010-06-15 05:52:25 +04:00
|
|
|
if (!skb)
|
2005-04-17 02:20:36 +04:00
|
|
|
goto alloc_new_skb;
|
|
|
|
|
|
|
|
while (length > 0) {
|
|
|
|
/* Check if the remaining data fits into current packet. */
|
|
|
|
copy = mtu - skb->len;
|
|
|
|
if (copy < length)
|
|
|
|
copy = maxfraglen - skb->len;
|
|
|
|
if (copy <= 0) {
|
|
|
|
char *data;
|
|
|
|
unsigned int datalen;
|
|
|
|
unsigned int fraglen;
|
|
|
|
unsigned int fraggap;
|
|
|
|
unsigned int alloclen;
|
|
|
|
struct sk_buff *skb_prev;
|
|
|
|
alloc_new_skb:
|
|
|
|
skb_prev = skb;
|
|
|
|
if (skb_prev)
|
|
|
|
fraggap = skb_prev->len - maxfraglen;
|
|
|
|
else
|
|
|
|
fraggap = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If remaining data exceeds the mtu,
|
|
|
|
* we know we need more fragment(s).
|
|
|
|
*/
|
|
|
|
datalen = length + fraggap;
|
|
|
|
if (datalen > mtu - fragheaderlen)
|
|
|
|
datalen = maxfraglen - fragheaderlen;
|
|
|
|
fraglen = datalen + fragheaderlen;
|
|
|
|
|
2007-02-09 17:24:47 +03:00
|
|
|
if ((flags & MSG_MORE) &&
|
2010-06-11 10:31:35 +04:00
|
|
|
!(rt->dst.dev->features&NETIF_F_SG))
|
2005-04-17 02:20:36 +04:00
|
|
|
alloclen = mtu;
|
|
|
|
else
|
2010-09-21 00:16:27 +04:00
|
|
|
alloclen = fraglen;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2011-06-22 05:05:37 +04:00
|
|
|
alloclen += exthdrlen;
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/* The last fragment gets additional space at tail.
|
|
|
|
* Note, with MSG_MORE we overallocate on fragments,
|
|
|
|
* because we have no idea what fragment will be
|
|
|
|
* the last.
|
|
|
|
*/
|
2011-06-22 05:04:37 +04:00
|
|
|
if (datalen == length + fraggap)
|
2010-06-11 10:31:35 +04:00
|
|
|
alloclen += rt->dst.trailer_len;
|
2011-06-22 05:04:37 +04:00
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
if (transhdrlen) {
|
2007-02-09 17:24:47 +03:00
|
|
|
skb = sock_alloc_send_skb(sk,
|
2005-04-17 02:20:36 +04:00
|
|
|
alloclen + hh_len + 15,
|
|
|
|
(flags & MSG_DONTWAIT), &err);
|
|
|
|
} else {
|
|
|
|
skb = NULL;
|
|
|
|
if (atomic_read(&sk->sk_wmem_alloc) <=
|
|
|
|
2 * sk->sk_sndbuf)
|
2007-02-09 17:24:47 +03:00
|
|
|
skb = sock_wmalloc(sk,
|
2005-04-17 02:20:36 +04:00
|
|
|
alloclen + hh_len + 15, 1,
|
|
|
|
sk->sk_allocation);
|
|
|
|
if (unlikely(skb == NULL))
|
|
|
|
err = -ENOBUFS;
|
|
|
|
}
|
|
|
|
if (skb == NULL)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Fill in the control structures
|
|
|
|
*/
|
|
|
|
skb->ip_summed = csummode;
|
|
|
|
skb->csum = 0;
|
|
|
|
skb_reserve(skb, hh_len);
|
2014-07-15 01:55:06 +04:00
|
|
|
|
|
|
|
/* only the initial fragment is time stamped */
|
2011-03-01 05:36:47 +03:00
|
|
|
skb_shinfo(skb)->tx_flags = cork->tx_flags;
|
2014-07-15 01:55:06 +04:00
|
|
|
cork->tx_flags = 0;
|
2014-08-05 06:11:47 +04:00
|
|
|
skb_shinfo(skb)->tskey = tskey;
|
|
|
|
tskey = 0;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Find where to start putting bytes.
|
|
|
|
*/
|
2011-06-22 05:05:37 +04:00
|
|
|
data = skb_put(skb, fraglen + exthdrlen);
|
2007-03-12 04:39:41 +03:00
|
|
|
skb_set_network_header(skb, exthdrlen);
|
2007-04-11 08:21:55 +04:00
|
|
|
skb->transport_header = (skb->network_header +
|
|
|
|
fragheaderlen);
|
2011-06-22 05:05:37 +04:00
|
|
|
data += fragheaderlen + exthdrlen;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
if (fraggap) {
|
|
|
|
skb->csum = skb_copy_and_csum_bits(
|
|
|
|
skb_prev, maxfraglen,
|
|
|
|
data + transhdrlen, fraggap, 0);
|
|
|
|
skb_prev->csum = csum_sub(skb_prev->csum,
|
|
|
|
skb->csum);
|
|
|
|
data += fraggap;
|
2006-08-14 07:12:58 +04:00
|
|
|
pskb_trim_unique(skb_prev, maxfraglen);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
copy = datalen - transhdrlen - fraggap;
|
|
|
|
if (copy > 0 && getfrag(from, data + transhdrlen, offset, copy, fraggap, skb) < 0) {
|
|
|
|
err = -EFAULT;
|
|
|
|
kfree_skb(skb);
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
|
|
|
offset += copy;
|
|
|
|
length -= datalen - fraggap;
|
|
|
|
transhdrlen = 0;
|
|
|
|
exthdrlen = 0;
|
|
|
|
csummode = CHECKSUM_NONE;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Put the packet on the pending queue.
|
|
|
|
*/
|
2011-03-01 05:36:47 +03:00
|
|
|
__skb_queue_tail(queue, skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (copy > length)
|
|
|
|
copy = length;
|
|
|
|
|
2010-06-11 10:31:35 +04:00
|
|
|
if (!(rt->dst.dev->features&NETIF_F_SG)) {
|
2005-04-17 02:20:36 +04:00
|
|
|
unsigned int off;
|
|
|
|
|
|
|
|
off = skb->len;
|
2007-02-09 17:24:47 +03:00
|
|
|
if (getfrag(from, skb_put(skb, copy),
|
2005-04-17 02:20:36 +04:00
|
|
|
offset, copy, off, skb) < 0) {
|
|
|
|
__skb_trim(skb, off);
|
|
|
|
err = -EFAULT;
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
int i = skb_shinfo(skb)->nr_frags;
|
|
|
|
|
net: use a per task frag allocator
We currently use a per socket order-0 page cache for tcp_sendmsg()
operations.
This page is used to build fragments for skbs.
Its done to increase probability of coalescing small write() into
single segments in skbs still in write queue (not yet sent)
But it wastes a lot of memory for applications handling many mostly
idle sockets, since each socket holds one page in sk->sk_sndmsg_page
Its also quite inefficient to build TSO 64KB packets, because we need
about 16 pages per skb on arches where PAGE_SIZE = 4096, so we hit
page allocator more than wanted.
This patch adds a per task frag allocator and uses bigger pages,
if available. An automatic fallback is done in case of memory pressure.
(up to 32768 bytes per frag, thats order-3 pages on x86)
This increases TCP stream performance by 20% on loopback device,
but also benefits on other network devices, since 8x less frags are
mapped on transmit and unmapped on tx completion. Alexander Duyck
mentioned a probable performance win on systems with IOMMU enabled.
Its possible some SG enabled hardware cant cope with bigger fragments,
but their ndo_start_xmit() should already handle this, splitting a
fragment in sub fragments, since some arches have PAGE_SIZE=65536
Successfully tested on various ethernet devices.
(ixgbe, igb, bnx2x, tg3, mellanox mlx4)
Signed-off-by: Eric Dumazet <edumazet@google.com>
Cc: Ben Hutchings <bhutchings@solarflare.com>
Cc: Vijay Subramanian <subramanian.vijay@gmail.com>
Cc: Alexander Duyck <alexander.h.duyck@intel.com>
Tested-by: Vijay Subramanian <subramanian.vijay@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2012-09-24 03:04:42 +04:00
|
|
|
err = -ENOMEM;
|
|
|
|
if (!sk_page_frag_refill(sk, pfrag))
|
2005-04-17 02:20:36 +04:00
|
|
|
goto error;
|
net: use a per task frag allocator
We currently use a per socket order-0 page cache for tcp_sendmsg()
operations.
This page is used to build fragments for skbs.
Its done to increase probability of coalescing small write() into
single segments in skbs still in write queue (not yet sent)
But it wastes a lot of memory for applications handling many mostly
idle sockets, since each socket holds one page in sk->sk_sndmsg_page
Its also quite inefficient to build TSO 64KB packets, because we need
about 16 pages per skb on arches where PAGE_SIZE = 4096, so we hit
page allocator more than wanted.
This patch adds a per task frag allocator and uses bigger pages,
if available. An automatic fallback is done in case of memory pressure.
(up to 32768 bytes per frag, thats order-3 pages on x86)
This increases TCP stream performance by 20% on loopback device,
but also benefits on other network devices, since 8x less frags are
mapped on transmit and unmapped on tx completion. Alexander Duyck
mentioned a probable performance win on systems with IOMMU enabled.
Its possible some SG enabled hardware cant cope with bigger fragments,
but their ndo_start_xmit() should already handle this, splitting a
fragment in sub fragments, since some arches have PAGE_SIZE=65536
Successfully tested on various ethernet devices.
(ixgbe, igb, bnx2x, tg3, mellanox mlx4)
Signed-off-by: Eric Dumazet <edumazet@google.com>
Cc: Ben Hutchings <bhutchings@solarflare.com>
Cc: Vijay Subramanian <subramanian.vijay@gmail.com>
Cc: Alexander Duyck <alexander.h.duyck@intel.com>
Tested-by: Vijay Subramanian <subramanian.vijay@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2012-09-24 03:04:42 +04:00
|
|
|
|
|
|
|
if (!skb_can_coalesce(skb, i, pfrag->page,
|
|
|
|
pfrag->offset)) {
|
|
|
|
err = -EMSGSIZE;
|
|
|
|
if (i == MAX_SKB_FRAGS)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
__skb_fill_page_desc(skb, i, pfrag->page,
|
|
|
|
pfrag->offset, 0);
|
|
|
|
skb_shinfo(skb)->nr_frags = ++i;
|
|
|
|
get_page(pfrag->page);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
net: use a per task frag allocator
We currently use a per socket order-0 page cache for tcp_sendmsg()
operations.
This page is used to build fragments for skbs.
Its done to increase probability of coalescing small write() into
single segments in skbs still in write queue (not yet sent)
But it wastes a lot of memory for applications handling many mostly
idle sockets, since each socket holds one page in sk->sk_sndmsg_page
Its also quite inefficient to build TSO 64KB packets, because we need
about 16 pages per skb on arches where PAGE_SIZE = 4096, so we hit
page allocator more than wanted.
This patch adds a per task frag allocator and uses bigger pages,
if available. An automatic fallback is done in case of memory pressure.
(up to 32768 bytes per frag, thats order-3 pages on x86)
This increases TCP stream performance by 20% on loopback device,
but also benefits on other network devices, since 8x less frags are
mapped on transmit and unmapped on tx completion. Alexander Duyck
mentioned a probable performance win on systems with IOMMU enabled.
Its possible some SG enabled hardware cant cope with bigger fragments,
but their ndo_start_xmit() should already handle this, splitting a
fragment in sub fragments, since some arches have PAGE_SIZE=65536
Successfully tested on various ethernet devices.
(ixgbe, igb, bnx2x, tg3, mellanox mlx4)
Signed-off-by: Eric Dumazet <edumazet@google.com>
Cc: Ben Hutchings <bhutchings@solarflare.com>
Cc: Vijay Subramanian <subramanian.vijay@gmail.com>
Cc: Alexander Duyck <alexander.h.duyck@intel.com>
Tested-by: Vijay Subramanian <subramanian.vijay@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2012-09-24 03:04:42 +04:00
|
|
|
copy = min_t(int, copy, pfrag->size - pfrag->offset);
|
|
|
|
if (getfrag(from,
|
|
|
|
page_address(pfrag->page) + pfrag->offset,
|
|
|
|
offset, copy, skb->len, skb) < 0)
|
|
|
|
goto error_efault;
|
|
|
|
|
|
|
|
pfrag->offset += copy;
|
|
|
|
skb_frag_size_add(&skb_shinfo(skb)->frags[i - 1], copy);
|
2005-04-17 02:20:36 +04:00
|
|
|
skb->len += copy;
|
|
|
|
skb->data_len += copy;
|
2008-01-23 09:39:26 +03:00
|
|
|
skb->truesize += copy;
|
|
|
|
atomic_add(copy, &sk->sk_wmem_alloc);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
offset += copy;
|
|
|
|
length -= copy;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
net: use a per task frag allocator
We currently use a per socket order-0 page cache for tcp_sendmsg()
operations.
This page is used to build fragments for skbs.
Its done to increase probability of coalescing small write() into
single segments in skbs still in write queue (not yet sent)
But it wastes a lot of memory for applications handling many mostly
idle sockets, since each socket holds one page in sk->sk_sndmsg_page
Its also quite inefficient to build TSO 64KB packets, because we need
about 16 pages per skb on arches where PAGE_SIZE = 4096, so we hit
page allocator more than wanted.
This patch adds a per task frag allocator and uses bigger pages,
if available. An automatic fallback is done in case of memory pressure.
(up to 32768 bytes per frag, thats order-3 pages on x86)
This increases TCP stream performance by 20% on loopback device,
but also benefits on other network devices, since 8x less frags are
mapped on transmit and unmapped on tx completion. Alexander Duyck
mentioned a probable performance win on systems with IOMMU enabled.
Its possible some SG enabled hardware cant cope with bigger fragments,
but their ndo_start_xmit() should already handle this, splitting a
fragment in sub fragments, since some arches have PAGE_SIZE=65536
Successfully tested on various ethernet devices.
(ixgbe, igb, bnx2x, tg3, mellanox mlx4)
Signed-off-by: Eric Dumazet <edumazet@google.com>
Cc: Ben Hutchings <bhutchings@solarflare.com>
Cc: Vijay Subramanian <subramanian.vijay@gmail.com>
Cc: Alexander Duyck <alexander.h.duyck@intel.com>
Tested-by: Vijay Subramanian <subramanian.vijay@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2012-09-24 03:04:42 +04:00
|
|
|
error_efault:
|
|
|
|
err = -EFAULT;
|
2005-04-17 02:20:36 +04:00
|
|
|
error:
|
2011-03-01 05:36:47 +03:00
|
|
|
cork->length -= length;
|
2008-07-17 07:19:49 +04:00
|
|
|
IP_INC_STATS(sock_net(sk), IPSTATS_MIB_OUTDISCARDS);
|
2007-02-09 17:24:47 +03:00
|
|
|
return err;
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2011-03-01 05:36:47 +03:00
|
|
|
static int ip_setup_cork(struct sock *sk, struct inet_cork *cork,
|
|
|
|
struct ipcm_cookie *ipc, struct rtable **rtp)
|
|
|
|
{
|
2011-04-21 13:45:37 +04:00
|
|
|
struct ip_options_rcu *opt;
|
2011-03-01 05:36:47 +03:00
|
|
|
struct rtable *rt;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* setup for corking.
|
|
|
|
*/
|
|
|
|
opt = ipc->opt;
|
|
|
|
if (opt) {
|
|
|
|
if (cork->opt == NULL) {
|
|
|
|
cork->opt = kmalloc(sizeof(struct ip_options) + 40,
|
|
|
|
sk->sk_allocation);
|
|
|
|
if (unlikely(cork->opt == NULL))
|
|
|
|
return -ENOBUFS;
|
|
|
|
}
|
2011-04-21 13:45:37 +04:00
|
|
|
memcpy(cork->opt, &opt->opt, sizeof(struct ip_options) + opt->opt.optlen);
|
2011-03-01 05:36:47 +03:00
|
|
|
cork->flags |= IPCORK_OPT;
|
|
|
|
cork->addr = ipc->addr;
|
|
|
|
}
|
|
|
|
rt = *rtp;
|
|
|
|
if (unlikely(!rt))
|
|
|
|
return -EFAULT;
|
|
|
|
/*
|
|
|
|
* We steal reference to this route, caller should not release it
|
|
|
|
*/
|
|
|
|
*rtp = NULL;
|
2013-11-05 05:24:17 +04:00
|
|
|
cork->fragsize = ip_sk_use_pmtu(sk) ?
|
|
|
|
dst_mtu(&rt->dst) : rt->dst.dev->mtu;
|
2011-03-01 05:36:47 +03:00
|
|
|
cork->dst = &rt->dst;
|
|
|
|
cork->length = 0;
|
2013-09-24 17:43:09 +04:00
|
|
|
cork->ttl = ipc->ttl;
|
|
|
|
cork->tos = ipc->tos;
|
|
|
|
cork->priority = ipc->priority;
|
2011-03-01 05:36:47 +03:00
|
|
|
cork->tx_flags = ipc->tx_flags;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ip_append_data() and ip_append_page() can make one large IP datagram
|
|
|
|
* from many pieces of data. Each pieces will be holded on the socket
|
|
|
|
* until ip_push_pending_frames() is called. Each piece can be a page
|
|
|
|
* or non-page data.
|
|
|
|
*
|
|
|
|
* Not only UDP, other transport protocols - e.g. raw sockets - can use
|
|
|
|
* this interface potentially.
|
|
|
|
*
|
|
|
|
* LATER: length must be adjusted by pad at tail, when it is required.
|
|
|
|
*/
|
2011-05-09 04:24:10 +04:00
|
|
|
int ip_append_data(struct sock *sk, struct flowi4 *fl4,
|
2011-03-01 05:36:47 +03:00
|
|
|
int getfrag(void *from, char *to, int offset, int len,
|
|
|
|
int odd, struct sk_buff *skb),
|
|
|
|
void *from, int length, int transhdrlen,
|
|
|
|
struct ipcm_cookie *ipc, struct rtable **rtp,
|
|
|
|
unsigned int flags)
|
|
|
|
{
|
|
|
|
struct inet_sock *inet = inet_sk(sk);
|
|
|
|
int err;
|
|
|
|
|
|
|
|
if (flags&MSG_PROBE)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (skb_queue_empty(&sk->sk_write_queue)) {
|
2011-05-07 02:02:07 +04:00
|
|
|
err = ip_setup_cork(sk, &inet->cork.base, ipc, rtp);
|
2011-03-01 05:36:47 +03:00
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
} else {
|
|
|
|
transhdrlen = 0;
|
|
|
|
}
|
|
|
|
|
net: use a per task frag allocator
We currently use a per socket order-0 page cache for tcp_sendmsg()
operations.
This page is used to build fragments for skbs.
Its done to increase probability of coalescing small write() into
single segments in skbs still in write queue (not yet sent)
But it wastes a lot of memory for applications handling many mostly
idle sockets, since each socket holds one page in sk->sk_sndmsg_page
Its also quite inefficient to build TSO 64KB packets, because we need
about 16 pages per skb on arches where PAGE_SIZE = 4096, so we hit
page allocator more than wanted.
This patch adds a per task frag allocator and uses bigger pages,
if available. An automatic fallback is done in case of memory pressure.
(up to 32768 bytes per frag, thats order-3 pages on x86)
This increases TCP stream performance by 20% on loopback device,
but also benefits on other network devices, since 8x less frags are
mapped on transmit and unmapped on tx completion. Alexander Duyck
mentioned a probable performance win on systems with IOMMU enabled.
Its possible some SG enabled hardware cant cope with bigger fragments,
but their ndo_start_xmit() should already handle this, splitting a
fragment in sub fragments, since some arches have PAGE_SIZE=65536
Successfully tested on various ethernet devices.
(ixgbe, igb, bnx2x, tg3, mellanox mlx4)
Signed-off-by: Eric Dumazet <edumazet@google.com>
Cc: Ben Hutchings <bhutchings@solarflare.com>
Cc: Vijay Subramanian <subramanian.vijay@gmail.com>
Cc: Alexander Duyck <alexander.h.duyck@intel.com>
Tested-by: Vijay Subramanian <subramanian.vijay@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2012-09-24 03:04:42 +04:00
|
|
|
return __ip_append_data(sk, fl4, &sk->sk_write_queue, &inet->cork.base,
|
|
|
|
sk_page_frag(sk), getfrag,
|
2011-03-01 05:36:47 +03:00
|
|
|
from, length, transhdrlen, flags);
|
|
|
|
}
|
|
|
|
|
2011-05-09 04:24:10 +04:00
|
|
|
ssize_t ip_append_page(struct sock *sk, struct flowi4 *fl4, struct page *page,
|
2005-04-17 02:20:36 +04:00
|
|
|
int offset, size_t size, int flags)
|
|
|
|
{
|
|
|
|
struct inet_sock *inet = inet_sk(sk);
|
|
|
|
struct sk_buff *skb;
|
|
|
|
struct rtable *rt;
|
|
|
|
struct ip_options *opt = NULL;
|
2011-05-07 02:02:07 +04:00
|
|
|
struct inet_cork *cork;
|
2005-04-17 02:20:36 +04:00
|
|
|
int hh_len;
|
|
|
|
int mtu;
|
|
|
|
int len;
|
|
|
|
int err;
|
2013-10-27 20:29:11 +04:00
|
|
|
unsigned int maxfraglen, fragheaderlen, fraggap, maxnonfragsize;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
if (inet->hdrincl)
|
|
|
|
return -EPERM;
|
|
|
|
|
|
|
|
if (flags&MSG_PROBE)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (skb_queue_empty(&sk->sk_write_queue))
|
|
|
|
return -EINVAL;
|
|
|
|
|
2011-05-07 02:02:07 +04:00
|
|
|
cork = &inet->cork.base;
|
|
|
|
rt = (struct rtable *)cork->dst;
|
|
|
|
if (cork->flags & IPCORK_OPT)
|
|
|
|
opt = cork->opt;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2010-06-11 10:31:35 +04:00
|
|
|
if (!(rt->dst.dev->features&NETIF_F_SG))
|
2005-04-17 02:20:36 +04:00
|
|
|
return -EOPNOTSUPP;
|
|
|
|
|
2010-06-11 10:31:35 +04:00
|
|
|
hh_len = LL_RESERVED_SPACE(rt->dst.dev);
|
2011-05-07 02:02:07 +04:00
|
|
|
mtu = cork->fragsize;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
fragheaderlen = sizeof(struct iphdr) + (opt ? opt->optlen : 0);
|
|
|
|
maxfraglen = ((mtu - fragheaderlen) & ~7) + fragheaderlen;
|
2014-05-05 03:39:18 +04:00
|
|
|
maxnonfragsize = ip_sk_ignore_df(sk) ? 0xFFFF : mtu;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2013-10-27 20:29:11 +04:00
|
|
|
if (cork->length + size > maxnonfragsize - fragheaderlen) {
|
2013-12-19 05:13:36 +04:00
|
|
|
ip_local_error(sk, EMSGSIZE, fl4->daddr, inet->inet_dport,
|
|
|
|
mtu - (opt ? opt->optlen : 0));
|
2005-04-17 02:20:36 +04:00
|
|
|
return -EMSGSIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((skb = skb_peek_tail(&sk->sk_write_queue)) == NULL)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2011-05-07 02:02:07 +04:00
|
|
|
cork->length += size;
|
2010-06-15 05:52:25 +04:00
|
|
|
if ((size + skb->len > mtu) &&
|
|
|
|
(sk->sk_protocol == IPPROTO_UDP) &&
|
2010-06-11 10:31:35 +04:00
|
|
|
(rt->dst.dev->features & NETIF_F_UFO)) {
|
2006-06-22 13:40:14 +04:00
|
|
|
skb_shinfo(skb)->gso_size = mtu - fragheaderlen;
|
2006-07-01 00:37:03 +04:00
|
|
|
skb_shinfo(skb)->gso_type = SKB_GSO_UDP;
|
2006-06-22 13:40:14 +04:00
|
|
|
}
|
2005-10-19 02:46:41 +04:00
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
while (size > 0) {
|
|
|
|
int i;
|
|
|
|
|
2006-07-09 00:34:32 +04:00
|
|
|
if (skb_is_gso(skb))
|
2005-10-19 02:46:41 +04:00
|
|
|
len = size;
|
|
|
|
else {
|
|
|
|
|
|
|
|
/* Check if the remaining data fits into current packet. */
|
|
|
|
len = mtu - skb->len;
|
|
|
|
if (len < size)
|
|
|
|
len = maxfraglen - skb->len;
|
|
|
|
}
|
2005-04-17 02:20:36 +04:00
|
|
|
if (len <= 0) {
|
|
|
|
struct sk_buff *skb_prev;
|
|
|
|
int alloclen;
|
|
|
|
|
|
|
|
skb_prev = skb;
|
2005-10-13 22:43:02 +04:00
|
|
|
fraggap = skb_prev->len - maxfraglen;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
alloclen = fragheaderlen + hh_len + fraggap + 15;
|
|
|
|
skb = sock_wmalloc(sk, alloclen, 1, sk->sk_allocation);
|
|
|
|
if (unlikely(!skb)) {
|
|
|
|
err = -ENOBUFS;
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Fill in the control structures
|
|
|
|
*/
|
|
|
|
skb->ip_summed = CHECKSUM_NONE;
|
|
|
|
skb->csum = 0;
|
|
|
|
skb_reserve(skb, hh_len);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Find where to start putting bytes.
|
|
|
|
*/
|
2007-03-13 19:51:52 +03:00
|
|
|
skb_put(skb, fragheaderlen + fraggap);
|
2007-03-11 01:15:25 +03:00
|
|
|
skb_reset_network_header(skb);
|
2007-04-11 08:21:55 +04:00
|
|
|
skb->transport_header = (skb->network_header +
|
|
|
|
fragheaderlen);
|
2005-04-17 02:20:36 +04:00
|
|
|
if (fraggap) {
|
2007-03-13 19:51:52 +03:00
|
|
|
skb->csum = skb_copy_and_csum_bits(skb_prev,
|
|
|
|
maxfraglen,
|
2007-04-26 05:04:18 +04:00
|
|
|
skb_transport_header(skb),
|
2007-03-13 19:51:52 +03:00
|
|
|
fraggap, 0);
|
2005-04-17 02:20:36 +04:00
|
|
|
skb_prev->csum = csum_sub(skb_prev->csum,
|
|
|
|
skb->csum);
|
2006-08-14 07:12:58 +04:00
|
|
|
pskb_trim_unique(skb_prev, maxfraglen);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Put the packet on the pending queue.
|
|
|
|
*/
|
|
|
|
__skb_queue_tail(&sk->sk_write_queue, skb);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
i = skb_shinfo(skb)->nr_frags;
|
|
|
|
if (len > size)
|
|
|
|
len = size;
|
|
|
|
if (skb_can_coalesce(skb, i, page, offset)) {
|
2011-10-19 01:00:24 +04:00
|
|
|
skb_frag_size_add(&skb_shinfo(skb)->frags[i-1], len);
|
2005-04-17 02:20:36 +04:00
|
|
|
} else if (i < MAX_SKB_FRAGS) {
|
|
|
|
get_page(page);
|
|
|
|
skb_fill_page_desc(skb, i, page, offset, len);
|
|
|
|
} else {
|
|
|
|
err = -EMSGSIZE;
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (skb->ip_summed == CHECKSUM_NONE) {
|
2006-11-15 08:36:14 +03:00
|
|
|
__wsum csum;
|
2005-04-17 02:20:36 +04:00
|
|
|
csum = csum_page(page, offset, len);
|
|
|
|
skb->csum = csum_block_add(skb->csum, csum, skb->len);
|
|
|
|
}
|
|
|
|
|
|
|
|
skb->len += len;
|
|
|
|
skb->data_len += len;
|
2008-01-23 10:44:31 +03:00
|
|
|
skb->truesize += len;
|
|
|
|
atomic_add(len, &sk->sk_wmem_alloc);
|
2005-04-17 02:20:36 +04:00
|
|
|
offset += len;
|
|
|
|
size -= len;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
error:
|
2011-05-07 02:02:07 +04:00
|
|
|
cork->length -= size;
|
2008-07-17 07:19:49 +04:00
|
|
|
IP_INC_STATS(sock_net(sk), IPSTATS_MIB_OUTDISCARDS);
|
2005-04-17 02:20:36 +04:00
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2011-03-01 05:36:47 +03:00
|
|
|
static void ip_cork_release(struct inet_cork *cork)
|
2007-11-06 08:03:24 +03:00
|
|
|
{
|
2011-03-01 05:36:47 +03:00
|
|
|
cork->flags &= ~IPCORK_OPT;
|
|
|
|
kfree(cork->opt);
|
|
|
|
cork->opt = NULL;
|
|
|
|
dst_release(cork->dst);
|
|
|
|
cork->dst = NULL;
|
2007-11-06 08:03:24 +03:00
|
|
|
}
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* Combined all pending IP fragments on the socket as one IP datagram
|
|
|
|
* and push them out.
|
|
|
|
*/
|
2011-03-01 05:36:47 +03:00
|
|
|
struct sk_buff *__ip_make_skb(struct sock *sk,
|
2011-05-09 04:12:19 +04:00
|
|
|
struct flowi4 *fl4,
|
2011-03-01 05:36:47 +03:00
|
|
|
struct sk_buff_head *queue,
|
|
|
|
struct inet_cork *cork)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
|
|
|
struct sk_buff *skb, *tmp_skb;
|
|
|
|
struct sk_buff **tail_skb;
|
|
|
|
struct inet_sock *inet = inet_sk(sk);
|
2008-07-15 10:00:43 +04:00
|
|
|
struct net *net = sock_net(sk);
|
2005-04-17 02:20:36 +04:00
|
|
|
struct ip_options *opt = NULL;
|
2011-03-01 05:36:47 +03:00
|
|
|
struct rtable *rt = (struct rtable *)cork->dst;
|
2005-04-17 02:20:36 +04:00
|
|
|
struct iphdr *iph;
|
2006-01-07 00:24:29 +03:00
|
|
|
__be16 df = 0;
|
2005-04-17 02:20:36 +04:00
|
|
|
__u8 ttl;
|
|
|
|
|
2011-03-01 05:36:47 +03:00
|
|
|
if ((skb = __skb_dequeue(queue)) == NULL)
|
2005-04-17 02:20:36 +04:00
|
|
|
goto out;
|
|
|
|
tail_skb = &(skb_shinfo(skb)->frag_list);
|
|
|
|
|
|
|
|
/* move skb->data to ip header from ext header */
|
2007-04-11 07:50:43 +04:00
|
|
|
if (skb->data < skb_network_header(skb))
|
2007-03-11 04:16:10 +03:00
|
|
|
__skb_pull(skb, skb_network_offset(skb));
|
2011-03-01 05:36:47 +03:00
|
|
|
while ((tmp_skb = __skb_dequeue(queue)) != NULL) {
|
2007-03-16 23:26:39 +03:00
|
|
|
__skb_pull(tmp_skb, skb_network_header_len(skb));
|
2005-04-17 02:20:36 +04:00
|
|
|
*tail_skb = tmp_skb;
|
|
|
|
tail_skb = &(tmp_skb->next);
|
|
|
|
skb->len += tmp_skb->len;
|
|
|
|
skb->data_len += tmp_skb->len;
|
|
|
|
skb->truesize += tmp_skb->truesize;
|
|
|
|
tmp_skb->destructor = NULL;
|
|
|
|
tmp_skb->sk = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Unless user demanded real pmtu discovery (IP_PMTUDISC_DO), we allow
|
|
|
|
* to fragment the frame generated here. No matter, what transforms
|
|
|
|
* how transforms change size of the packet, it will come out.
|
|
|
|
*/
|
2014-05-05 03:39:18 +04:00
|
|
|
skb->ignore_df = ip_sk_ignore_df(sk);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/* DF bit is set when we want to see DF on outgoing frames.
|
2014-05-05 03:39:18 +04:00
|
|
|
* If ignore_df is set too, we still allow to fragment this frame
|
2005-04-17 02:20:36 +04:00
|
|
|
* locally. */
|
2013-11-05 05:24:17 +04:00
|
|
|
if (inet->pmtudisc == IP_PMTUDISC_DO ||
|
|
|
|
inet->pmtudisc == IP_PMTUDISC_PROBE ||
|
2010-06-11 10:31:35 +04:00
|
|
|
(skb->len <= dst_mtu(&rt->dst) &&
|
|
|
|
ip_dont_fragment(sk, &rt->dst)))
|
2005-04-17 02:20:36 +04:00
|
|
|
df = htons(IP_DF);
|
|
|
|
|
2011-03-01 05:36:47 +03:00
|
|
|
if (cork->flags & IPCORK_OPT)
|
|
|
|
opt = cork->opt;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2013-09-24 17:43:09 +04:00
|
|
|
if (cork->ttl != 0)
|
|
|
|
ttl = cork->ttl;
|
|
|
|
else if (rt->rt_type == RTN_MULTICAST)
|
2005-04-17 02:20:36 +04:00
|
|
|
ttl = inet->mc_ttl;
|
|
|
|
else
|
2010-06-11 10:31:35 +04:00
|
|
|
ttl = ip_select_ttl(inet, &rt->dst);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2013-09-19 02:29:52 +04:00
|
|
|
iph = ip_hdr(skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
iph->version = 4;
|
|
|
|
iph->ihl = 5;
|
2013-09-24 17:43:09 +04:00
|
|
|
iph->tos = (cork->tos != -1) ? cork->tos : inet->tos;
|
2005-04-17 02:20:36 +04:00
|
|
|
iph->frag_off = df;
|
|
|
|
iph->ttl = ttl;
|
|
|
|
iph->protocol = sk->sk_protocol;
|
2011-11-30 23:00:53 +04:00
|
|
|
ip_copy_addrs(iph, fl4);
|
inetpeer: get rid of ip_id_count
Ideally, we would need to generate IP ID using a per destination IP
generator.
linux kernels used inet_peer cache for this purpose, but this had a huge
cost on servers disabling MTU discovery.
1) each inet_peer struct consumes 192 bytes
2) inetpeer cache uses a binary tree of inet_peer structs,
with a nominal size of ~66000 elements under load.
3) lookups in this tree are hitting a lot of cache lines, as tree depth
is about 20.
4) If server deals with many tcp flows, we have a high probability of
not finding the inet_peer, allocating a fresh one, inserting it in
the tree with same initial ip_id_count, (cf secure_ip_id())
5) We garbage collect inet_peer aggressively.
IP ID generation do not have to be 'perfect'
Goal is trying to avoid duplicates in a short period of time,
so that reassembly units have a chance to complete reassembly of
fragments belonging to one message before receiving other fragments
with a recycled ID.
We simply use an array of generators, and a Jenkin hash using the dst IP
as a key.
ipv6_select_ident() is put back into net/ipv6/ip6_output.c where it
belongs (it is only used from this file)
secure_ip_id() and secure_ipv6_id() no longer are needed.
Rename ip_select_ident_more() to ip_select_ident_segs() to avoid
unnecessary decrement/increment of the number of segments.
Signed-off-by: Eric Dumazet <edumazet@google.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2014-06-02 16:26:03 +04:00
|
|
|
ip_select_ident(skb, sk);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2011-05-14 01:21:27 +04:00
|
|
|
if (opt) {
|
|
|
|
iph->ihl += opt->optlen>>2;
|
|
|
|
ip_options_build(skb, opt, cork->addr, rt, 0);
|
|
|
|
}
|
|
|
|
|
2013-09-24 17:43:09 +04:00
|
|
|
skb->priority = (cork->tos != -1) ? cork->priority: sk->sk_priority;
|
2008-01-31 06:08:16 +03:00
|
|
|
skb->mark = sk->sk_mark;
|
2008-11-25 03:07:50 +03:00
|
|
|
/*
|
|
|
|
* Steal rt from cork.dst to avoid a pair of atomic_inc/atomic_dec
|
|
|
|
* on dst refcount
|
|
|
|
*/
|
2011-03-01 05:36:47 +03:00
|
|
|
cork->dst = NULL;
|
2010-06-11 10:31:35 +04:00
|
|
|
skb_dst_set(skb, &rt->dst);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2007-09-17 20:57:33 +04:00
|
|
|
if (iph->protocol == IPPROTO_ICMP)
|
2008-07-15 10:00:43 +04:00
|
|
|
icmp_out_count(net, ((struct icmphdr *)
|
2007-09-17 20:57:33 +04:00
|
|
|
skb_transport_header(skb))->type);
|
|
|
|
|
2011-03-01 05:36:47 +03:00
|
|
|
ip_cork_release(cork);
|
|
|
|
out:
|
|
|
|
return skb;
|
|
|
|
}
|
|
|
|
|
2012-08-10 06:22:47 +04:00
|
|
|
int ip_send_skb(struct net *net, struct sk_buff *skb)
|
2011-03-01 05:36:47 +03:00
|
|
|
{
|
|
|
|
int err;
|
|
|
|
|
2008-01-12 06:14:00 +03:00
|
|
|
err = ip_local_out(skb);
|
2005-04-17 02:20:36 +04:00
|
|
|
if (err) {
|
|
|
|
if (err > 0)
|
ip: Report qdisc packet drops
Christoph Lameter pointed out that packet drops at qdisc level where not
accounted in SNMP counters. Only if application sets IP_RECVERR, drops
are reported to user (-ENOBUFS errors) and SNMP counters updated.
IP_RECVERR is used to enable extended reliable error message passing,
but these are not needed to update system wide SNMP stats.
This patch changes things a bit to allow SNMP counters to be updated,
regardless of IP_RECVERR being set or not on the socket.
Example after an UDP tx flood
# netstat -s
...
IP:
1487048 outgoing packets dropped
...
Udp:
...
SndbufErrors: 1487048
send() syscalls, do however still return an OK status, to not
break applications.
Note : send() manual page explicitly says for -ENOBUFS error :
"The output queue for a network interface was full.
This generally indicates that the interface has stopped sending,
but may be caused by transient congestion.
(Normally, this does not occur in Linux. Packets are just silently
dropped when a device queue overflows.) "
This is not true for IP_RECVERR enabled sockets : a send() syscall
that hit a qdisc drop returns an ENOBUFS error.
Many thanks to Christoph, David, and last but not least, Alexey !
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-09-03 05:05:33 +04:00
|
|
|
err = net_xmit_errno(err);
|
2005-04-17 02:20:36 +04:00
|
|
|
if (err)
|
2011-03-01 05:36:47 +03:00
|
|
|
IP_INC_STATS(net, IPSTATS_MIB_OUTDISCARDS);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2011-05-09 04:12:19 +04:00
|
|
|
int ip_push_pending_frames(struct sock *sk, struct flowi4 *fl4)
|
2011-03-01 05:36:47 +03:00
|
|
|
{
|
2011-03-01 05:36:47 +03:00
|
|
|
struct sk_buff *skb;
|
|
|
|
|
2011-05-09 04:12:19 +04:00
|
|
|
skb = ip_finish_skb(sk, fl4);
|
2011-03-01 05:36:47 +03:00
|
|
|
if (!skb)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Netfilter gets whole the not fragmented skb. */
|
2012-08-10 06:22:47 +04:00
|
|
|
return ip_send_skb(sock_net(sk), skb);
|
2011-03-01 05:36:47 +03:00
|
|
|
}
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* Throw away all pending data on the socket.
|
|
|
|
*/
|
2011-03-01 05:36:47 +03:00
|
|
|
static void __ip_flush_pending_frames(struct sock *sk,
|
|
|
|
struct sk_buff_head *queue,
|
|
|
|
struct inet_cork *cork)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
|
|
|
struct sk_buff *skb;
|
|
|
|
|
2011-03-01 05:36:47 +03:00
|
|
|
while ((skb = __skb_dequeue_tail(queue)) != NULL)
|
2005-04-17 02:20:36 +04:00
|
|
|
kfree_skb(skb);
|
|
|
|
|
2011-03-01 05:36:47 +03:00
|
|
|
ip_cork_release(cork);
|
|
|
|
}
|
|
|
|
|
|
|
|
void ip_flush_pending_frames(struct sock *sk)
|
|
|
|
{
|
2011-05-07 02:02:07 +04:00
|
|
|
__ip_flush_pending_frames(sk, &sk->sk_write_queue, &inet_sk(sk)->cork.base);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2011-03-01 05:36:47 +03:00
|
|
|
struct sk_buff *ip_make_skb(struct sock *sk,
|
2011-05-09 04:12:19 +04:00
|
|
|
struct flowi4 *fl4,
|
2011-03-01 05:36:47 +03:00
|
|
|
int getfrag(void *from, char *to, int offset,
|
|
|
|
int len, int odd, struct sk_buff *skb),
|
|
|
|
void *from, int length, int transhdrlen,
|
|
|
|
struct ipcm_cookie *ipc, struct rtable **rtp,
|
|
|
|
unsigned int flags)
|
|
|
|
{
|
2011-05-07 02:06:01 +04:00
|
|
|
struct inet_cork cork;
|
2011-03-01 05:36:47 +03:00
|
|
|
struct sk_buff_head queue;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
if (flags & MSG_PROBE)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
__skb_queue_head_init(&queue);
|
|
|
|
|
2011-05-07 02:06:01 +04:00
|
|
|
cork.flags = 0;
|
|
|
|
cork.addr = 0;
|
2011-05-07 03:01:15 +04:00
|
|
|
cork.opt = NULL;
|
2011-03-01 05:36:47 +03:00
|
|
|
err = ip_setup_cork(sk, &cork, ipc, rtp);
|
|
|
|
if (err)
|
|
|
|
return ERR_PTR(err);
|
|
|
|
|
net: use a per task frag allocator
We currently use a per socket order-0 page cache for tcp_sendmsg()
operations.
This page is used to build fragments for skbs.
Its done to increase probability of coalescing small write() into
single segments in skbs still in write queue (not yet sent)
But it wastes a lot of memory for applications handling many mostly
idle sockets, since each socket holds one page in sk->sk_sndmsg_page
Its also quite inefficient to build TSO 64KB packets, because we need
about 16 pages per skb on arches where PAGE_SIZE = 4096, so we hit
page allocator more than wanted.
This patch adds a per task frag allocator and uses bigger pages,
if available. An automatic fallback is done in case of memory pressure.
(up to 32768 bytes per frag, thats order-3 pages on x86)
This increases TCP stream performance by 20% on loopback device,
but also benefits on other network devices, since 8x less frags are
mapped on transmit and unmapped on tx completion. Alexander Duyck
mentioned a probable performance win on systems with IOMMU enabled.
Its possible some SG enabled hardware cant cope with bigger fragments,
but their ndo_start_xmit() should already handle this, splitting a
fragment in sub fragments, since some arches have PAGE_SIZE=65536
Successfully tested on various ethernet devices.
(ixgbe, igb, bnx2x, tg3, mellanox mlx4)
Signed-off-by: Eric Dumazet <edumazet@google.com>
Cc: Ben Hutchings <bhutchings@solarflare.com>
Cc: Vijay Subramanian <subramanian.vijay@gmail.com>
Cc: Alexander Duyck <alexander.h.duyck@intel.com>
Tested-by: Vijay Subramanian <subramanian.vijay@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2012-09-24 03:04:42 +04:00
|
|
|
err = __ip_append_data(sk, fl4, &queue, &cork,
|
|
|
|
¤t->task_frag, getfrag,
|
2011-03-01 05:36:47 +03:00
|
|
|
from, length, transhdrlen, flags);
|
|
|
|
if (err) {
|
|
|
|
__ip_flush_pending_frames(sk, &queue, &cork);
|
|
|
|
return ERR_PTR(err);
|
|
|
|
}
|
|
|
|
|
2011-05-09 04:12:19 +04:00
|
|
|
return __ip_make_skb(sk, fl4, &queue, &cork);
|
2011-03-01 05:36:47 +03:00
|
|
|
}
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Fetch data from kernel space and fill in checksum if needed.
|
|
|
|
*/
|
2007-02-09 17:24:47 +03:00
|
|
|
static int ip_reply_glue_bits(void *dptr, char *to, int offset,
|
2005-04-17 02:20:36 +04:00
|
|
|
int len, int odd, struct sk_buff *skb)
|
|
|
|
{
|
2006-11-15 08:36:34 +03:00
|
|
|
__wsum csum;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
csum = csum_partial_copy_nocheck(dptr+offset, to, len, 0);
|
|
|
|
skb->csum = csum_block_add(skb->csum, csum, odd);
|
2007-02-09 17:24:47 +03:00
|
|
|
return 0;
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2007-02-09 17:24:47 +03:00
|
|
|
/*
|
2005-04-17 02:20:36 +04:00
|
|
|
* Generic function to send a packet as reply to another packet.
|
2012-07-19 11:34:03 +04:00
|
|
|
* Used to send some TCP resets/acks so far.
|
2005-04-17 02:20:36 +04:00
|
|
|
*
|
2012-07-19 11:34:03 +04:00
|
|
|
* Use a fake percpu inet socket to avoid false sharing and contention.
|
2005-04-17 02:20:36 +04:00
|
|
|
*/
|
2012-07-19 11:34:03 +04:00
|
|
|
static DEFINE_PER_CPU(struct inet_sock, unicast_sock) = {
|
|
|
|
.sk = {
|
|
|
|
.__sk_common = {
|
|
|
|
.skc_refcnt = ATOMIC_INIT(1),
|
|
|
|
},
|
|
|
|
.sk_wmem_alloc = ATOMIC_INIT(1),
|
|
|
|
.sk_allocation = GFP_ATOMIC,
|
|
|
|
.sk_flags = (1UL << SOCK_USE_WRITE_QUEUE),
|
|
|
|
},
|
2012-07-21 02:28:51 +04:00
|
|
|
.pmtudisc = IP_PMTUDISC_WANT,
|
|
|
|
.uc_ttl = -1,
|
2012-07-19 11:34:03 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
void ip_send_unicast_reply(struct net *net, struct sk_buff *skb, __be32 daddr,
|
2012-06-28 14:21:41 +04:00
|
|
|
__be32 saddr, const struct ip_reply_arg *arg,
|
|
|
|
unsigned int len)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
2011-04-21 13:45:37 +04:00
|
|
|
struct ip_options_data replyopts;
|
2005-04-17 02:20:36 +04:00
|
|
|
struct ipcm_cookie ipc;
|
2011-05-09 04:12:19 +04:00
|
|
|
struct flowi4 fl4;
|
2009-06-02 09:14:27 +04:00
|
|
|
struct rtable *rt = skb_rtable(skb);
|
2012-07-19 11:34:03 +04:00
|
|
|
struct sk_buff *nskb;
|
|
|
|
struct sock *sk;
|
|
|
|
struct inet_sock *inet;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2011-04-21 13:45:37 +04:00
|
|
|
if (ip_options_echo(&replyopts.opt.opt, skb))
|
2005-04-17 02:20:36 +04:00
|
|
|
return;
|
|
|
|
|
2011-05-10 00:22:43 +04:00
|
|
|
ipc.addr = daddr;
|
2005-04-17 02:20:36 +04:00
|
|
|
ipc.opt = NULL;
|
2010-08-17 12:59:14 +04:00
|
|
|
ipc.tx_flags = 0;
|
2013-09-24 17:43:09 +04:00
|
|
|
ipc.ttl = 0;
|
|
|
|
ipc.tos = -1;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2011-04-21 13:45:37 +04:00
|
|
|
if (replyopts.opt.opt.optlen) {
|
2005-04-17 02:20:36 +04:00
|
|
|
ipc.opt = &replyopts.opt;
|
|
|
|
|
2011-04-21 13:45:37 +04:00
|
|
|
if (replyopts.opt.opt.srr)
|
|
|
|
daddr = replyopts.opt.opt.faddr;
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2014-05-13 21:17:33 +04:00
|
|
|
flowi4_init_output(&fl4, arg->bound_dev_if,
|
|
|
|
IP4_REPLY_MARK(net, skb->mark),
|
2011-10-24 11:06:21 +04:00
|
|
|
RT_TOS(arg->tos),
|
2012-07-19 11:34:03 +04:00
|
|
|
RT_SCOPE_UNIVERSE, ip_hdr(skb)->protocol,
|
2011-05-09 04:12:19 +04:00
|
|
|
ip_reply_arg_flowi_flags(arg),
|
2012-06-28 14:21:41 +04:00
|
|
|
daddr, saddr,
|
2011-05-09 04:12:19 +04:00
|
|
|
tcp_hdr(skb)->source, tcp_hdr(skb)->dest);
|
|
|
|
security_skb_classify_flow(skb, flowi4_to_flowi(&fl4));
|
2012-07-19 11:34:03 +04:00
|
|
|
rt = ip_route_output_key(net, &fl4);
|
2011-05-09 04:12:19 +04:00
|
|
|
if (IS_ERR(rt))
|
|
|
|
return;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2012-07-19 11:34:03 +04:00
|
|
|
inet = &get_cpu_var(unicast_sock);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2011-10-24 11:06:21 +04:00
|
|
|
inet->tos = arg->tos;
|
2012-07-19 11:34:03 +04:00
|
|
|
sk = &inet->sk;
|
2005-04-17 02:20:36 +04:00
|
|
|
sk->sk_priority = skb->priority;
|
2007-04-21 09:47:35 +04:00
|
|
|
sk->sk_protocol = ip_hdr(skb)->protocol;
|
2007-06-05 08:32:46 +04:00
|
|
|
sk->sk_bound_dev_if = arg->bound_dev_if;
|
2012-07-19 11:34:03 +04:00
|
|
|
sock_net_set(sk, net);
|
|
|
|
__skb_queue_head_init(&sk->sk_write_queue);
|
|
|
|
sk->sk_sndbuf = sysctl_wmem_default;
|
2011-05-09 04:24:10 +04:00
|
|
|
ip_append_data(sk, &fl4, ip_reply_glue_bits, arg->iov->iov_base, len, 0,
|
2008-11-25 02:52:46 +03:00
|
|
|
&ipc, &rt, MSG_DONTWAIT);
|
2012-07-19 11:34:03 +04:00
|
|
|
nskb = skb_peek(&sk->sk_write_queue);
|
|
|
|
if (nskb) {
|
2005-04-17 02:20:36 +04:00
|
|
|
if (arg->csumoffset >= 0)
|
2012-07-19 11:34:03 +04:00
|
|
|
*((__sum16 *)skb_transport_header(nskb) +
|
|
|
|
arg->csumoffset) = csum_fold(csum_add(nskb->csum,
|
2007-04-26 05:04:18 +04:00
|
|
|
arg->csum));
|
2012-07-19 11:34:03 +04:00
|
|
|
nskb->ip_summed = CHECKSUM_NONE;
|
2012-08-09 17:56:06 +04:00
|
|
|
skb_orphan(nskb);
|
2012-07-19 11:34:03 +04:00
|
|
|
skb_set_queue_mapping(nskb, skb_get_queue_mapping(skb));
|
2011-05-09 04:12:19 +04:00
|
|
|
ip_push_pending_frames(sk, &fl4);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2012-07-19 11:34:03 +04:00
|
|
|
put_cpu_var(unicast_sock);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
ip_rt_put(rt);
|
|
|
|
}
|
|
|
|
|
|
|
|
void __init ip_init(void)
|
|
|
|
{
|
|
|
|
ip_rt_init();
|
|
|
|
inet_initpeers();
|
|
|
|
|
2014-01-11 04:09:45 +04:00
|
|
|
#if defined(CONFIG_IP_MULTICAST)
|
|
|
|
igmp_mc_init();
|
2005-04-17 02:20:36 +04:00
|
|
|
#endif
|
|
|
|
}
|