Commit 3acb50c1 authored by Marcelo Ricardo Leitner's avatar Marcelo Ricardo Leitner Committed by David S. Miller

sctp: delay as much as possible skb_linearize

This patch is a preparation for the GSO one. In order to successfully
handle GSO packets on rx path we must not call skb_linearize, otherwise
it defeats any gain GSO may have had.

This patch thus delays as much as possible the call to skb_linearize,
leaving it to sctp_inq_pop() moment. For that the sanity checks
performed now know how to deal with fragments.

One positive side-effect of this is that if the socket is backlogged it
will have the chance of doing it on backlog processing instead of
during softirq.

With this move, it's evident that a check for non-linearity in
sctp_inq_pop was ineffective and is now removed. Note that a similar
check is performed a bit below this one.
Signed-off-by: default avatarMarcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Tested-by: default avatarXin Long <lucien.xin@gmail.com>
Signed-off-by: default avatarDavid S. Miller <davem@davemloft.net>
parent ae7ef81e
...@@ -112,7 +112,6 @@ int sctp_rcv(struct sk_buff *skb) ...@@ -112,7 +112,6 @@ int sctp_rcv(struct sk_buff *skb)
struct sctp_ep_common *rcvr; struct sctp_ep_common *rcvr;
struct sctp_transport *transport = NULL; struct sctp_transport *transport = NULL;
struct sctp_chunk *chunk; struct sctp_chunk *chunk;
struct sctphdr *sh;
union sctp_addr src; union sctp_addr src;
union sctp_addr dest; union sctp_addr dest;
int family; int family;
...@@ -124,15 +123,18 @@ int sctp_rcv(struct sk_buff *skb) ...@@ -124,15 +123,18 @@ int sctp_rcv(struct sk_buff *skb)
__SCTP_INC_STATS(net, SCTP_MIB_INSCTPPACKS); __SCTP_INC_STATS(net, SCTP_MIB_INSCTPPACKS);
if (skb_linearize(skb)) /* If packet is too small to contain a single chunk, let's not
* waste time on it anymore.
*/
if (skb->len < sizeof(struct sctphdr) + sizeof(struct sctp_chunkhdr) +
skb_transport_offset(skb))
goto discard_it; goto discard_it;
sh = sctp_hdr(skb); if (!pskb_may_pull(skb, sizeof(struct sctphdr)))
goto discard_it;
/* Pull up the IP and SCTP headers. */ /* Pull up the IP header. */
__skb_pull(skb, skb_transport_offset(skb)); __skb_pull(skb, skb_transport_offset(skb));
if (skb->len < sizeof(struct sctphdr))
goto discard_it;
skb->csum_valid = 0; /* Previous value not applicable */ skb->csum_valid = 0; /* Previous value not applicable */
if (skb_csum_unnecessary(skb)) if (skb_csum_unnecessary(skb))
...@@ -141,11 +143,7 @@ int sctp_rcv(struct sk_buff *skb) ...@@ -141,11 +143,7 @@ int sctp_rcv(struct sk_buff *skb)
goto discard_it; goto discard_it;
skb->csum_valid = 1; skb->csum_valid = 1;
skb_pull(skb, sizeof(struct sctphdr)); __skb_pull(skb, sizeof(struct sctphdr));
/* Make sure we at least have chunk headers worth of data left. */
if (skb->len < sizeof(struct sctp_chunkhdr))
goto discard_it;
family = ipver2af(ip_hdr(skb)->version); family = ipver2af(ip_hdr(skb)->version);
af = sctp_get_af_specific(family); af = sctp_get_af_specific(family);
...@@ -230,7 +228,7 @@ int sctp_rcv(struct sk_buff *skb) ...@@ -230,7 +228,7 @@ int sctp_rcv(struct sk_buff *skb)
chunk->rcvr = rcvr; chunk->rcvr = rcvr;
/* Remember the SCTP header. */ /* Remember the SCTP header. */
chunk->sctp_hdr = sh; chunk->sctp_hdr = sctp_hdr(skb);
/* Set the source and destination addresses of the incoming chunk. */ /* Set the source and destination addresses of the incoming chunk. */
sctp_init_addrs(chunk, &src, &dest); sctp_init_addrs(chunk, &src, &dest);
...@@ -660,19 +658,23 @@ void sctp_v4_err(struct sk_buff *skb, __u32 info) ...@@ -660,19 +658,23 @@ void sctp_v4_err(struct sk_buff *skb, __u32 info)
*/ */
static int sctp_rcv_ootb(struct sk_buff *skb) static int sctp_rcv_ootb(struct sk_buff *skb)
{ {
sctp_chunkhdr_t *ch; sctp_chunkhdr_t *ch, _ch;
__u8 *ch_end; int ch_end, offset = 0;
ch = (sctp_chunkhdr_t *) skb->data;
/* Scan through all the chunks in the packet. */ /* Scan through all the chunks in the packet. */
do { do {
/* Make sure we have at least the header there */
if (offset + sizeof(sctp_chunkhdr_t) > skb->len)
break;
ch = skb_header_pointer(skb, offset, sizeof(*ch), &_ch);
/* Break out if chunk length is less then minimal. */ /* Break out if chunk length is less then minimal. */
if (ntohs(ch->length) < sizeof(sctp_chunkhdr_t)) if (ntohs(ch->length) < sizeof(sctp_chunkhdr_t))
break; break;
ch_end = ((__u8 *)ch) + WORD_ROUND(ntohs(ch->length)); ch_end = offset + WORD_ROUND(ntohs(ch->length));
if (ch_end > skb_tail_pointer(skb)) if (ch_end > skb->len)
break; break;
/* RFC 8.4, 2) If the OOTB packet contains an ABORT chunk, the /* RFC 8.4, 2) If the OOTB packet contains an ABORT chunk, the
...@@ -697,8 +699,8 @@ static int sctp_rcv_ootb(struct sk_buff *skb) ...@@ -697,8 +699,8 @@ static int sctp_rcv_ootb(struct sk_buff *skb)
if (SCTP_CID_INIT == ch->type && (void *)ch != skb->data) if (SCTP_CID_INIT == ch->type && (void *)ch != skb->data)
goto discard; goto discard;
ch = (sctp_chunkhdr_t *) ch_end; offset = ch_end;
} while (ch_end < skb_tail_pointer(skb)); } while (ch_end < skb->len);
return 0; return 0;
...@@ -1173,6 +1175,9 @@ static struct sctp_association *__sctp_rcv_lookup_harder(struct net *net, ...@@ -1173,6 +1175,9 @@ static struct sctp_association *__sctp_rcv_lookup_harder(struct net *net,
{ {
sctp_chunkhdr_t *ch; sctp_chunkhdr_t *ch;
if (skb_linearize(skb))
return NULL;
ch = (sctp_chunkhdr_t *) skb->data; ch = (sctp_chunkhdr_t *) skb->data;
/* The code below will attempt to walk the chunk and extract /* The code below will attempt to walk the chunk and extract
......
...@@ -130,7 +130,8 @@ struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue) ...@@ -130,7 +130,8 @@ struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue)
* at this time. * at this time.
*/ */
if ((chunk = queue->in_progress)) { chunk = queue->in_progress;
if (chunk) {
/* There is a packet that we have been working on. /* There is a packet that we have been working on.
* Any post processing work to do before we move on? * Any post processing work to do before we move on?
*/ */
...@@ -152,15 +153,29 @@ struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue) ...@@ -152,15 +153,29 @@ struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue)
if (!chunk) { if (!chunk) {
struct list_head *entry; struct list_head *entry;
next_chunk:
/* Is the queue empty? */ /* Is the queue empty? */
if (list_empty(&queue->in_chunk_list)) if (list_empty(&queue->in_chunk_list))
return NULL; return NULL;
entry = queue->in_chunk_list.next; entry = queue->in_chunk_list.next;
chunk = queue->in_progress = chunk = list_entry(entry, struct sctp_chunk, list);
list_entry(entry, struct sctp_chunk, list);
list_del_init(entry); list_del_init(entry);
/* Linearize if it's not GSO */
if (skb_is_nonlinear(chunk->skb)) {
if (skb_linearize(chunk->skb)) {
__SCTP_INC_STATS(dev_net(chunk->skb->dev), SCTP_MIB_IN_PKT_DISCARDS);
sctp_chunk_free(chunk);
goto next_chunk;
}
/* Update sctp_hdr as it probably changed */
chunk->sctp_hdr = sctp_hdr(chunk->skb);
}
queue->in_progress = chunk;
/* This is the first chunk in the packet. */ /* This is the first chunk in the packet. */
chunk->singleton = 1; chunk->singleton = 1;
ch = (sctp_chunkhdr_t *) chunk->skb->data; ch = (sctp_chunkhdr_t *) chunk->skb->data;
...@@ -172,14 +187,6 @@ struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue) ...@@ -172,14 +187,6 @@ struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue)
chunk->chunk_hdr = ch; chunk->chunk_hdr = ch;
chunk->chunk_end = ((__u8 *)ch) + WORD_ROUND(ntohs(ch->length)); chunk->chunk_end = ((__u8 *)ch) + WORD_ROUND(ntohs(ch->length));
/* In the unlikely case of an IP reassembly, the skb could be
* non-linear. If so, update chunk_end so that it doesn't go past
* the skb->tail.
*/
if (unlikely(skb_is_nonlinear(chunk->skb))) {
if (chunk->chunk_end > skb_tail_pointer(chunk->skb))
chunk->chunk_end = skb_tail_pointer(chunk->skb);
}
skb_pull(chunk->skb, sizeof(sctp_chunkhdr_t)); skb_pull(chunk->skb, sizeof(sctp_chunkhdr_t));
chunk->subh.v = NULL; /* Subheader is no longer valid. */ chunk->subh.v = NULL; /* Subheader is no longer valid. */
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment