tipc: fall back to smaller MTU if allocation of local send skb fails

When sending node local messages the code is using an 'mtu' of 66060
bytes to avoid unnecessary fragmentation. During situations of low
memory tipc_msg_build() may sometimes fail to allocate such large
buffers, resulting in unnecessary send failures. This can easily be
remedied by falling back to a smaller MTU, and then reassemble the
buffer chain as if the message were arriving from a remote node.

At the same time, we change the initial MTU setting of the broadcast
link to a lower value, so that large messages always are fragmented
into smaller buffers even when we run in single node mode. Apart from
obtaining the same advantage as for the 'fallback' solution above, this
turns out to give a significant performance improvement. This can
probably be explained with the __pskb_copy() operation performed on the
buffer for each recipient during reception. We found the optimal value
for this, considering the most relevant skb pool, to be 3744 bytes.

Acked-by: Ying Xue <ying.xue@ericsson.com>
Signed-off-by: Jon Maloy <jon.maloy@ericsson.com>
Signed-off-by: David S. Miller <davem@davemloft.net>

diff --git a/net/tipc/bcast.c b/net/tipc/bcast.c
index 329325bd553e403c8a5f31484b74a9968d28d3d6..37892b3909afc110990c11f5a12197ad506b3a02 100644 (file)
--- a/net/tipc/bcast.c
+++ b/net/tipc/bcast.c
@@ -1,7 +1,7 @@
 /*
  * net/tipc/bcast.c: TIPC broadcast code
  *
- * Copyright (c) 2004-2006, 2014-2016, Ericsson AB
+ * Copyright (c) 2004-2006, 2014-2017, Ericsson AB
  * Copyright (c) 2004, Intel Corporation.
  * Copyright (c) 2005, 2010-2011, Wind River Systems
  * All rights reserved.
@@ -42,8 +42,8 @@
 #include "link.h"
 #include "name_table.h"
 
-#define        BCLINK_WIN_DEFAULT      50      /* bcast link window size (default) */
-#define        BCLINK_WIN_MIN          32      /* bcast minimum link window size */
+#define BCLINK_WIN_DEFAULT  50 /* bcast link window size (default) */
+#define BCLINK_WIN_MIN      32 /* bcast minimum link window size */
 
 const char tipc_bclink_name[] = "broadcast-link";
 
@@ -74,6 +74,10 @@ static struct tipc_bc_base *tipc_bc_base(struct net *net)
        return tipc_net(net)->bcbase;
 }
 
