dccp_tfrc.c revision 1.1 1 1.1 rjs /* $KAME: dccp_tfrc.c,v 1.16 2006/03/01 17:34:08 nishida Exp $ */
2 1.1 rjs /* $NetBSD: dccp_tfrc.c,v 1.1 2015/02/10 19:11:52 rjs Exp $ */
3 1.1 rjs
4 1.1 rjs /*
5 1.1 rjs * Copyright (c) 2003 Nils-Erik Mattsson
6 1.1 rjs * All rights reserved.
7 1.1 rjs *
8 1.1 rjs * Redistribution and use in source and binary forms, with or without
9 1.1 rjs * modification, are permitted provided that the following conditions
10 1.1 rjs * are met:
11 1.1 rjs *
12 1.1 rjs * 1. Redistributions of source code must retain the above copyright
13 1.1 rjs * notice, this list of conditions and the following disclaimer.
14 1.1 rjs * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 rjs * notice, this list of conditions and the following disclaimer in the
16 1.1 rjs * documentation and/or other materials provided with the distribution.
17 1.1 rjs * 3. The name of the author may not be used to endorse or promote products
18 1.1 rjs * derived from this software without specific prior written permission.
19 1.1 rjs *
20 1.1 rjs * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 1.1 rjs * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 1.1 rjs * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 1.1 rjs * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 1.1 rjs * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 1.1 rjs * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 1.1 rjs * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 1.1 rjs * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 1.1 rjs * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 1.1 rjs * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 1.1 rjs *
31 1.1 rjs * Id: dccp_tfrc.c,v 1.47 2003/05/28 17:36:15 nilmat-8 Exp
32 1.1 rjs */
33 1.1 rjs
34 1.1 rjs #include <sys/cdefs.h>
35 1.1 rjs __KERNEL_RCSID(0, "$NetBSD: dccp_tfrc.c,v 1.1 2015/02/10 19:11:52 rjs Exp $");
36 1.1 rjs
37 1.1 rjs #include "opt_dccp.h"
38 1.1 rjs
39 1.1 rjs /*
40 1.1 rjs * This implementation conforms to the drafts of DCCP dated Mars 2003.
41 1.1 rjs * The options used are window counter, elapsed time, loss event rate
42 1.1 rjs * and receive rate. No support for history discounting or oscillation
43 1.1 rjs * prevention.
44 1.1 rjs */
45 1.1 rjs
46 1.1 rjs #include <sys/param.h>
47 1.1 rjs #include <sys/systm.h>
48 1.1 rjs #include <sys/domain.h>
49 1.1 rjs #include <sys/kernel.h>
50 1.1 rjs #include <sys/lock.h>
51 1.1 rjs #include <sys/malloc.h>
52 1.1 rjs #include <sys/mbuf.h>
53 1.1 rjs #include <sys/proc.h>
54 1.1 rjs #include <sys/protosw.h>
55 1.1 rjs #include <sys/signalvar.h>
56 1.1 rjs #include <sys/socket.h>
57 1.1 rjs #include <sys/socketvar.h>
58 1.1 rjs #include <sys/mutex.h>
59 1.1 rjs #include <sys/sysctl.h>
60 1.1 rjs #include <sys/syslog.h>
61 1.1 rjs #include <sys/queue.h>
62 1.1 rjs #include <sys/callout.h>
63 1.1 rjs
64 1.1 rjs #include <net/if.h>
65 1.1 rjs #include <net/route.h>
66 1.1 rjs
67 1.1 rjs #include <netinet/in.h>
68 1.1 rjs #include <netinet/in_systm.h>
69 1.1 rjs #include <netinet/ip.h>
70 1.1 rjs
71 1.1 rjs #include <netinet/in_pcb.h>
72 1.1 rjs #include <netinet/in_var.h>
73 1.1 rjs #include <netinet/ip_icmp.h>
74 1.1 rjs #include <netinet/icmp_var.h>
75 1.1 rjs #include <netinet/ip_var.h>
76 1.1 rjs
77 1.1 rjs #include <netinet/dccp.h>
78 1.1 rjs #include <netinet/dccp_var.h>
79 1.1 rjs #include <netinet/dccp_tfrc.h>
80 1.1 rjs #include <netinet/dccp_tfrc_lookup.h>
81 1.1 rjs
82 1.1 rjs #define TFRCDEBUG
83 1.1 rjs #if 0
84 1.1 rjs #define TFRCDEBUGTIMERS
85 1.1 rjs #define NOTFRCSENDER
86 1.1 rjs #define NOTFRCRECV
87 1.1 rjs #endif
88 1.1 rjs
89 1.1 rjs #ifdef TFRCDEBUG
90 1.1 rjs #ifdef __FreeBSD__
91 1.1 rjs #define TFRC_DEBUG(args) log args
92 1.1 rjs #else
93 1.1 rjs #define TFRC_DEBUG(args) dccp_log args
94 1.1 rjs #endif
95 1.1 rjs #else
96 1.1 rjs #define TFRC_DEBUG(args)
97 1.1 rjs #endif
98 1.1 rjs
99 1.1 rjs #ifdef TFRCDEBUGTIMERS
100 1.1 rjs #ifdef __FreeBSD__
101 1.1 rjs #define TFRC_DEBUG_TIME(args) log args
102 1.1 rjs #else
103 1.1 rjs #define TFRC_DEBUG_TIME(args) dccp_log args
104 1.1 rjs #endif
105 1.1 rjs #else
106 1.1 rjs #define TFRC_DEBUG_TIME(args)
107 1.1 rjs #endif
108 1.1 rjs
109 1.1 rjs #if !defined(__FreeBSD__) || __FreeBSD_version < 500000
110 1.1 rjs #define INP_INFO_LOCK_INIT(x,y)
111 1.1 rjs #define INP_INFO_WLOCK(x)
112 1.1 rjs #define INP_INFO_WUNLOCK(x)
113 1.1 rjs #define INP_INFO_RLOCK(x)
114 1.1 rjs #define INP_INFO_RUNLOCK(x)
115 1.1 rjs #define INP_LOCK(x)
116 1.1 rjs #define INP_UNLOCK(x)
117 1.1 rjs #endif
118 1.1 rjs
119 1.1 rjs
120 1.1 rjs /* Timeval operations */
121 1.1 rjs const struct timeval delta_half = {0, TFRC_OPSYS_TIME_GRAN / 2};
122 1.1 rjs
123 1.1 rjs /*
124 1.1 rjs * Half time value struct (accurate to +- 0.5us)
125 1.1 rjs * args: tvp - pointer to timeval structure
126 1.1 rjs * Tested u:OK
127 1.1 rjs */
128 1.1 rjs #define HALFTIMEVAL(tvp) \
129 1.1 rjs do { \
130 1.1 rjs if ((tvp)->tv_sec & 1) \
131 1.1 rjs (tvp)->tv_usec += 1000000; \
132 1.1 rjs (tvp)->tv_sec = (tvp)->tv_sec >> 1; \
133 1.1 rjs (tvp)->tv_usec = (tvp)->tv_usec >> 1; \
134 1.1 rjs } while (0)
135 1.1 rjs
136 1.1 rjs /* Sender side */
137 1.1 rjs
138 1.1 rjs /* Calculate new t_ipi (inter packet interval) by
139 1.1 rjs * t_ipi = s/X_inst;
140 1.1 rjs * args: ccbp - pointer to sender ccb block
141 1.1 rjs * Tested u:OK - Note: No check for x = 0 -> t_ipi = {0xFFF...,0xFFF}
142 1.1 rjs */
143 1.1 rjs #define CALCNEWTIPI(ccbp) \
144 1.1 rjs do { \
145 1.1 rjs struct fixpoint x1, y1; \
146 1.1 rjs x1.num = ccbp->s; \
147 1.1 rjs x1.denom = 1; \
148 1.1 rjs fixpoint_div(&x1, &x1, &(ccbp)->x); \
149 1.1 rjs y1.num = (ccbp)->t_ipi.tv_sec = fixpoint_getlong(&x1); \
150 1.1 rjs y1.denom = 1; \
151 1.1 rjs fixpoint_sub(&x1, &x1, &y1); \
152 1.1 rjs y1.num = 1000000; \
153 1.1 rjs y1.denom = 1; \
154 1.1 rjs fixpoint_mul(&x1, &x1, &y1); \
155 1.1 rjs (ccbp)->t_ipi.tv_usec = fixpoint_getlong(&x1); \
156 1.1 rjs } while (0)
157 1.1 rjs
158 1.1 rjs /* Calculate new delta by
159 1.1 rjs * delta = min(t_ipi/2, t_gran/2);
160 1.1 rjs * args: ccbp - pointer to sender ccb block
161 1.1 rjs * Tested u:OK
162 1.1 rjs */
163 1.1 rjs #define CALCNEWDELTA(ccbp) \
164 1.1 rjs do { \
165 1.1 rjs (ccbp)->delta = delta_half; \
166 1.1 rjs if ((ccbp)->t_ipi.tv_sec == 0 && \
167 1.1 rjs (ccbp)->t_ipi.tv_usec < TFRC_OPSYS_TIME_GRAN) { \
168 1.1 rjs (ccbp)->delta = (ccbp)->t_ipi; \
169 1.1 rjs HALFTIMEVAL(&((ccbp)->delta)); \
170 1.1 rjs } \
171 1.1 rjs } while (0)
172 1.1 rjs
173 1.1 rjs #ifdef TFRCDEBUG
174 1.1 rjs #define PRINTFLOAT(x) TFRC_DEBUG((LOG_INFO, "%lld/%lld", (x)->num, (x)->denom));
175 1.1 rjs #endif
176 1.1 rjs
177 1.1 rjs const struct fixpoint tfrc_smallest_p = { 4LL, 1000000LL };
178 1.1 rjs
179 1.1 rjs /* External declarations */
180 1.1 rjs extern int dccp_get_option(char *, int, int, char *, int);
181 1.1 rjs
182 1.1 rjs /* Forward declarations */
183 1.1 rjs void tfrc_time_no_feedback(void *);
184 1.1 rjs void tfrc_time_send(void *);
185 1.1 rjs void tfrc_set_send_timer(struct tfrc_send_ccb *, struct timeval);
186 1.1 rjs void tfrc_updateX(struct tfrc_send_ccb *, struct timeval);
187 1.1 rjs const struct fixpoint *tfrc_calcX(u_int16_t, u_int32_t,
188 1.1 rjs const struct fixpoint *);
189 1.1 rjs void tfrc_send_term(void *);
190 1.1 rjs
191 1.1 rjs static void normalize(long long *, long long *);
192 1.1 rjs struct fixpoint *fixpoint_add(struct fixpoint *, const struct fixpoint *,
193 1.1 rjs const struct fixpoint *);
194 1.1 rjs struct fixpoint *fixpoint_sub(struct fixpoint *, const struct fixpoint *,
195 1.1 rjs const struct fixpoint *);
196 1.1 rjs int fixpoint_cmp(const struct fixpoint *, const struct fixpoint *);
197 1.1 rjs struct fixpoint *fixpoint_mul(struct fixpoint *, const struct fixpoint *,
198 1.1 rjs const struct fixpoint *);
199 1.1 rjs struct fixpoint *fixpoint_div(struct fixpoint *, const struct fixpoint *,
200 1.1 rjs const struct fixpoint *);
201 1.1 rjs long fixpoint_getlong(const struct fixpoint *);
202 1.1 rjs
203 1.1 rjs const struct fixpoint *flookup(const struct fixpoint *);
204 1.1 rjs const struct fixpoint *tfrc_flookup_reverse(const struct fixpoint *);
205 1.1 rjs
206 1.1 rjs /*
207 1.1 rjs * Calculate the send rate according to TCP throughput eq.
208 1.1 rjs * args: s - packet size (in bytes)
209 1.1 rjs * R - Round trip time (in micro seconds)
210 1.1 rjs * p - loss event rate (0<=p<=1)
211 1.1 rjs * returns: calculated send rate (in bytes per second)
212 1.1 rjs * Tested u:OK
213 1.1 rjs */
214 1.1 rjs __inline const struct fixpoint *
215 1.1 rjs tfrc_calcX(u_int16_t s, u_int32_t r, const struct fixpoint *p)
216 1.1 rjs {
217 1.1 rjs static struct fixpoint x;
218 1.1 rjs
219 1.1 rjs x.num = 1000000 * s;
220 1.1 rjs x.denom = 1 * r;
221 1.1 rjs fixpoint_div(&x, &x, p);
222 1.1 rjs return &x;
223 1.1 rjs }
224 1.1 rjs
225 1.1 rjs /*
226 1.1 rjs * Function called by the send timer (to send packet)
227 1.1 rjs * args: cb - sender congestion control block
228 1.1 rjs */
229 1.1 rjs void
230 1.1 rjs tfrc_time_send(void *ccb)
231 1.1 rjs {
232 1.1 rjs struct tfrc_send_ccb *cb = (struct tfrc_send_ccb *) ccb;
233 1.1 rjs int s;
234 1.1 rjs /*struct inpcb *inp;*/
235 1.1 rjs
236 1.1 rjs if (cb->state == TFRC_SSTATE_TERM) {
237 1.1 rjs TFRC_DEBUG((LOG_INFO,
238 1.1 rjs "TFRC - Send timer is ordered to terminate. (tfrc_time_send)\n"));
239 1.1 rjs return;
240 1.1 rjs }
241 1.1 rjs if (callout_pending(&cb->ch_stimer)) {
242 1.1 rjs TFRC_DEBUG((LOG_INFO,
243 1.1 rjs "TFRC - Callout pending. (tfrc_time_send)\n"));
244 1.1 rjs return;
245 1.1 rjs }
246 1.1 rjs /* aquire locks for dccp_output */
247 1.1 rjs s = splsoftnet();
248 1.1 rjs INP_INFO_RLOCK(&dccpbinfo);
249 1.1 rjs /*inp = cb->pcb->d_inpcb;*/
250 1.1 rjs INP_LOCK(inp);
251 1.1 rjs INP_INFO_RUNLOCK(&dccpbinfo);
252 1.1 rjs
253 1.1 rjs callout_stop(&cb->ch_stimer);
254 1.1 rjs
255 1.1 rjs dccp_output(cb->pcb, 1);
256 1.1 rjs /* make sure we schedule next send time */
257 1.1 rjs tfrc_send_packet_sent(cb, 0, -1);
258 1.1 rjs
259 1.1 rjs /* release locks */
260 1.1 rjs INP_UNLOCK(inp);
261 1.1 rjs splx(s);
262 1.1 rjs }
263 1.1 rjs /*
264 1.1 rjs * Calculate and set when the send timer should expire
265 1.1 rjs * args: cb - sender congestion control block
266 1.1 rjs * t_now - timeval struct containing actual time
267 1.1 rjs * Tested u:OK
268 1.1 rjs */
269 1.1 rjs void
270 1.1 rjs tfrc_set_send_timer(struct tfrc_send_ccb * cb, struct timeval t_now)
271 1.1 rjs {
272 1.1 rjs struct timeval t_temp;
273 1.1 rjs long t_ticks;
274 1.1 rjs
275 1.1 rjs /* set send timer to fire in t_ipi - (t_now-t_nom_old) or in other
276 1.1 rjs * words after t_nom - t_now */
277 1.1 rjs t_temp = cb->t_nom;
278 1.1 rjs timersub(&t_temp, &t_now, &t_temp);
279 1.1 rjs
280 1.1 rjs #ifdef TFRCDEBUG
281 1.1 rjs if (t_temp.tv_sec < 0 || t_temp.tv_usec < 0)
282 1.1 rjs panic("TFRC - scheduled a negative time! (tfrc_set_send_timer)");
283 1.1 rjs #endif
284 1.1 rjs
285 1.1 rjs t_ticks = (t_temp.tv_usec + 1000000 * t_temp.tv_sec) / (1000000 / hz);
286 1.1 rjs if (t_ticks == 0) t_ticks = 1;
287 1.1 rjs
288 1.1 rjs TFRC_DEBUG_TIME((LOG_INFO,
289 1.1 rjs "TFRC scheduled send timer to expire in %ld ticks (hz=%lu)\n", t_ticks, (unsigned long)hz));
290 1.1 rjs
291 1.1 rjs callout_reset(&cb->ch_stimer, t_ticks, tfrc_time_send, cb);
292 1.1 rjs }
293 1.1 rjs
294 1.1 rjs /*
295 1.1 rjs * Update X by
296 1.1 rjs * If (p > 0)
297 1.1 rjs * x_calc = calcX(s,R,p);
298 1.1 rjs * X = max(min(X_calc, 2*X_recv), s/t_mbi);
299 1.1 rjs * Else
300 1.1 rjs * If (t_now - tld >= R)
301 1.1 rjs * X = max(min("2*X, 2*X_recv),s/R);
302 1.1 rjs * tld = t_now;
303 1.1 rjs * args: cb - sender congestion control block
304 1.1 rjs * t_now - timeval struct containing actual time
305 1.1 rjs * Tested u:OK
306 1.1 rjs */
307 1.1 rjs void
308 1.1 rjs tfrc_updateX(struct tfrc_send_ccb * cb, struct timeval t_now)
309 1.1 rjs {
310 1.1 rjs struct fixpoint temp, temp2;
311 1.1 rjs struct timeval t_temp, t_rtt = {0, 0};
312 1.1 rjs
313 1.1 rjs /* to avoid large error in calcX */
314 1.1 rjs if (fixpoint_cmp(&cb->p, &tfrc_smallest_p) >= 0) {
315 1.1 rjs cb->x_calc = *tfrc_calcX(cb->s, cb->rtt, &cb->p);
316 1.1 rjs temp = cb->x_recv;
317 1.1 rjs temp.num *= 2;
318 1.1 rjs if (fixpoint_cmp(&cb->x_calc, &temp) < 0)
319 1.1 rjs temp = cb->x_calc;
320 1.1 rjs cb->x = temp;
321 1.1 rjs temp2.num = cb->s;
322 1.1 rjs temp2.denom = TFRC_MAX_BACK_OFF_TIME;
323 1.1 rjs if (fixpoint_cmp(&temp, &temp2) < 0)
324 1.1 rjs cb->x = temp2;
325 1.1 rjs normalize(&cb->x.num, &cb->x.denom);
326 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC updated send rate to "));
327 1.1 rjs PRINTFLOAT(&cb->x);
328 1.1 rjs TFRC_DEBUG((LOG_INFO, " bytes/s (tfrc_updateX, p>0)\n"));
329 1.1 rjs } else {
330 1.1 rjs t_rtt.tv_usec = cb->rtt % 1000000;
331 1.1 rjs t_rtt.tv_sec = cb->rtt / 1000000;
332 1.1 rjs t_temp = t_now;
333 1.1 rjs timersub(&t_temp, &cb->t_ld, &t_temp);
334 1.1 rjs if (timercmp(&t_temp, &t_rtt, >=)) {
335 1.1 rjs temp = cb->x_recv;
336 1.1 rjs temp.num *= 2;
337 1.1 rjs temp2 = cb->x;
338 1.1 rjs temp2.num *= 2;
339 1.1 rjs if (fixpoint_cmp(&temp2, &temp) < 0)
340 1.1 rjs temp = temp2;
341 1.1 rjs cb->x.num = cb->s;
342 1.1 rjs cb->x.denom = 1;
343 1.1 rjs cb->x.num *= 1000000;
344 1.1 rjs cb->x.denom *= cb->rtt;
345 1.1 rjs if (fixpoint_cmp(&temp, &cb->x) > 0)
346 1.1 rjs cb->x = temp;
347 1.1 rjs normalize(&cb->x.num, &cb->x.denom);
348 1.1 rjs cb->t_ld = t_now;
349 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC updated send rate to "));
350 1.1 rjs PRINTFLOAT(&cb->x);
351 1.1 rjs TFRC_DEBUG((LOG_INFO, " bytes/s (tfrc_updateX, p==0)\n"));
352 1.1 rjs } else
353 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC didn't update send rate! (tfrc_updateX, p==0)\n"));
354 1.1 rjs }
355 1.1 rjs }
356 1.1 rjs
357 1.1 rjs /*
358 1.1 rjs * Function called by the no feedback timer
359 1.1 rjs * args: cb - sender congestion control block
360 1.1 rjs * Tested u:OK
361 1.1 rjs */
362 1.1 rjs void
363 1.1 rjs tfrc_time_no_feedback(void *ccb)
364 1.1 rjs {
365 1.1 rjs struct fixpoint v, w;
366 1.1 rjs u_int32_t next_time_out = 1; /* remove init! */
367 1.1 rjs struct timeval t_now;
368 1.1 rjs struct tfrc_send_ccb *cb = (struct tfrc_send_ccb *) ccb;
369 1.1 rjs
370 1.1 rjs mutex_enter(&(cb->mutex));
371 1.1 rjs
372 1.1 rjs if (cb->state == TFRC_SSTATE_TERM) {
373 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - No feedback timer is ordered to terminate\n"));
374 1.1 rjs goto nf_release;
375 1.1 rjs }
376 1.1 rjs if (callout_pending(&(cb)->ch_nftimer)) {
377 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Callout pending, exiting...(tfrc_time_no_feedback)\n"));
378 1.1 rjs goto nf_release;
379 1.1 rjs }
380 1.1 rjs switch (cb->state) {
381 1.1 rjs case TFRC_SSTATE_NO_FBACK:
382 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - no feedback timer expired, state NO_FBACK\n"));
383 1.1 rjs /* half send rate */
384 1.1 rjs cb->x.denom *= 2;
385 1.1 rjs v.num = cb->s;
386 1.1 rjs v.denom *= TFRC_MAX_BACK_OFF_TIME;
387 1.1 rjs if (fixpoint_cmp(&cb->x, &v) < 0)
388 1.1 rjs cb->x = v;
389 1.1 rjs
390 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC updated send rate to "));
391 1.1 rjs PRINTFLOAT(&cb->x);
392 1.1 rjs TFRC_DEBUG((LOG_INFO, " bytes/s (tfrc_time_no_feedback\n"));
393 1.1 rjs
394 1.1 rjs /* reschedule next time out */
395 1.1 rjs
396 1.1 rjs v.num = 2;
397 1.1 rjs v.denom = 1;
398 1.1 rjs w.num = cb->s;
399 1.1 rjs w.denom = 1;
400 1.1 rjs fixpoint_mul(&v, &v, &w);
401 1.1 rjs fixpoint_div(&v, &v, &(cb->x));
402 1.1 rjs v.num *= 1000000;
403 1.1 rjs normalize(&v.num, &v.denom);
404 1.1 rjs next_time_out = v.num / v.denom;
405 1.1 rjs if (next_time_out < TFRC_INITIAL_TIMEOUT * 1000000)
406 1.1 rjs next_time_out = TFRC_INITIAL_TIMEOUT * 1000000;
407 1.1 rjs break;
408 1.1 rjs case TFRC_SSTATE_FBACK:
409 1.1 rjs /*
410 1.1 rjs * Check if IDLE since last timeout and recv rate is less than
411 1.1 rjs * 4 packets per RTT
412 1.1 rjs */
413 1.1 rjs
414 1.1 rjs v.num = cb->s;
415 1.1 rjs v.num *= 4;
416 1.1 rjs v.denom *= cb->rtt;
417 1.1 rjs v.num *= 1000000;
418 1.1 rjs normalize(&v.num, &v.denom);
419 1.1 rjs if (!cb->idle || fixpoint_cmp(&cb->x_recv, &v) >= 0) {
420 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - no feedback timer expired, state FBACK, not idle\n"));
421 1.1 rjs /* Half sending rate */
422 1.1 rjs
423 1.1 rjs /*
424 1.1 rjs * If (X_calc > 2* X_recv) X_recv = max(X_recv/2,
425 1.1 rjs * s/(2*t_mbi)); Else X_recv = X_calc/4;
426 1.1 rjs */
427 1.1 rjs v.num = TFRC_SMALLEST_P;
428 1.1 rjs v.denom = 1;
429 1.1 rjs if (fixpoint_cmp(&cb->p, &v) < 0 && cb->x_calc.num == 0)
430 1.1 rjs panic("TFRC - X_calc is zero! (tfrc_time_no_feedback)\n");
431 1.1 rjs
432 1.1 rjs /* check also if p i zero -> x_calc is infinity ?? */
433 1.1 rjs w = cb->x_recv;
434 1.1 rjs w.num *= 2;
435 1.1 rjs if (fixpoint_cmp(&cb->p, &v) || fixpoint_cmp(&cb->x_calc, &w) > 0) {
436 1.1 rjs cb->x_recv.denom *= 2;
437 1.1 rjs w.num = cb->s;
438 1.1 rjs w.denom *= (2 * TFRC_MAX_BACK_OFF_TIME);
439 1.1 rjs if (fixpoint_cmp(&cb->x_recv, &w) < 0)
440 1.1 rjs cb->x_recv = w;
441 1.1 rjs } else
442 1.1 rjs cb->x_recv.denom *= 4;
443 1.1 rjs normalize(&cb->x_recv.num, &cb->x_recv.denom);
444 1.1 rjs
445 1.1 rjs /* Update sending rate */
446 1.1 rjs microtime(&t_now);
447 1.1 rjs tfrc_updateX(cb, t_now);
448 1.1 rjs }
449 1.1 rjs /* Schedule no feedback timer to expire in max(4*R, 2*s/X) */
450 1.1 rjs v.num = cb->s;
451 1.1 rjs v.num *= 2;
452 1.1 rjs fixpoint_div(&v, &v, &cb->x);
453 1.1 rjs v.num *= 1000000;
454 1.1 rjs next_time_out = v.num / v.denom;
455 1.1 rjs if (next_time_out < cb->t_rto)
456 1.1 rjs next_time_out = cb->t_rto;
457 1.1 rjs break;
458 1.1 rjs default:
459 1.1 rjs panic("tfrc_no_feedback: Illegal state!");
460 1.1 rjs break;
461 1.1 rjs }
462 1.1 rjs
463 1.1 rjs /* Set timer */
464 1.1 rjs
465 1.1 rjs next_time_out = next_time_out / (1000000 / hz);
466 1.1 rjs if (next_time_out == 0)
467 1.1 rjs next_time_out = 1;
468 1.1 rjs
469 1.1 rjs TFRC_DEBUG_TIME((LOG_INFO, "TFRC scheduled no feedback timer to expire in %u ticks (hz=%u)\n", next_time_out, hz));
470 1.1 rjs
471 1.1 rjs callout_reset(&cb->ch_nftimer, next_time_out, tfrc_time_no_feedback, cb);
472 1.1 rjs
473 1.1 rjs /* set idle flag */
474 1.1 rjs cb->idle = 1;
475 1.1 rjs nf_release:
476 1.1 rjs mutex_exit(&(cb->mutex));
477 1.1 rjs }
478 1.1 rjs
479 1.1 rjs /*
480 1.1 rjs * Removes ccb from memory
481 1.1 rjs * args: ccb - ccb of sender
482 1.1 rjs */
483 1.1 rjs void
484 1.1 rjs tfrc_send_term(void *ccb)
485 1.1 rjs {
486 1.1 rjs struct tfrc_send_ccb *cb = (struct tfrc_send_ccb *) ccb;
487 1.1 rjs
488 1.1 rjs if (ccb == 0)
489 1.1 rjs panic("TFRC - Sender ccb is null! (free)");
490 1.1 rjs
491 1.1 rjs /* free sender */
492 1.1 rjs
493 1.1 rjs mutex_destroy(&(cb->mutex));
494 1.1 rjs
495 1.1 rjs free(cb, M_PCB);
496 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC sender is destroyed\n"));
497 1.1 rjs }
498 1.1 rjs
499 1.1 rjs /* Functions declared in struct dccp_cc_sw */
500 1.1 rjs
501 1.1 rjs /*
502 1.1 rjs * Initialises the sender side
503 1.1 rjs * args: pcb - dccp protocol control block
504 1.1 rjs * returns: pointer to a tfrc_send_ccb struct on success, otherwise 0
505 1.1 rjs * Tested u:OK
506 1.1 rjs */
507 1.1 rjs void *
508 1.1 rjs tfrc_send_init(struct dccpcb * pcb)
509 1.1 rjs {
510 1.1 rjs struct tfrc_send_ccb *ccb;
511 1.1 rjs
512 1.1 rjs ccb = malloc(sizeof(struct tfrc_send_ccb), M_PCB, M_NOWAIT | M_ZERO);
513 1.1 rjs if (ccb == 0) {
514 1.1 rjs TFRC_DEBUG((LOG_INFO, "Unable to allocate memory for tfrc_send_ccb!\n"));
515 1.1 rjs return 0;
516 1.1 rjs }
517 1.1 rjs /* init sender */
518 1.1 rjs
519 1.1 rjs mutex_init(&(ccb->mutex), MUTEX_DEFAULT, IPL_SOFTNET);
520 1.1 rjs
521 1.1 rjs ccb->pcb = pcb;
522 1.1 rjs if (ccb->pcb->avgpsize >= TFRC_MIN_PACKET_SIZE && ccb->pcb->avgpsize <= TFRC_MAX_PACKET_SIZE)
523 1.1 rjs ccb->s = (u_int16_t) ccb->pcb->avgpsize;
524 1.1 rjs else
525 1.1 rjs ccb->s = TFRC_STD_PACKET_SIZE;
526 1.1 rjs
527 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Sender is using packet size %u\n", ccb->s));
528 1.1 rjs
529 1.1 rjs ccb->x.num = ccb->s; /* set transmissionrate to 1 packet per second */
530 1.1 rjs ccb->x.denom = 1;
531 1.1 rjs
532 1.1 rjs ccb->t_ld.tv_sec = -1;
533 1.1 rjs ccb->t_ld.tv_usec = 0;
534 1.1 rjs
535 1.1 rjs #ifdef TFRCDEBUG
536 1.1 rjs ccb->t_last_win_count.tv_sec = -1;
537 1.1 rjs #endif
538 1.1 rjs callout_init(&ccb->ch_stimer, 0);
539 1.1 rjs callout_init(&ccb->ch_nftimer, 0);
540 1.1 rjs
541 1.1 rjs /* init packet history */
542 1.1 rjs TAILQ_INIT(&(ccb->hist));
543 1.1 rjs
544 1.1 rjs ccb->state = TFRC_SSTATE_NO_SENT;
545 1.1 rjs
546 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC sender initialised!\n"));
547 1.1 rjs dccpstat.tfrcs_send_conn++;
548 1.1 rjs return ccb;
549 1.1 rjs }
550 1.1 rjs
551 1.1 rjs /*
552 1.1 rjs * Free the sender side
553 1.1 rjs * args: ccb - ccb of sender
554 1.1 rjs * Tested u:OK
555 1.1 rjs */
556 1.1 rjs void
557 1.1 rjs tfrc_send_free(void *ccb)
558 1.1 rjs {
559 1.1 rjs struct s_hist_entry *elm, *elm2;
560 1.1 rjs struct tfrc_send_ccb *cb = (struct tfrc_send_ccb *) ccb;
561 1.1 rjs
562 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC send free called!\n"));
563 1.1 rjs
564 1.1 rjs if (ccb == 0)
565 1.1 rjs return;
566 1.1 rjs
567 1.1 rjs /* uninit sender */
568 1.1 rjs
569 1.1 rjs /* get mutex */
570 1.1 rjs mutex_enter(&(cb->mutex));
571 1.1 rjs
572 1.1 rjs cb->state = TFRC_SSTATE_TERM;
573 1.1 rjs /* unschedule timers */
574 1.1 rjs callout_stop(&cb->ch_stimer);
575 1.1 rjs callout_stop(&cb->ch_nftimer);
576 1.1 rjs
577 1.1 rjs /* Empty packet history */
578 1.1 rjs elm = TAILQ_FIRST(&(cb->hist));
579 1.1 rjs while (elm != NULL) {
580 1.1 rjs elm2 = TAILQ_NEXT(elm, linfo);
581 1.1 rjs free(elm, M_TEMP); /* M_TEMP ?? */
582 1.1 rjs elm = elm2;
583 1.1 rjs }
584 1.1 rjs TAILQ_INIT(&(cb->hist));
585 1.1 rjs
586 1.1 rjs mutex_exit(&(cb->mutex));
587 1.1 rjs
588 1.1 rjs /* schedule the removal of ccb */
589 1.1 rjs callout_reset(&cb->ch_stimer, TFRC_SEND_WAIT_TERM * hz, tfrc_send_term, cb);
590 1.1 rjs }
591 1.1 rjs
592 1.1 rjs /*
593 1.1 rjs * Ask TFRC whether one can send a packet or not
594 1.1 rjs * args: ccb - ccb block for current connection
595 1.1 rjs * returns: 1 if ok, else 0.
596 1.1 rjs */
597 1.1 rjs int
598 1.1 rjs tfrc_send_packet(void *ccb, long datasize)
599 1.1 rjs {
600 1.1 rjs struct s_hist_entry *new_packet;
601 1.1 rjs u_int8_t answer = 0;
602 1.1 rjs u_int8_t win_count = 0;
603 1.1 rjs u_int32_t uw_win_count = 0;
604 1.1 rjs struct timeval t_now, t_temp;
605 1.1 rjs struct tfrc_send_ccb *cb = (struct tfrc_send_ccb *) ccb;
606 1.1 rjs #ifdef NOTFRCSENDER
607 1.1 rjs return 1;
608 1.1 rjs #endif
609 1.1 rjs
610 1.1 rjs /* check if pure ACK or Terminating */
611 1.1 rjs if (datasize == 0 || cb->state == TFRC_SSTATE_TERM) {
612 1.1 rjs return 1;
613 1.1 rjs } else if (cb->state == TFRC_SSTATE_TERM) {
614 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Asked to send packet when terminating!\n"));
615 1.1 rjs return 0;
616 1.1 rjs }
617 1.1 rjs /* we have data to send */
618 1.1 rjs mutex_enter(&(cb->mutex));
619 1.1 rjs
620 1.1 rjs /* check to see if we already have allocated memory last time */
621 1.1 rjs new_packet = TAILQ_FIRST(&(cb->hist));
622 1.1 rjs
623 1.1 rjs if ((new_packet != NULL && new_packet->t_sent.tv_sec >= 0) || new_packet == NULL) {
624 1.1 rjs /* check to see if we have memory to add to packet history */
625 1.1 rjs new_packet = malloc(sizeof(struct s_hist_entry), M_TEMP, M_NOWAIT); /* M_TEMP?? */
626 1.1 rjs if (new_packet == NULL) {
627 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Not enough memory to add packet to packet history (send refused)! (tfrc_send_packet)\n"));
628 1.1 rjs answer = 0;
629 1.1 rjs dccpstat.tfrcs_send_nomem++;
630 1.1 rjs goto sp_release;
631 1.1 rjs }
632 1.1 rjs new_packet->t_sent.tv_sec = -1; /* mark as unsent */
633 1.1 rjs TAILQ_INSERT_HEAD(&(cb->hist), new_packet, linfo);
634 1.1 rjs }
635 1.1 rjs switch (cb->state) {
636 1.1 rjs case TFRC_SSTATE_NO_SENT:
637 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - DCCP ask permission to send first data packet (tfrc_send_packet)\n"));
638 1.1 rjs microtime(&(cb->t_nom)); /* set nominal send time for initial packet */
639 1.1 rjs t_now = cb->t_nom;
640 1.1 rjs
641 1.1 rjs /* init feedback timer */
642 1.1 rjs
643 1.1 rjs callout_reset(&cb->ch_nftimer, TFRC_INITIAL_TIMEOUT * hz, tfrc_time_no_feedback, cb);
644 1.1 rjs win_count = 0;
645 1.1 rjs cb->t_last_win_count = t_now;
646 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Permission granted. Scheduled no feedback timer (initial) to expire in %u ticks (hz=%u) (tfrc_send_packet)\n", TFRC_INITIAL_TIMEOUT * hz, hz));
647 1.1 rjs /* start send timer */
648 1.1 rjs
649 1.1 rjs /* Calculate new t_ipi */
650 1.1 rjs CALCNEWTIPI(cb);
651 1.1 rjs timeradd(&cb->t_nom, &cb->t_ipi, &cb->t_nom);
652 1.1 rjs /* Calculate new delta */
653 1.1 rjs CALCNEWDELTA(cb);
654 1.1 rjs tfrc_set_send_timer(cb, t_now); /* if so schedule sendtimer */
655 1.1 rjs cb->state = TFRC_SSTATE_NO_FBACK;
656 1.1 rjs answer = 1;
657 1.1 rjs break;
658 1.1 rjs case TFRC_SSTATE_NO_FBACK:
659 1.1 rjs case TFRC_SSTATE_FBACK:
660 1.1 rjs if (!callout_pending(&cb->ch_stimer)) {
661 1.1 rjs microtime(&t_now);
662 1.1 rjs
663 1.1 rjs t_temp = t_now;
664 1.1 rjs timeradd(&t_temp, &cb->delta, &t_temp);
665 1.1 rjs
666 1.1 rjs if ((timercmp(&(t_temp), &(cb->t_nom), >))) {
667 1.1 rjs /* Packet can be sent */
668 1.1 rjs
669 1.1 rjs #ifdef TFRCDEBUG
670 1.1 rjs if (cb->t_last_win_count.tv_sec == -1)
671 1.1 rjs panic("TFRC - t_last_win_count unitialized (tfrc_send_packet)\n");
672 1.1 rjs #endif
673 1.1 rjs t_temp = t_now;
674 1.1 rjs timersub(&t_temp, &(cb->t_last_win_count), &t_temp);
675 1.1 rjs
676 1.1 rjs /* XXX calculate window counter */
677 1.1 rjs if (cb->state == TFRC_SSTATE_NO_FBACK) {
678 1.1 rjs /* Assume RTT = t_rto(initial)/4 */
679 1.1 rjs uw_win_count = (t_temp.tv_sec + (t_temp.tv_usec / 1000000))
680 1.1 rjs / TFRC_INITIAL_TIMEOUT / (4 * TFRC_WIN_COUNT_PER_RTT);
681 1.1 rjs } else {
682 1.1 rjs if (cb->rtt)
683 1.1 rjs uw_win_count = (t_temp.tv_sec * 1000000 + t_temp.tv_usec)
684 1.1 rjs / cb->rtt / TFRC_WIN_COUNT_PER_RTT;
685 1.1 rjs else
686 1.1 rjs uw_win_count = 0;
687 1.1 rjs }
688 1.1 rjs uw_win_count += cb->last_win_count;
689 1.1 rjs win_count = uw_win_count % TFRC_WIN_COUNT_LIMIT;
690 1.1 rjs answer = 1;
691 1.1 rjs } else {
692 1.1 rjs answer = 0;
693 1.1 rjs }
694 1.1 rjs } else {
695 1.1 rjs answer = 0;
696 1.1 rjs }
697 1.1 rjs break;
698 1.1 rjs default:
699 1.1 rjs panic("tfrc_send_packet: Illegal state!");
700 1.1 rjs break;
701 1.1 rjs }
702 1.1 rjs
703 1.1 rjs if (answer) {
704 1.1 rjs cb->pcb->ccval = win_count;
705 1.1 rjs new_packet->win_count = win_count;
706 1.1 rjs }
707 1.1 rjs
708 1.1 rjs sp_release:
709 1.1 rjs mutex_exit(&(cb->mutex));
710 1.1 rjs return answer;
711 1.1 rjs }
712 1.1 rjs /* Notify sender that a packet has been sent
713 1.1 rjs * args: ccb - ccb block for current connection
714 1.1 rjs * moreToSend - if there exists more packets to send
715 1.1 rjs * dataSize - packet size
716 1.1 rjs */
717 1.1 rjs void
718 1.1 rjs tfrc_send_packet_sent(void *ccb, int moreToSend, long datasize)
719 1.1 rjs {
720 1.1 rjs struct timeval t_now, t_temp;
721 1.1 rjs struct s_hist_entry *packet;
722 1.1 rjs struct tfrc_send_ccb *cb = (struct tfrc_send_ccb *) ccb;
723 1.1 rjs
724 1.1 rjs #ifdef NOTFRCSENDER
725 1.1 rjs return;
726 1.1 rjs #endif
727 1.1 rjs
728 1.1 rjs if (cb->state == TFRC_SSTATE_TERM) {
729 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Packet sent when terminating!\n"));
730 1.1 rjs return;
731 1.1 rjs }
732 1.1 rjs mutex_enter(&(cb->mutex));
733 1.1 rjs microtime(&t_now);
734 1.1 rjs
735 1.1 rjs /* check if we have sent a data packet */
736 1.1 rjs if (datasize > 0) {
737 1.1 rjs /* add send time to history */
738 1.1 rjs packet = TAILQ_FIRST(&(cb->hist));
739 1.1 rjs if (packet == NULL)
740 1.1 rjs panic("TFRC - Packet does not exist in history! (tfrc_send_packet_sent)");
741 1.1 rjs else if (packet != NULL && packet->t_sent.tv_sec >= 0)
742 1.1 rjs panic("TFRC - No unsent packet in history! (tfrc_send_packet_sent)");
743 1.1 rjs packet->t_sent = t_now;
744 1.1 rjs packet->seq = cb->pcb->seq_snd;
745 1.1 rjs /* check if win_count have changed */
746 1.1 rjs if (packet->win_count != cb->last_win_count) {
747 1.1 rjs cb->t_last_win_count = t_now;
748 1.1 rjs cb->last_win_count = packet->win_count;
749 1.1 rjs }
750 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Packet sent (%llu, %u, (%lu.%lu)",
751 1.1 rjs packet->seq, packet->win_count, packet->t_sent.tv_sec, packet->t_sent.tv_usec));
752 1.1 rjs cb->idle = 0;
753 1.1 rjs }
754 1.1 rjs
755 1.1 rjs /* if timer is running, do nothing */
756 1.1 rjs if (callout_pending(&cb->ch_stimer)) {
757 1.1 rjs goto sps_release;
758 1.1 rjs }
759 1.1 rjs
760 1.1 rjs switch (cb->state) {
761 1.1 rjs case TFRC_SSTATE_NO_SENT:
762 1.1 rjs /* if first was pure ack */
763 1.1 rjs if (datasize == 0) {
764 1.1 rjs goto sps_release;
765 1.1 rjs } else
766 1.1 rjs panic("TFRC - First packet sent is noted as a data packet in tfrc_send_packet_sent\n");
767 1.1 rjs break;
768 1.1 rjs case TFRC_SSTATE_NO_FBACK:
769 1.1 rjs case TFRC_SSTATE_FBACK:
770 1.1 rjs if (datasize <= 0) { /* we have ack (or simulate a sent
771 1.1 rjs * packet which never can have
772 1.1 rjs * moreToSend */
773 1.1 rjs moreToSend = 0;
774 1.1 rjs } else {
775 1.1 rjs /* Calculate new t_ipi */
776 1.1 rjs CALCNEWTIPI(cb);
777 1.1 rjs timeradd(&cb->t_nom, &cb->t_ipi, &cb->t_nom);
778 1.1 rjs /* Calculate new delta */
779 1.1 rjs CALCNEWDELTA(cb);
780 1.1 rjs }
781 1.1 rjs
782 1.1 rjs if (!moreToSend) {
783 1.1 rjs /* loop until we find a send time in the future */
784 1.1 rjs microtime(&t_now);
785 1.1 rjs t_temp = t_now;
786 1.1 rjs timeradd(&t_temp, &cb->delta, &t_temp);
787 1.1 rjs while ((timercmp(&(t_temp), &(cb->t_nom), >))) {
788 1.1 rjs /* Calculate new t_ipi */
789 1.1 rjs CALCNEWTIPI(cb);
790 1.1 rjs timeradd(&cb->t_nom, &cb->t_ipi, &cb->t_nom);
791 1.1 rjs
792 1.1 rjs /* Calculate new delta */
793 1.1 rjs CALCNEWDELTA(cb);
794 1.1 rjs
795 1.1 rjs microtime(&t_now);
796 1.1 rjs t_temp = t_now;
797 1.1 rjs timeradd(&t_temp, &cb->delta, &t_temp);
798 1.1 rjs }
799 1.1 rjs tfrc_set_send_timer(cb, t_now);
800 1.1 rjs } else {
801 1.1 rjs microtime(&t_now);
802 1.1 rjs t_temp = t_now;
803 1.1 rjs timeradd(&t_temp, &cb->delta, &t_temp);
804 1.1 rjs
805 1.1 rjs /* Check if next packet can not be sent immediately */
806 1.1 rjs if (!(timercmp(&(t_temp), &(cb->t_nom), >))) {
807 1.1 rjs tfrc_set_send_timer(cb, t_now); /* if so schedule sendtimer */
808 1.1 rjs }
809 1.1 rjs }
810 1.1 rjs break;
811 1.1 rjs default:
812 1.1 rjs panic("tfrc_send_packet_sent: Illegal state!");
813 1.1 rjs break;
814 1.1 rjs }
815 1.1 rjs
816 1.1 rjs sps_release:
817 1.1 rjs mutex_exit(&(cb->mutex));
818 1.1 rjs }
819 1.1 rjs /* Notify that a an ack package was received (i.e. a feedback packet)
820 1.1 rjs * args: ccb - ccb block for current connection
821 1.1 rjs */
822 1.1 rjs void
823 1.1 rjs tfrc_send_packet_recv(void *ccb, char *options, int optlen)
824 1.1 rjs {
825 1.1 rjs u_int32_t next_time_out;
826 1.1 rjs struct timeval t_now;
827 1.1 rjs struct fixpoint x,y;
828 1.1 rjs int res;
829 1.1 rjs u_int16_t t_elapsed = 0;
830 1.1 rjs u_int32_t t_elapsed_l = 0;
831 1.1 rjs u_int32_t pinv;
832 1.1 rjs u_int32_t x_recv;
833 1.1 rjs
834 1.1 rjs u_int32_t r_sample;
835 1.1 rjs
836 1.1 rjs struct s_hist_entry *elm, *elm2;
837 1.1 rjs struct tfrc_send_ccb *cb = (struct tfrc_send_ccb *) ccb;
838 1.1 rjs
839 1.1 rjs #ifdef NOTFRCSENDER
840 1.1 rjs return;
841 1.1 rjs #endif
842 1.1 rjs
843 1.1 rjs if (cb->state == TFRC_SSTATE_TERM) {
844 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Sender received a packet when terminating!\n"));
845 1.1 rjs return;
846 1.1 rjs }
847 1.1 rjs /* we are only interested in ACKs */
848 1.1 rjs if (!(cb->pcb->type_rcv == DCCP_TYPE_ACK || cb->pcb->type_rcv == DCCP_TYPE_DATAACK))
849 1.1 rjs return;
850 1.1 rjs
851 1.1 rjs res = dccp_get_option(options, optlen, TFRC_OPT_LOSS_RATE, (char *) &pinv, 6);
852 1.1 rjs if (res == 0) {
853 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Missing Loss rate option! (tfrc_send_packet_recv)\n"));
854 1.1 rjs dccpstat.tfrcs_send_noopt++;
855 1.1 rjs return;
856 1.1 rjs }
857 1.1 rjs
858 1.1 rjs res = dccp_get_option(options, optlen, DCCP_OPT_ELAPSEDTIME, (char *) &t_elapsed_l, 6);
859 1.1 rjs if (res == 0) {
860 1.1 rjs /* try 2 bytes elapsed time */
861 1.1 rjs res = dccp_get_option(options, optlen, DCCP_OPT_ELAPSEDTIME, (char *) &t_elapsed, 4);
862 1.1 rjs if (res == 0){
863 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Missing elapsed time option! (tfrc_send_packet_recv)\n"));
864 1.1 rjs dccpstat.tfrcs_send_noopt++;
865 1.1 rjs return;
866 1.1 rjs }
867 1.1 rjs }
868 1.1 rjs res = dccp_get_option(options, optlen, TFRC_OPT_RECEIVE_RATE, (char *) &x_recv, 4);
869 1.1 rjs if (res == 0) {
870 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Missing x_recv option! (tfrc_send_packet_recv)\n"));
871 1.1 rjs dccpstat.tfrcs_send_noopt++;
872 1.1 rjs return;
873 1.1 rjs }
874 1.1 rjs dccpstat.tfrcs_send_fbacks++;
875 1.1 rjs /* change byte order */
876 1.1 rjs if (t_elapsed)
877 1.1 rjs t_elapsed = ntohs(t_elapsed);
878 1.1 rjs else
879 1.1 rjs t_elapsed_l = ntohl(t_elapsed_l);
880 1.1 rjs x_recv = ntohl(x_recv);
881 1.1 rjs pinv = ntohl(pinv);
882 1.1 rjs if (pinv == 0xFFFFFFFF) pinv = 0;
883 1.1 rjs
884 1.1 rjs if (t_elapsed)
885 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Receieved options on ack %llu: pinv=%u, t_elapsed=%u, x_recv=%u ! (tfrc_send_packet_recv)\n", cb->pcb->ack_rcv, pinv, t_elapsed, x_recv));
886 1.1 rjs else
887 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Receieved options on ack %llu: pinv=%u, t_elapsed=%u, x_recv=%u ! (tfrc_send_packet_recv)\n", cb->pcb->ack_rcv, pinv, t_elapsed_l, x_recv));
888 1.1 rjs
889 1.1 rjs mutex_enter(&(cb->mutex));
890 1.1 rjs
891 1.1 rjs switch (cb->state) {
892 1.1 rjs case TFRC_SSTATE_NO_FBACK:
893 1.1 rjs case TFRC_SSTATE_FBACK:
894 1.1 rjs /* Calculate new round trip sample by R_sample = (t_now -
895 1.1 rjs * t_recvdata)-t_delay; */
896 1.1 rjs
897 1.1 rjs /* get t_recvdata from history */
898 1.1 rjs elm = TAILQ_FIRST(&(cb->hist));
899 1.1 rjs while (elm != NULL) {
900 1.1 rjs if (elm->seq == cb->pcb->ack_rcv)
901 1.1 rjs break;
902 1.1 rjs elm = TAILQ_NEXT(elm, linfo);
903 1.1 rjs }
904 1.1 rjs
905 1.1 rjs if (elm == NULL) {
906 1.1 rjs TFRC_DEBUG((LOG_INFO,
907 1.1 rjs "TFRC - Packet does not exist in history (seq=%llu)! (tfrc_send_packet_recv)", cb->pcb->ack_rcv));
908 1.1 rjs goto sar_release;
909 1.1 rjs }
910 1.1 rjs /* Update RTT */
911 1.1 rjs microtime(&t_now);
912 1.1 rjs timersub(&t_now, &(elm->t_sent), &t_now);
913 1.1 rjs r_sample = t_now.tv_sec * 1000000 + t_now.tv_usec;
914 1.1 rjs if (t_elapsed)
915 1.1 rjs r_sample = r_sample - ((u_int32_t) t_elapsed * 10); /* t_elapsed in us */
916 1.1 rjs else
917 1.1 rjs r_sample = r_sample - (t_elapsed_l * 10); /* t_elapsed in us */
918 1.1 rjs
919 1.1 rjs /* Update RTT estimate by If (No feedback recv) R = R_sample;
920 1.1 rjs * Else R = q*R+(1-q)*R_sample; */
921 1.1 rjs if (cb->state == TFRC_SSTATE_NO_FBACK) {
922 1.1 rjs cb->state = TFRC_SSTATE_FBACK;
923 1.1 rjs cb->rtt = r_sample;
924 1.1 rjs } else {
925 1.1 rjs cb->rtt = (u_int32_t) (TFRC_RTT_FILTER_CONST * cb->rtt +
926 1.1 rjs (1 - TFRC_RTT_FILTER_CONST) * r_sample);
927 1.1 rjs }
928 1.1 rjs
929 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - New RTT estimate %u (tfrc_send_packet_recv)\n", cb->rtt));
930 1.1 rjs
931 1.1 rjs /* Update timeout interval */
932 1.1 rjs cb->t_rto = 4 * cb->rtt;
933 1.1 rjs
934 1.1 rjs /* Update receive rate */
935 1.1 rjs x.num = x_recv;
936 1.1 rjs y.num = 8;
937 1.1 rjs x.denom = y.denom = 1;
938 1.1 rjs fixpoint_div(&(cb)->x_recv, &x, &y);
939 1.1 rjs
940 1.1 rjs /* Update loss event rate */
941 1.1 rjs if (pinv == 0) {
942 1.1 rjs cb->p.num = cb->p.denom = 0;
943 1.1 rjs } else {
944 1.1 rjs cb->p.num = 1.0;
945 1.1 rjs cb->p.denom = pinv;
946 1.1 rjs if (fixpoint_cmp(&cb->p, &tfrc_smallest_p) <= 0) {
947 1.1 rjs cb->p.num = tfrc_smallest_p.num;
948 1.1 rjs cb->p.denom = tfrc_smallest_p.denom;
949 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Smallest p used!\n"));
950 1.1 rjs }
951 1.1 rjs }
952 1.1 rjs
953 1.1 rjs /* unschedule no feedback timer */
954 1.1 rjs if (!callout_pending(&cb->ch_nftimer)) {
955 1.1 rjs callout_stop(&cb->ch_nftimer);
956 1.1 rjs }
957 1.1 rjs /* Update sending rate */
958 1.1 rjs microtime(&t_now);
959 1.1 rjs tfrc_updateX(cb, t_now);
960 1.1 rjs
961 1.1 rjs /* Update next send time */
962 1.1 rjs timersub(&cb->t_nom, &cb->t_ipi, &cb->t_nom);
963 1.1 rjs
964 1.1 rjs /* Calculate new t_ipi */
965 1.1 rjs CALCNEWTIPI(cb);
966 1.1 rjs timeradd(&cb->t_nom, &cb->t_ipi, &cb->t_nom);
967 1.1 rjs /* Calculate new delta */
968 1.1 rjs CALCNEWDELTA(cb);
969 1.1 rjs
970 1.1 rjs if (callout_pending(&cb->ch_stimer)) {
971 1.1 rjs callout_stop(&cb->ch_stimer);
972 1.1 rjs }
973 1.1 rjs
974 1.1 rjs #if 0 /* XXX do not send ack of ack so far */
975 1.1 rjs dccp_output(cb->pcb, 1);
976 1.1 rjs tfrc_send_packet_sent(cb, 0, -1); /* make sure we schedule next send time */
977 1.1 rjs #endif
978 1.1 rjs
979 1.1 rjs /* remove all packets older than the one acked from history */
980 1.1 rjs /* elm points to acked package! */
981 1.1 rjs
982 1.1 rjs elm2 = TAILQ_NEXT(elm, linfo);
983 1.1 rjs
984 1.1 rjs while (elm2 != NULL) {
985 1.1 rjs TAILQ_REMOVE(&(cb->hist), elm2, linfo);
986 1.1 rjs free(elm2, M_TEMP);
987 1.1 rjs elm2 = TAILQ_NEXT(elm, linfo);
988 1.1 rjs }
989 1.1 rjs
990 1.1 rjs /* Schedule no feedback timer to expire in max(4*R, 2*s/X) */
991 1.1 rjs /* next_time_out = (u_int32_t) (2 * cb->s * 1000000 / cb->x); */
992 1.1 rjs
993 1.1 rjs x.num = 2;
994 1.1 rjs x.denom = 1;
995 1.1 rjs y.num = cb->s;
996 1.1 rjs y.denom = 1;
997 1.1 rjs fixpoint_mul(&x, &x, &y);
998 1.1 rjs fixpoint_div(&x, &x, &(cb->x));
999 1.1 rjs x.num *= 1000000;
1000 1.1 rjs normalize(&x.num, &x.denom);
1001 1.1 rjs next_time_out = x.num / x.denom;
1002 1.1 rjs
1003 1.1 rjs if (next_time_out < cb->t_rto)
1004 1.1 rjs next_time_out = cb->t_rto;
1005 1.1 rjs TFRC_DEBUG_TIME((LOG_INFO,
1006 1.1 rjs "TFRC - Scheduled no feedback timer to expire in %u ticks (%u us) (hz=%u)(tfrc_send_packet_recv)\n",
1007 1.1 rjs next_time_out / (1000000 / hz), next_time_out, hz));
1008 1.1 rjs next_time_out = next_time_out / (1000000 / hz);
1009 1.1 rjs if (next_time_out == 0)
1010 1.1 rjs next_time_out = 1;
1011 1.1 rjs
1012 1.1 rjs callout_reset(&cb->ch_nftimer, next_time_out, tfrc_time_no_feedback, cb);
1013 1.1 rjs
1014 1.1 rjs /* set idle flag */
1015 1.1 rjs cb->idle = 1;
1016 1.1 rjs break;
1017 1.1 rjs default:
1018 1.1 rjs panic("tfrc_send_packet_recv: Illegal state!");
1019 1.1 rjs break;
1020 1.1 rjs }
1021 1.1 rjs sar_release:
1022 1.1 rjs mutex_exit(&(cb->mutex));
1023 1.1 rjs }
1024 1.1 rjs /* Receiver side */
1025 1.1 rjs
1026 1.1 rjs /* Forward declarations */
1027 1.1 rjs long tfrc_calclmean(struct tfrc_recv_ccb *);
1028 1.1 rjs void tfrc_recv_send_feedback(struct tfrc_recv_ccb *);
1029 1.1 rjs int tfrc_recv_add_hist(struct tfrc_recv_ccb *, struct r_hist_entry *);
1030 1.1 rjs void tfrc_recv_detectLoss(struct tfrc_recv_ccb *);
1031 1.1 rjs u_int32_t tfrc_recv_calcFirstLI(struct tfrc_recv_ccb *);
1032 1.1 rjs void tfrc_recv_updateLI(struct tfrc_recv_ccb *, long, u_int8_t);
1033 1.1 rjs
1034 1.1 rjs /* Weights used to calculate loss event rate */
1035 1.1 rjs /* const double tfrc_recv_w[] = { 1, 1, 1, 1, 0.8, 0.6, 0.4, 0.2}; */
1036 1.1 rjs const struct fixpoint tfrc_recv_w[] = {{1,1}, {1,1}, {1,1}, {1,1}, {4,5}, {3,5}, {2,5}, {1,5}};
1037 1.1 rjs
1038 1.1 rjs /* Find a data packet in history
1039 1.1 rjs * args: cb - ccb of receiver
1040 1.1 rjs * elm - pointer to element (variable)
1041 1.1 rjs * num - number in history (variable)
1042 1.1 rjs * returns: elm points to found packet, otherwise NULL
1043 1.1 rjs * Tested u:OK
1044 1.1 rjs */
1045 1.1 rjs #define TFRC_RECV_FINDDATAPACKET(cb,elm,num) \
1046 1.1 rjs do { \
1047 1.1 rjs elm = TAILQ_FIRST(&((cb)->hist)); \
1048 1.1 rjs while ((elm) != NULL) { \
1049 1.1 rjs if ((elm)->type == DCCP_TYPE_DATA || (elm)->type == DCCP_TYPE_DATAACK) \
1050 1.1 rjs (num)--; \
1051 1.1 rjs if (num == 0) \
1052 1.1 rjs break; \
1053 1.1 rjs elm = TAILQ_NEXT((elm), linfo); \
1054 1.1 rjs } \
1055 1.1 rjs } while (0)
1056 1.1 rjs
1057 1.1 rjs /* Find next data packet in history
1058 1.1 rjs * args: cb - ccb of receiver
1059 1.1 rjs * elm - pointer to element (variable)
1060 1.1 rjs * returns: elm points to found packet, otherwise NULL
1061 1.1 rjs * Tested u:OK
1062 1.1 rjs */
1063 1.1 rjs #define TFRC_RECV_NEXTDATAPACKET(cb,elm) \
1064 1.1 rjs do { \
1065 1.1 rjs if (elm != NULL) { \
1066 1.1 rjs elm = TAILQ_NEXT(elm, linfo); \
1067 1.1 rjs while ((elm) != NULL && (elm)->type != DCCP_TYPE_DATA && (elm)->type != DCCP_TYPE_DATAACK) { \
1068 1.1 rjs elm = TAILQ_NEXT((elm), linfo); \
1069 1.1 rjs } \
1070 1.1 rjs } \
1071 1.1 rjs } while (0)
1072 1.1 rjs
1073 1.1 rjs /*
1074 1.1 rjs * Calculate avarage loss Interval I_mean
1075 1.1 rjs * args: cb - ccb of receiver
1076 1.1 rjs * returns: avarage loss interval
1077 1.1 rjs * Tested u:OK
1078 1.1 rjs */
1079 1.1 rjs long
1080 1.1 rjs tfrc_calclmean(struct tfrc_recv_ccb * cb)
1081 1.1 rjs {
1082 1.1 rjs struct li_hist_entry *elm;
1083 1.1 rjs struct fixpoint l_tot;
1084 1.1 rjs struct fixpoint l_tot0 = {0,0};
1085 1.1 rjs struct fixpoint l_tot1 = {0,0};
1086 1.1 rjs struct fixpoint W_tot = {0, 0};
1087 1.1 rjs struct fixpoint tmp;
1088 1.1 rjs int i;
1089 1.1 rjs elm = TAILQ_FIRST(&(cb->li_hist));
1090 1.1 rjs
1091 1.1 rjs for (i = 0; i < TFRC_RECV_IVAL_F_LENGTH; i++) {
1092 1.1 rjs #ifdef TFRCDEBUG
1093 1.1 rjs if (elm == 0)
1094 1.1 rjs goto I_panic;
1095 1.1 rjs #endif
1096 1.1 rjs
1097 1.1 rjs /*
1098 1.1 rjs I_tot0 = I_tot0 + (elm->interval * tfrc_recv_w[i]);
1099 1.1 rjs W_tot = W_tot + tfrc_recv_w[i];
1100 1.1 rjs */
1101 1.1 rjs tmp.num = elm->interval;
1102 1.1 rjs tmp.denom = 1;
1103 1.1 rjs fixpoint_mul(&tmp, &tmp, &tfrc_recv_w[i]);
1104 1.1 rjs fixpoint_add(&l_tot0, &l_tot0, &tmp);
1105 1.1 rjs fixpoint_add(&W_tot, &W_tot, &tfrc_recv_w[i]);
1106 1.1 rjs
1107 1.1 rjs elm = TAILQ_NEXT(elm, linfo);
1108 1.1 rjs }
1109 1.1 rjs
1110 1.1 rjs elm = TAILQ_FIRST(&(cb->li_hist));
1111 1.1 rjs elm = TAILQ_NEXT(elm, linfo);
1112 1.1 rjs
1113 1.1 rjs for (i = 1; i <= TFRC_RECV_IVAL_F_LENGTH; i++) {
1114 1.1 rjs #ifdef TFRCDEBUG
1115 1.1 rjs if (elm == 0)
1116 1.1 rjs goto I_panic;
1117 1.1 rjs #endif
1118 1.1 rjs /*
1119 1.1 rjs I_tot1 = I_tot1 + (elm->interval * tfrc_recv_w[i - 1]);
1120 1.1 rjs */
1121 1.1 rjs tmp.num = elm->interval;
1122 1.1 rjs tmp.denom = 1;
1123 1.1 rjs fixpoint_mul(&tmp, &tmp, &tfrc_recv_w[i-1]);
1124 1.1 rjs fixpoint_add(&l_tot1, &l_tot1, &tmp);
1125 1.1 rjs
1126 1.1 rjs elm = TAILQ_NEXT(elm, linfo);
1127 1.1 rjs }
1128 1.1 rjs
1129 1.1 rjs /* I_tot = max(I_tot0, I_tot1) */
1130 1.1 rjs /*
1131 1.1 rjs I_tot = I_tot0;
1132 1.1 rjs if (I_tot0 < I_tot1)
1133 1.1 rjs I_tot = I_tot1;
1134 1.1 rjs
1135 1.1 rjs if (I_tot < W_tot)
1136 1.1 rjs I_tot = W_tot;
1137 1.1 rjs return (I_tot / W_tot);
1138 1.1 rjs */
1139 1.1 rjs
1140 1.1 rjs l_tot.num = l_tot0.num;
1141 1.1 rjs l_tot.denom = l_tot0.denom;
1142 1.1 rjs if (fixpoint_cmp(&l_tot0, &l_tot1) < 0){
1143 1.1 rjs l_tot.num = l_tot1.num;
1144 1.1 rjs l_tot.denom = l_tot1.denom;
1145 1.1 rjs }
1146 1.1 rjs
1147 1.1 rjs if (fixpoint_cmp(&l_tot, &W_tot) < 0){
1148 1.1 rjs l_tot.num = W_tot.num;
1149 1.1 rjs l_tot.denom = W_tot.denom;
1150 1.1 rjs }
1151 1.1 rjs fixpoint_div(&tmp, &l_tot, &W_tot);
1152 1.1 rjs return(fixpoint_getlong(&tmp));
1153 1.1 rjs
1154 1.1 rjs #ifdef TFRCDEBUG
1155 1.1 rjs I_panic:
1156 1.1 rjs panic("TFRC - Missing entry in interval history! (tfrc_calclmean)");
1157 1.1 rjs #endif
1158 1.1 rjs }
1159 1.1 rjs
1160 1.1 rjs /*
1161 1.1 rjs * Send a feedback packet
1162 1.1 rjs * args: cb - ccb for receiver
1163 1.1 rjs * Tested u:OK
1164 1.1 rjs */
1165 1.1 rjs void
1166 1.1 rjs tfrc_recv_send_feedback(struct tfrc_recv_ccb * cb)
1167 1.1 rjs {
1168 1.1 rjs u_int32_t x_recv, pinv;
1169 1.1 rjs u_int32_t t_elapsed;
1170 1.1 rjs struct r_hist_entry *elm;
1171 1.1 rjs struct fixpoint x;
1172 1.1 rjs struct timeval t_now, t_temp;
1173 1.1 rjs int num;
1174 1.1 rjs
1175 1.1 rjs x.num = 1;
1176 1.1 rjs x.denom = 4000000000LL; /* -> 1/p > 4 000 000 000 */
1177 1.1 rjs if (fixpoint_cmp(&cb->p, &x) < 0)
1178 1.1 rjs /* if (cb->p < 0.00000000025) -> 1/p > 4 000 000 000 */
1179 1.1 rjs pinv = 0xFFFFFFFF;
1180 1.1 rjs else {
1181 1.1 rjs /* pinv = (u_int32_t) (1.0 / cb->p); */
1182 1.1 rjs x.num = 1;
1183 1.1 rjs x.denom = 1;
1184 1.1 rjs fixpoint_div(&x, &x, &(cb)->p);
1185 1.1 rjs pinv = fixpoint_getlong(&x);
1186 1.1 rjs }
1187 1.1 rjs
1188 1.1 rjs switch (cb->state) {
1189 1.1 rjs case TFRC_RSTATE_NO_DATA:
1190 1.1 rjs x_recv = 0;
1191 1.1 rjs break;
1192 1.1 rjs case TFRC_RSTATE_DATA:
1193 1.1 rjs /* Calculate x_recv */
1194 1.1 rjs microtime(&t_temp);
1195 1.1 rjs timersub(&t_temp, &cb->t_last_feedback, &t_temp);
1196 1.1 rjs
1197 1.1 rjs x_recv = (u_int32_t) (cb->bytes_recv * 8 * 1000000) / (t_temp.tv_sec * 1000000 + t_temp.tv_usec);
1198 1.1 rjs
1199 1.1 rjs break;
1200 1.1 rjs default:
1201 1.1 rjs panic("tfrc_recv_send_feedback: Illegal state!");
1202 1.1 rjs break;
1203 1.1 rjs }
1204 1.1 rjs
1205 1.1 rjs /* Find largest win_count so far (data packet with highest seqnum so far) */
1206 1.1 rjs num = 1;
1207 1.1 rjs TFRC_RECV_FINDDATAPACKET(cb, elm, num);
1208 1.1 rjs
1209 1.1 rjs if (elm == NULL)
1210 1.1 rjs panic("No data packet in history! (tfrc_recv_send_feedback)");
1211 1.1 rjs
1212 1.1 rjs
1213 1.1 rjs microtime(&t_now);
1214 1.1 rjs timersub(&t_now, &elm->t_recv, &t_now);
1215 1.1 rjs t_elapsed = (u_int32_t) (t_now.tv_sec * 100000 + t_now.tv_usec / 10);
1216 1.1 rjs
1217 1.1 rjs /* change byte order */
1218 1.1 rjs t_elapsed = htonl(t_elapsed);
1219 1.1 rjs x_recv = htonl(x_recv);
1220 1.1 rjs pinv = htonl(pinv);
1221 1.1 rjs
1222 1.1 rjs /* add options from variables above */
1223 1.1 rjs if (dccp_add_option(cb->pcb, TFRC_OPT_LOSS_RATE, (char *) &pinv, 4)
1224 1.1 rjs || dccp_add_option(cb->pcb, DCCP_OPT_ELAPSEDTIME, (char *) &t_elapsed, 4)
1225 1.1 rjs || dccp_add_option(cb->pcb, TFRC_OPT_RECEIVE_RATE, (char *) &x_recv, 4)) {
1226 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Can't add options, aborting send feedback (tfrc_send_feedback)"));
1227 1.1 rjs /* todo: remove options */
1228 1.1 rjs dccpstat.tfrcs_recv_erropt++;
1229 1.1 rjs return;
1230 1.1 rjs }
1231 1.1 rjs cb->pcb->ack_snd = elm->seq;
1232 1.1 rjs cb->last_counter = elm->win_count;
1233 1.1 rjs cb->seq_last_counter = elm->seq;
1234 1.1 rjs microtime(&(cb->t_last_feedback));
1235 1.1 rjs cb->bytes_recv = 0;
1236 1.1 rjs
1237 1.1 rjs TFRC_DEBUG_TIME((LOG_INFO, "TFRC - Sending a feedback packet with (t_elapsed %u, pinv %x, x_recv %u, ack=%llu) (tfrc_recv_send_feedback)\n", ntohs(t_elapsed), ntohl(pinv), ntohl(x_recv), elm->seq));
1238 1.1 rjs
1239 1.1 rjs dccpstat.tfrcs_recv_fbacks++;
1240 1.1 rjs dccp_output(cb->pcb, 1);
1241 1.1 rjs }
1242 1.1 rjs /*
1243 1.1 rjs * Calculate first loss interval
1244 1.1 rjs * args: cb - ccb of the receiver
1245 1.1 rjs * returns: loss interval
1246 1.1 rjs * Tested u:OK
1247 1.1 rjs */
1248 1.1 rjs u_int32_t
1249 1.1 rjs tfrc_recv_calcFirstLI(struct tfrc_recv_ccb * cb)
1250 1.1 rjs {
1251 1.1 rjs struct r_hist_entry *elm, *elm2;
1252 1.1 rjs struct timeval t_temp;
1253 1.1 rjs int temp;
1254 1.1 rjs struct fixpoint x_recv, fval, t_rtt, x;
1255 1.1 rjs const struct fixpoint *fval2;
1256 1.1 rjs int win_count;
1257 1.1 rjs
1258 1.1 rjs temp = 1;
1259 1.1 rjs TFRC_RECV_FINDDATAPACKET(cb, elm, temp);
1260 1.1 rjs
1261 1.1 rjs if (elm == NULL)
1262 1.1 rjs panic("Packet history contains no data packets! (tfrc_recv_calcFirstLI)\n");
1263 1.1 rjs t_temp = elm->t_recv;
1264 1.1 rjs win_count = elm->win_count;
1265 1.1 rjs elm2 = elm;
1266 1.1 rjs TFRC_RECV_NEXTDATAPACKET(cb, elm2);
1267 1.1 rjs while (elm2 != NULL) {
1268 1.1 rjs temp = win_count - (int) (elm2->win_count);
1269 1.1 rjs if (temp < 0)
1270 1.1 rjs temp = temp + TFRC_WIN_COUNT_LIMIT;
1271 1.1 rjs
1272 1.1 rjs if (temp > 4)
1273 1.1 rjs break;
1274 1.1 rjs elm = elm2;
1275 1.1 rjs TFRC_RECV_NEXTDATAPACKET(cb, elm2);
1276 1.1 rjs }
1277 1.1 rjs
1278 1.1 rjs if (elm2 == NULL) {
1279 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Could not find a win_count interval > 4 \n"));
1280 1.1 rjs elm2 = elm;
1281 1.1 rjs if (temp == 0) {
1282 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Could not find a win_count interval > 0. Defaulting to 1 (tfrc_recv_calcFirstLI)\n"));
1283 1.1 rjs temp = 1;
1284 1.1 rjs }
1285 1.1 rjs }
1286 1.1 rjs timersub(&t_temp, &elm2->t_recv, &t_temp);
1287 1.1 rjs t_rtt.num = t_temp.tv_sec * 1000000 + t_temp.tv_usec;
1288 1.1 rjs t_rtt.denom = 1000000;
1289 1.1 rjs
1290 1.1 rjs if (t_rtt.num < 0 && t_rtt.denom < 0) {
1291 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Approximation of RTT is negative!\n"));
1292 1.1 rjs t_rtt.num = -t_rtt.num;
1293 1.1 rjs t_rtt.denom = -t_rtt.denom;
1294 1.1 rjs }
1295 1.1 rjs
1296 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Approximated rtt to "));
1297 1.1 rjs PRINTFLOAT(&t_rtt);
1298 1.1 rjs TFRC_DEBUG((LOG_INFO, " s (tfrc_recv_calcFirstLI)\n"));
1299 1.1 rjs
1300 1.1 rjs /* Calculate x_recv */
1301 1.1 rjs microtime(&t_temp);
1302 1.1 rjs timersub(&t_temp, &cb->t_last_feedback, &t_temp);
1303 1.1 rjs /*
1304 1.1 rjs x_recv = (((double) (cb->bytes_recv)) /
1305 1.1 rjs (((double) t_temp.tv_sec) + ((double) t_temp.tv_usec) / 1000000.0));
1306 1.1 rjs */
1307 1.1 rjs x_recv.num = cb->bytes_recv * 1000000;
1308 1.1 rjs x_recv.denom = t_temp.tv_sec * 1000000 + t_temp.tv_usec;
1309 1.1 rjs
1310 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Receive rate XXX"));
1311 1.1 rjs PRINTFLOAT(&x_recv);
1312 1.1 rjs TFRC_DEBUG((LOG_INFO, " bytes/s (tfrc_recv_calcFirstLI)\n"));
1313 1.1 rjs
1314 1.1 rjs /* fval = ((double) (cb->s)) / (x_recv * t_rtt); */
1315 1.1 rjs fval.num = cb->s;
1316 1.1 rjs fval.denom = 1;
1317 1.1 rjs fixpoint_div(&fval, &fval, &x_recv);
1318 1.1 rjs fixpoint_div(&fval, &fval, &t_rtt);
1319 1.1 rjs
1320 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Fvalue to locate XXX"));
1321 1.1 rjs PRINTFLOAT(&fval);
1322 1.1 rjs TFRC_DEBUG((LOG_INFO, " (tfrc_recv_calcFirstLI)\n"));
1323 1.1 rjs fval2 = tfrc_flookup_reverse(&fval);
1324 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Lookup gives p= XXX"));
1325 1.1 rjs PRINTFLOAT(&fval);
1326 1.1 rjs TFRC_DEBUG((LOG_INFO, " (tfrc_recv_calcFirstLI)\n"));
1327 1.1 rjs if (fval2->num == 0 && fval2->denom == 0)
1328 1.1 rjs return (u_int32_t) 0xFFFFFFFF;
1329 1.1 rjs x.num = x.denom = 1;
1330 1.1 rjs fixpoint_div(&x, &x, fval2);
1331 1.1 rjs return (u_int32_t) (fixpoint_getlong(&x));
1332 1.1 rjs }
1333 1.1 rjs /* Add packet to recv history (sorted on seqnum)
1334 1.1 rjs * Do not add packets that are already lost
1335 1.1 rjs * args: cb - ccb of receiver
1336 1.1 rjs * packet - packet to insert
1337 1.1 rjs * returns: 1 if the packet was considered lost, 0 otherwise
1338 1.1 rjs * Tested u:OK
1339 1.1 rjs */
1340 1.1 rjs int
1341 1.1 rjs tfrc_recv_add_hist(struct tfrc_recv_ccb * cb, struct r_hist_entry * packet)
1342 1.1 rjs {
1343 1.1 rjs struct r_hist_entry *elm, *elm2;
1344 1.1 rjs u_int8_t num_later = 0, win_count;
1345 1.1 rjs u_int32_t seq_num = packet->seq;
1346 1.1 rjs int temp;
1347 1.1 rjs
1348 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Adding packet (seq=%llu,win_count=%u,type=%u,ndp=%u) to history! (tfrc_recv_add_hist)\n", packet->seq, packet->win_count, packet->type, packet->ndp));
1349 1.1 rjs
1350 1.1 rjs if (TAILQ_EMPTY(&(cb->hist))) {
1351 1.1 rjs TAILQ_INSERT_HEAD(&(cb->hist), packet, linfo);
1352 1.1 rjs } else {
1353 1.1 rjs elm = TAILQ_FIRST(&(cb->hist));
1354 1.1 rjs if ((seq_num > elm->seq
1355 1.1 rjs && seq_num - elm->seq < TFRC_RECV_NEW_SEQ_RANGE) ||
1356 1.1 rjs (seq_num < elm->seq
1357 1.1 rjs && elm->seq - seq_num > DCCP_SEQ_NUM_LIMIT - TFRC_RECV_NEW_SEQ_RANGE)) {
1358 1.1 rjs TAILQ_INSERT_HEAD(&(cb->hist), packet, linfo);
1359 1.1 rjs } else {
1360 1.1 rjs if (elm->type == DCCP_TYPE_DATA || elm->type == DCCP_TYPE_DATAACK)
1361 1.1 rjs num_later = 1;
1362 1.1 rjs
1363 1.1 rjs elm2 = TAILQ_NEXT(elm, linfo);
1364 1.1 rjs while (elm2 != NULL) {
1365 1.1 rjs if ((seq_num > elm2->seq
1366 1.1 rjs && seq_num - elm2->seq < TFRC_RECV_NEW_SEQ_RANGE) ||
1367 1.1 rjs (seq_num < elm2->seq
1368 1.1 rjs && elm2->seq - seq_num > DCCP_SEQ_NUM_LIMIT - TFRC_RECV_NEW_SEQ_RANGE)) {
1369 1.1 rjs TAILQ_INSERT_AFTER(&(cb->hist), elm, packet, linfo);
1370 1.1 rjs break;
1371 1.1 rjs }
1372 1.1 rjs elm = elm2;
1373 1.1 rjs elm2 = TAILQ_NEXT(elm, linfo);
1374 1.1 rjs
1375 1.1 rjs if (elm->type == DCCP_TYPE_DATA || elm->type == DCCP_TYPE_DATAACK)
1376 1.1 rjs num_later++;
1377 1.1 rjs
1378 1.1 rjs if (num_later == TFRC_RECV_NUM_LATE_LOSS) {
1379 1.1 rjs free(packet, M_TEMP);
1380 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Packet already lost! (tfrc_recv_add_hist)\n"));
1381 1.1 rjs return 1;
1382 1.1 rjs break;
1383 1.1 rjs }
1384 1.1 rjs }
1385 1.1 rjs
1386 1.1 rjs if (elm2 == NULL && num_later < TFRC_RECV_NUM_LATE_LOSS) {
1387 1.1 rjs TAILQ_INSERT_TAIL(&(cb->hist), packet, linfo);
1388 1.1 rjs }
1389 1.1 rjs }
1390 1.1 rjs }
1391 1.1 rjs
1392 1.1 rjs /* trim history (remove all packets after the NUM_LATE_LOSS+1 data
1393 1.1 rjs * packets) */
1394 1.1 rjs if (TAILQ_FIRST(&(cb->li_hist)) != NULL) {
1395 1.1 rjs num_later = TFRC_RECV_NUM_LATE_LOSS + 1;
1396 1.1 rjs TFRC_RECV_FINDDATAPACKET(cb, elm, num_later);
1397 1.1 rjs if (elm != NULL) {
1398 1.1 rjs elm2 = TAILQ_NEXT(elm, linfo);
1399 1.1 rjs while (elm2 != NULL) {
1400 1.1 rjs TAILQ_REMOVE(&(cb->hist), elm2, linfo);
1401 1.1 rjs free(elm2, M_TEMP);
1402 1.1 rjs elm2 = TAILQ_NEXT(elm, linfo);
1403 1.1 rjs }
1404 1.1 rjs }
1405 1.1 rjs } else {
1406 1.1 rjs /* we have no loss interval history so we need at least one
1407 1.1 rjs * rtt:s of data packets to approximate rtt */
1408 1.1 rjs num_later = TFRC_RECV_NUM_LATE_LOSS + 1;
1409 1.1 rjs TFRC_RECV_FINDDATAPACKET(cb, elm2, num_later);
1410 1.1 rjs if (elm2 != NULL) {
1411 1.1 rjs num_later = 1;
1412 1.1 rjs TFRC_RECV_FINDDATAPACKET(cb, elm, num_later);
1413 1.1 rjs win_count = elm->win_count;
1414 1.1 rjs
1415 1.1 rjs elm = elm2;
1416 1.1 rjs TFRC_RECV_NEXTDATAPACKET(cb, elm2);
1417 1.1 rjs while (elm2 != NULL) {
1418 1.1 rjs temp = win_count - (int) (elm2->win_count);
1419 1.1 rjs if (temp < 0)
1420 1.1 rjs temp = temp + TFRC_WIN_COUNT_LIMIT;
1421 1.1 rjs
1422 1.1 rjs if (temp > TFRC_WIN_COUNT_PER_RTT + 1) {
1423 1.1 rjs /* we have found a packet older than
1424 1.1 rjs * one rtt remove the rest */
1425 1.1 rjs elm = TAILQ_NEXT(elm2, linfo);
1426 1.1 rjs
1427 1.1 rjs while (elm != NULL) {
1428 1.1 rjs TAILQ_REMOVE(&(cb->hist), elm, linfo);
1429 1.1 rjs free(elm, M_TEMP);
1430 1.1 rjs elm = TAILQ_NEXT(elm2, linfo);
1431 1.1 rjs }
1432 1.1 rjs break;
1433 1.1 rjs }
1434 1.1 rjs elm = elm2;
1435 1.1 rjs TFRC_RECV_NEXTDATAPACKET(cb, elm2);
1436 1.1 rjs }
1437 1.1 rjs } /* end if (exist atleast 4 data packets) */
1438 1.1 rjs }
1439 1.1 rjs
1440 1.1 rjs return 0;
1441 1.1 rjs }
1442 1.1 rjs /*
1443 1.1 rjs * Detect loss events and update loss interval history
1444 1.1 rjs * args: cb - ccb of the receiver
1445 1.1 rjs * Tested u:OK
1446 1.1 rjs */
1447 1.1 rjs void
1448 1.1 rjs tfrc_recv_detectLoss(struct tfrc_recv_ccb * cb)
1449 1.1 rjs {
1450 1.1 rjs struct r_hist_entry *bLoss, *aLoss, *elm, *elm2;
1451 1.1 rjs u_int8_t num_later = TFRC_RECV_NUM_LATE_LOSS;
1452 1.1 rjs long seq_temp = 0;
1453 1.1 rjs long seq_loss = -1;
1454 1.1 rjs u_int8_t win_loss = 0;
1455 1.1 rjs
1456 1.1 rjs TFRC_RECV_FINDDATAPACKET(cb, bLoss, num_later);
1457 1.1 rjs
1458 1.1 rjs if (bLoss == NULL) {
1459 1.1 rjs /* not enough packets yet to cause the first loss event */
1460 1.1 rjs } else { /* bloss != NULL */
1461 1.1 rjs num_later = TFRC_RECV_NUM_LATE_LOSS + 1;
1462 1.1 rjs TFRC_RECV_FINDDATAPACKET(cb, aLoss, num_later);
1463 1.1 rjs if (aLoss == NULL) {
1464 1.1 rjs if (TAILQ_EMPTY(&(cb->li_hist))) {
1465 1.1 rjs /* no loss event have occured yet */
1466 1.1 rjs
1467 1.1 rjs /* todo: find a lost data packet by comparing
1468 1.1 rjs * to initial seq num */
1469 1.1 rjs
1470 1.1 rjs } else {
1471 1.1 rjs panic("Less than 4 data packets in history (tfrc_recv_detecLossEvent)\n");
1472 1.1 rjs }
1473 1.1 rjs } else { /* aLoss != NULL */
1474 1.1 rjs /* locate a lost data packet */
1475 1.1 rjs elm = bLoss;
1476 1.1 rjs elm2 = TAILQ_NEXT(elm, linfo);
1477 1.1 rjs do {
1478 1.1 rjs seq_temp = ((long) (elm->seq)) - ((long) elm2->seq);
1479 1.1 rjs
1480 1.1 rjs if (seq_temp < 0)
1481 1.1 rjs seq_temp = seq_temp + DCCP_SEQ_NUM_LIMIT;
1482 1.1 rjs
1483 1.1 rjs if (seq_temp != 1) {
1484 1.1 rjs /* check no data packets */
1485 1.1 rjs if (elm->type == DCCP_TYPE_DATA || elm->type == DCCP_TYPE_DATAACK)
1486 1.1 rjs seq_temp = seq_temp - 1;
1487 1.1 rjs if (seq_temp % DCCP_NDP_LIMIT != ((int) elm->ndp - (int) elm2->ndp + DCCP_NDP_LIMIT) % DCCP_NDP_LIMIT)
1488 1.1 rjs seq_loss = (elm2->seq + 1) % DCCP_SEQ_NUM_LIMIT;
1489 1.1 rjs }
1490 1.1 rjs elm = elm2;
1491 1.1 rjs elm2 = TAILQ_NEXT(elm2, linfo);
1492 1.1 rjs } while (elm != aLoss);
1493 1.1 rjs
1494 1.1 rjs if (seq_loss != -1) {
1495 1.1 rjs win_loss = aLoss->win_count;
1496 1.1 rjs }
1497 1.1 rjs }
1498 1.1 rjs } /* end if (bLoss == NULL) */
1499 1.1 rjs tfrc_recv_updateLI(cb, seq_loss, win_loss);
1500 1.1 rjs }
1501 1.1 rjs /* Updates the loss interval history
1502 1.1 rjs * cb - congestion control block
1503 1.1 rjs * seq_loss - sequence number of lost packet (-1 for none)
1504 1.1 rjs * win_loss - window counter for previous (from the lost packet view) packet
1505 1.1 rjs * Tested u:OK
1506 1.1 rjs */
1507 1.1 rjs void
1508 1.1 rjs tfrc_recv_updateLI(struct tfrc_recv_ccb * cb, long seq_loss, u_int8_t win_loss)
1509 1.1 rjs {
1510 1.1 rjs struct r_hist_entry *elm;
1511 1.1 rjs struct li_hist_entry *li_elm, *li_elm2;
1512 1.1 rjs u_int8_t num_later = TFRC_RECV_NUM_LATE_LOSS;
1513 1.1 rjs long seq_temp = 0;
1514 1.1 rjs int i;
1515 1.1 rjs u_int8_t win_start;
1516 1.1 rjs int debug_info = 0;
1517 1.1 rjs if (seq_loss != -1) { /* we have found a packet loss! */
1518 1.1 rjs dccpstat.tfrcs_recv_losts++;
1519 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - seqloss=%i, winloss=%i\n", (int) seq_loss, (int) win_loss));
1520 1.1 rjs if (TAILQ_EMPTY(&(cb->li_hist))) {
1521 1.1 rjs debug_info = 1;
1522 1.1 rjs /* first loss detected */
1523 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - First loss event detected! (tfrc_recv_updateLI)\n"));
1524 1.1 rjs /* create history */
1525 1.1 rjs for (i = 0; i < TFRC_RECV_IVAL_F_LENGTH + 1; i++) {
1526 1.1 rjs li_elm = malloc(sizeof(struct li_hist_entry),
1527 1.1 rjs M_TEMP, M_NOWAIT | M_ZERO); /* M_TEMP?? */
1528 1.1 rjs if (li_elm == NULL) {
1529 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Not enough memory for loss interval history!\n"));
1530 1.1 rjs /* Empty loss interval history */
1531 1.1 rjs li_elm = TAILQ_FIRST(&(cb->li_hist));
1532 1.1 rjs while (li_elm != NULL) {
1533 1.1 rjs li_elm2 = TAILQ_NEXT(li_elm, linfo);
1534 1.1 rjs free(li_elm, M_TEMP); /* M_TEMP ?? */
1535 1.1 rjs li_elm = li_elm2;
1536 1.1 rjs }
1537 1.1 rjs return;
1538 1.1 rjs }
1539 1.1 rjs TAILQ_INSERT_HEAD(&(cb->li_hist), li_elm, linfo);
1540 1.1 rjs }
1541 1.1 rjs
1542 1.1 rjs li_elm->seq = seq_loss;
1543 1.1 rjs li_elm->win_count = win_loss;
1544 1.1 rjs
1545 1.1 rjs li_elm = TAILQ_NEXT(li_elm, linfo);
1546 1.1 rjs /* add approx interval */
1547 1.1 rjs li_elm->interval = tfrc_recv_calcFirstLI(cb);
1548 1.1 rjs
1549 1.1 rjs } else { /* we have a loss interval history */
1550 1.1 rjs debug_info = 2;
1551 1.1 rjs /* Check if the loss is in the same loss event as
1552 1.1 rjs * interval start */
1553 1.1 rjs win_start = (TAILQ_FIRST(&(cb->li_hist)))->win_count;
1554 1.1 rjs if ((win_loss > win_start
1555 1.1 rjs && win_loss - win_start > TFRC_WIN_COUNT_PER_RTT) ||
1556 1.1 rjs (win_loss < win_start
1557 1.1 rjs && win_start - win_loss < TFRC_WIN_COUNT_LIMIT - TFRC_WIN_COUNT_PER_RTT)) {
1558 1.1 rjs /* new loss event detected */
1559 1.1 rjs /* calculate last interval length */
1560 1.1 rjs seq_temp = seq_loss - ((long) ((TAILQ_FIRST(&(cb->li_hist)))->seq));
1561 1.1 rjs if (seq_temp < 0)
1562 1.1 rjs seq_temp = seq_temp + DCCP_SEQ_NUM_LIMIT;
1563 1.1 rjs
1564 1.1 rjs (TAILQ_FIRST(&(cb->li_hist)))->interval = seq_temp;
1565 1.1 rjs
1566 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - New loss event detected!, interval %i (tfrc_recv_updateLI)\n", (int) seq_temp));
1567 1.1 rjs /* Remove oldest interval */
1568 1.1 rjs li_elm = TAILQ_LAST(&(cb->li_hist), li_hist_head);
1569 1.1 rjs TAILQ_REMOVE(&(cb->li_hist), li_elm, linfo);
1570 1.1 rjs
1571 1.1 rjs /* Create the newest interval */
1572 1.1 rjs li_elm->seq = seq_loss;
1573 1.1 rjs li_elm->win_count = win_loss;
1574 1.1 rjs
1575 1.1 rjs /* insert it into history */
1576 1.1 rjs TAILQ_INSERT_HEAD(&(cb->li_hist), li_elm, linfo);
1577 1.1 rjs } else
1578 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Loss belongs to previous loss event (tfrc_recv_updateLI)!\n"));
1579 1.1 rjs }
1580 1.1 rjs }
1581 1.1 rjs if (TAILQ_FIRST(&(cb->li_hist)) != NULL) {
1582 1.1 rjs /* calculate interval to last loss event */
1583 1.1 rjs num_later = 1;
1584 1.1 rjs TFRC_RECV_FINDDATAPACKET(cb, elm, num_later);
1585 1.1 rjs
1586 1.1 rjs seq_temp = ((long) (elm->seq)) -
1587 1.1 rjs ((long) ((TAILQ_FIRST(&(cb->li_hist)))->seq));
1588 1.1 rjs if (seq_temp < 0)
1589 1.1 rjs seq_temp = seq_temp + DCCP_SEQ_NUM_LIMIT;
1590 1.1 rjs
1591 1.1 rjs (TAILQ_FIRST(&(cb->li_hist)))->interval = seq_temp;
1592 1.1 rjs if (debug_info > 0) {
1593 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Highest data packet received %llu (tfrc_recv_updateLI)\n", elm->seq));
1594 1.1 rjs }
1595 1.1 rjs }
1596 1.1 rjs }
1597 1.1 rjs
1598 1.1 rjs
1599 1.1 rjs /* Functions declared in struct dccp_cc_sw */
1600 1.1 rjs /* Initialises the receiver side
1601 1.1 rjs * returns: pointer to a tfrc_recv_ccb struct on success, otherwise 0
1602 1.1 rjs * Tested u:OK
1603 1.1 rjs */
1604 1.1 rjs void *
1605 1.1 rjs tfrc_recv_init(struct dccpcb * pcb)
1606 1.1 rjs {
1607 1.1 rjs struct tfrc_recv_ccb *ccb;
1608 1.1 rjs
1609 1.1 rjs ccb = malloc(sizeof(struct tfrc_recv_ccb), M_PCB, M_NOWAIT | M_ZERO);
1610 1.1 rjs if (ccb == 0) {
1611 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Unable to allocate memory for tfrc_recv_ccb!\n"));
1612 1.1 rjs return 0;
1613 1.1 rjs }
1614 1.1 rjs /* init recv here */
1615 1.1 rjs
1616 1.1 rjs mutex_init(&(ccb->mutex), MUTEX_DEFAULT, IPL_SOFTNET);
1617 1.1 rjs
1618 1.1 rjs ccb->pcb = pcb;
1619 1.1 rjs
1620 1.1 rjs if (ccb->pcb->avgpsize >= TFRC_MIN_PACKET_SIZE && ccb->pcb->avgpsize <= TFRC_MAX_PACKET_SIZE)
1621 1.1 rjs ccb->s = (u_int16_t) ccb->pcb->avgpsize;
1622 1.1 rjs else
1623 1.1 rjs ccb->s = TFRC_STD_PACKET_SIZE;
1624 1.1 rjs
1625 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Receiver is using packet size %u\n", ccb->s));
1626 1.1 rjs
1627 1.1 rjs /* init packet history */
1628 1.1 rjs TAILQ_INIT(&(ccb->hist));
1629 1.1 rjs
1630 1.1 rjs /* init loss interval history */
1631 1.1 rjs TAILQ_INIT(&(ccb->li_hist));
1632 1.1 rjs
1633 1.1 rjs ccb->state = TFRC_RSTATE_NO_DATA;
1634 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC receiver initialised!\n"));
1635 1.1 rjs dccpstat.tfrcs_recv_conn++;
1636 1.1 rjs return ccb;
1637 1.1 rjs }
1638 1.1 rjs /* Free the receiver side
1639 1.1 rjs * args: ccb - ccb of recevier
1640 1.1 rjs * Tested u:OK
1641 1.1 rjs */
1642 1.1 rjs void
1643 1.1 rjs tfrc_recv_free(void *ccb)
1644 1.1 rjs {
1645 1.1 rjs struct r_hist_entry *elm, *elm2;
1646 1.1 rjs struct li_hist_entry *li_elm, *li_elm2;
1647 1.1 rjs struct tfrc_recv_ccb *cb = (struct tfrc_recv_ccb *) ccb;
1648 1.1 rjs
1649 1.1 rjs if (ccb == 0)
1650 1.1 rjs panic("TFRC - Receiver ccb is null! (free)");
1651 1.1 rjs
1652 1.1 rjs /* uninit recv here */
1653 1.1 rjs
1654 1.1 rjs cb->state = TFRC_RSTATE_TERM;
1655 1.1 rjs /* get mutex */
1656 1.1 rjs mutex_enter(&(cb->mutex));
1657 1.1 rjs
1658 1.1 rjs /* Empty packet history */
1659 1.1 rjs elm = TAILQ_FIRST(&(cb->hist));
1660 1.1 rjs while (elm != NULL) {
1661 1.1 rjs elm2 = TAILQ_NEXT(elm, linfo);
1662 1.1 rjs free(elm, M_TEMP); /* M_TEMP ?? */
1663 1.1 rjs elm = elm2;
1664 1.1 rjs }
1665 1.1 rjs TAILQ_INIT(&(cb->hist));
1666 1.1 rjs
1667 1.1 rjs /* Empty loss interval history */
1668 1.1 rjs li_elm = TAILQ_FIRST(&(cb->li_hist));
1669 1.1 rjs while (li_elm != NULL) {
1670 1.1 rjs li_elm2 = TAILQ_NEXT(li_elm, linfo);
1671 1.1 rjs free(li_elm, M_TEMP); /* M_TEMP ?? */
1672 1.1 rjs li_elm = li_elm2;
1673 1.1 rjs }
1674 1.1 rjs TAILQ_INIT(&(cb->li_hist));
1675 1.1 rjs
1676 1.1 rjs mutex_exit(&(cb->mutex));
1677 1.1 rjs mutex_destroy(&(cb->mutex));
1678 1.1 rjs
1679 1.1 rjs free(ccb, M_PCB);
1680 1.1 rjs
1681 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC receiver is destroyed\n"));
1682 1.1 rjs }
1683 1.1 rjs
1684 1.1 rjs
1685 1.1 rjs /*
1686 1.1 rjs * Tell TFRC that a packet has been received
1687 1.1 rjs * args: ccb - ccb block for current connection
1688 1.1 rjs */
1689 1.1 rjs void
1690 1.1 rjs tfrc_recv_packet_recv(void *ccb, char *options, int optlen)
1691 1.1 rjs {
1692 1.1 rjs struct r_hist_entry *packet;
1693 1.1 rjs u_int8_t win_count = 0;
1694 1.1 rjs struct fixpoint p_prev;
1695 1.1 rjs int ins = 0;
1696 1.1 rjs struct tfrc_recv_ccb *cb = (struct tfrc_recv_ccb *) ccb;
1697 1.1 rjs
1698 1.1 rjs #ifdef NOTFRCRECV
1699 1.1 rjs return;
1700 1.1 rjs #endif
1701 1.1 rjs
1702 1.1 rjs if (!(cb->state == TFRC_RSTATE_NO_DATA || cb->state == TFRC_RSTATE_DATA)) {
1703 1.1 rjs panic("TFRC - Illegal state! (tfrc_recv_packet_recv)\n");
1704 1.1 rjs return;
1705 1.1 rjs }
1706 1.1 rjs /* Check which type */
1707 1.1 rjs switch (cb->pcb->type_rcv) {
1708 1.1 rjs case DCCP_TYPE_ACK:
1709 1.1 rjs if (cb->state == TFRC_RSTATE_NO_DATA)
1710 1.1 rjs return;
1711 1.1 rjs break;
1712 1.1 rjs case DCCP_TYPE_DATA:
1713 1.1 rjs case DCCP_TYPE_DATAACK:
1714 1.1 rjs break;
1715 1.1 rjs default:
1716 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Received not data/dataack/ack packet! (tfrc_recv_packet_recv)"));
1717 1.1 rjs return;
1718 1.1 rjs }
1719 1.1 rjs
1720 1.1 rjs mutex_enter(&(cb->mutex));
1721 1.1 rjs
1722 1.1 rjs /* Add packet to history */
1723 1.1 rjs
1724 1.1 rjs packet = malloc(sizeof(struct r_hist_entry), M_TEMP, M_NOWAIT); /* M_TEMP?? */
1725 1.1 rjs if (packet == NULL) {
1726 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Not enough memory to add received packet to history (consider it lost)! (tfrc_recv_packet_recv)"));
1727 1.1 rjs dccpstat.tfrcs_recv_nomem++;
1728 1.1 rjs goto rp_release;
1729 1.1 rjs }
1730 1.1 rjs microtime(&(packet->t_recv));
1731 1.1 rjs packet->seq = cb->pcb->seq_rcv;
1732 1.1 rjs packet->type = cb->pcb->type_rcv;
1733 1.1 rjs packet->ndp = cb->pcb->ndp_rcv;
1734 1.1 rjs
1735 1.1 rjs /* get window counter */
1736 1.1 rjs win_count = cb->pcb->ccval;
1737 1.1 rjs packet->win_count = win_count;
1738 1.1 rjs
1739 1.1 rjs ins = tfrc_recv_add_hist(cb, packet);
1740 1.1 rjs
1741 1.1 rjs /* check if we got a data packet */
1742 1.1 rjs if (cb->pcb->type_rcv != DCCP_TYPE_ACK) {
1743 1.1 rjs
1744 1.1 rjs switch (cb->state) {
1745 1.1 rjs case TFRC_RSTATE_NO_DATA:
1746 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Send an inital feedback packet (tfrc_recv_packet_recv)\n"));
1747 1.1 rjs tfrc_recv_send_feedback(cb);
1748 1.1 rjs cb->state = TFRC_RSTATE_DATA;
1749 1.1 rjs break;
1750 1.1 rjs case TFRC_RSTATE_DATA:
1751 1.1 rjs cb->bytes_recv = cb->bytes_recv + cb->pcb->len_rcv;
1752 1.1 rjs if (!ins) {
1753 1.1 rjs /* find loss event */
1754 1.1 rjs tfrc_recv_detectLoss(cb);
1755 1.1 rjs p_prev.num = cb->p.num;
1756 1.1 rjs p_prev.denom = cb->p.denom;
1757 1.1 rjs
1758 1.1 rjs /* Calculate loss event rate */
1759 1.1 rjs if (!TAILQ_EMPTY(&(cb->li_hist))) {
1760 1.1 rjs cb->p.num = 1;
1761 1.1 rjs cb->p.denom = tfrc_calclmean(cb);
1762 1.1 rjs }
1763 1.1 rjs /* check send conditions then send */
1764 1.1 rjs
1765 1.1 rjs if (fixpoint_cmp(&(cb)->p, &p_prev) > 0) {
1766 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Send a feedback packet because p>p_prev (tfrc_recv_packet_recv)\n"));
1767 1.1 rjs tfrc_recv_send_feedback(cb);
1768 1.1 rjs } else {
1769 1.1 rjs if ((cb->pcb->seq_rcv > cb->seq_last_counter
1770 1.1 rjs && cb->pcb->seq_rcv - cb->seq_last_counter < TFRC_RECV_NEW_SEQ_RANGE) ||
1771 1.1 rjs (cb->pcb->seq_rcv < cb->seq_last_counter
1772 1.1 rjs && cb->seq_last_counter - cb->pcb->seq_rcv > DCCP_SEQ_NUM_LIMIT - TFRC_RECV_NEW_SEQ_RANGE)) {
1773 1.1 rjs
1774 1.1 rjs /* the sequence number is
1775 1.1 rjs * newer than seq_last_count */
1776 1.1 rjs if ((win_count > cb->last_counter
1777 1.1 rjs && win_count - cb->last_counter > TFRC_WIN_COUNT_PER_RTT) ||
1778 1.1 rjs (win_count < cb->last_counter
1779 1.1 rjs && cb->last_counter - win_count < TFRC_WIN_COUNT_LIMIT - TFRC_WIN_COUNT_PER_RTT)) {
1780 1.1 rjs
1781 1.1 rjs TFRC_DEBUG((LOG_INFO, "TFRC - Send a feedback packet (%i)(win_count larger) (tfrc_recv_packet_recv)\n", (win_count - cb->last_counter + TFRC_WIN_COUNT_LIMIT) % TFRC_WIN_COUNT_LIMIT));
1782 1.1 rjs
1783 1.1 rjs tfrc_recv_send_feedback(cb);
1784 1.1 rjs }
1785 1.1 rjs } /* end newer seqnum */
1786 1.1 rjs } /* end p > p_prev */
1787 1.1 rjs
1788 1.1 rjs }
1789 1.1 rjs break;
1790 1.1 rjs default:
1791 1.1 rjs panic("tfrc_recv_packet_recv: Illegal state!");
1792 1.1 rjs break;
1793 1.1 rjs }
1794 1.1 rjs
1795 1.1 rjs } /* end if not pure ack */
1796 1.1 rjs rp_release:
1797 1.1 rjs mutex_exit(&(cb->mutex));
1798 1.1 rjs }
1799 1.1 rjs
1800 1.1 rjs
1801 1.1 rjs /*
1802 1.1 rjs * fixpoint routines
1803 1.1 rjs */
1804 1.1 rjs static void
1805 1.1 rjs normalize(long long *num, long long *denom)
1806 1.1 rjs {
1807 1.1 rjs static const int prime[] = { 2, 3, 5, 7, 11, 13, 17, 19, 0 };
1808 1.1 rjs int i;
1809 1.1 rjs
1810 1.1 rjs if (!*denom) return;
1811 1.1 rjs if (*denom < 0) {
1812 1.1 rjs *num *= (-1);
1813 1.1 rjs *denom *= (-1);
1814 1.1 rjs }
1815 1.1 rjs
1816 1.1 rjs if (*num % *denom == 0) {
1817 1.1 rjs *num /= *denom;
1818 1.1 rjs *denom = 1;
1819 1.1 rjs }
1820 1.1 rjs for (i = 0; prime[i]; i++)
1821 1.1 rjs while (*num % prime[i] == 0 && *denom % prime[i] == 0) {
1822 1.1 rjs *num /= prime[i];
1823 1.1 rjs *denom /= prime[i];
1824 1.1 rjs }
1825 1.1 rjs }
1826 1.1 rjs
1827 1.1 rjs struct fixpoint *
1828 1.1 rjs fixpoint_add(struct fixpoint *x, const struct fixpoint *a,
1829 1.1 rjs const struct fixpoint *b)
1830 1.1 rjs {
1831 1.1 rjs long long num, denom;
1832 1.1 rjs
1833 1.1 rjs num = a->num * b->denom + a->denom * b->num;
1834 1.1 rjs denom = a->denom * b->denom;
1835 1.1 rjs normalize(&num, &denom);
1836 1.1 rjs
1837 1.1 rjs x->num = num;
1838 1.1 rjs x->denom = denom;
1839 1.1 rjs return (x);
1840 1.1 rjs }
1841 1.1 rjs
1842 1.1 rjs struct fixpoint *
1843 1.1 rjs fixpoint_sub(struct fixpoint *x, const struct fixpoint *a,
1844 1.1 rjs const struct fixpoint *b)
1845 1.1 rjs {
1846 1.1 rjs long long num, denom;
1847 1.1 rjs
1848 1.1 rjs if (!a->denom) {
1849 1.1 rjs x->num = -1 * b->num;
1850 1.1 rjs x->denom = -1 * b->denom;
1851 1.1 rjs return (x);
1852 1.1 rjs }
1853 1.1 rjs if (!b->denom) {
1854 1.1 rjs x->num = a->num;
1855 1.1 rjs x->denom = a->denom;
1856 1.1 rjs return (x);
1857 1.1 rjs }
1858 1.1 rjs num = a->num * b->denom - a->denom * b->num;
1859 1.1 rjs denom = a->denom * b->denom;
1860 1.1 rjs normalize(&num, &denom);
1861 1.1 rjs
1862 1.1 rjs x->num = num;
1863 1.1 rjs x->denom = denom;
1864 1.1 rjs return (x);
1865 1.1 rjs }
1866 1.1 rjs
1867 1.1 rjs int
1868 1.1 rjs fixpoint_cmp(const struct fixpoint *a, const struct fixpoint *b)
1869 1.1 rjs {
1870 1.1 rjs struct fixpoint x;
1871 1.1 rjs
1872 1.1 rjs fixpoint_sub(&x, a, b);
1873 1.1 rjs if (x.num > 0)
1874 1.1 rjs return (1);
1875 1.1 rjs else if (x.num < 0)
1876 1.1 rjs return (-1);
1877 1.1 rjs else
1878 1.1 rjs return (0);
1879 1.1 rjs }
1880 1.1 rjs
1881 1.1 rjs struct fixpoint *
1882 1.1 rjs fixpoint_mul(struct fixpoint *x, const struct fixpoint *a,
1883 1.1 rjs const struct fixpoint *b)
1884 1.1 rjs {
1885 1.1 rjs long long num, denom;
1886 1.1 rjs
1887 1.1 rjs num = a->num * b->num;
1888 1.1 rjs denom = a->denom * b->denom;
1889 1.1 rjs normalize(&num, &denom);
1890 1.1 rjs
1891 1.1 rjs x->num = num;
1892 1.1 rjs x->denom = denom;
1893 1.1 rjs return (x);
1894 1.1 rjs }
1895 1.1 rjs
1896 1.1 rjs struct fixpoint *
1897 1.1 rjs fixpoint_div(struct fixpoint *x, const struct fixpoint *a,
1898 1.1 rjs const struct fixpoint *b)
1899 1.1 rjs {
1900 1.1 rjs long long num, denom;
1901 1.1 rjs
1902 1.1 rjs num = a->num * b->denom;
1903 1.1 rjs denom = a->denom * b->num;
1904 1.1 rjs normalize(&num, &denom);
1905 1.1 rjs
1906 1.1 rjs x->num = num;
1907 1.1 rjs x->denom = denom;
1908 1.1 rjs return (x);
1909 1.1 rjs }
1910 1.1 rjs
1911 1.1 rjs long
1912 1.1 rjs fixpoint_getlong(const struct fixpoint *x)
1913 1.1 rjs {
1914 1.1 rjs
1915 1.1 rjs if (x->denom == 0)
1916 1.1 rjs return (0);
1917 1.1 rjs return (x->num / x->denom);
1918 1.1 rjs }
1919 1.1 rjs
1920 1.1 rjs const struct fixpoint flargex = { 2LL, 1000LL };
1921 1.1 rjs const struct fixpoint fsmallx = { 1LL, 100000LL };
1922 1.1 rjs const struct fixpoint fsmallstep = { 4LL, 1000000LL };
1923 1.1 rjs
1924 1.1 rjs /*
1925 1.1 rjs * FLOOKUP macro. NOTE! 0<=(int x)<=1
1926 1.1 rjs * Tested u:OK
1927 1.1 rjs */
1928 1.1 rjs const struct fixpoint *
1929 1.1 rjs flookup(const struct fixpoint *x)
1930 1.1 rjs {
1931 1.1 rjs static const struct fixpoint y = { 250000, 1 };
1932 1.1 rjs struct fixpoint z;
1933 1.1 rjs int i;
1934 1.1 rjs
1935 1.1 rjs if (fixpoint_cmp(x, &flargex) >= 0) {
1936 1.1 rjs if (x->num == 0)
1937 1.1 rjs return NULL;
1938 1.1 rjs i = x->denom / x->num;
1939 1.1 rjs #ifdef TFRCDEBUG
1940 1.1 rjs if (i >= sizeof(flarge_table) / sizeof(flarge_table[0]))
1941 1.1 rjs panic("flarge_table lookup failed");
1942 1.1 rjs #endif
1943 1.1 rjs
1944 1.1 rjs return &flarge_table[i];
1945 1.1 rjs } else {
1946 1.1 rjs fixpoint_mul(&z, x, &y);
1947 1.1 rjs if (z.num == 0)
1948 1.1 rjs return NULL;
1949 1.1 rjs i = fixpoint_getlong(&z);
1950 1.1 rjs #ifdef TFRCDEBUG
1951 1.1 rjs if (i >= sizeof(fsmall_table) / sizeof(fsmall_table[0]))
1952 1.1 rjs panic("fsmall_table lookup failed");
1953 1.1 rjs #endif
1954 1.1 rjs
1955 1.1 rjs return &fsmall_table[i];
1956 1.1 rjs }
1957 1.1 rjs }
1958 1.1 rjs
1959 1.1 rjs /*
1960 1.1 rjs * Inverse of the FLOOKUP above
1961 1.1 rjs * args: fvalue - function value to match
1962 1.1 rjs * returns: p closest to that value
1963 1.1 rjs * Tested u:OK
1964 1.1 rjs */
1965 1.1 rjs const struct fixpoint *
1966 1.1 rjs tfrc_flookup_reverse(const struct fixpoint *fvalue)
1967 1.1 rjs {
1968 1.1 rjs static struct fixpoint x;
1969 1.1 rjs int ctr;
1970 1.1 rjs
1971 1.1 rjs if (fixpoint_cmp(fvalue, &flarge_table[1]) >= 0) {
1972 1.1 rjs /* 1.0 */
1973 1.1 rjs x.num = 1;
1974 1.1 rjs x.denom = 1;
1975 1.1 rjs return &x;
1976 1.1 rjs } else if (fixpoint_cmp(fvalue, &flarge_table[sizeof(flarge_table) /
1977 1.1 rjs sizeof(flarge_table[0]) - 1]) >= 0) {
1978 1.1 rjs ctr = sizeof(flarge_table) / sizeof(flarge_table[0]) - 1;
1979 1.1 rjs while (ctr > 1 && fixpoint_cmp(fvalue, &flarge_table[ctr]) >= 0)
1980 1.1 rjs ctr--;
1981 1.1 rjs
1982 1.1 rjs /* round to smallest */
1983 1.1 rjs ctr = ctr + 1;
1984 1.1 rjs
1985 1.1 rjs /* round to nearest */
1986 1.1 rjs return &flarge_table[ctr];
1987 1.1 rjs } else if (fixpoint_cmp(fvalue, &fsmall_table[0]) >= 0) {
1988 1.1 rjs ctr = 0;
1989 1.1 rjs while (ctr < sizeof(fsmall_table) / sizeof(fsmall_table[0]) &&
1990 1.1 rjs fixpoint_cmp(fvalue, &fsmall_table[ctr]) > 0)
1991 1.1 rjs ctr++;
1992 1.1 rjs x = fsmallstep;
1993 1.1 rjs x.num *= ctr;
1994 1.1 rjs return &x;
1995 1.1 rjs }
1996 1.1 rjs return &fsmallstep;
1997 1.1 rjs }
1998