1 /* SCTP kernel implementation
2 * (C) Copyright Red Hat Inc. 2017
4 * This file is part of the SCTP kernel implementation
6 * These functions manipulate sctp stream queue/scheduling.
8 * This SCTP implementation is free software;
9 * you can redistribute it and/or modify it under the terms of
10 * the GNU General Public License as published by
11 * the Free Software Foundation; either version 2, or (at your option)
14 * This SCTP implementation is distributed in the hope that it
15 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
16 * ************************
17 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
18 * See the GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with GNU CC; see the file COPYING. If not, see
22 * <http://www.gnu.org/licenses/>.
24 * Please send any bug reports or fixes you make to the
25 * email addresched(es):
28 * Written or modified by:
32 #include <linux/list.h>
33 #include <net/sctp/sctp.h>
34 #include <net/sctp/sm.h>
35 #include <net/sctp/stream_sched.h>
37 /* First Come First Serve (a.k.a. FIFO)
38 * RFC DRAFT ndata Section 3.1
40 static int sctp_sched_fcfs_set(struct sctp_stream *stream, __u16 sid,
41 __u16 value, gfp_t gfp)
46 static int sctp_sched_fcfs_get(struct sctp_stream *stream, __u16 sid,
53 static int sctp_sched_fcfs_init(struct sctp_stream *stream)
58 static int sctp_sched_fcfs_init_sid(struct sctp_stream *stream, __u16 sid,
64 static void sctp_sched_fcfs_free(struct sctp_stream *stream)
68 static void sctp_sched_fcfs_enqueue(struct sctp_outq *q,
69 struct sctp_datamsg *msg)
73 static struct sctp_chunk *sctp_sched_fcfs_dequeue(struct sctp_outq *q)
75 struct sctp_stream *stream = &q->asoc->stream;
76 struct sctp_chunk *ch = NULL;
77 struct list_head *entry;
79 if (list_empty(&q->out_chunk_list))
82 if (stream->out_curr) {
83 ch = list_entry(stream->out_curr->ext->outq.next,
84 struct sctp_chunk, stream_list);
86 entry = q->out_chunk_list.next;
87 ch = list_entry(entry, struct sctp_chunk, list);
90 sctp_sched_dequeue_common(q, ch);
96 static void sctp_sched_fcfs_dequeue_done(struct sctp_outq *q,
97 struct sctp_chunk *chunk)
101 static void sctp_sched_fcfs_sched_all(struct sctp_stream *stream)
105 static void sctp_sched_fcfs_unsched_all(struct sctp_stream *stream)
109 static struct sctp_sched_ops sctp_sched_fcfs = {
110 .set = sctp_sched_fcfs_set,
111 .get = sctp_sched_fcfs_get,
112 .init = sctp_sched_fcfs_init,
113 .init_sid = sctp_sched_fcfs_init_sid,
114 .free = sctp_sched_fcfs_free,
115 .enqueue = sctp_sched_fcfs_enqueue,
116 .dequeue = sctp_sched_fcfs_dequeue,
117 .dequeue_done = sctp_sched_fcfs_dequeue_done,
118 .sched_all = sctp_sched_fcfs_sched_all,
119 .unsched_all = sctp_sched_fcfs_unsched_all,
122 /* API to other parts of the stack */
124 extern struct sctp_sched_ops sctp_sched_prio;
125 extern struct sctp_sched_ops sctp_sched_rr;
127 static struct sctp_sched_ops *sctp_sched_ops[] = {
133 int sctp_sched_set_sched(struct sctp_association *asoc,
134 enum sctp_sched_type sched)
136 struct sctp_sched_ops *n = sctp_sched_ops[sched];
137 struct sctp_sched_ops *old = asoc->outqueue.sched;
138 struct sctp_datamsg *msg = NULL;
139 struct sctp_chunk *ch;
145 if (sched > SCTP_SS_MAX)
149 old->free(&asoc->stream);
151 /* Give the next scheduler a clean slate. */
152 for (i = 0; i < asoc->stream.outcnt; i++) {
153 void *p = asoc->stream.out[i].ext;
158 p += offsetofend(struct sctp_stream_out_ext, outq);
159 memset(p, 0, sizeof(struct sctp_stream_out_ext) -
160 offsetofend(struct sctp_stream_out_ext, outq));
164 asoc->outqueue.sched = n;
165 n->init(&asoc->stream);
166 for (i = 0; i < asoc->stream.outcnt; i++) {
167 if (!asoc->stream.out[i].ext)
170 ret = n->init_sid(&asoc->stream, i, GFP_KERNEL);
175 /* We have to requeue all chunks already queued. */
176 list_for_each_entry(ch, &asoc->outqueue.out_chunk_list, list) {
180 n->enqueue(&asoc->outqueue, msg);
186 n->free(&asoc->stream);
187 asoc->outqueue.sched = &sctp_sched_fcfs; /* Always safe */
192 int sctp_sched_get_sched(struct sctp_association *asoc)
196 for (i = 0; i <= SCTP_SS_MAX; i++)
197 if (asoc->outqueue.sched == sctp_sched_ops[i])
203 int sctp_sched_set_value(struct sctp_association *asoc, __u16 sid,
204 __u16 value, gfp_t gfp)
206 if (sid >= asoc->stream.outcnt)
209 if (!asoc->stream.out[sid].ext) {
212 ret = sctp_stream_init_ext(&asoc->stream, sid);
217 return asoc->outqueue.sched->set(&asoc->stream, sid, value, gfp);
220 int sctp_sched_get_value(struct sctp_association *asoc, __u16 sid,
223 if (sid >= asoc->stream.outcnt)
226 if (!asoc->stream.out[sid].ext)
229 return asoc->outqueue.sched->get(&asoc->stream, sid, value);
232 void sctp_sched_dequeue_done(struct sctp_outq *q, struct sctp_chunk *ch)
234 if (!list_is_last(&ch->frag_list, &ch->msg->chunks)) {
235 struct sctp_stream_out *sout;
238 /* datamsg is not finish, so save it as current one,
239 * in case application switch scheduler or a higher
240 * priority stream comes in.
242 sid = sctp_chunk_stream_no(ch);
243 sout = &q->asoc->stream.out[sid];
244 q->asoc->stream.out_curr = sout;
248 q->asoc->stream.out_curr = NULL;
249 q->sched->dequeue_done(q, ch);
252 /* Auxiliary functions for the schedulers */
253 void sctp_sched_dequeue_common(struct sctp_outq *q, struct sctp_chunk *ch)
255 list_del_init(&ch->list);
256 list_del_init(&ch->stream_list);
257 q->out_qlen -= ch->skb->len;
260 int sctp_sched_init_sid(struct sctp_stream *stream, __u16 sid, gfp_t gfp)
262 struct sctp_sched_ops *sched = sctp_sched_ops_from_stream(stream);
264 INIT_LIST_HEAD(&stream->out[sid].ext->outq);
265 return sched->init_sid(stream, sid, gfp);
268 struct sctp_sched_ops *sctp_sched_ops_from_stream(struct sctp_stream *stream)
270 struct sctp_association *asoc;
272 asoc = container_of(stream, struct sctp_association, stream);
274 return asoc->outqueue.sched;