2019-05-23 17:14:41 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
2017-01-06 22:18:33 +08:00
|
|
|
/* SCTP kernel implementation
|
|
|
|
|
* (C) Copyright IBM Corp. 2001, 2004
|
|
|
|
|
* Copyright (c) 1999-2000 Cisco, Inc.
|
|
|
|
|
* Copyright (c) 1999-2001 Motorola, Inc.
|
|
|
|
|
* Copyright (c) 2001 Intel Corp.
|
|
|
|
|
*
|
|
|
|
|
* This file is part of the SCTP kernel implementation
|
|
|
|
|
*
|
2018-02-13 19:29:13 +08:00
|
|
|
* This file contains sctp stream maniuplation primitives and helpers.
|
2017-01-06 22:18:33 +08:00
|
|
|
*
|
|
|
|
|
* Please send any bug reports or fixes you make to the
|
|
|
|
|
* email address(es):
|
|
|
|
|
* lksctp developers <linux-sctp@vger.kernel.org>
|
|
|
|
|
*
|
|
|
|
|
* Written or modified by:
|
|
|
|
|
* Xin Long <lucien.xin@gmail.com>
|
|
|
|
|
*/
|
|
|
|
|
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
#include <linux/list.h>
|
2017-01-06 22:18:33 +08:00
|
|
|
#include <net/sctp/sctp.h>
|
2017-01-18 00:44:47 +08:00
|
|
|
#include <net/sctp/sm.h>
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
#include <net/sctp/stream_sched.h>
|
|
|
|
|
|
|
|
|
|
/* Migrates chunks from stream queues to new stream queues if needed,
|
|
|
|
|
* but not across associations. Also, removes those chunks to streams
|
|
|
|
|
* higher than the new max.
|
|
|
|
|
*/
|
|
|
|
|
static void sctp_stream_outq_migrate(struct sctp_stream *stream,
|
|
|
|
|
struct sctp_stream *new, __u16 outcnt)
|
|
|
|
|
{
|
|
|
|
|
struct sctp_association *asoc;
|
|
|
|
|
struct sctp_chunk *ch, *temp;
|
|
|
|
|
struct sctp_outq *outq;
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
asoc = container_of(stream, struct sctp_association, stream);
|
|
|
|
|
outq = &asoc->outqueue;
|
|
|
|
|
|
|
|
|
|
list_for_each_entry_safe(ch, temp, &outq->out_chunk_list, list) {
|
|
|
|
|
__u16 sid = sctp_chunk_stream_no(ch);
|
|
|
|
|
|
|
|
|
|
if (sid < outcnt)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
sctp_sched_dequeue_common(outq, ch);
|
|
|
|
|
/* No need to call dequeue_done here because
|
|
|
|
|
* the chunks are not scheduled by now.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/* Mark as failed send. */
|
2017-11-26 20:16:06 +08:00
|
|
|
sctp_chunk_fail(ch, (__force __u32)SCTP_ERROR_INV_STRM);
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
if (asoc->peer.prsctp_capable &&
|
|
|
|
|
SCTP_PR_PRIO_ENABLED(ch->sinfo.sinfo_flags))
|
|
|
|
|
asoc->sent_cnt_removable--;
|
|
|
|
|
|
|
|
|
|
sctp_chunk_free(ch);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (new) {
|
|
|
|
|
/* Here we actually move the old ext stuff into the new
|
|
|
|
|
* buffer, because we want to keep it. Then
|
|
|
|
|
* sctp_stream_update will swap ->out pointers.
|
|
|
|
|
*/
|
|
|
|
|
for (i = 0; i < outcnt; i++) {
|
2018-08-11 01:11:43 +08:00
|
|
|
kfree(SCTP_SO(new, i)->ext);
|
|
|
|
|
SCTP_SO(new, i)->ext = SCTP_SO(stream, i)->ext;
|
|
|
|
|
SCTP_SO(stream, i)->ext = NULL;
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-02-12 18:51:01 +08:00
|
|
|
for (i = outcnt; i < stream->outcnt; i++) {
|
2018-08-11 01:11:43 +08:00
|
|
|
kfree(SCTP_SO(stream, i)->ext);
|
2019-02-12 18:51:01 +08:00
|
|
|
SCTP_SO(stream, i)->ext = NULL;
|
|
|
|
|
}
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
}
|
2017-01-06 22:18:33 +08:00
|
|
|
|
2017-10-04 06:20:09 +08:00
|
|
|
static int sctp_stream_alloc_out(struct sctp_stream *stream, __u16 outcnt,
|
|
|
|
|
gfp_t gfp)
|
|
|
|
|
{
|
2019-03-12 14:31:22 +08:00
|
|
|
int ret;
|
2017-10-04 06:20:09 +08:00
|
|
|
|
2019-03-12 14:31:22 +08:00
|
|
|
if (outcnt <= stream->outcnt)
|
|
|
|
|
return 0;
|
2019-02-04 03:27:58 +08:00
|
|
|
|
2019-03-12 14:31:22 +08:00
|
|
|
ret = genradix_prealloc(&stream->out, outcnt, gfp);
|
2019-12-21 02:03:44 +08:00
|
|
|
if (ret)
|
2019-03-12 14:31:22 +08:00
|
|
|
return ret;
|
2017-10-04 06:20:09 +08:00
|
|
|
|
2019-03-12 14:31:22 +08:00
|
|
|
stream->outcnt = outcnt;
|
2017-10-04 06:20:09 +08:00
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2017-10-04 06:20:10 +08:00
|
|
|
static int sctp_stream_alloc_in(struct sctp_stream *stream, __u16 incnt,
|
|
|
|
|
gfp_t gfp)
|
|
|
|
|
{
|
2019-03-12 14:31:22 +08:00
|
|
|
int ret;
|
2017-10-04 06:20:10 +08:00
|
|
|
|
2019-03-12 14:31:22 +08:00
|
|
|
if (incnt <= stream->incnt)
|
|
|
|
|
return 0;
|
2017-10-04 06:20:10 +08:00
|
|
|
|
2019-03-12 14:31:22 +08:00
|
|
|
ret = genradix_prealloc(&stream->in, incnt, gfp);
|
2019-12-21 02:03:44 +08:00
|
|
|
if (ret)
|
2019-03-12 14:31:22 +08:00
|
|
|
return ret;
|
2017-10-04 06:20:10 +08:00
|
|
|
|
2019-03-12 14:31:22 +08:00
|
|
|
stream->incnt = incnt;
|
2017-10-04 06:20:10 +08:00
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-31 16:36:32 +08:00
|
|
|
int sctp_stream_init(struct sctp_stream *stream, __u16 outcnt, __u16 incnt,
|
|
|
|
|
gfp_t gfp)
|
2017-01-06 22:18:33 +08:00
|
|
|
{
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
struct sctp_sched_ops *sched = sctp_sched_ops_from_stream(stream);
|
|
|
|
|
int i, ret = 0;
|
2017-03-30 01:00:53 +08:00
|
|
|
|
2017-10-04 06:20:08 +08:00
|
|
|
gfp |= __GFP_NOWARN;
|
|
|
|
|
|
2017-03-30 01:00:53 +08:00
|
|
|
/* Initial stream->out size may be very big, so free it and alloc
|
2017-10-04 06:20:08 +08:00
|
|
|
* a new one with new outcnt to save memory if needed.
|
2017-03-30 01:00:53 +08:00
|
|
|
*/
|
2017-10-04 06:20:08 +08:00
|
|
|
if (outcnt == stream->outcnt)
|
2019-12-21 02:03:44 +08:00
|
|
|
goto handle_in;
|
2017-10-04 06:20:08 +08:00
|
|
|
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
/* Filter out chunks queued on streams that won't exist anymore */
|
|
|
|
|
sched->unsched_all(stream);
|
|
|
|
|
sctp_stream_outq_migrate(stream, NULL, outcnt);
|
|
|
|
|
sched->sched_all(stream);
|
|
|
|
|
|
2018-01-03 05:44:37 +08:00
|
|
|
ret = sctp_stream_alloc_out(stream, outcnt, gfp);
|
|
|
|
|
if (ret)
|
2019-12-21 02:03:44 +08:00
|
|
|
goto out_err;
|
2017-03-30 01:00:53 +08:00
|
|
|
|
|
|
|
|
for (i = 0; i < stream->outcnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->state = SCTP_STREAM_OPEN;
|
2017-03-30 01:00:53 +08:00
|
|
|
|
2019-12-21 02:03:44 +08:00
|
|
|
handle_in:
|
2017-12-08 21:04:01 +08:00
|
|
|
sctp_stream_interleave_init(stream);
|
2017-05-31 16:36:32 +08:00
|
|
|
if (!incnt)
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
goto out;
|
2017-05-31 16:36:32 +08:00
|
|
|
|
2018-01-03 05:44:37 +08:00
|
|
|
ret = sctp_stream_alloc_in(stream, incnt, gfp);
|
2019-12-21 02:03:44 +08:00
|
|
|
if (ret)
|
|
|
|
|
goto in_err;
|
|
|
|
|
|
|
|
|
|
goto out;
|
2017-01-06 22:18:33 +08:00
|
|
|
|
2019-12-21 02:03:44 +08:00
|
|
|
in_err:
|
|
|
|
|
sched->free(stream);
|
|
|
|
|
genradix_free(&stream->in);
|
|
|
|
|
out_err:
|
|
|
|
|
genradix_free(&stream->out);
|
|
|
|
|
stream->outcnt = 0;
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
out:
|
|
|
|
|
return ret;
|
2017-01-06 22:18:33 +08:00
|
|
|
}
|
|
|
|
|
|
2017-10-04 06:20:11 +08:00
|
|
|
int sctp_stream_init_ext(struct sctp_stream *stream, __u16 sid)
|
|
|
|
|
{
|
|
|
|
|
struct sctp_stream_out_ext *soute;
|
2019-06-28 06:48:10 +08:00
|
|
|
int ret;
|
2017-10-04 06:20:11 +08:00
|
|
|
|
|
|
|
|
soute = kzalloc(sizeof(*soute), GFP_KERNEL);
|
|
|
|
|
if (!soute)
|
|
|
|
|
return -ENOMEM;
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, sid)->ext = soute;
|
2017-10-04 06:20:11 +08:00
|
|
|
|
2019-06-28 06:48:10 +08:00
|
|
|
ret = sctp_sched_init_sid(stream, sid, GFP_KERNEL);
|
|
|
|
|
if (ret) {
|
|
|
|
|
kfree(SCTP_SO(stream, sid)->ext);
|
|
|
|
|
SCTP_SO(stream, sid)->ext = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return ret;
|
2017-10-04 06:20:11 +08:00
|
|
|
}
|
|
|
|
|
|
2017-01-06 22:18:33 +08:00
|
|
|
void sctp_stream_free(struct sctp_stream *stream)
|
|
|
|
|
{
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
struct sctp_sched_ops *sched = sctp_sched_ops_from_stream(stream);
|
2017-10-04 06:20:11 +08:00
|
|
|
int i;
|
|
|
|
|
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
sched->free(stream);
|
2017-10-04 06:20:11 +08:00
|
|
|
for (i = 0; i < stream->outcnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
kfree(SCTP_SO(stream, i)->ext);
|
2019-03-12 14:31:22 +08:00
|
|
|
genradix_free(&stream->out);
|
|
|
|
|
genradix_free(&stream->in);
|
2017-01-06 22:18:33 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void sctp_stream_clear(struct sctp_stream *stream)
|
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
|
2017-12-15 00:41:31 +08:00
|
|
|
for (i = 0; i < stream->outcnt; i++) {
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->mid = 0;
|
|
|
|
|
SCTP_SO(stream, i)->mid_uo = 0;
|
2017-12-15 00:41:31 +08:00
|
|
|
}
|
2017-01-06 22:18:33 +08:00
|
|
|
|
|
|
|
|
for (i = 0; i < stream->incnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SI(stream, i)->mid = 0;
|
2017-01-06 22:18:33 +08:00
|
|
|
}
|
2017-01-18 00:44:47 +08:00
|
|
|
|
2017-05-31 16:36:31 +08:00
|
|
|
void sctp_stream_update(struct sctp_stream *stream, struct sctp_stream *new)
|
|
|
|
|
{
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
struct sctp_sched_ops *sched = sctp_sched_ops_from_stream(stream);
|
|
|
|
|
|
|
|
|
|
sched->unsched_all(stream);
|
|
|
|
|
sctp_stream_outq_migrate(stream, new, new->outcnt);
|
2017-05-31 16:36:31 +08:00
|
|
|
sctp_stream_free(stream);
|
|
|
|
|
|
|
|
|
|
stream->out = new->out;
|
|
|
|
|
stream->in = new->in;
|
|
|
|
|
stream->outcnt = new->outcnt;
|
|
|
|
|
stream->incnt = new->incnt;
|
|
|
|
|
|
sctp: introduce stream scheduler foundations
This patch introduces the hooks necessary to do stream scheduling, as
per RFC Draft ndata. It also introduces the first scheduler, which is
what we do today but now factored out: first come first served (FCFS).
With stream scheduling now we have to track which chunk was enqueued on
which stream and be able to select another other than the in front of
the main outqueue. So we introduce a list on sctp_stream_out_ext
structure for this purpose.
We reuse sctp_chunk->transmitted_list space for the list above, as the
chunk cannot belong to the two lists at the same time. By using the
union in there, we can have distinct names for these moments.
sctp_sched_ops are the operations expected to be implemented by each
scheduler. The dequeueing is a bit particular to this implementation but
it is to match how we dequeue packets today. We first dequeue and then
check if it fits the packet and if not, we requeue it at head. Thus why
we don't have a peek operation but have dequeue_done instead, which is
called once the chunk can be safely considered as transmitted.
The check removed from sctp_outq_flush is now performed by
sctp_stream_outq_migrate, which is only called during assoc setup.
(sctp_sendmsg() also checks for it)
The only operation that is foreseen but not yet added here is a way to
signalize that a new packet is starting or that the packet is done, for
round robin scheduler per packet, but is intentionally left to the
patch that actually implements it.
Support for I-DATA chunks, also described in this RFC, with user message
interleaving is straightforward as it just requires the schedulers to
probe for the feature and ignore datamsg boundaries when dequeueing.
See-also: https://tools.ietf.org/html/draft-ietf-tsvwg-sctp-ndata-13
Tested-by: Xin Long <lucien.xin@gmail.com>
Signed-off-by: Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-10-04 06:20:13 +08:00
|
|
|
sched->sched_all(stream);
|
|
|
|
|
|
2019-03-12 14:31:22 +08:00
|
|
|
new->out.tree.root = NULL;
|
|
|
|
|
new->in.tree.root = NULL;
|
2018-04-26 15:21:44 +08:00
|
|
|
new->outcnt = 0;
|
|
|
|
|
new->incnt = 0;
|
2017-05-31 16:36:31 +08:00
|
|
|
}
|
|
|
|
|
|
2017-01-18 00:44:47 +08:00
|
|
|
static int sctp_send_reconf(struct sctp_association *asoc,
|
|
|
|
|
struct sctp_chunk *chunk)
|
|
|
|
|
{
|
|
|
|
|
int retval = 0;
|
|
|
|
|
|
2019-12-09 13:45:18 +08:00
|
|
|
retval = sctp_primitive_RECONF(asoc->base.net, asoc, chunk);
|
2017-01-18 00:44:47 +08:00
|
|
|
if (retval)
|
|
|
|
|
sctp_chunk_free(chunk);
|
|
|
|
|
|
|
|
|
|
return retval;
|
|
|
|
|
}
|
|
|
|
|
|
2017-11-25 21:05:33 +08:00
|
|
|
static bool sctp_stream_outq_is_empty(struct sctp_stream *stream,
|
|
|
|
|
__u16 str_nums, __be16 *str_list)
|
|
|
|
|
{
|
|
|
|
|
struct sctp_association *asoc;
|
|
|
|
|
__u16 i;
|
|
|
|
|
|
|
|
|
|
asoc = container_of(stream, struct sctp_association, stream);
|
|
|
|
|
if (!asoc->outqueue.out_qlen)
|
|
|
|
|
return true;
|
|
|
|
|
|
|
|
|
|
if (!str_nums)
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < str_nums; i++) {
|
|
|
|
|
__u16 sid = ntohs(str_list[i]);
|
|
|
|
|
|
2018-08-11 01:11:42 +08:00
|
|
|
if (SCTP_SO(stream, sid)->ext &&
|
|
|
|
|
!list_empty(&SCTP_SO(stream, sid)->ext->outq))
|
2017-11-25 21:05:33 +08:00
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
2017-01-18 00:44:47 +08:00
|
|
|
int sctp_send_reset_streams(struct sctp_association *asoc,
|
|
|
|
|
struct sctp_reset_streams *params)
|
|
|
|
|
{
|
2017-05-31 16:36:31 +08:00
|
|
|
struct sctp_stream *stream = &asoc->stream;
|
2017-01-18 00:44:47 +08:00
|
|
|
__u16 i, str_nums, *str_list;
|
|
|
|
|
struct sctp_chunk *chunk;
|
|
|
|
|
int retval = -EINVAL;
|
2017-10-28 19:43:54 +08:00
|
|
|
__be16 *nstr_list;
|
2017-01-18 00:44:47 +08:00
|
|
|
bool out, in;
|
|
|
|
|
|
|
|
|
|
if (!asoc->peer.reconf_capable ||
|
|
|
|
|
!(asoc->strreset_enable & SCTP_ENABLE_RESET_STREAM_REQ)) {
|
|
|
|
|
retval = -ENOPROTOOPT;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (asoc->strreset_outstanding) {
|
|
|
|
|
retval = -EINPROGRESS;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
out = params->srs_flags & SCTP_STREAM_RESET_OUTGOING;
|
|
|
|
|
in = params->srs_flags & SCTP_STREAM_RESET_INCOMING;
|
|
|
|
|
if (!out && !in)
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
str_nums = params->srs_number_streams;
|
|
|
|
|
str_list = params->srs_stream_list;
|
2017-11-15 17:00:11 +08:00
|
|
|
if (str_nums) {
|
|
|
|
|
int param_len = 0;
|
|
|
|
|
|
|
|
|
|
if (out) {
|
|
|
|
|
for (i = 0; i < str_nums; i++)
|
|
|
|
|
if (str_list[i] >= stream->outcnt)
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
param_len = str_nums * sizeof(__u16) +
|
|
|
|
|
sizeof(struct sctp_strreset_outreq);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (in) {
|
|
|
|
|
for (i = 0; i < str_nums; i++)
|
|
|
|
|
if (str_list[i] >= stream->incnt)
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
param_len += str_nums * sizeof(__u16) +
|
|
|
|
|
sizeof(struct sctp_strreset_inreq);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (param_len > SCTP_MAX_CHUNK_LEN -
|
|
|
|
|
sizeof(struct sctp_reconf_chunk))
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
2017-01-18 00:44:47 +08:00
|
|
|
|
2017-10-28 19:43:54 +08:00
|
|
|
nstr_list = kcalloc(str_nums, sizeof(__be16), GFP_KERNEL);
|
|
|
|
|
if (!nstr_list) {
|
|
|
|
|
retval = -ENOMEM;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
2017-02-17 12:45:40 +08:00
|
|
|
for (i = 0; i < str_nums; i++)
|
2017-10-28 19:43:54 +08:00
|
|
|
nstr_list[i] = htons(str_list[i]);
|
2017-02-17 12:45:40 +08:00
|
|
|
|
2017-11-25 21:05:33 +08:00
|
|
|
if (out && !sctp_stream_outq_is_empty(stream, str_nums, nstr_list)) {
|
2019-08-13 22:05:50 +08:00
|
|
|
kfree(nstr_list);
|
2017-11-25 21:05:33 +08:00
|
|
|
retval = -EAGAIN;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
2017-10-28 19:43:54 +08:00
|
|
|
chunk = sctp_make_strreset_req(asoc, str_nums, nstr_list, out, in);
|
2017-02-17 12:45:40 +08:00
|
|
|
|
2017-10-28 19:43:54 +08:00
|
|
|
kfree(nstr_list);
|
2017-02-17 12:45:40 +08:00
|
|
|
|
2017-02-09 01:18:16 +08:00
|
|
|
if (!chunk) {
|
|
|
|
|
retval = -ENOMEM;
|
2017-01-18 00:44:47 +08:00
|
|
|
goto out;
|
2017-02-09 01:18:16 +08:00
|
|
|
}
|
2017-01-18 00:44:47 +08:00
|
|
|
|
|
|
|
|
if (out) {
|
|
|
|
|
if (str_nums)
|
|
|
|
|
for (i = 0; i < str_nums; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, str_list[i])->state =
|
2017-01-18 00:44:47 +08:00
|
|
|
SCTP_STREAM_CLOSED;
|
|
|
|
|
else
|
|
|
|
|
for (i = 0; i < stream->outcnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->state = SCTP_STREAM_CLOSED;
|
2017-01-18 00:44:47 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
asoc->strreset_chunk = chunk;
|
|
|
|
|
sctp_chunk_hold(asoc->strreset_chunk);
|
|
|
|
|
|
|
|
|
|
retval = sctp_send_reconf(asoc, chunk);
|
|
|
|
|
if (retval) {
|
|
|
|
|
sctp_chunk_put(asoc->strreset_chunk);
|
|
|
|
|
asoc->strreset_chunk = NULL;
|
2017-02-09 01:18:16 +08:00
|
|
|
if (!out)
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
if (str_nums)
|
|
|
|
|
for (i = 0; i < str_nums; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, str_list[i])->state =
|
2017-02-09 01:18:16 +08:00
|
|
|
SCTP_STREAM_OPEN;
|
|
|
|
|
else
|
|
|
|
|
for (i = 0; i < stream->outcnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->state = SCTP_STREAM_OPEN;
|
2017-02-09 01:18:16 +08:00
|
|
|
|
|
|
|
|
goto out;
|
2017-01-18 00:44:47 +08:00
|
|
|
}
|
|
|
|
|
|
2017-02-09 01:18:16 +08:00
|
|
|
asoc->strreset_outstanding = out + in;
|
|
|
|
|
|
2017-01-18 00:44:47 +08:00
|
|
|
out:
|
|
|
|
|
return retval;
|
|
|
|
|
}
|
2017-02-09 01:18:18 +08:00
|
|
|
|
|
|
|
|
int sctp_send_reset_assoc(struct sctp_association *asoc)
|
|
|
|
|
{
|
2017-05-31 16:36:31 +08:00
|
|
|
struct sctp_stream *stream = &asoc->stream;
|
2017-02-09 01:18:18 +08:00
|
|
|
struct sctp_chunk *chunk = NULL;
|
|
|
|
|
int retval;
|
|
|
|
|
__u16 i;
|
|
|
|
|
|
|
|
|
|
if (!asoc->peer.reconf_capable ||
|
|
|
|
|
!(asoc->strreset_enable & SCTP_ENABLE_RESET_ASSOC_REQ))
|
|
|
|
|
return -ENOPROTOOPT;
|
|
|
|
|
|
|
|
|
|
if (asoc->strreset_outstanding)
|
|
|
|
|
return -EINPROGRESS;
|
|
|
|
|
|
2017-11-25 21:05:34 +08:00
|
|
|
if (!sctp_outq_is_empty(&asoc->outqueue))
|
|
|
|
|
return -EAGAIN;
|
|
|
|
|
|
2017-02-09 01:18:18 +08:00
|
|
|
chunk = sctp_make_strreset_tsnreq(asoc);
|
|
|
|
|
if (!chunk)
|
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
|
|
/* Block further xmit of data until this request is completed */
|
2017-05-31 16:36:31 +08:00
|
|
|
for (i = 0; i < stream->outcnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->state = SCTP_STREAM_CLOSED;
|
2017-02-09 01:18:18 +08:00
|
|
|
|
|
|
|
|
asoc->strreset_chunk = chunk;
|
|
|
|
|
sctp_chunk_hold(asoc->strreset_chunk);
|
|
|
|
|
|
|
|
|
|
retval = sctp_send_reconf(asoc, chunk);
|
|
|
|
|
if (retval) {
|
|
|
|
|
sctp_chunk_put(asoc->strreset_chunk);
|
|
|
|
|
asoc->strreset_chunk = NULL;
|
|
|
|
|
|
2017-05-31 16:36:31 +08:00
|
|
|
for (i = 0; i < stream->outcnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->state = SCTP_STREAM_OPEN;
|
2017-02-09 01:18:18 +08:00
|
|
|
|
|
|
|
|
return retval;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
asoc->strreset_outstanding = 1;
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
2017-02-09 01:18:20 +08:00
|
|
|
|
|
|
|
|
int sctp_send_add_streams(struct sctp_association *asoc,
|
|
|
|
|
struct sctp_add_streams *params)
|
|
|
|
|
{
|
2017-05-31 16:36:31 +08:00
|
|
|
struct sctp_stream *stream = &asoc->stream;
|
2017-02-09 01:18:20 +08:00
|
|
|
struct sctp_chunk *chunk = NULL;
|
2017-10-31 21:28:16 +08:00
|
|
|
int retval;
|
2017-02-09 01:18:20 +08:00
|
|
|
__u32 outcnt, incnt;
|
|
|
|
|
__u16 out, in;
|
|
|
|
|
|
|
|
|
|
if (!asoc->peer.reconf_capable ||
|
|
|
|
|
!(asoc->strreset_enable & SCTP_ENABLE_CHANGE_ASSOC_REQ)) {
|
|
|
|
|
retval = -ENOPROTOOPT;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (asoc->strreset_outstanding) {
|
|
|
|
|
retval = -EINPROGRESS;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
out = params->sas_outstrms;
|
|
|
|
|
in = params->sas_instrms;
|
|
|
|
|
outcnt = stream->outcnt + out;
|
|
|
|
|
incnt = stream->incnt + in;
|
|
|
|
|
if (outcnt > SCTP_MAX_STREAM || incnt > SCTP_MAX_STREAM ||
|
|
|
|
|
(!out && !in)) {
|
|
|
|
|
retval = -EINVAL;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (out) {
|
2017-10-04 06:20:09 +08:00
|
|
|
retval = sctp_stream_alloc_out(stream, outcnt, GFP_KERNEL);
|
|
|
|
|
if (retval)
|
2017-02-09 01:18:20 +08:00
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
chunk = sctp_make_strreset_addstrm(asoc, out, in);
|
2017-10-31 21:28:16 +08:00
|
|
|
if (!chunk) {
|
|
|
|
|
retval = -ENOMEM;
|
2017-02-09 01:18:20 +08:00
|
|
|
goto out;
|
2017-10-31 21:28:16 +08:00
|
|
|
}
|
2017-02-09 01:18:20 +08:00
|
|
|
|
|
|
|
|
asoc->strreset_chunk = chunk;
|
|
|
|
|
sctp_chunk_hold(asoc->strreset_chunk);
|
|
|
|
|
|
|
|
|
|
retval = sctp_send_reconf(asoc, chunk);
|
|
|
|
|
if (retval) {
|
|
|
|
|
sctp_chunk_put(asoc->strreset_chunk);
|
|
|
|
|
asoc->strreset_chunk = NULL;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
asoc->strreset_outstanding = !!out + !!in;
|
|
|
|
|
|
|
|
|
|
out:
|
|
|
|
|
return retval;
|
|
|
|
|
}
|
2017-02-17 12:45:39 +08:00
|
|
|
|
2017-06-30 11:52:16 +08:00
|
|
|
static struct sctp_paramhdr *sctp_chunk_lookup_strreset_param(
|
2017-10-28 19:43:54 +08:00
|
|
|
struct sctp_association *asoc, __be32 resp_seq,
|
2017-03-10 12:11:09 +08:00
|
|
|
__be16 type)
|
2017-02-17 12:45:39 +08:00
|
|
|
{
|
|
|
|
|
struct sctp_chunk *chunk = asoc->strreset_chunk;
|
|
|
|
|
struct sctp_reconf_chunk *hdr;
|
|
|
|
|
union sctp_params param;
|
|
|
|
|
|
2017-03-10 12:11:09 +08:00
|
|
|
if (!chunk)
|
2017-02-17 12:45:39 +08:00
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
hdr = (struct sctp_reconf_chunk *)chunk->chunk_hdr;
|
|
|
|
|
sctp_walk_params(param, hdr, params) {
|
|
|
|
|
/* sctp_strreset_tsnreq is actually the basic structure
|
|
|
|
|
* of all stream reconf params, so it's safe to use it
|
|
|
|
|
* to access request_seq.
|
|
|
|
|
*/
|
|
|
|
|
struct sctp_strreset_tsnreq *req = param.v;
|
|
|
|
|
|
2017-03-10 12:11:09 +08:00
|
|
|
if ((!resp_seq || req->request_seq == resp_seq) &&
|
|
|
|
|
(!type || type == req->param_hdr.type))
|
2017-02-17 12:45:39 +08:00
|
|
|
return param.v;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
2017-04-15 22:00:27 +08:00
|
|
|
static void sctp_update_strreset_result(struct sctp_association *asoc,
|
|
|
|
|
__u32 result)
|
|
|
|
|
{
|
|
|
|
|
asoc->strreset_result[1] = asoc->strreset_result[0];
|
|
|
|
|
asoc->strreset_result[0] = result;
|
|
|
|
|
}
|
|
|
|
|
|
2017-02-17 12:45:39 +08:00
|
|
|
struct sctp_chunk *sctp_process_strreset_outreq(
|
|
|
|
|
struct sctp_association *asoc,
|
|
|
|
|
union sctp_params param,
|
|
|
|
|
struct sctp_ulpevent **evp)
|
|
|
|
|
{
|
|
|
|
|
struct sctp_strreset_outreq *outreq = param.v;
|
2017-05-31 16:36:31 +08:00
|
|
|
struct sctp_stream *stream = &asoc->stream;
|
2017-02-17 12:45:39 +08:00
|
|
|
__u32 result = SCTP_STRRESET_DENIED;
|
2017-10-28 19:43:54 +08:00
|
|
|
__be16 *str_p = NULL;
|
2017-02-17 12:45:39 +08:00
|
|
|
__u32 request_seq;
|
2019-01-22 02:39:34 +08:00
|
|
|
__u16 i, nums;
|
2017-02-17 12:45:39 +08:00
|
|
|
|
|
|
|
|
request_seq = ntohl(outreq->request_seq);
|
|
|
|
|
|
|
|
|
|
if (ntohl(outreq->send_reset_at_tsn) >
|
|
|
|
|
sctp_tsnmap_get_ctsn(&asoc->peer.tsn_map)) {
|
|
|
|
|
result = SCTP_STRRESET_IN_PROGRESS;
|
2017-04-15 22:00:27 +08:00
|
|
|
goto err;
|
2017-02-17 12:45:39 +08:00
|
|
|
}
|
|
|
|
|
|
2017-04-15 22:00:27 +08:00
|
|
|
if (TSN_lt(asoc->strreset_inseq, request_seq) ||
|
|
|
|
|
TSN_lt(request_seq, asoc->strreset_inseq - 2)) {
|
2017-02-17 12:45:39 +08:00
|
|
|
result = SCTP_STRRESET_ERR_BAD_SEQNO;
|
2017-04-15 22:00:27 +08:00
|
|
|
goto err;
|
|
|
|
|
} else if (TSN_lt(request_seq, asoc->strreset_inseq)) {
|
|
|
|
|
i = asoc->strreset_inseq - request_seq - 1;
|
|
|
|
|
result = asoc->strreset_result[i];
|
|
|
|
|
goto err;
|
2017-02-17 12:45:39 +08:00
|
|
|
}
|
2017-04-15 22:00:27 +08:00
|
|
|
asoc->strreset_inseq++;
|
2017-02-17 12:45:39 +08:00
|
|
|
|
|
|
|
|
/* Check strreset_enable after inseq inc, as sender cannot tell
|
|
|
|
|
* the peer doesn't enable strreset after receiving response with
|
|
|
|
|
* result denied, as well as to keep consistent with bsd.
|
|
|
|
|
*/
|
|
|
|
|
if (!(asoc->strreset_enable & SCTP_ENABLE_RESET_STREAM_REQ))
|
|
|
|
|
goto out;
|
|
|
|
|
|
2019-01-22 02:39:34 +08:00
|
|
|
nums = (ntohs(param.p->length) - sizeof(*outreq)) / sizeof(__u16);
|
|
|
|
|
str_p = outreq->list_of_streams;
|
|
|
|
|
for (i = 0; i < nums; i++) {
|
|
|
|
|
if (ntohs(str_p[i]) >= stream->incnt) {
|
|
|
|
|
result = SCTP_STRRESET_ERR_WRONG_SSN;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-02-17 12:45:39 +08:00
|
|
|
if (asoc->strreset_chunk) {
|
2017-03-10 12:11:09 +08:00
|
|
|
if (!sctp_chunk_lookup_strreset_param(
|
|
|
|
|
asoc, outreq->response_seq,
|
|
|
|
|
SCTP_PARAM_RESET_IN_REQUEST)) {
|
2017-02-17 12:45:39 +08:00
|
|
|
/* same process with outstanding isn't 0 */
|
|
|
|
|
result = SCTP_STRRESET_ERR_IN_PROGRESS;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
asoc->strreset_outstanding--;
|
|
|
|
|
asoc->strreset_outseq++;
|
|
|
|
|
|
|
|
|
|
if (!asoc->strreset_outstanding) {
|
2017-03-10 12:11:09 +08:00
|
|
|
struct sctp_transport *t;
|
|
|
|
|
|
2017-02-17 12:45:39 +08:00
|
|
|
t = asoc->strreset_chunk->transport;
|
|
|
|
|
if (del_timer(&t->reconf_timer))
|
|
|
|
|
sctp_transport_put(t);
|
|
|
|
|
|
|
|
|
|
sctp_chunk_put(asoc->strreset_chunk);
|
|
|
|
|
asoc->strreset_chunk = NULL;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-01-22 02:39:34 +08:00
|
|
|
if (nums)
|
2017-02-17 12:45:39 +08:00
|
|
|
for (i = 0; i < nums; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SI(stream, ntohs(str_p[i]))->mid = 0;
|
2019-01-22 02:39:34 +08:00
|
|
|
else
|
2017-02-17 12:45:39 +08:00
|
|
|
for (i = 0; i < stream->incnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SI(stream, i)->mid = 0;
|
2017-02-17 12:45:39 +08:00
|
|
|
|
|
|
|
|
result = SCTP_STRRESET_PERFORMED;
|
|
|
|
|
|
|
|
|
|
*evp = sctp_ulpevent_make_stream_reset_event(asoc,
|
2019-01-22 02:39:34 +08:00
|
|
|
SCTP_STREAM_RESET_INCOMING_SSN, nums, str_p, GFP_ATOMIC);
|
2017-02-17 12:45:39 +08:00
|
|
|
|
|
|
|
|
out:
|
2017-04-15 22:00:27 +08:00
|
|
|
sctp_update_strreset_result(asoc, result);
|
|
|
|
|
err:
|
2017-02-17 12:45:39 +08:00
|
|
|
return sctp_make_strreset_resp(asoc, result, request_seq);
|
|
|
|
|
}
|
2017-02-17 12:45:40 +08:00
|
|
|
|
|
|
|
|
struct sctp_chunk *sctp_process_strreset_inreq(
|
|
|
|
|
struct sctp_association *asoc,
|
|
|
|
|
union sctp_params param,
|
|
|
|
|
struct sctp_ulpevent **evp)
|
|
|
|
|
{
|
|
|
|
|
struct sctp_strreset_inreq *inreq = param.v;
|
2017-05-31 16:36:31 +08:00
|
|
|
struct sctp_stream *stream = &asoc->stream;
|
2017-02-17 12:45:40 +08:00
|
|
|
__u32 result = SCTP_STRRESET_DENIED;
|
|
|
|
|
struct sctp_chunk *chunk = NULL;
|
|
|
|
|
__u32 request_seq;
|
2017-10-28 19:43:54 +08:00
|
|
|
__u16 i, nums;
|
|
|
|
|
__be16 *str_p;
|
2017-02-17 12:45:40 +08:00
|
|
|
|
|
|
|
|
request_seq = ntohl(inreq->request_seq);
|
2017-04-15 22:00:28 +08:00
|
|
|
if (TSN_lt(asoc->strreset_inseq, request_seq) ||
|
|
|
|
|
TSN_lt(request_seq, asoc->strreset_inseq - 2)) {
|
2017-02-17 12:45:40 +08:00
|
|
|
result = SCTP_STRRESET_ERR_BAD_SEQNO;
|
2017-04-15 22:00:28 +08:00
|
|
|
goto err;
|
|
|
|
|
} else if (TSN_lt(request_seq, asoc->strreset_inseq)) {
|
|
|
|
|
i = asoc->strreset_inseq - request_seq - 1;
|
|
|
|
|
result = asoc->strreset_result[i];
|
|
|
|
|
if (result == SCTP_STRRESET_PERFORMED)
|
|
|
|
|
return NULL;
|
|
|
|
|
goto err;
|
2017-02-17 12:45:40 +08:00
|
|
|
}
|
2017-04-15 22:00:28 +08:00
|
|
|
asoc->strreset_inseq++;
|
2017-02-17 12:45:40 +08:00
|
|
|
|
|
|
|
|
if (!(asoc->strreset_enable & SCTP_ENABLE_RESET_STREAM_REQ))
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
if (asoc->strreset_outstanding) {
|
|
|
|
|
result = SCTP_STRRESET_ERR_IN_PROGRESS;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
2017-11-25 21:05:32 +08:00
|
|
|
nums = (ntohs(param.p->length) - sizeof(*inreq)) / sizeof(__u16);
|
2017-02-17 12:45:40 +08:00
|
|
|
str_p = inreq->list_of_streams;
|
|
|
|
|
for (i = 0; i < nums; i++) {
|
|
|
|
|
if (ntohs(str_p[i]) >= stream->outcnt) {
|
|
|
|
|
result = SCTP_STRRESET_ERR_WRONG_SSN;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-11-25 21:05:33 +08:00
|
|
|
if (!sctp_stream_outq_is_empty(stream, nums, str_p)) {
|
|
|
|
|
result = SCTP_STRRESET_IN_PROGRESS;
|
|
|
|
|
asoc->strreset_inseq--;
|
|
|
|
|
goto err;
|
|
|
|
|
}
|
|
|
|
|
|
2017-02-17 12:45:40 +08:00
|
|
|
chunk = sctp_make_strreset_req(asoc, nums, str_p, 1, 0);
|
|
|
|
|
if (!chunk)
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
if (nums)
|
|
|
|
|
for (i = 0; i < nums; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, ntohs(str_p[i]))->state =
|
2017-02-17 12:45:40 +08:00
|
|
|
SCTP_STREAM_CLOSED;
|
|
|
|
|
else
|
|
|
|
|
for (i = 0; i < stream->outcnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->state = SCTP_STREAM_CLOSED;
|
2017-02-17 12:45:40 +08:00
|
|
|
|
|
|
|
|
asoc->strreset_chunk = chunk;
|
|
|
|
|
asoc->strreset_outstanding = 1;
|
|
|
|
|
sctp_chunk_hold(asoc->strreset_chunk);
|
|
|
|
|
|
2017-04-15 22:00:28 +08:00
|
|
|
result = SCTP_STRRESET_PERFORMED;
|
|
|
|
|
|
2017-02-17 12:45:40 +08:00
|
|
|
out:
|
2017-04-15 22:00:28 +08:00
|
|
|
sctp_update_strreset_result(asoc, result);
|
|
|
|
|
err:
|
2017-02-17 12:45:40 +08:00
|
|
|
if (!chunk)
|
|
|
|
|
chunk = sctp_make_strreset_resp(asoc, result, request_seq);
|
|
|
|
|
|
|
|
|
|
return chunk;
|
|
|
|
|
}
|
2017-03-10 12:11:07 +08:00
|
|
|
|
|
|
|
|
struct sctp_chunk *sctp_process_strreset_tsnreq(
|
|
|
|
|
struct sctp_association *asoc,
|
|
|
|
|
union sctp_params param,
|
|
|
|
|
struct sctp_ulpevent **evp)
|
|
|
|
|
{
|
|
|
|
|
__u32 init_tsn = 0, next_tsn = 0, max_tsn_seen;
|
|
|
|
|
struct sctp_strreset_tsnreq *tsnreq = param.v;
|
2017-05-31 16:36:31 +08:00
|
|
|
struct sctp_stream *stream = &asoc->stream;
|
2017-03-10 12:11:07 +08:00
|
|
|
__u32 result = SCTP_STRRESET_DENIED;
|
|
|
|
|
__u32 request_seq;
|
|
|
|
|
__u16 i;
|
|
|
|
|
|
|
|
|
|
request_seq = ntohl(tsnreq->request_seq);
|
2017-04-15 22:00:29 +08:00
|
|
|
if (TSN_lt(asoc->strreset_inseq, request_seq) ||
|
|
|
|
|
TSN_lt(request_seq, asoc->strreset_inseq - 2)) {
|
2017-03-10 12:11:07 +08:00
|
|
|
result = SCTP_STRRESET_ERR_BAD_SEQNO;
|
2017-04-15 22:00:29 +08:00
|
|
|
goto err;
|
|
|
|
|
} else if (TSN_lt(request_seq, asoc->strreset_inseq)) {
|
|
|
|
|
i = asoc->strreset_inseq - request_seq - 1;
|
|
|
|
|
result = asoc->strreset_result[i];
|
|
|
|
|
if (result == SCTP_STRRESET_PERFORMED) {
|
2017-11-25 21:05:36 +08:00
|
|
|
next_tsn = asoc->ctsn_ack_point + 1;
|
2017-04-15 22:00:29 +08:00
|
|
|
init_tsn =
|
|
|
|
|
sctp_tsnmap_get_ctsn(&asoc->peer.tsn_map) + 1;
|
|
|
|
|
}
|
|
|
|
|
goto err;
|
2017-03-10 12:11:07 +08:00
|
|
|
}
|
2017-11-25 21:05:34 +08:00
|
|
|
|
|
|
|
|
if (!sctp_outq_is_empty(&asoc->outqueue)) {
|
|
|
|
|
result = SCTP_STRRESET_IN_PROGRESS;
|
|
|
|
|
goto err;
|
|
|
|
|
}
|
|
|
|
|
|
2017-04-15 22:00:29 +08:00
|
|
|
asoc->strreset_inseq++;
|
2017-03-10 12:11:07 +08:00
|
|
|
|
|
|
|
|
if (!(asoc->strreset_enable & SCTP_ENABLE_RESET_ASSOC_REQ))
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
if (asoc->strreset_outstanding) {
|
|
|
|
|
result = SCTP_STRRESET_ERR_IN_PROGRESS;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
2017-11-25 21:05:35 +08:00
|
|
|
/* G4: The same processing as though a FWD-TSN chunk (as defined in
|
|
|
|
|
* [RFC3758]) with all streams affected and a new cumulative TSN
|
|
|
|
|
* ACK of the Receiver's Next TSN minus 1 were received MUST be
|
|
|
|
|
* performed.
|
2017-03-10 12:11:07 +08:00
|
|
|
*/
|
|
|
|
|
max_tsn_seen = sctp_tsnmap_get_max_tsn_seen(&asoc->peer.tsn_map);
|
2017-12-15 00:41:28 +08:00
|
|
|
asoc->stream.si->report_ftsn(&asoc->ulpq, max_tsn_seen);
|
2017-03-10 12:11:07 +08:00
|
|
|
|
|
|
|
|
/* G1: Compute an appropriate value for the Receiver's Next TSN -- the
|
|
|
|
|
* TSN that the peer should use to send the next DATA chunk. The
|
|
|
|
|
* value SHOULD be the smallest TSN not acknowledged by the
|
|
|
|
|
* receiver of the request plus 2^31.
|
|
|
|
|
*/
|
|
|
|
|
init_tsn = sctp_tsnmap_get_ctsn(&asoc->peer.tsn_map) + (1 << 31);
|
|
|
|
|
sctp_tsnmap_init(&asoc->peer.tsn_map, SCTP_TSN_MAP_INITIAL,
|
|
|
|
|
init_tsn, GFP_ATOMIC);
|
|
|
|
|
|
2017-11-25 21:05:35 +08:00
|
|
|
/* G3: The same processing as though a SACK chunk with no gap report
|
|
|
|
|
* and a cumulative TSN ACK of the Sender's Next TSN minus 1 were
|
|
|
|
|
* received MUST be performed.
|
2017-03-10 12:11:07 +08:00
|
|
|
*/
|
|
|
|
|
sctp_outq_free(&asoc->outqueue);
|
|
|
|
|
|
|
|
|
|
/* G2: Compute an appropriate value for the local endpoint's next TSN,
|
|
|
|
|
* i.e., the next TSN assigned by the receiver of the SSN/TSN reset
|
|
|
|
|
* chunk. The value SHOULD be the highest TSN sent by the receiver
|
|
|
|
|
* of the request plus 1.
|
|
|
|
|
*/
|
|
|
|
|
next_tsn = asoc->next_tsn;
|
|
|
|
|
asoc->ctsn_ack_point = next_tsn - 1;
|
|
|
|
|
asoc->adv_peer_ack_point = asoc->ctsn_ack_point;
|
|
|
|
|
|
|
|
|
|
/* G5: The next expected and outgoing SSNs MUST be reset to 0 for all
|
|
|
|
|
* incoming and outgoing streams.
|
|
|
|
|
*/
|
2017-12-15 00:41:31 +08:00
|
|
|
for (i = 0; i < stream->outcnt; i++) {
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->mid = 0;
|
|
|
|
|
SCTP_SO(stream, i)->mid_uo = 0;
|
2017-12-15 00:41:31 +08:00
|
|
|
}
|
2017-03-10 12:11:07 +08:00
|
|
|
for (i = 0; i < stream->incnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SI(stream, i)->mid = 0;
|
2017-03-10 12:11:07 +08:00
|
|
|
|
|
|
|
|
result = SCTP_STRRESET_PERFORMED;
|
|
|
|
|
|
|
|
|
|
*evp = sctp_ulpevent_make_assoc_reset_event(asoc, 0, init_tsn,
|
|
|
|
|
next_tsn, GFP_ATOMIC);
|
|
|
|
|
|
|
|
|
|
out:
|
2017-04-15 22:00:29 +08:00
|
|
|
sctp_update_strreset_result(asoc, result);
|
|
|
|
|
err:
|
2017-03-10 12:11:07 +08:00
|
|
|
return sctp_make_strreset_tsnresp(asoc, result, request_seq,
|
|
|
|
|
next_tsn, init_tsn);
|
|
|
|
|
}
|
2017-03-10 12:11:09 +08:00
|
|
|
|
|
|
|
|
struct sctp_chunk *sctp_process_strreset_addstrm_out(
|
|
|
|
|
struct sctp_association *asoc,
|
|
|
|
|
union sctp_params param,
|
|
|
|
|
struct sctp_ulpevent **evp)
|
|
|
|
|
{
|
|
|
|
|
struct sctp_strreset_addstrm *addstrm = param.v;
|
2017-05-31 16:36:31 +08:00
|
|
|
struct sctp_stream *stream = &asoc->stream;
|
2017-03-10 12:11:09 +08:00
|
|
|
__u32 result = SCTP_STRRESET_DENIED;
|
|
|
|
|
__u32 request_seq, incnt;
|
2017-04-15 22:00:27 +08:00
|
|
|
__u16 in, i;
|
2017-03-10 12:11:09 +08:00
|
|
|
|
|
|
|
|
request_seq = ntohl(addstrm->request_seq);
|
2017-04-15 22:00:27 +08:00
|
|
|
if (TSN_lt(asoc->strreset_inseq, request_seq) ||
|
|
|
|
|
TSN_lt(request_seq, asoc->strreset_inseq - 2)) {
|
2017-03-10 12:11:09 +08:00
|
|
|
result = SCTP_STRRESET_ERR_BAD_SEQNO;
|
2017-04-15 22:00:27 +08:00
|
|
|
goto err;
|
|
|
|
|
} else if (TSN_lt(request_seq, asoc->strreset_inseq)) {
|
|
|
|
|
i = asoc->strreset_inseq - request_seq - 1;
|
|
|
|
|
result = asoc->strreset_result[i];
|
|
|
|
|
goto err;
|
2017-03-10 12:11:09 +08:00
|
|
|
}
|
2017-04-15 22:00:27 +08:00
|
|
|
asoc->strreset_inseq++;
|
2017-03-10 12:11:09 +08:00
|
|
|
|
|
|
|
|
if (!(asoc->strreset_enable & SCTP_ENABLE_CHANGE_ASSOC_REQ))
|
|
|
|
|
goto out;
|
|
|
|
|
|
2019-01-22 02:40:12 +08:00
|
|
|
in = ntohs(addstrm->number_of_streams);
|
|
|
|
|
incnt = stream->incnt + in;
|
|
|
|
|
if (!in || incnt > SCTP_MAX_STREAM)
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
if (sctp_stream_alloc_in(stream, incnt, GFP_ATOMIC))
|
|
|
|
|
goto out;
|
|
|
|
|
|
2017-03-10 12:11:09 +08:00
|
|
|
if (asoc->strreset_chunk) {
|
|
|
|
|
if (!sctp_chunk_lookup_strreset_param(
|
|
|
|
|
asoc, 0, SCTP_PARAM_RESET_ADD_IN_STREAMS)) {
|
|
|
|
|
/* same process with outstanding isn't 0 */
|
|
|
|
|
result = SCTP_STRRESET_ERR_IN_PROGRESS;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
asoc->strreset_outstanding--;
|
|
|
|
|
asoc->strreset_outseq++;
|
|
|
|
|
|
|
|
|
|
if (!asoc->strreset_outstanding) {
|
|
|
|
|
struct sctp_transport *t;
|
|
|
|
|
|
|
|
|
|
t = asoc->strreset_chunk->transport;
|
|
|
|
|
if (del_timer(&t->reconf_timer))
|
|
|
|
|
sctp_transport_put(t);
|
|
|
|
|
|
|
|
|
|
sctp_chunk_put(asoc->strreset_chunk);
|
|
|
|
|
asoc->strreset_chunk = NULL;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
stream->incnt = incnt;
|
|
|
|
|
|
|
|
|
|
result = SCTP_STRRESET_PERFORMED;
|
|
|
|
|
|
|
|
|
|
*evp = sctp_ulpevent_make_stream_change_event(asoc,
|
|
|
|
|
0, ntohs(addstrm->number_of_streams), 0, GFP_ATOMIC);
|
|
|
|
|
|
|
|
|
|
out:
|
2017-04-15 22:00:27 +08:00
|
|
|
sctp_update_strreset_result(asoc, result);
|
|
|
|
|
err:
|
2017-03-10 12:11:09 +08:00
|
|
|
return sctp_make_strreset_resp(asoc, result, request_seq);
|
|
|
|
|
}
|
2017-03-10 12:11:10 +08:00
|
|
|
|
|
|
|
|
struct sctp_chunk *sctp_process_strreset_addstrm_in(
|
|
|
|
|
struct sctp_association *asoc,
|
|
|
|
|
union sctp_params param,
|
|
|
|
|
struct sctp_ulpevent **evp)
|
|
|
|
|
{
|
|
|
|
|
struct sctp_strreset_addstrm *addstrm = param.v;
|
2017-05-31 16:36:31 +08:00
|
|
|
struct sctp_stream *stream = &asoc->stream;
|
2017-03-10 12:11:10 +08:00
|
|
|
__u32 result = SCTP_STRRESET_DENIED;
|
|
|
|
|
struct sctp_chunk *chunk = NULL;
|
|
|
|
|
__u32 request_seq, outcnt;
|
2017-04-15 22:00:28 +08:00
|
|
|
__u16 out, i;
|
2017-10-04 06:20:09 +08:00
|
|
|
int ret;
|
2017-03-10 12:11:10 +08:00
|
|
|
|
|
|
|
|
request_seq = ntohl(addstrm->request_seq);
|
2017-04-15 22:00:28 +08:00
|
|
|
if (TSN_lt(asoc->strreset_inseq, request_seq) ||
|
|
|
|
|
TSN_lt(request_seq, asoc->strreset_inseq - 2)) {
|
2017-03-10 12:11:10 +08:00
|
|
|
result = SCTP_STRRESET_ERR_BAD_SEQNO;
|
2017-04-15 22:00:28 +08:00
|
|
|
goto err;
|
|
|
|
|
} else if (TSN_lt(request_seq, asoc->strreset_inseq)) {
|
|
|
|
|
i = asoc->strreset_inseq - request_seq - 1;
|
|
|
|
|
result = asoc->strreset_result[i];
|
|
|
|
|
if (result == SCTP_STRRESET_PERFORMED)
|
|
|
|
|
return NULL;
|
|
|
|
|
goto err;
|
2017-03-10 12:11:10 +08:00
|
|
|
}
|
2017-04-15 22:00:28 +08:00
|
|
|
asoc->strreset_inseq++;
|
2017-03-10 12:11:10 +08:00
|
|
|
|
|
|
|
|
if (!(asoc->strreset_enable & SCTP_ENABLE_CHANGE_ASSOC_REQ))
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
if (asoc->strreset_outstanding) {
|
|
|
|
|
result = SCTP_STRRESET_ERR_IN_PROGRESS;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
out = ntohs(addstrm->number_of_streams);
|
|
|
|
|
outcnt = stream->outcnt + out;
|
|
|
|
|
if (!out || outcnt > SCTP_MAX_STREAM)
|
|
|
|
|
goto out;
|
|
|
|
|
|
2017-10-04 06:20:09 +08:00
|
|
|
ret = sctp_stream_alloc_out(stream, outcnt, GFP_ATOMIC);
|
|
|
|
|
if (ret)
|
2017-03-10 12:11:10 +08:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
chunk = sctp_make_strreset_addstrm(asoc, out, 0);
|
|
|
|
|
if (!chunk)
|
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
|
|
asoc->strreset_chunk = chunk;
|
|
|
|
|
asoc->strreset_outstanding = 1;
|
|
|
|
|
sctp_chunk_hold(asoc->strreset_chunk);
|
|
|
|
|
|
|
|
|
|
stream->outcnt = outcnt;
|
|
|
|
|
|
2017-04-15 22:00:28 +08:00
|
|
|
result = SCTP_STRRESET_PERFORMED;
|
|
|
|
|
|
2017-03-10 12:11:10 +08:00
|
|
|
out:
|
2017-04-15 22:00:28 +08:00
|
|
|
sctp_update_strreset_result(asoc, result);
|
|
|
|
|
err:
|
2017-03-10 12:11:10 +08:00
|
|
|
if (!chunk)
|
|
|
|
|
chunk = sctp_make_strreset_resp(asoc, result, request_seq);
|
|
|
|
|
|
|
|
|
|
return chunk;
|
|
|
|
|
}
|
2017-03-10 12:11:11 +08:00
|
|
|
|
|
|
|
|
struct sctp_chunk *sctp_process_strreset_resp(
|
|
|
|
|
struct sctp_association *asoc,
|
|
|
|
|
union sctp_params param,
|
|
|
|
|
struct sctp_ulpevent **evp)
|
|
|
|
|
{
|
2017-05-31 16:36:31 +08:00
|
|
|
struct sctp_stream *stream = &asoc->stream;
|
2017-03-10 12:11:11 +08:00
|
|
|
struct sctp_strreset_resp *resp = param.v;
|
|
|
|
|
struct sctp_transport *t;
|
|
|
|
|
__u16 i, nums, flags = 0;
|
2017-06-30 11:52:16 +08:00
|
|
|
struct sctp_paramhdr *req;
|
2017-03-10 12:11:11 +08:00
|
|
|
__u32 result;
|
|
|
|
|
|
|
|
|
|
req = sctp_chunk_lookup_strreset_param(asoc, resp->response_seq, 0);
|
|
|
|
|
if (!req)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
result = ntohl(resp->result);
|
|
|
|
|
if (result != SCTP_STRRESET_PERFORMED) {
|
|
|
|
|
/* if in progress, do nothing but retransmit */
|
|
|
|
|
if (result == SCTP_STRRESET_IN_PROGRESS)
|
|
|
|
|
return NULL;
|
|
|
|
|
else if (result == SCTP_STRRESET_DENIED)
|
|
|
|
|
flags = SCTP_STREAM_RESET_DENIED;
|
|
|
|
|
else
|
|
|
|
|
flags = SCTP_STREAM_RESET_FAILED;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (req->type == SCTP_PARAM_RESET_OUT_REQUEST) {
|
|
|
|
|
struct sctp_strreset_outreq *outreq;
|
2017-10-28 19:43:54 +08:00
|
|
|
__be16 *str_p;
|
2017-03-10 12:11:11 +08:00
|
|
|
|
|
|
|
|
outreq = (struct sctp_strreset_outreq *)req;
|
2017-04-15 21:56:57 +08:00
|
|
|
str_p = outreq->list_of_streams;
|
2017-11-25 21:05:32 +08:00
|
|
|
nums = (ntohs(outreq->param_hdr.length) - sizeof(*outreq)) /
|
|
|
|
|
sizeof(__u16);
|
2017-03-10 12:11:11 +08:00
|
|
|
|
|
|
|
|
if (result == SCTP_STRRESET_PERFORMED) {
|
2018-08-11 01:11:42 +08:00
|
|
|
struct sctp_stream_out *sout;
|
2017-03-10 12:11:11 +08:00
|
|
|
if (nums) {
|
2017-12-15 00:41:31 +08:00
|
|
|
for (i = 0; i < nums; i++) {
|
2018-08-11 01:11:42 +08:00
|
|
|
sout = SCTP_SO(stream, ntohs(str_p[i]));
|
|
|
|
|
sout->mid = 0;
|
|
|
|
|
sout->mid_uo = 0;
|
2017-12-15 00:41:31 +08:00
|
|
|
}
|
2017-03-10 12:11:11 +08:00
|
|
|
} else {
|
2017-12-15 00:41:31 +08:00
|
|
|
for (i = 0; i < stream->outcnt; i++) {
|
2018-08-11 01:11:42 +08:00
|
|
|
sout = SCTP_SO(stream, i);
|
|
|
|
|
sout->mid = 0;
|
|
|
|
|
sout->mid_uo = 0;
|
2017-12-15 00:41:31 +08:00
|
|
|
}
|
2017-03-10 12:11:11 +08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-01-22 02:39:34 +08:00
|
|
|
flags |= SCTP_STREAM_RESET_OUTGOING_SSN;
|
|
|
|
|
|
2017-03-10 12:11:11 +08:00
|
|
|
for (i = 0; i < stream->outcnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->state = SCTP_STREAM_OPEN;
|
2017-03-10 12:11:11 +08:00
|
|
|
|
|
|
|
|
*evp = sctp_ulpevent_make_stream_reset_event(asoc, flags,
|
|
|
|
|
nums, str_p, GFP_ATOMIC);
|
|
|
|
|
} else if (req->type == SCTP_PARAM_RESET_IN_REQUEST) {
|
|
|
|
|
struct sctp_strreset_inreq *inreq;
|
2017-10-28 19:43:54 +08:00
|
|
|
__be16 *str_p;
|
2017-03-10 12:11:11 +08:00
|
|
|
|
|
|
|
|
/* if the result is performed, it's impossible for inreq */
|
|
|
|
|
if (result == SCTP_STRRESET_PERFORMED)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
inreq = (struct sctp_strreset_inreq *)req;
|
2017-04-15 21:56:57 +08:00
|
|
|
str_p = inreq->list_of_streams;
|
2017-11-25 21:05:32 +08:00
|
|
|
nums = (ntohs(inreq->param_hdr.length) - sizeof(*inreq)) /
|
|
|
|
|
sizeof(__u16);
|
2017-03-10 12:11:11 +08:00
|
|
|
|
2019-01-22 02:39:34 +08:00
|
|
|
flags |= SCTP_STREAM_RESET_INCOMING_SSN;
|
|
|
|
|
|
2017-03-10 12:11:11 +08:00
|
|
|
*evp = sctp_ulpevent_make_stream_reset_event(asoc, flags,
|
|
|
|
|
nums, str_p, GFP_ATOMIC);
|
|
|
|
|
} else if (req->type == SCTP_PARAM_RESET_TSN_REQUEST) {
|
|
|
|
|
struct sctp_strreset_resptsn *resptsn;
|
|
|
|
|
__u32 stsn, rtsn;
|
|
|
|
|
|
|
|
|
|
/* check for resptsn, as sctp_verify_reconf didn't do it*/
|
|
|
|
|
if (ntohs(param.p->length) != sizeof(*resptsn))
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
resptsn = (struct sctp_strreset_resptsn *)resp;
|
|
|
|
|
stsn = ntohl(resptsn->senders_next_tsn);
|
|
|
|
|
rtsn = ntohl(resptsn->receivers_next_tsn);
|
|
|
|
|
|
|
|
|
|
if (result == SCTP_STRRESET_PERFORMED) {
|
|
|
|
|
__u32 mtsn = sctp_tsnmap_get_max_tsn_seen(
|
|
|
|
|
&asoc->peer.tsn_map);
|
2017-11-25 21:05:35 +08:00
|
|
|
LIST_HEAD(temp);
|
2017-03-10 12:11:11 +08:00
|
|
|
|
2017-12-15 00:41:28 +08:00
|
|
|
asoc->stream.si->report_ftsn(&asoc->ulpq, mtsn);
|
2017-03-10 12:11:11 +08:00
|
|
|
|
|
|
|
|
sctp_tsnmap_init(&asoc->peer.tsn_map,
|
|
|
|
|
SCTP_TSN_MAP_INITIAL,
|
|
|
|
|
stsn, GFP_ATOMIC);
|
|
|
|
|
|
2017-11-25 21:05:35 +08:00
|
|
|
/* Clean up sacked and abandoned queues only. As the
|
|
|
|
|
* out_chunk_list may not be empty, splice it to temp,
|
|
|
|
|
* then get it back after sctp_outq_free is done.
|
|
|
|
|
*/
|
|
|
|
|
list_splice_init(&asoc->outqueue.out_chunk_list, &temp);
|
2017-03-10 12:11:11 +08:00
|
|
|
sctp_outq_free(&asoc->outqueue);
|
2017-11-25 21:05:35 +08:00
|
|
|
list_splice_init(&temp, &asoc->outqueue.out_chunk_list);
|
2017-03-10 12:11:11 +08:00
|
|
|
|
|
|
|
|
asoc->next_tsn = rtsn;
|
|
|
|
|
asoc->ctsn_ack_point = asoc->next_tsn - 1;
|
|
|
|
|
asoc->adv_peer_ack_point = asoc->ctsn_ack_point;
|
|
|
|
|
|
2017-12-15 00:41:31 +08:00
|
|
|
for (i = 0; i < stream->outcnt; i++) {
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->mid = 0;
|
|
|
|
|
SCTP_SO(stream, i)->mid_uo = 0;
|
2017-12-15 00:41:31 +08:00
|
|
|
}
|
2017-03-10 12:11:11 +08:00
|
|
|
for (i = 0; i < stream->incnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SI(stream, i)->mid = 0;
|
2017-03-10 12:11:11 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < stream->outcnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->state = SCTP_STREAM_OPEN;
|
2017-03-10 12:11:11 +08:00
|
|
|
|
|
|
|
|
*evp = sctp_ulpevent_make_assoc_reset_event(asoc, flags,
|
|
|
|
|
stsn, rtsn, GFP_ATOMIC);
|
|
|
|
|
} else if (req->type == SCTP_PARAM_RESET_ADD_OUT_STREAMS) {
|
|
|
|
|
struct sctp_strreset_addstrm *addstrm;
|
|
|
|
|
__u16 number;
|
|
|
|
|
|
|
|
|
|
addstrm = (struct sctp_strreset_addstrm *)req;
|
|
|
|
|
nums = ntohs(addstrm->number_of_streams);
|
|
|
|
|
number = stream->outcnt - nums;
|
|
|
|
|
|
|
|
|
|
if (result == SCTP_STRRESET_PERFORMED)
|
|
|
|
|
for (i = number; i < stream->outcnt; i++)
|
2018-08-11 01:11:42 +08:00
|
|
|
SCTP_SO(stream, i)->state = SCTP_STREAM_OPEN;
|
2017-03-10 12:11:11 +08:00
|
|
|
else
|
|
|
|
|
stream->outcnt = number;
|
|
|
|
|
|
|
|
|
|
*evp = sctp_ulpevent_make_stream_change_event(asoc, flags,
|
|
|
|
|
0, nums, GFP_ATOMIC);
|
|
|
|
|
} else if (req->type == SCTP_PARAM_RESET_ADD_IN_STREAMS) {
|
|
|
|
|
struct sctp_strreset_addstrm *addstrm;
|
|
|
|
|
|
|
|
|
|
/* if the result is performed, it's impossible for addstrm in
|
|
|
|
|
* request.
|
|
|
|
|
*/
|
|
|
|
|
if (result == SCTP_STRRESET_PERFORMED)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
addstrm = (struct sctp_strreset_addstrm *)req;
|
|
|
|
|
nums = ntohs(addstrm->number_of_streams);
|
|
|
|
|
|
|
|
|
|
*evp = sctp_ulpevent_make_stream_change_event(asoc, flags,
|
|
|
|
|
nums, 0, GFP_ATOMIC);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
asoc->strreset_outstanding--;
|
|
|
|
|
asoc->strreset_outseq++;
|
|
|
|
|
|
|
|
|
|
/* remove everything for this reconf request */
|
|
|
|
|
if (!asoc->strreset_outstanding) {
|
|
|
|
|
t = asoc->strreset_chunk->transport;
|
|
|
|
|
if (del_timer(&t->reconf_timer))
|
|
|
|
|
sctp_transport_put(t);
|
|
|
|
|
|
|
|
|
|
sctp_chunk_put(asoc->strreset_chunk);
|
|
|
|
|
asoc->strreset_chunk = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|