Loading...
1// SPDX-License-Identifier: GPL-2.0-or-later
2/* SCTP kernel implementation
3 * (C) Copyright Red Hat Inc. 2017
4 *
5 * This file is part of the SCTP kernel implementation
6 *
7 * These functions manipulate sctp stream queue/scheduling.
8 *
9 * Please send any bug reports or fixes you make to the
10 * email addresched(es):
11 * lksctp developers <linux-sctp@vger.kernel.org>
12 *
13 * Written or modified by:
14 * Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
15 */
16
17#include <linux/list.h>
18#include <net/sctp/sctp.h>
19#include <net/sctp/sm.h>
20#include <net/sctp/stream_sched.h>
21
22/* First Come First Serve (a.k.a. FIFO)
23 * RFC DRAFT ndata Section 3.1
24 */
25static int sctp_sched_fcfs_set(struct sctp_stream *stream, __u16 sid,
26 __u16 value, gfp_t gfp)
27{
28 return 0;
29}
30
31static int sctp_sched_fcfs_get(struct sctp_stream *stream, __u16 sid,
32 __u16 *value)
33{
34 *value = 0;
35 return 0;
36}
37
38static int sctp_sched_fcfs_init(struct sctp_stream *stream)
39{
40 return 0;
41}
42
43static int sctp_sched_fcfs_init_sid(struct sctp_stream *stream, __u16 sid,
44 gfp_t gfp)
45{
46 return 0;
47}
48
49static void sctp_sched_fcfs_free(struct sctp_stream *stream)
50{
51}
52
53static void sctp_sched_fcfs_enqueue(struct sctp_outq *q,
54 struct sctp_datamsg *msg)
55{
56}
57
58static struct sctp_chunk *sctp_sched_fcfs_dequeue(struct sctp_outq *q)
59{
60 struct sctp_stream *stream = &q->asoc->stream;
61 struct sctp_chunk *ch = NULL;
62 struct list_head *entry;
63
64 if (list_empty(&q->out_chunk_list))
65 goto out;
66
67 if (stream->out_curr) {
68 ch = list_entry(stream->out_curr->ext->outq.next,
69 struct sctp_chunk, stream_list);
70 } else {
71 entry = q->out_chunk_list.next;
72 ch = list_entry(entry, struct sctp_chunk, list);
73 }
74
75 sctp_sched_dequeue_common(q, ch);
76
77out:
78 return ch;
79}
80
81static void sctp_sched_fcfs_dequeue_done(struct sctp_outq *q,
82 struct sctp_chunk *chunk)
83{
84}
85
86static void sctp_sched_fcfs_sched_all(struct sctp_stream *stream)
87{
88}
89
90static void sctp_sched_fcfs_unsched_all(struct sctp_stream *stream)
91{
92}
93
94static struct sctp_sched_ops sctp_sched_fcfs = {
95 .set = sctp_sched_fcfs_set,
96 .get = sctp_sched_fcfs_get,
97 .init = sctp_sched_fcfs_init,
98 .init_sid = sctp_sched_fcfs_init_sid,
99 .free = sctp_sched_fcfs_free,
100 .enqueue = sctp_sched_fcfs_enqueue,
101 .dequeue = sctp_sched_fcfs_dequeue,
102 .dequeue_done = sctp_sched_fcfs_dequeue_done,
103 .sched_all = sctp_sched_fcfs_sched_all,
104 .unsched_all = sctp_sched_fcfs_unsched_all,
105};
106
107static void sctp_sched_ops_fcfs_init(void)
108{
109 sctp_sched_ops_register(SCTP_SS_FCFS, &sctp_sched_fcfs);
110}
111
112/* API to other parts of the stack */
113
114static struct sctp_sched_ops *sctp_sched_ops[SCTP_SS_MAX + 1];
115
116void sctp_sched_ops_register(enum sctp_sched_type sched,
117 struct sctp_sched_ops *sched_ops)
118{
119 sctp_sched_ops[sched] = sched_ops;
120}
121
122void sctp_sched_ops_init(void)
123{
124 sctp_sched_ops_fcfs_init();
125 sctp_sched_ops_prio_init();
126 sctp_sched_ops_rr_init();
127}
128
129int sctp_sched_set_sched(struct sctp_association *asoc,
130 enum sctp_sched_type sched)
131{
132 struct sctp_sched_ops *n = sctp_sched_ops[sched];
133 struct sctp_sched_ops *old = asoc->outqueue.sched;
134 struct sctp_datamsg *msg = NULL;
135 struct sctp_chunk *ch;
136 int i, ret = 0;
137
138 if (old == n)
139 return ret;
140
141 if (sched > SCTP_SS_MAX)
142 return -EINVAL;
143
144 if (old) {
145 old->free(&asoc->stream);
146
147 /* Give the next scheduler a clean slate. */
148 for (i = 0; i < asoc->stream.outcnt; i++) {
149 void *p = SCTP_SO(&asoc->stream, i)->ext;
150
151 if (!p)
152 continue;
153
154 p += offsetofend(struct sctp_stream_out_ext, outq);
155 memset(p, 0, sizeof(struct sctp_stream_out_ext) -
156 offsetofend(struct sctp_stream_out_ext, outq));
157 }
158 }
159
160 asoc->outqueue.sched = n;
161 n->init(&asoc->stream);
162 for (i = 0; i < asoc->stream.outcnt; i++) {
163 if (!SCTP_SO(&asoc->stream, i)->ext)
164 continue;
165
166 ret = n->init_sid(&asoc->stream, i, GFP_KERNEL);
167 if (ret)
168 goto err;
169 }
170
171 /* We have to requeue all chunks already queued. */
172 list_for_each_entry(ch, &asoc->outqueue.out_chunk_list, list) {
173 if (ch->msg == msg)
174 continue;
175 msg = ch->msg;
176 n->enqueue(&asoc->outqueue, msg);
177 }
178
179 return ret;
180
181err:
182 n->free(&asoc->stream);
183 asoc->outqueue.sched = &sctp_sched_fcfs; /* Always safe */
184
185 return ret;
186}
187
188int sctp_sched_get_sched(struct sctp_association *asoc)
189{
190 int i;
191
192 for (i = 0; i <= SCTP_SS_MAX; i++)
193 if (asoc->outqueue.sched == sctp_sched_ops[i])
194 return i;
195
196 return 0;
197}
198
199int sctp_sched_set_value(struct sctp_association *asoc, __u16 sid,
200 __u16 value, gfp_t gfp)
201{
202 if (sid >= asoc->stream.outcnt)
203 return -EINVAL;
204
205 if (!SCTP_SO(&asoc->stream, sid)->ext) {
206 int ret;
207
208 ret = sctp_stream_init_ext(&asoc->stream, sid);
209 if (ret)
210 return ret;
211 }
212
213 return asoc->outqueue.sched->set(&asoc->stream, sid, value, gfp);
214}
215
216int sctp_sched_get_value(struct sctp_association *asoc, __u16 sid,
217 __u16 *value)
218{
219 if (sid >= asoc->stream.outcnt)
220 return -EINVAL;
221
222 if (!SCTP_SO(&asoc->stream, sid)->ext)
223 return 0;
224
225 return asoc->outqueue.sched->get(&asoc->stream, sid, value);
226}
227
228void sctp_sched_dequeue_done(struct sctp_outq *q, struct sctp_chunk *ch)
229{
230 if (!list_is_last(&ch->frag_list, &ch->msg->chunks) &&
231 !q->asoc->peer.intl_capable) {
232 struct sctp_stream_out *sout;
233 __u16 sid;
234
235 /* datamsg is not finish, so save it as current one,
236 * in case application switch scheduler or a higher
237 * priority stream comes in.
238 */
239 sid = sctp_chunk_stream_no(ch);
240 sout = SCTP_SO(&q->asoc->stream, sid);
241 q->asoc->stream.out_curr = sout;
242 return;
243 }
244
245 q->asoc->stream.out_curr = NULL;
246 q->sched->dequeue_done(q, ch);
247}
248
249/* Auxiliary functions for the schedulers */
250void sctp_sched_dequeue_common(struct sctp_outq *q, struct sctp_chunk *ch)
251{
252 list_del_init(&ch->list);
253 list_del_init(&ch->stream_list);
254 q->out_qlen -= ch->skb->len;
255}
256
257int sctp_sched_init_sid(struct sctp_stream *stream, __u16 sid, gfp_t gfp)
258{
259 struct sctp_sched_ops *sched = sctp_sched_ops_from_stream(stream);
260 struct sctp_stream_out_ext *ext = SCTP_SO(stream, sid)->ext;
261
262 INIT_LIST_HEAD(&ext->outq);
263 return sched->init_sid(stream, sid, gfp);
264}
265
266struct sctp_sched_ops *sctp_sched_ops_from_stream(struct sctp_stream *stream)
267{
268 struct sctp_association *asoc;
269
270 asoc = container_of(stream, struct sctp_association, stream);
271
272 return asoc->outqueue.sched;
273}
1/* SCTP kernel implementation
2 * (C) Copyright Red Hat Inc. 2017
3 *
4 * This file is part of the SCTP kernel implementation
5 *
6 * These functions manipulate sctp stream queue/scheduling.
7 *
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)
12 * any later version.
13 *
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.
19 *
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/>.
23 *
24 * Please send any bug reports or fixes you make to the
25 * email addresched(es):
26 * lksctp developers <linux-sctp@vger.kernel.org>
27 *
28 * Written or modified by:
29 * Marcelo Ricardo Leitner <marcelo.leitner@gmail.com>
30 */
31
32#include <linux/list.h>
33#include <net/sctp/sctp.h>
34#include <net/sctp/sm.h>
35#include <net/sctp/stream_sched.h>
36
37/* First Come First Serve (a.k.a. FIFO)
38 * RFC DRAFT ndata Section 3.1
39 */
40static int sctp_sched_fcfs_set(struct sctp_stream *stream, __u16 sid,
41 __u16 value, gfp_t gfp)
42{
43 return 0;
44}
45
46static int sctp_sched_fcfs_get(struct sctp_stream *stream, __u16 sid,
47 __u16 *value)
48{
49 *value = 0;
50 return 0;
51}
52
53static int sctp_sched_fcfs_init(struct sctp_stream *stream)
54{
55 return 0;
56}
57
58static int sctp_sched_fcfs_init_sid(struct sctp_stream *stream, __u16 sid,
59 gfp_t gfp)
60{
61 return 0;
62}
63
64static void sctp_sched_fcfs_free(struct sctp_stream *stream)
65{
66}
67
68static void sctp_sched_fcfs_enqueue(struct sctp_outq *q,
69 struct sctp_datamsg *msg)
70{
71}
72
73static struct sctp_chunk *sctp_sched_fcfs_dequeue(struct sctp_outq *q)
74{
75 struct sctp_stream *stream = &q->asoc->stream;
76 struct sctp_chunk *ch = NULL;
77 struct list_head *entry;
78
79 if (list_empty(&q->out_chunk_list))
80 goto out;
81
82 if (stream->out_curr) {
83 ch = list_entry(stream->out_curr->ext->outq.next,
84 struct sctp_chunk, stream_list);
85 } else {
86 entry = q->out_chunk_list.next;
87 ch = list_entry(entry, struct sctp_chunk, list);
88 }
89
90 sctp_sched_dequeue_common(q, ch);
91
92out:
93 return ch;
94}
95
96static void sctp_sched_fcfs_dequeue_done(struct sctp_outq *q,
97 struct sctp_chunk *chunk)
98{
99}
100
101static void sctp_sched_fcfs_sched_all(struct sctp_stream *stream)
102{
103}
104
105static void sctp_sched_fcfs_unsched_all(struct sctp_stream *stream)
106{
107}
108
109static 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,
120};
121
122static void sctp_sched_ops_fcfs_init(void)
123{
124 sctp_sched_ops_register(SCTP_SS_FCFS, &sctp_sched_fcfs);
125}
126
127/* API to other parts of the stack */
128
129static struct sctp_sched_ops *sctp_sched_ops[SCTP_SS_MAX + 1];
130
131void sctp_sched_ops_register(enum sctp_sched_type sched,
132 struct sctp_sched_ops *sched_ops)
133{
134 sctp_sched_ops[sched] = sched_ops;
135}
136
137void sctp_sched_ops_init(void)
138{
139 sctp_sched_ops_fcfs_init();
140 sctp_sched_ops_prio_init();
141 sctp_sched_ops_rr_init();
142}
143
144int sctp_sched_set_sched(struct sctp_association *asoc,
145 enum sctp_sched_type sched)
146{
147 struct sctp_sched_ops *n = sctp_sched_ops[sched];
148 struct sctp_sched_ops *old = asoc->outqueue.sched;
149 struct sctp_datamsg *msg = NULL;
150 struct sctp_chunk *ch;
151 int i, ret = 0;
152
153 if (old == n)
154 return ret;
155
156 if (sched > SCTP_SS_MAX)
157 return -EINVAL;
158
159 if (old) {
160 old->free(&asoc->stream);
161
162 /* Give the next scheduler a clean slate. */
163 for (i = 0; i < asoc->stream.outcnt; i++) {
164 void *p = asoc->stream.out[i].ext;
165
166 if (!p)
167 continue;
168
169 p += offsetofend(struct sctp_stream_out_ext, outq);
170 memset(p, 0, sizeof(struct sctp_stream_out_ext) -
171 offsetofend(struct sctp_stream_out_ext, outq));
172 }
173 }
174
175 asoc->outqueue.sched = n;
176 n->init(&asoc->stream);
177 for (i = 0; i < asoc->stream.outcnt; i++) {
178 if (!asoc->stream.out[i].ext)
179 continue;
180
181 ret = n->init_sid(&asoc->stream, i, GFP_KERNEL);
182 if (ret)
183 goto err;
184 }
185
186 /* We have to requeue all chunks already queued. */
187 list_for_each_entry(ch, &asoc->outqueue.out_chunk_list, list) {
188 if (ch->msg == msg)
189 continue;
190 msg = ch->msg;
191 n->enqueue(&asoc->outqueue, msg);
192 }
193
194 return ret;
195
196err:
197 n->free(&asoc->stream);
198 asoc->outqueue.sched = &sctp_sched_fcfs; /* Always safe */
199
200 return ret;
201}
202
203int sctp_sched_get_sched(struct sctp_association *asoc)
204{
205 int i;
206
207 for (i = 0; i <= SCTP_SS_MAX; i++)
208 if (asoc->outqueue.sched == sctp_sched_ops[i])
209 return i;
210
211 return 0;
212}
213
214int sctp_sched_set_value(struct sctp_association *asoc, __u16 sid,
215 __u16 value, gfp_t gfp)
216{
217 if (sid >= asoc->stream.outcnt)
218 return -EINVAL;
219
220 if (!asoc->stream.out[sid].ext) {
221 int ret;
222
223 ret = sctp_stream_init_ext(&asoc->stream, sid);
224 if (ret)
225 return ret;
226 }
227
228 return asoc->outqueue.sched->set(&asoc->stream, sid, value, gfp);
229}
230
231int sctp_sched_get_value(struct sctp_association *asoc, __u16 sid,
232 __u16 *value)
233{
234 if (sid >= asoc->stream.outcnt)
235 return -EINVAL;
236
237 if (!asoc->stream.out[sid].ext)
238 return 0;
239
240 return asoc->outqueue.sched->get(&asoc->stream, sid, value);
241}
242
243void sctp_sched_dequeue_done(struct sctp_outq *q, struct sctp_chunk *ch)
244{
245 if (!list_is_last(&ch->frag_list, &ch->msg->chunks) &&
246 !q->asoc->intl_enable) {
247 struct sctp_stream_out *sout;
248 __u16 sid;
249
250 /* datamsg is not finish, so save it as current one,
251 * in case application switch scheduler or a higher
252 * priority stream comes in.
253 */
254 sid = sctp_chunk_stream_no(ch);
255 sout = &q->asoc->stream.out[sid];
256 q->asoc->stream.out_curr = sout;
257 return;
258 }
259
260 q->asoc->stream.out_curr = NULL;
261 q->sched->dequeue_done(q, ch);
262}
263
264/* Auxiliary functions for the schedulers */
265void sctp_sched_dequeue_common(struct sctp_outq *q, struct sctp_chunk *ch)
266{
267 list_del_init(&ch->list);
268 list_del_init(&ch->stream_list);
269 q->out_qlen -= ch->skb->len;
270}
271
272int sctp_sched_init_sid(struct sctp_stream *stream, __u16 sid, gfp_t gfp)
273{
274 struct sctp_sched_ops *sched = sctp_sched_ops_from_stream(stream);
275
276 INIT_LIST_HEAD(&stream->out[sid].ext->outq);
277 return sched->init_sid(stream, sid, gfp);
278}
279
280struct sctp_sched_ops *sctp_sched_ops_from_stream(struct sctp_stream *stream)
281{
282 struct sctp_association *asoc;
283
284 asoc = container_of(stream, struct sctp_association, stream);
285
286 return asoc->outqueue.sched;
287}