dccp ccid-3: Simplify computing and range-checking of t_ipi
[linux-2.6/verdex.git] / net / dccp / ccids / ccid3.c
blob7cd76c6c790c1cb53b36d81a2480e4e910ad4174
1 /*
2 * net/dccp/ccids/ccid3.c
4 * Copyright (c) 2007 The University of Aberdeen, Scotland, UK
5 * Copyright (c) 2005-7 The University of Waikato, Hamilton, New Zealand.
6 * Copyright (c) 2005-7 Ian McDonald <ian.mcdonald@jandi.co.nz>
8 * An implementation of the DCCP protocol
10 * This code has been developed by the University of Waikato WAND
11 * research group. For further information please see http://www.wand.net.nz/
13 * This code also uses code from Lulea University, rereleased as GPL by its
14 * authors:
15 * Copyright (c) 2003 Nils-Erik Mattsson, Joacim Haggmark, Magnus Erixzon
17 * Changes to meet Linux coding standards, to make it meet latest ccid3 draft
18 * and to make it work as a loadable module in the DCCP stack written by
19 * Arnaldo Carvalho de Melo <acme@conectiva.com.br>.
21 * Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@conectiva.com.br>
23 * This program is free software; you can redistribute it and/or modify
24 * it under the terms of the GNU General Public License as published by
25 * the Free Software Foundation; either version 2 of the License, or
26 * (at your option) any later version.
28 * This program is distributed in the hope that it will be useful,
29 * but WITHOUT ANY WARRANTY; without even the implied warranty of
30 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
31 * GNU General Public License for more details.
33 * You should have received a copy of the GNU General Public License
34 * along with this program; if not, write to the Free Software
35 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
37 #include "../dccp.h"
38 #include "ccid3.h"
40 #include <asm/unaligned.h>
42 #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
43 static int ccid3_debug;
44 #define ccid3_pr_debug(format, a...) DCCP_PR_DEBUG(ccid3_debug, format, ##a)
45 #else
46 #define ccid3_pr_debug(format, a...)
47 #endif
50 * Transmitter Half-Connection Routines
54 * Compute the initial sending rate X_init in the manner of RFC 3390:
56 * X_init = min(4 * MPS, max(2 * MPS, 4380 bytes)) / RTT
58 * For consistency with other parts of the code, X_init is scaled by 2^6.
60 static inline u64 rfc3390_initial_rate(struct sock *sk)
62 const u32 mps = dccp_sk(sk)->dccps_mss_cache,
63 w_init = clamp(4380U, 2 * mps, 4 * mps);
65 return scaled_div(w_init << 6, ccid3_hc_tx_sk(sk)->rtt);
68 /**
69 * ccid3_update_send_interval - Calculate new t_ipi = s / X
70 * This respects the granularity of X (64 * bytes/second) and enforces the
71 * scaled minimum of s * 64 / t_mbi = `s' bytes/second as per RFC 3448/4342.
73 static void ccid3_update_send_interval(struct ccid3_hc_tx_sock *hctx)
75 if (unlikely(hctx->x <= hctx->s))
76 hctx->x = hctx->s;
77 hctx->t_ipi = scaled_div32(((u64)hctx->s) << 6, hctx->x);
80 static u32 ccid3_hc_tx_idle_rtt(struct ccid3_hc_tx_sock *hctx, ktime_t now)
82 u32 delta = ktime_us_delta(now, hctx->t_last_win_count);
84 return delta / hctx->rtt;
87 /**
88 * ccid3_hc_tx_update_x - Update allowed sending rate X
89 * @stamp: most recent time if available - can be left NULL.
90 * This function tracks draft rfc3448bis, check there for latest details.
92 * Note: X and X_recv are both stored in units of 64 * bytes/second, to support
93 * fine-grained resolution of sending rates. This requires scaling by 2^6
94 * throughout the code. Only X_calc is unscaled (in bytes/second).
97 static void ccid3_hc_tx_update_x(struct sock *sk, ktime_t *stamp)
99 struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
100 u64 min_rate = 2 * hctx->x_recv;
101 const u64 old_x = hctx->x;
102 ktime_t now = stamp ? *stamp : ktime_get_real();
105 * Handle IDLE periods: do not reduce below RFC3390 initial sending rate
106 * when idling [RFC 4342, 5.1]. Definition of idling is from rfc3448bis:
107 * a sender is idle if it has not sent anything over a 2-RTT-period.
108 * For consistency with X and X_recv, min_rate is also scaled by 2^6.
110 if (ccid3_hc_tx_idle_rtt(hctx, now) >= 2) {
111 min_rate = rfc3390_initial_rate(sk);
112 min_rate = max(min_rate, 2 * hctx->x_recv);
115 if (hctx->p > 0) {
117 hctx->x = min(((u64)hctx->x_calc) << 6, min_rate);
119 } else if (ktime_us_delta(now, hctx->t_ld) - (s64)hctx->rtt >= 0) {
121 hctx->x = min(2 * hctx->x, min_rate);
122 hctx->x = max(hctx->x,
123 scaled_div(((u64)hctx->s) << 6, hctx->rtt));
124 hctx->t_ld = now;
127 if (hctx->x != old_x) {
128 ccid3_pr_debug("X_prev=%u, X_now=%u, X_calc=%u, "
129 "X_recv=%u\n", (unsigned)(old_x >> 6),
130 (unsigned)(hctx->x >> 6), hctx->x_calc,
131 (unsigned)(hctx->x_recv >> 6));
133 ccid3_update_send_interval(hctx);
138 * ccid3_hc_tx_measure_packet_size - Measuring the packet size `s' (sec 4.1)
139 * @new_len: DCCP payload size in bytes (not used by all methods)
141 static u32 ccid3_hc_tx_measure_packet_size(struct sock *sk, const u16 new_len)
143 #if defined(CONFIG_IP_DCCP_CCID3_MEASURE_S_AS_AVG)
144 return tfrc_ewma(ccid3_hc_tx_sk(sk)->s, new_len, 9);
145 #elif defined(CONFIG_IP_DCCP_CCID3_MEASURE_S_AS_MAX)
146 return max(ccid3_hc_tx_sk(sk)->s, new_len);
147 #else /* CONFIG_IP_DCCP_CCID3_MEASURE_S_AS_MPS */
148 return dccp_sk(sk)->dccps_mss_cache;
149 #endif
153 * Update Window Counter using the algorithm from [RFC 4342, 8.1].
154 * As elsewhere, RTT > 0 is assumed by using dccp_sample_rtt().
156 static inline void ccid3_hc_tx_update_win_count(struct ccid3_hc_tx_sock *hctx,
157 ktime_t now)
159 u32 delta = ktime_us_delta(now, hctx->t_last_win_count),
160 quarter_rtts = (4 * delta) / hctx->rtt;
162 if (quarter_rtts > 0) {
163 hctx->t_last_win_count = now;
164 hctx->last_win_count += min(quarter_rtts, 5U);
165 hctx->last_win_count &= 0xF; /* mod 16 */
169 static void ccid3_hc_tx_no_feedback_timer(unsigned long data)
171 struct sock *sk = (struct sock *)data;
172 struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
173 unsigned long t_nfb = USEC_PER_SEC / 5;
175 bh_lock_sock(sk);
176 if (sock_owned_by_user(sk)) {
177 /* Try again later. */
178 /* XXX: set some sensible MIB */
179 goto restart_timer;
182 ccid3_pr_debug("%s(%p) entry with%s feedback\n", dccp_role(sk), sk,
183 hctx->feedback ? "" : "out");
185 /* Ignore and do not restart after leaving the established state */
186 if ((1 << sk->sk_state) & ~(DCCPF_OPEN | DCCPF_PARTOPEN))
187 goto out;
189 /* Reset feedback state to "no feedback received" */
190 hctx->feedback = false;
193 * Determine new allowed sending rate X as per draft rfc3448bis-00, 4.4
194 * RTO is 0 if and only if no feedback has been received yet.
196 if (hctx->t_rto == 0 || hctx->p == 0) {
198 /* halve send rate directly */
199 hctx->x /= 2;
200 ccid3_update_send_interval(hctx);
202 } else {
204 * Modify the cached value of X_recv
206 * If (X_calc > 2 * X_recv)
207 * X_recv = max(X_recv / 2, s / (2 * t_mbi));
208 * Else
209 * X_recv = X_calc / 4;
211 * Note that X_recv is scaled by 2^6 while X_calc is not
213 BUG_ON(hctx->p && !hctx->x_calc);
215 if (hctx->x_calc > (hctx->x_recv >> 5))
216 hctx->x_recv /= 2;
217 else {
218 hctx->x_recv = hctx->x_calc;
219 hctx->x_recv <<= 4;
221 ccid3_hc_tx_update_x(sk, NULL);
223 ccid3_pr_debug("Reduced X to %llu/64 bytes/sec\n",
224 (unsigned long long)hctx->x);
227 * Set new timeout for the nofeedback timer.
228 * See comments in packet_recv() regarding the value of t_RTO.
230 if (unlikely(hctx->t_rto == 0)) /* no feedback received yet */
231 t_nfb = TFRC_INITIAL_TIMEOUT;
232 else
233 t_nfb = max(hctx->t_rto, 2 * hctx->t_ipi);
235 restart_timer:
236 sk_reset_timer(sk, &hctx->no_feedback_timer,
237 jiffies + usecs_to_jiffies(t_nfb));
238 out:
239 bh_unlock_sock(sk);
240 sock_put(sk);
244 * ccid3_hc_tx_send_packet - Delay-based dequeueing of TX packets
245 * @skb: next packet candidate to send on @sk
246 * This function uses the convention of ccid_packet_dequeue_eval() and
247 * returns a millisecond-delay value between 0 and t_mbi = 64000 msec.
249 static int ccid3_hc_tx_send_packet(struct sock *sk, struct sk_buff *skb)
251 struct dccp_sock *dp = dccp_sk(sk);
252 struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
253 ktime_t now = ktime_get_real();
254 s64 delay;
257 * This function is called only for Data and DataAck packets. Sending
258 * zero-sized Data(Ack)s is theoretically possible, but for congestion
259 * control this case is pathological - ignore it.
261 if (unlikely(skb->len == 0))
262 return -EBADMSG;
264 if (hctx->s == 0) {
265 sk_reset_timer(sk, &hctx->no_feedback_timer, (jiffies +
266 usecs_to_jiffies(TFRC_INITIAL_TIMEOUT)));
267 hctx->last_win_count = 0;
268 hctx->t_last_win_count = now;
270 /* Set t_0 for initial packet */
271 hctx->t_nom = now;
274 * Use initial RTT sample when available: recommended by erratum
275 * to RFC 4342. This implements the initialisation procedure of
276 * draft rfc3448bis, section 4.2. Remember, X is scaled by 2^6.
278 if (dp->dccps_syn_rtt) {
279 ccid3_pr_debug("SYN RTT = %uus\n", dp->dccps_syn_rtt);
280 hctx->rtt = dp->dccps_syn_rtt;
281 hctx->x = rfc3390_initial_rate(sk);
282 hctx->t_ld = now;
283 } else {
285 * Sender does not have RTT sample:
286 * - set fallback RTT (RFC 4340, 3.4) since a RTT value
287 * is needed in several parts (e.g. window counter);
288 * - set sending rate X_pps = 1pps as per RFC 3448, 4.2.
290 hctx->rtt = DCCP_FALLBACK_RTT;
291 hctx->x = dp->dccps_mss_cache;
292 hctx->x <<= 6;
295 /* Compute t_ipi = s / X */
296 hctx->s = ccid3_hc_tx_measure_packet_size(sk, skb->len);
297 ccid3_update_send_interval(hctx);
299 } else {
300 delay = ktime_us_delta(hctx->t_nom, now);
301 ccid3_pr_debug("delay=%ld\n", (long)delay);
303 * Scheduling of packet transmissions [RFC 3448, 4.6]
305 * if (t_now > t_nom - delta)
306 * // send the packet now
307 * else
308 * // send the packet in (t_nom - t_now) milliseconds.
310 if (delay >= TFRC_T_DELTA)
311 return (u32)delay / USEC_PER_MSEC;
313 ccid3_hc_tx_update_win_count(hctx, now);
316 /* prepare to send now (add options etc.) */
317 dp->dccps_hc_tx_insert_options = 1;
318 DCCP_SKB_CB(skb)->dccpd_ccval = hctx->last_win_count;
320 /* set the nominal send time for the next following packet */
321 hctx->t_nom = ktime_add_us(hctx->t_nom, hctx->t_ipi);
322 return CCID_PACKET_SEND_AT_ONCE;
325 static void ccid3_hc_tx_packet_sent(struct sock *sk, unsigned int len)
327 struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
329 /* Changes to s will become effective the next time X is computed */
330 hctx->s = ccid3_hc_tx_measure_packet_size(sk, len);
332 if (tfrc_tx_hist_add(&hctx->hist, dccp_sk(sk)->dccps_gss))
333 DCCP_CRIT("packet history - out of memory!");
336 static void ccid3_hc_tx_packet_recv(struct sock *sk, struct sk_buff *skb)
338 struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
339 struct tfrc_tx_hist_entry *acked;
340 ktime_t now;
341 unsigned long t_nfb;
342 u32 r_sample;
344 /* we are only interested in ACKs */
345 if (!(DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_ACK ||
346 DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_DATAACK))
347 return;
349 * Locate the acknowledged packet in the TX history.
351 * Returning "entry not found" here can for instance happen when
352 * - the host has not sent out anything (e.g. a passive server),
353 * - the Ack is outdated (packet with higher Ack number was received),
354 * - it is a bogus Ack (for a packet not sent on this connection).
356 acked = tfrc_tx_hist_find_entry(hctx->hist, dccp_hdr_ack_seq(skb));
357 if (acked == NULL)
358 return;
359 /* For the sake of RTT sampling, ignore/remove all older entries */
360 tfrc_tx_hist_purge(&acked->next);
362 /* Update the moving average for the RTT estimate (RFC 3448, 4.3) */
363 now = ktime_get_real();
364 r_sample = dccp_sample_rtt(sk, ktime_us_delta(now, acked->stamp));
365 hctx->rtt = tfrc_ewma(hctx->rtt, r_sample, 9);
368 * Update allowed sending rate X as per draft rfc3448bis-00, 4.2/3
370 if (!hctx->feedback) {
371 hctx->feedback = true;
373 if (hctx->t_rto == 0) {
375 * Initial feedback packet: Larger Initial Windows (4.2)
377 hctx->x = rfc3390_initial_rate(sk);
378 hctx->t_ld = now;
380 ccid3_update_send_interval(hctx);
382 goto done_computing_x;
383 } else if (hctx->p == 0) {
385 * First feedback after nofeedback timer expiry (4.3)
387 goto done_computing_x;
391 /* Update sending rate (step 4 of [RFC 3448, 4.3]) */
392 if (hctx->p > 0)
393 hctx->x_calc = tfrc_calc_x(hctx->s, hctx->rtt, hctx->p);
394 ccid3_hc_tx_update_x(sk, &now);
396 done_computing_x:
397 ccid3_pr_debug("%s(%p), RTT=%uus (sample=%uus), s=%u, "
398 "p=%u, X_calc=%u, X_recv=%u, X=%u\n",
399 dccp_role(sk), sk, hctx->rtt, r_sample,
400 hctx->s, hctx->p, hctx->x_calc,
401 (unsigned)(hctx->x_recv >> 6),
402 (unsigned)(hctx->x >> 6));
404 /* unschedule no feedback timer */
405 sk_stop_timer(sk, &hctx->no_feedback_timer);
408 * As we have calculated new ipi, delta, t_nom it is possible
409 * that we now can send a packet, so wake up dccp_wait_for_ccid
411 sk->sk_write_space(sk);
414 * Update timeout interval for the nofeedback timer.
415 * We use a configuration option to increase the lower bound.
416 * This can help avoid triggering the nofeedback timer too
417 * often ('spinning') on LANs with small RTTs.
419 hctx->t_rto = max_t(u32, 4 * hctx->rtt, (CONFIG_IP_DCCP_CCID3_RTO *
420 (USEC_PER_SEC / 1000)));
422 * Schedule no feedback timer to expire in
423 * max(t_RTO, 2 * s/X) = max(t_RTO, 2 * t_ipi)
425 t_nfb = max(hctx->t_rto, 2 * hctx->t_ipi);
427 ccid3_pr_debug("%s(%p), Scheduled no feedback timer to "
428 "expire in %lu jiffies (%luus)\n",
429 dccp_role(sk), sk, usecs_to_jiffies(t_nfb), t_nfb);
431 sk_reset_timer(sk, &hctx->no_feedback_timer,
432 jiffies + usecs_to_jiffies(t_nfb));
435 static int ccid3_hc_tx_parse_options(struct sock *sk, u8 packet_type,
436 u8 option, u8 *optval, u8 optlen)
438 struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
439 __be32 opt_val;
441 switch (option) {
442 case TFRC_OPT_RECEIVE_RATE:
443 case TFRC_OPT_LOSS_EVENT_RATE:
444 /* Must be ignored on Data packets, cf. RFC 4342 8.3 and 8.5 */
445 if (packet_type == DCCP_PKT_DATA)
446 break;
447 if (unlikely(optlen != 4)) {
448 DCCP_WARN("%s(%p), invalid len %d for %u\n",
449 dccp_role(sk), sk, optlen, option);
450 return -EINVAL;
452 opt_val = ntohl(get_unaligned((__be32 *)optval));
454 if (option == TFRC_OPT_RECEIVE_RATE) {
455 /* Receive Rate is kept in units of 64 bytes/second */
456 hctx->x_recv = opt_val;
457 hctx->x_recv <<= 6;
459 ccid3_pr_debug("%s(%p), RECEIVE_RATE=%u\n",
460 dccp_role(sk), sk, opt_val);
461 } else {
462 /* Update the fixpoint Loss Event Rate fraction */
463 hctx->p = tfrc_invert_loss_event_rate(opt_val);
465 ccid3_pr_debug("%s(%p), LOSS_EVENT_RATE=%u\n",
466 dccp_role(sk), sk, opt_val);
469 return 0;
472 static int ccid3_hc_tx_init(struct ccid *ccid, struct sock *sk)
474 struct ccid3_hc_tx_sock *hctx = ccid_priv(ccid);
476 hctx->hist = NULL;
477 setup_timer(&hctx->no_feedback_timer,
478 ccid3_hc_tx_no_feedback_timer, (unsigned long)sk);
479 return 0;
482 static void ccid3_hc_tx_exit(struct sock *sk)
484 struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
486 sk_stop_timer(sk, &hctx->no_feedback_timer);
487 tfrc_tx_hist_purge(&hctx->hist);
490 static void ccid3_hc_tx_get_info(struct sock *sk, struct tcp_info *info)
492 info->tcpi_rto = ccid3_hc_tx_sk(sk)->t_rto;
493 info->tcpi_rtt = ccid3_hc_tx_sk(sk)->rtt;
496 static int ccid3_hc_tx_getsockopt(struct sock *sk, const int optname, int len,
497 u32 __user *optval, int __user *optlen)
499 const struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
500 struct tfrc_tx_info tfrc;
501 const void *val;
503 switch (optname) {
504 case DCCP_SOCKOPT_CCID_TX_INFO:
505 if (len < sizeof(tfrc))
506 return -EINVAL;
507 tfrc.tfrctx_x = hctx->x;
508 tfrc.tfrctx_x_recv = hctx->x_recv;
509 tfrc.tfrctx_x_calc = hctx->x_calc;
510 tfrc.tfrctx_rtt = hctx->rtt;
511 tfrc.tfrctx_p = hctx->p;
512 tfrc.tfrctx_rto = hctx->t_rto;
513 tfrc.tfrctx_ipi = hctx->t_ipi;
514 len = sizeof(tfrc);
515 val = &tfrc;
516 break;
517 default:
518 return -ENOPROTOOPT;
521 if (put_user(len, optlen) || copy_to_user(optval, val, len))
522 return -EFAULT;
524 return 0;
528 * Receiver Half-Connection Routines
530 static void ccid3_hc_rx_send_feedback(struct sock *sk,
531 const struct sk_buff *skb,
532 enum ccid3_fback_type fbtype)
534 struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
536 switch (fbtype) {
537 case CCID3_FBACK_INITIAL:
538 hcrx->x_recv = 0;
539 hcrx->p_inverse = ~0U; /* see RFC 4342, 8.5 */
540 break;
541 case CCID3_FBACK_PARAM_CHANGE:
542 if (unlikely(hcrx->feedback == CCID3_FBACK_NONE)) {
544 * rfc3448bis-06, 6.3.1: First packet(s) lost or marked
545 * FIXME: in rfc3448bis the receiver returns X_recv=0
546 * here as it normally would in the first feedback packet.
547 * However this is not possible yet, since the code still
548 * uses RFC 3448, i.e.
549 * If (p > 0)
550 * Calculate X_calc using the TCP throughput equation.
551 * X = max(min(X_calc, 2*X_recv), s/t_mbi);
552 * would bring X down to s/t_mbi. That is why we return
553 * X_recv according to rfc3448bis-06 for the moment.
555 u32 s = tfrc_rx_hist_packet_size(&hcrx->hist),
556 rtt = tfrc_rx_hist_rtt(&hcrx->hist);
558 hcrx->x_recv = scaled_div32(s, 2 * rtt);
559 break;
562 * When parameters change (new loss or p > p_prev), we do not
563 * have a reliable estimate for R_m of [RFC 3448, 6.2] and so
564 * always check whether at least RTT time units were covered.
566 hcrx->x_recv = tfrc_rx_hist_x_recv(&hcrx->hist, hcrx->x_recv);
567 break;
568 case CCID3_FBACK_PERIODIC:
570 * Step (2) of rfc3448bis-06, 6.2:
571 * - if no data packets have been received, just restart timer
572 * - if data packets have been received, re-compute X_recv
574 if (hcrx->hist.bytes_recvd == 0)
575 goto prepare_for_next_time;
576 hcrx->x_recv = tfrc_rx_hist_x_recv(&hcrx->hist, hcrx->x_recv);
577 break;
578 default:
579 return;
582 ccid3_pr_debug("X_recv=%u, 1/p=%u\n", hcrx->x_recv, hcrx->p_inverse);
584 dccp_sk(sk)->dccps_hc_rx_insert_options = 1;
585 dccp_send_ack(sk);
587 prepare_for_next_time:
588 tfrc_rx_hist_restart_byte_counter(&hcrx->hist);
589 hcrx->last_counter = dccp_hdr(skb)->dccph_ccval;
590 hcrx->feedback = fbtype;
593 static int ccid3_hc_rx_insert_options(struct sock *sk, struct sk_buff *skb)
595 const struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
596 __be32 x_recv, pinv;
598 if (!(sk->sk_state == DCCP_OPEN || sk->sk_state == DCCP_PARTOPEN))
599 return 0;
601 if (dccp_packet_without_ack(skb))
602 return 0;
604 x_recv = htonl(hcrx->x_recv);
605 pinv = htonl(hcrx->p_inverse);
607 if (dccp_insert_option(sk, skb, TFRC_OPT_LOSS_EVENT_RATE,
608 &pinv, sizeof(pinv)) ||
609 dccp_insert_option(sk, skb, TFRC_OPT_RECEIVE_RATE,
610 &x_recv, sizeof(x_recv)))
611 return -1;
613 return 0;
616 /** ccid3_first_li - Implements [RFC 3448, 6.3.1]
618 * Determine the length of the first loss interval via inverse lookup.
619 * Assume that X_recv can be computed by the throughput equation
621 * X_recv = --------
622 * R * fval
623 * Find some p such that f(p) = fval; return 1/p (scaled).
625 static u32 ccid3_first_li(struct sock *sk)
627 struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
628 u32 s = tfrc_rx_hist_packet_size(&hcrx->hist),
629 rtt = tfrc_rx_hist_rtt(&hcrx->hist), x_recv, p;
630 u64 fval;
633 * rfc3448bis-06, 6.3.1: First data packet(s) are marked or lost. Set p
634 * to give the equivalent of X_target = s/(2*R). Thus fval = 2 and so p
635 * is about 20.64%. This yields an interval length of 4.84 (rounded up).
637 if (unlikely(hcrx->feedback == CCID3_FBACK_NONE))
638 return 5;
640 x_recv = tfrc_rx_hist_x_recv(&hcrx->hist, hcrx->x_recv);
641 if (x_recv == 0)
642 goto failed;
644 fval = scaled_div32(scaled_div(s, rtt), x_recv);
645 p = tfrc_calc_x_reverse_lookup(fval);
647 ccid3_pr_debug("%s(%p), receive rate=%u bytes/s, implied "
648 "loss rate=%u\n", dccp_role(sk), sk, x_recv, p);
650 if (p > 0)
651 return scaled_div(1, p);
652 failed:
653 return UINT_MAX;
656 static void ccid3_hc_rx_packet_recv(struct sock *sk, struct sk_buff *skb)
658 struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
659 const u64 ndp = dccp_sk(sk)->dccps_options_received.dccpor_ndp;
660 const bool is_data_packet = dccp_data_packet(skb);
663 * Perform loss detection and handle pending losses
665 if (tfrc_rx_congestion_event(&hcrx->hist, &hcrx->li_hist,
666 skb, ndp, ccid3_first_li, sk))
667 ccid3_hc_rx_send_feedback(sk, skb, CCID3_FBACK_PARAM_CHANGE);
669 * Feedback for first non-empty data packet (RFC 3448, 6.3)
671 else if (unlikely(hcrx->feedback == CCID3_FBACK_NONE && is_data_packet))
672 ccid3_hc_rx_send_feedback(sk, skb, CCID3_FBACK_INITIAL);
674 * Check if the periodic once-per-RTT feedback is due; RFC 4342, 10.3
676 else if (!tfrc_rx_hist_loss_pending(&hcrx->hist) && is_data_packet &&
677 SUB16(dccp_hdr(skb)->dccph_ccval, hcrx->last_counter) > 3)
678 ccid3_hc_rx_send_feedback(sk, skb, CCID3_FBACK_PERIODIC);
681 static int ccid3_hc_rx_init(struct ccid *ccid, struct sock *sk)
683 struct ccid3_hc_rx_sock *hcrx = ccid_priv(ccid);
685 tfrc_lh_init(&hcrx->li_hist);
686 return tfrc_rx_hist_init(&hcrx->hist, sk);
689 static void ccid3_hc_rx_exit(struct sock *sk)
691 struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
693 tfrc_rx_hist_purge(&hcrx->hist);
694 tfrc_lh_cleanup(&hcrx->li_hist);
697 static void ccid3_hc_rx_get_info(struct sock *sk, struct tcp_info *info)
699 info->tcpi_options |= TCPI_OPT_TIMESTAMPS;
700 info->tcpi_rcv_rtt = tfrc_rx_hist_rtt(&ccid3_hc_rx_sk(sk)->hist);
703 static int ccid3_hc_rx_getsockopt(struct sock *sk, const int optname, int len,
704 u32 __user *optval, int __user *optlen)
706 const struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
707 struct tfrc_rx_info rx_info;
708 const void *val;
710 switch (optname) {
711 case DCCP_SOCKOPT_CCID_RX_INFO:
712 if (len < sizeof(rx_info))
713 return -EINVAL;
714 rx_info.tfrcrx_x_recv = hcrx->x_recv;
715 rx_info.tfrcrx_rtt = tfrc_rx_hist_rtt(&hcrx->hist);
716 rx_info.tfrcrx_p = tfrc_invert_loss_event_rate(hcrx->p_inverse);
717 len = sizeof(rx_info);
718 val = &rx_info;
719 break;
720 default:
721 return -ENOPROTOOPT;
724 if (put_user(len, optlen) || copy_to_user(optval, val, len))
725 return -EFAULT;
727 return 0;
730 static struct ccid_operations ccid3 = {
731 .ccid_id = DCCPC_CCID3,
732 .ccid_name = "TCP-Friendly Rate Control",
733 .ccid_owner = THIS_MODULE,
734 .ccid_hc_tx_obj_size = sizeof(struct ccid3_hc_tx_sock),
735 .ccid_hc_tx_init = ccid3_hc_tx_init,
736 .ccid_hc_tx_exit = ccid3_hc_tx_exit,
737 .ccid_hc_tx_send_packet = ccid3_hc_tx_send_packet,
738 .ccid_hc_tx_packet_sent = ccid3_hc_tx_packet_sent,
739 .ccid_hc_tx_packet_recv = ccid3_hc_tx_packet_recv,
740 .ccid_hc_tx_parse_options = ccid3_hc_tx_parse_options,
741 .ccid_hc_rx_obj_size = sizeof(struct ccid3_hc_rx_sock),
742 .ccid_hc_rx_init = ccid3_hc_rx_init,
743 .ccid_hc_rx_exit = ccid3_hc_rx_exit,
744 .ccid_hc_rx_insert_options = ccid3_hc_rx_insert_options,
745 .ccid_hc_rx_packet_recv = ccid3_hc_rx_packet_recv,
746 .ccid_hc_rx_get_info = ccid3_hc_rx_get_info,
747 .ccid_hc_tx_get_info = ccid3_hc_tx_get_info,
748 .ccid_hc_rx_getsockopt = ccid3_hc_rx_getsockopt,
749 .ccid_hc_tx_getsockopt = ccid3_hc_tx_getsockopt,
752 #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
753 module_param(ccid3_debug, bool, 0644);
754 MODULE_PARM_DESC(ccid3_debug, "Enable debug messages");
755 #endif
757 static __init int ccid3_module_init(void)
759 struct timespec tp;
762 * Without a fine-grained clock resolution, RTTs/X_recv are not sampled
763 * correctly and feedback is sent either too early or too late.
765 hrtimer_get_res(CLOCK_MONOTONIC, &tp);
766 if (tp.tv_sec || tp.tv_nsec > DCCP_TIME_RESOLUTION * NSEC_PER_USEC) {
767 printk(KERN_ERR "%s: Timer too coarse (%ld usec), need %u-usec"
768 " resolution - check your clocksource.\n", __func__,
769 tp.tv_nsec/NSEC_PER_USEC, DCCP_TIME_RESOLUTION);
770 return -ESOCKTNOSUPPORT;
772 return ccid_register(&ccid3);
774 module_init(ccid3_module_init);
776 static __exit void ccid3_module_exit(void)
778 ccid_unregister(&ccid3);
780 module_exit(ccid3_module_exit);
782 MODULE_AUTHOR("Ian McDonald <ian.mcdonald@jandi.co.nz>, "
783 "Arnaldo Carvalho de Melo <acme@ghostprotocols.net>");
784 MODULE_DESCRIPTION("DCCP TFRC CCID3 CCID");
785 MODULE_LICENSE("GPL");
786 MODULE_ALIAS("net-dccp-ccid-3");