]>
Commit | Line | Data |
---|---|---|
ac1ed8b8 MRL |
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 | /* Priority handling | |
38 | * RFC DRAFT ndata section 3.2 | |
39 | */ | |
40 | static void sctp_sched_rr_unsched_all(struct sctp_stream *stream); | |
41 | ||
42 | static void sctp_sched_rr_next_stream(struct sctp_stream *stream) | |
43 | { | |
44 | struct list_head *pos; | |
45 | ||
46 | pos = stream->rr_next->rr_list.next; | |
47 | if (pos == &stream->rr_list) | |
48 | pos = pos->next; | |
49 | stream->rr_next = list_entry(pos, struct sctp_stream_out_ext, rr_list); | |
50 | } | |
51 | ||
52 | static void sctp_sched_rr_unsched(struct sctp_stream *stream, | |
53 | struct sctp_stream_out_ext *soute) | |
54 | { | |
55 | if (stream->rr_next == soute) | |
56 | /* Try to move to the next stream */ | |
57 | sctp_sched_rr_next_stream(stream); | |
58 | ||
59 | list_del_init(&soute->rr_list); | |
60 | ||
61 | /* If we have no other stream queued, clear next */ | |
62 | if (list_empty(&stream->rr_list)) | |
63 | stream->rr_next = NULL; | |
64 | } | |
65 | ||
66 | static void sctp_sched_rr_sched(struct sctp_stream *stream, | |
67 | struct sctp_stream_out_ext *soute) | |
68 | { | |
69 | if (!list_empty(&soute->rr_list)) | |
70 | /* Already scheduled. */ | |
71 | return; | |
72 | ||
73 | /* Schedule the stream */ | |
74 | list_add_tail(&soute->rr_list, &stream->rr_list); | |
75 | ||
76 | if (!stream->rr_next) | |
77 | stream->rr_next = soute; | |
78 | } | |
79 | ||
80 | static int sctp_sched_rr_set(struct sctp_stream *stream, __u16 sid, | |
81 | __u16 prio, gfp_t gfp) | |
82 | { | |
83 | return 0; | |
84 | } | |
85 | ||
86 | static int sctp_sched_rr_get(struct sctp_stream *stream, __u16 sid, | |
87 | __u16 *value) | |
88 | { | |
89 | return 0; | |
90 | } | |
91 | ||
92 | static int sctp_sched_rr_init(struct sctp_stream *stream) | |
93 | { | |
94 | INIT_LIST_HEAD(&stream->rr_list); | |
95 | stream->rr_next = NULL; | |
96 | ||
97 | return 0; | |
98 | } | |
99 | ||
100 | static int sctp_sched_rr_init_sid(struct sctp_stream *stream, __u16 sid, | |
101 | gfp_t gfp) | |
102 | { | |
103 | INIT_LIST_HEAD(&stream->out[sid].ext->rr_list); | |
104 | ||
105 | return 0; | |
106 | } | |
107 | ||
108 | static void sctp_sched_rr_free(struct sctp_stream *stream) | |
109 | { | |
110 | sctp_sched_rr_unsched_all(stream); | |
111 | } | |
112 | ||
113 | static void sctp_sched_rr_enqueue(struct sctp_outq *q, | |
114 | struct sctp_datamsg *msg) | |
115 | { | |
116 | struct sctp_stream *stream; | |
117 | struct sctp_chunk *ch; | |
118 | __u16 sid; | |
119 | ||
120 | ch = list_first_entry(&msg->chunks, struct sctp_chunk, frag_list); | |
121 | sid = sctp_chunk_stream_no(ch); | |
122 | stream = &q->asoc->stream; | |
123 | sctp_sched_rr_sched(stream, stream->out[sid].ext); | |
124 | } | |
125 | ||
126 | static struct sctp_chunk *sctp_sched_rr_dequeue(struct sctp_outq *q) | |
127 | { | |
128 | struct sctp_stream *stream = &q->asoc->stream; | |
129 | struct sctp_stream_out_ext *soute; | |
130 | struct sctp_chunk *ch = NULL; | |
131 | ||
132 | /* Bail out quickly if queue is empty */ | |
133 | if (list_empty(&q->out_chunk_list)) | |
134 | goto out; | |
135 | ||
136 | /* Find which chunk is next */ | |
137 | if (stream->out_curr) | |
138 | soute = stream->out_curr->ext; | |
139 | else | |
140 | soute = stream->rr_next; | |
141 | ch = list_entry(soute->outq.next, struct sctp_chunk, stream_list); | |
142 | ||
143 | sctp_sched_dequeue_common(q, ch); | |
144 | ||
145 | out: | |
146 | return ch; | |
147 | } | |
148 | ||
149 | static void sctp_sched_rr_dequeue_done(struct sctp_outq *q, | |
150 | struct sctp_chunk *ch) | |
151 | { | |
152 | struct sctp_stream_out_ext *soute; | |
153 | __u16 sid; | |
154 | ||
155 | /* Last chunk on that msg, move to the next stream */ | |
156 | sid = sctp_chunk_stream_no(ch); | |
157 | soute = q->asoc->stream.out[sid].ext; | |
158 | ||
159 | sctp_sched_rr_next_stream(&q->asoc->stream); | |
160 | ||
161 | if (list_empty(&soute->outq)) | |
162 | sctp_sched_rr_unsched(&q->asoc->stream, soute); | |
163 | } | |
164 | ||
165 | static void sctp_sched_rr_sched_all(struct sctp_stream *stream) | |
166 | { | |
167 | struct sctp_association *asoc; | |
168 | struct sctp_stream_out_ext *soute; | |
169 | struct sctp_chunk *ch; | |
170 | ||
171 | asoc = container_of(stream, struct sctp_association, stream); | |
172 | list_for_each_entry(ch, &asoc->outqueue.out_chunk_list, list) { | |
173 | __u16 sid; | |
174 | ||
175 | sid = sctp_chunk_stream_no(ch); | |
176 | soute = stream->out[sid].ext; | |
177 | if (soute) | |
178 | sctp_sched_rr_sched(stream, soute); | |
179 | } | |
180 | } | |
181 | ||
182 | static void sctp_sched_rr_unsched_all(struct sctp_stream *stream) | |
183 | { | |
184 | struct sctp_stream_out_ext *soute, *tmp; | |
185 | ||
186 | list_for_each_entry_safe(soute, tmp, &stream->rr_list, rr_list) | |
187 | sctp_sched_rr_unsched(stream, soute); | |
188 | } | |
189 | ||
1ba896f6 | 190 | static struct sctp_sched_ops sctp_sched_rr = { |
ac1ed8b8 MRL |
191 | .set = sctp_sched_rr_set, |
192 | .get = sctp_sched_rr_get, | |
193 | .init = sctp_sched_rr_init, | |
194 | .init_sid = sctp_sched_rr_init_sid, | |
195 | .free = sctp_sched_rr_free, | |
196 | .enqueue = sctp_sched_rr_enqueue, | |
197 | .dequeue = sctp_sched_rr_dequeue, | |
198 | .dequeue_done = sctp_sched_rr_dequeue_done, | |
199 | .sched_all = sctp_sched_rr_sched_all, | |
200 | .unsched_all = sctp_sched_rr_unsched_all, | |
201 | }; | |
1ba896f6 XL |
202 | |
203 | void sctp_sched_ops_rr_init(void) | |
204 | { | |
205 | sctp_sched_ops_register(SCTP_SS_RR, &sctp_sched_rr); | |
206 | } |