+/* tipc_bcast_get_mtu(): -get the MTU currently used by broadcast link
+ * Note: the MTU is decremented to give room for a tunnel header, in
+ * case the message needs to be sent as replicast
+ */
 int tipc_bcast_get_mtu(struct net *net)
 {
        return tipc_link_mtu(tipc_bc_sndlink(net)) - INT_H_SIZE;
@@ -515,7 +519,7 @@ int tipc_bcast_init(struct net *net)
        spin_lock_init(&tipc_net(net)->bclock);
 
        if (!tipc_link_bc_create(net, 0, 0,
-                                U16_MAX,
+                                FB_MTU,
                                 BCLINK_WIN_DEFAULT,
                                 0,
                                 &bb->inputq,

diff --git a/net/tipc/link.c b/net/tipc/link.c
index 6bce0b1117bdf293b90c5a7940d08e8887a11e65..2d6b2aed30e0602a9d30bb64e7a91c3c87f7b916 100644 (file)
--- a/net/tipc/link.c
+++ b/net/tipc/link.c
@@ -483,7 +483,7 @@ bool tipc_link_create(struct net *net, char *if_name, int bearer_id,
 /**
  * tipc_link_bc_create - create new link to be used for broadcast
  * @n: pointer to associated node
- * @mtu: mtu to be used
+ * @mtu: mtu to be used initially if no peers
  * @window: send window to be used
  * @inputq: queue to put messages ready for delivery
  * @namedq: queue to put binding table update messages ready for delivery

diff --git a/net/tipc/msg.c b/net/tipc/msg.c
index b0d07b35909d3349fd7fae2526c96bddc93b2b4e..55d8ba92291d2ac15e97ed90213e40d45ab99a58 100644 (file)
--- a/net/tipc/msg.c
+++ b/net/tipc/msg.c
@@ -251,20 +251,23 @@ bool tipc_msg_validate(struct sk_buff **_skb)
  * @pktmax: Max packet size that can be used
  * @list: Buffer or chain of buffers to be returned to caller
  *
+ * Note that the recursive call we are making here is safe, since it can
+ * logically go only one further level down.
+ *
  * Returns message data size or errno: -ENOMEM, -EFAULT
  */
-int tipc_msg_build(struct tipc_msg *mhdr, struct msghdr *m,
-                  int offset, int dsz, int pktmax, struct sk_buff_head *list)
+int tipc_msg_build(struct tipc_msg *mhdr, struct msghdr *m, int offset,
+                  int dsz, int pktmax, struct sk_buff_head *list)
 {
        int mhsz = msg_hdr_sz(mhdr);
+       struct tipc_msg pkthdr;
        int msz = mhsz + dsz;
-       int pktno = 1;
-       int pktsz;
        int pktrem = pktmax;
-       int drem = dsz;
-       struct tipc_msg pkthdr;
        struct sk_buff *skb;
+       int drem = dsz;
+       int pktno = 1;
        char *pktpos;
+       int pktsz;
        int rc;
 
        msg_set_size(mhdr, msz);
@@ -272,8 +275,18 @@ int tipc_msg_build(struct tipc_msg *mhdr, struct msghdr *m,
        /* No fragmentation needed? */
        if (likely(msz <= pktmax)) {
                skb = tipc_buf_acquire(msz, GFP_KERNEL);
-               if (unlikely(!skb))
+
+               /* Fall back to smaller MTU if node local message */
+               if (unlikely(!skb)) {
+                       if (pktmax != MAX_MSG_SIZE)
+                               return -ENOMEM;
+                       rc = tipc_msg_build(mhdr, m, offset, dsz, FB_MTU, list);
+                       if (rc != dsz)
+                               return rc;
+                       if (tipc_msg_assemble(list))
+                               return dsz;
                        return -ENOMEM;
+               }
                skb_orphan(skb);
                __skb_queue_tail(list, skb);
                skb_copy_to_linear_data(skb, mhdr, mhsz);
@@ -589,6 +602,30 @@ bool tipc_msg_lookup_dest(struct net *net, struct sk_buff *skb, int *err)
        return true;
 }
 
+/* tipc_msg_assemble() - assemble chain of fragments into one message
+ */
+bool tipc_msg_assemble(struct sk_buff_head *list)
+{
+       struct sk_buff *skb, *tmp = NULL;
+
+       if (skb_queue_len(list) == 1)
+               return true;
+
+       while ((skb = __skb_dequeue(list))) {
+               skb->next = NULL;
+               if (tipc_buf_append(&tmp, &skb)) {
+                       __skb_queue_tail(list, skb);
+                       return true;
+               }
+               if (!tmp)
+                       break;
+       }
+       __skb_queue_purge(list);
+       __skb_queue_head_init(list);
+       pr_warn("Failed do assemble buffer\n");
+       return false;
+}
+
 /* tipc_msg_reassemble() - clone a buffer chain of fragments and
  *                         reassemble the clones into one message
  */

diff --git a/net/tipc/msg.h b/net/tipc/msg.h
index 3e4384c222f705fdf20a56c53c4abf363bcd7186..b4ba1b4f9ae7fa51aa7c58db8456c1691e2a0839 100644 (file)
--- a/net/tipc/msg.h
+++ b/net/tipc/msg.h
@@ -98,7 +98,7 @@ struct plist;
 #define MAX_H_SIZE                60   /* Largest possible TIPC header size */
 
 #define MAX_MSG_SIZE (MAX_H_SIZE + TIPC_MAX_USER_MSG_SIZE)
-
+#define FB_MTU                  3744
 #define TIPC_MEDIA_INFO_OFFSET 5
 
 struct tipc_skb_cb {
@@ -943,6 +943,7 @@ bool tipc_msg_extract(struct sk_buff *skb, struct sk_buff **iskb, int *pos);
 int tipc_msg_build(struct tipc_msg *mhdr, struct msghdr *m,
                   int offset, int dsz, int mtu, struct sk_buff_head *list);
 bool tipc_msg_lookup_dest(struct net *net, struct sk_buff *skb, int *err);
+bool tipc_msg_assemble(struct sk_buff_head *list);
 bool tipc_msg_reassemble(struct sk_buff_head *list, struct sk_buff_head *rcvq);
 bool tipc_msg_pskb_copy(u32 dst, struct sk_buff_head *msg,
                        struct sk_buff_head *cpy);