ccid3.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941
  1. /*
  2. * net/dccp/ccids/ccid3.c
  3. *
  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>
  7. *
  8. * An implementation of the DCCP protocol
  9. *
  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/
  12. *
  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
  16. *
  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>.
  20. *
  21. * Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@conectiva.com.br>
  22. *
  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.
  27. *
  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.
  32. *
  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.
  36. */
  37. #include "../dccp.h"
  38. #include "ccid3.h"
  39. #include <asm/unaligned.h>
  40. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  41. static int ccid3_debug;
  42. #define ccid3_pr_debug(format, a...) DCCP_PR_DEBUG(ccid3_debug, format, ##a)
  43. #else
  44. #define ccid3_pr_debug(format, a...)
  45. #endif
  46. /*
  47. * Transmitter Half-Connection Routines
  48. */
  49. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  50. static const char *ccid3_tx_state_name(enum ccid3_hc_tx_states state)
  51. {
  52. static char *ccid3_state_names[] = {
  53. [TFRC_SSTATE_NO_SENT] = "NO_SENT",
  54. [TFRC_SSTATE_NO_FBACK] = "NO_FBACK",
  55. [TFRC_SSTATE_FBACK] = "FBACK",
  56. [TFRC_SSTATE_TERM] = "TERM",
  57. };
  58. return ccid3_state_names[state];
  59. }
  60. #endif
  61. static void ccid3_hc_tx_set_state(struct sock *sk,
  62. enum ccid3_hc_tx_states state)
  63. {
  64. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  65. enum ccid3_hc_tx_states oldstate = hctx->state;
  66. ccid3_pr_debug("%s(%p) %-8.8s -> %s\n",
  67. dccp_role(sk), sk, ccid3_tx_state_name(oldstate),
  68. ccid3_tx_state_name(state));
  69. WARN_ON(state == oldstate);
  70. hctx->state = state;
  71. }
  72. /*
  73. * Compute the initial sending rate X_init in the manner of RFC 3390:
  74. *
  75. * X_init = min(4 * s, max(2 * s, 4380 bytes)) / RTT
  76. *
  77. * Note that RFC 3390 uses MSS, RFC 4342 refers to RFC 3390, and rfc3448bis
  78. * (rev-02) clarifies the use of RFC 3390 with regard to the above formula.
  79. * For consistency with other parts of the code, X_init is scaled by 2^6.
  80. */
  81. static inline u64 rfc3390_initial_rate(struct sock *sk)
  82. {
  83. const struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  84. const __u32 w_init = clamp_t(__u32, 4380U, 2 * hctx->s, 4 * hctx->s);
  85. return scaled_div(w_init << 6, hctx->rtt);
  86. }
  87. /*
  88. * Recalculate t_ipi and delta (should be called whenever X changes)
  89. */
  90. static void ccid3_update_send_interval(struct ccid3_hc_tx_sock *hctx)
  91. {
  92. /* Calculate new t_ipi = s / X_inst (X_inst is in 64 * bytes/second) */
  93. hctx->t_ipi = scaled_div32(((u64)hctx->s) << 6, hctx->x);
  94. /* Calculate new delta by delta = min(t_ipi / 2, t_gran / 2) */
  95. hctx->delta = min_t(u32, hctx->t_ipi / 2, TFRC_OPSYS_HALF_TIME_GRAN);
  96. ccid3_pr_debug("t_ipi=%u, delta=%u, s=%u, X=%u\n", hctx->t_ipi,
  97. hctx->delta, hctx->s, (unsigned)(hctx->x >> 6));
  98. }
  99. static u32 ccid3_hc_tx_idle_rtt(struct ccid3_hc_tx_sock *hctx, ktime_t now)
  100. {
  101. u32 delta = ktime_us_delta(now, hctx->t_last_win_count);
  102. return delta / hctx->rtt;
  103. }
  104. /**
  105. * ccid3_hc_tx_update_x - Update allowed sending rate X
  106. * @stamp: most recent time if available - can be left NULL.
  107. * This function tracks draft rfc3448bis, check there for latest details.
  108. *
  109. * Note: X and X_recv are both stored in units of 64 * bytes/second, to support
  110. * fine-grained resolution of sending rates. This requires scaling by 2^6
  111. * throughout the code. Only X_calc is unscaled (in bytes/second).
  112. *
  113. */
  114. static void ccid3_hc_tx_update_x(struct sock *sk, ktime_t *stamp)
  115. {
  116. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  117. u64 min_rate = 2 * hctx->x_recv;
  118. const u64 old_x = hctx->x;
  119. ktime_t now = stamp ? *stamp : ktime_get_real();
  120. /*
  121. * Handle IDLE periods: do not reduce below RFC3390 initial sending rate
  122. * when idling [RFC 4342, 5.1]. Definition of idling is from rfc3448bis:
  123. * a sender is idle if it has not sent anything over a 2-RTT-period.
  124. * For consistency with X and X_recv, min_rate is also scaled by 2^6.
  125. */
  126. if (ccid3_hc_tx_idle_rtt(hctx, now) >= 2) {
  127. min_rate = rfc3390_initial_rate(sk);
  128. min_rate = max(min_rate, 2 * hctx->x_recv);
  129. }
  130. if (hctx->p > 0) {
  131. hctx->x = min(((u64)hctx->x_calc) << 6, min_rate);
  132. hctx->x = max(hctx->x, (((u64)hctx->s) << 6) / TFRC_T_MBI);
  133. } else if (ktime_us_delta(now, hctx->t_ld) - (s64)hctx->rtt >= 0) {
  134. hctx->x = min(2 * hctx->x, min_rate);
  135. hctx->x = max(hctx->x,
  136. scaled_div(((u64)hctx->s) << 6, hctx->rtt));
  137. hctx->t_ld = now;
  138. }
  139. if (hctx->x != old_x) {
  140. ccid3_pr_debug("X_prev=%u, X_now=%u, X_calc=%u, "
  141. "X_recv=%u\n", (unsigned)(old_x >> 6),
  142. (unsigned)(hctx->x >> 6), hctx->x_calc,
  143. (unsigned)(hctx->x_recv >> 6));
  144. ccid3_update_send_interval(hctx);
  145. }
  146. }
  147. /*
  148. * Track the mean packet size `s' (cf. RFC 4342, 5.3 and RFC 3448, 4.1)
  149. * @len: DCCP packet payload size in bytes
  150. */
  151. static inline void ccid3_hc_tx_update_s(struct ccid3_hc_tx_sock *hctx, int len)
  152. {
  153. const u16 old_s = hctx->s;
  154. hctx->s = tfrc_ewma(hctx->s, len, 9);
  155. if (hctx->s != old_s)
  156. ccid3_update_send_interval(hctx);
  157. }
  158. /*
  159. * Update Window Counter using the algorithm from [RFC 4342, 8.1].
  160. * As elsewhere, RTT > 0 is assumed by using dccp_sample_rtt().
  161. */
  162. static inline void ccid3_hc_tx_update_win_count(struct ccid3_hc_tx_sock *hctx,
  163. ktime_t now)
  164. {
  165. u32 delta = ktime_us_delta(now, hctx->t_last_win_count),
  166. quarter_rtts = (4 * delta) / hctx->rtt;
  167. if (quarter_rtts > 0) {
  168. hctx->t_last_win_count = now;
  169. hctx->last_win_count += min(quarter_rtts, 5U);
  170. hctx->last_win_count &= 0xF; /* mod 16 */
  171. }
  172. }
  173. static void ccid3_hc_tx_no_feedback_timer(unsigned long data)
  174. {
  175. struct sock *sk = (struct sock *)data;
  176. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  177. unsigned long t_nfb = USEC_PER_SEC / 5;
  178. bh_lock_sock(sk);
  179. if (sock_owned_by_user(sk)) {
  180. /* Try again later. */
  181. /* XXX: set some sensible MIB */
  182. goto restart_timer;
  183. }
  184. ccid3_pr_debug("%s(%p, state=%s) - entry \n", dccp_role(sk), sk,
  185. ccid3_tx_state_name(hctx->state));
  186. if (hctx->state == TFRC_SSTATE_FBACK)
  187. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_NO_FBACK);
  188. else if (hctx->state != TFRC_SSTATE_NO_FBACK)
  189. goto out;
  190. /*
  191. * Determine new allowed sending rate X as per draft rfc3448bis-00, 4.4
  192. * RTO is 0 if and only if no feedback has been received yet.
  193. */
  194. if (hctx->t_rto == 0 || hctx->p == 0) {
  195. /* halve send rate directly */
  196. hctx->x = max(hctx->x / 2, (((u64)hctx->s) << 6) / TFRC_T_MBI);
  197. ccid3_update_send_interval(hctx);
  198. } else {
  199. /*
  200. * Modify the cached value of X_recv
  201. *
  202. * If (X_calc > 2 * X_recv)
  203. * X_recv = max(X_recv / 2, s / (2 * t_mbi));
  204. * Else
  205. * X_recv = X_calc / 4;
  206. *
  207. * Note that X_recv is scaled by 2^6 while X_calc is not
  208. */
  209. BUG_ON(hctx->p && !hctx->x_calc);
  210. if (hctx->x_calc > (hctx->x_recv >> 5))
  211. hctx->x_recv =
  212. max(hctx->x_recv / 2,
  213. (((__u64)hctx->s) << 6) / (2 * TFRC_T_MBI));
  214. else {
  215. hctx->x_recv = hctx->x_calc;
  216. hctx->x_recv <<= 4;
  217. }
  218. ccid3_hc_tx_update_x(sk, NULL);
  219. }
  220. ccid3_pr_debug("Reduced X to %llu/64 bytes/sec\n",
  221. (unsigned long long)hctx->x);
  222. /*
  223. * Set new timeout for the nofeedback timer.
  224. * See comments in packet_recv() regarding the value of t_RTO.
  225. */
  226. if (unlikely(hctx->t_rto == 0)) /* no feedback received yet */
  227. t_nfb = TFRC_INITIAL_TIMEOUT;
  228. else
  229. t_nfb = max(hctx->t_rto, 2 * hctx->t_ipi);
  230. restart_timer:
  231. sk_reset_timer(sk, &hctx->no_feedback_timer,
  232. jiffies + usecs_to_jiffies(t_nfb));
  233. out:
  234. bh_unlock_sock(sk);
  235. sock_put(sk);
  236. }
  237. /*
  238. * returns
  239. * > 0: delay (in msecs) that should pass before actually sending
  240. * = 0: can send immediately
  241. * < 0: error condition; do not send packet
  242. */
  243. static int ccid3_hc_tx_send_packet(struct sock *sk, struct sk_buff *skb)
  244. {
  245. struct dccp_sock *dp = dccp_sk(sk);
  246. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  247. ktime_t now = ktime_get_real();
  248. s64 delay;
  249. /*
  250. * This function is called only for Data and DataAck packets. Sending
  251. * zero-sized Data(Ack)s is theoretically possible, but for congestion
  252. * control this case is pathological - ignore it.
  253. */
  254. if (unlikely(skb->len == 0))
  255. return -EBADMSG;
  256. switch (hctx->state) {
  257. case TFRC_SSTATE_NO_SENT:
  258. sk_reset_timer(sk, &hctx->no_feedback_timer, (jiffies +
  259. usecs_to_jiffies(TFRC_INITIAL_TIMEOUT)));
  260. hctx->last_win_count = 0;
  261. hctx->t_last_win_count = now;
  262. /* Set t_0 for initial packet */
  263. hctx->t_nom = now;
  264. hctx->s = skb->len;
  265. /*
  266. * Use initial RTT sample when available: recommended by erratum
  267. * to RFC 4342. This implements the initialisation procedure of
  268. * draft rfc3448bis, section 4.2. Remember, X is scaled by 2^6.
  269. */
  270. if (dp->dccps_syn_rtt) {
  271. ccid3_pr_debug("SYN RTT = %uus\n", dp->dccps_syn_rtt);
  272. hctx->rtt = dp->dccps_syn_rtt;
  273. hctx->x = rfc3390_initial_rate(sk);
  274. hctx->t_ld = now;
  275. } else {
  276. /*
  277. * Sender does not have RTT sample:
  278. * - set fallback RTT (RFC 4340, 3.4) since a RTT value
  279. * is needed in several parts (e.g. window counter);
  280. * - set sending rate X_pps = 1pps as per RFC 3448, 4.2.
  281. */
  282. hctx->rtt = DCCP_FALLBACK_RTT;
  283. hctx->x = hctx->s;
  284. hctx->x <<= 6;
  285. }
  286. ccid3_update_send_interval(hctx);
  287. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_NO_FBACK);
  288. break;
  289. case TFRC_SSTATE_NO_FBACK:
  290. case TFRC_SSTATE_FBACK:
  291. delay = ktime_us_delta(hctx->t_nom, now);
  292. ccid3_pr_debug("delay=%ld\n", (long)delay);
  293. /*
  294. * Scheduling of packet transmissions [RFC 3448, 4.6]
  295. *
  296. * if (t_now > t_nom - delta)
  297. * // send the packet now
  298. * else
  299. * // send the packet in (t_nom - t_now) milliseconds.
  300. */
  301. if (delay - (s64)hctx->delta >= 1000)
  302. return (u32)delay / 1000L;
  303. ccid3_hc_tx_update_win_count(hctx, now);
  304. break;
  305. case TFRC_SSTATE_TERM:
  306. DCCP_BUG("%s(%p) - Illegal state TERM", dccp_role(sk), sk);
  307. return -EINVAL;
  308. }
  309. /* prepare to send now (add options etc.) */
  310. dp->dccps_hc_tx_insert_options = 1;
  311. DCCP_SKB_CB(skb)->dccpd_ccval = hctx->last_win_count;
  312. /* set the nominal send time for the next following packet */
  313. hctx->t_nom = ktime_add_us(hctx->t_nom, hctx->t_ipi);
  314. return 0;
  315. }
  316. static void ccid3_hc_tx_packet_sent(struct sock *sk, int more,
  317. unsigned int len)
  318. {
  319. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  320. ccid3_hc_tx_update_s(hctx, len);
  321. if (tfrc_tx_hist_add(&hctx->hist, dccp_sk(sk)->dccps_gss))
  322. DCCP_CRIT("packet history - out of memory!");
  323. }
  324. static void ccid3_hc_tx_packet_recv(struct sock *sk, struct sk_buff *skb)
  325. {
  326. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  327. struct ccid3_options_received *opt_recv = &hctx->options_received;
  328. ktime_t now;
  329. unsigned long t_nfb;
  330. u32 pinv, r_sample;
  331. /* we are only interested in ACKs */
  332. if (!(DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_ACK ||
  333. DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_DATAACK))
  334. return;
  335. /* ... and only in the established state */
  336. if (hctx->state != TFRC_SSTATE_FBACK &&
  337. hctx->state != TFRC_SSTATE_NO_FBACK)
  338. return;
  339. now = ktime_get_real();
  340. /* Estimate RTT from history if ACK number is valid */
  341. r_sample = tfrc_tx_hist_rtt(hctx->hist,
  342. DCCP_SKB_CB(skb)->dccpd_ack_seq, now);
  343. if (r_sample == 0) {
  344. DCCP_WARN("%s(%p): %s with bogus ACK-%llu\n", dccp_role(sk), sk,
  345. dccp_packet_name(DCCP_SKB_CB(skb)->dccpd_type),
  346. (unsigned long long)DCCP_SKB_CB(skb)->dccpd_ack_seq);
  347. return;
  348. }
  349. /* Update receive rate in units of 64 * bytes/second */
  350. hctx->x_recv = opt_recv->ccid3or_receive_rate;
  351. hctx->x_recv <<= 6;
  352. /* Update loss event rate (which is scaled by 1e6) */
  353. pinv = opt_recv->ccid3or_loss_event_rate;
  354. if (pinv == ~0U || pinv == 0) /* see RFC 4342, 8.5 */
  355. hctx->p = 0;
  356. else /* can not exceed 100% */
  357. hctx->p = scaled_div(1, pinv);
  358. /*
  359. * Validate new RTT sample and update moving average
  360. */
  361. r_sample = dccp_sample_rtt(sk, r_sample);
  362. hctx->rtt = tfrc_ewma(hctx->rtt, r_sample, 9);
  363. /*
  364. * Update allowed sending rate X as per draft rfc3448bis-00, 4.2/3
  365. */
  366. if (hctx->state == TFRC_SSTATE_NO_FBACK) {
  367. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_FBACK);
  368. if (hctx->t_rto == 0) {
  369. /*
  370. * Initial feedback packet: Larger Initial Windows (4.2)
  371. */
  372. hctx->x = rfc3390_initial_rate(sk);
  373. hctx->t_ld = now;
  374. ccid3_update_send_interval(hctx);
  375. goto done_computing_x;
  376. } else if (hctx->p == 0) {
  377. /*
  378. * First feedback after nofeedback timer expiry (4.3)
  379. */
  380. goto done_computing_x;
  381. }
  382. }
  383. /* Update sending rate (step 4 of [RFC 3448, 4.3]) */
  384. if (hctx->p > 0)
  385. hctx->x_calc = tfrc_calc_x(hctx->s, hctx->rtt, hctx->p);
  386. ccid3_hc_tx_update_x(sk, &now);
  387. done_computing_x:
  388. ccid3_pr_debug("%s(%p), RTT=%uus (sample=%uus), s=%u, "
  389. "p=%u, X_calc=%u, X_recv=%u, X=%u\n",
  390. dccp_role(sk), sk, hctx->rtt, r_sample,
  391. hctx->s, hctx->p, hctx->x_calc,
  392. (unsigned)(hctx->x_recv >> 6),
  393. (unsigned)(hctx->x >> 6));
  394. /* unschedule no feedback timer */
  395. sk_stop_timer(sk, &hctx->no_feedback_timer);
  396. /*
  397. * As we have calculated new ipi, delta, t_nom it is possible
  398. * that we now can send a packet, so wake up dccp_wait_for_ccid
  399. */
  400. sk->sk_write_space(sk);
  401. /*
  402. * Update timeout interval for the nofeedback timer.
  403. * We use a configuration option to increase the lower bound.
  404. * This can help avoid triggering the nofeedback timer too
  405. * often ('spinning') on LANs with small RTTs.
  406. */
  407. hctx->t_rto = max_t(u32, 4 * hctx->rtt, (CONFIG_IP_DCCP_CCID3_RTO *
  408. (USEC_PER_SEC / 1000)));
  409. /*
  410. * Schedule no feedback timer to expire in
  411. * max(t_RTO, 2 * s/X) = max(t_RTO, 2 * t_ipi)
  412. */
  413. t_nfb = max(hctx->t_rto, 2 * hctx->t_ipi);
  414. ccid3_pr_debug("%s(%p), Scheduled no feedback timer to "
  415. "expire in %lu jiffies (%luus)\n",
  416. dccp_role(sk), sk, usecs_to_jiffies(t_nfb), t_nfb);
  417. sk_reset_timer(sk, &hctx->no_feedback_timer,
  418. jiffies + usecs_to_jiffies(t_nfb));
  419. }
  420. static int ccid3_hc_tx_parse_options(struct sock *sk, unsigned char option,
  421. unsigned char len, u16 idx,
  422. unsigned char *value)
  423. {
  424. int rc = 0;
  425. const struct dccp_sock *dp = dccp_sk(sk);
  426. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  427. struct ccid3_options_received *opt_recv = &hctx->options_received;
  428. __be32 opt_val;
  429. if (opt_recv->ccid3or_seqno != dp->dccps_gsr) {
  430. opt_recv->ccid3or_seqno = dp->dccps_gsr;
  431. opt_recv->ccid3or_loss_event_rate = ~0;
  432. opt_recv->ccid3or_loss_intervals_idx = 0;
  433. opt_recv->ccid3or_loss_intervals_len = 0;
  434. opt_recv->ccid3or_receive_rate = 0;
  435. }
  436. switch (option) {
  437. case TFRC_OPT_LOSS_EVENT_RATE:
  438. if (unlikely(len != 4)) {
  439. DCCP_WARN("%s(%p), invalid len %d "
  440. "for TFRC_OPT_LOSS_EVENT_RATE\n",
  441. dccp_role(sk), sk, len);
  442. rc = -EINVAL;
  443. } else {
  444. opt_val = get_unaligned((__be32 *)value);
  445. opt_recv->ccid3or_loss_event_rate = ntohl(opt_val);
  446. ccid3_pr_debug("%s(%p), LOSS_EVENT_RATE=%u\n",
  447. dccp_role(sk), sk,
  448. opt_recv->ccid3or_loss_event_rate);
  449. }
  450. break;
  451. case TFRC_OPT_LOSS_INTERVALS:
  452. opt_recv->ccid3or_loss_intervals_idx = idx;
  453. opt_recv->ccid3or_loss_intervals_len = len;
  454. ccid3_pr_debug("%s(%p), LOSS_INTERVALS=(%u, %u)\n",
  455. dccp_role(sk), sk,
  456. opt_recv->ccid3or_loss_intervals_idx,
  457. opt_recv->ccid3or_loss_intervals_len);
  458. break;
  459. case TFRC_OPT_RECEIVE_RATE:
  460. if (unlikely(len != 4)) {
  461. DCCP_WARN("%s(%p), invalid len %d "
  462. "for TFRC_OPT_RECEIVE_RATE\n",
  463. dccp_role(sk), sk, len);
  464. rc = -EINVAL;
  465. } else {
  466. opt_val = get_unaligned((__be32 *)value);
  467. opt_recv->ccid3or_receive_rate = ntohl(opt_val);
  468. ccid3_pr_debug("%s(%p), RECEIVE_RATE=%u\n",
  469. dccp_role(sk), sk,
  470. opt_recv->ccid3or_receive_rate);
  471. }
  472. break;
  473. }
  474. return rc;
  475. }
  476. static int ccid3_hc_tx_init(struct ccid *ccid, struct sock *sk)
  477. {
  478. struct ccid3_hc_tx_sock *hctx = ccid_priv(ccid);
  479. hctx->state = TFRC_SSTATE_NO_SENT;
  480. hctx->hist = NULL;
  481. setup_timer(&hctx->no_feedback_timer,
  482. ccid3_hc_tx_no_feedback_timer, (unsigned long)sk);
  483. return 0;
  484. }
  485. static void ccid3_hc_tx_exit(struct sock *sk)
  486. {
  487. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  488. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_TERM);
  489. sk_stop_timer(sk, &hctx->no_feedback_timer);
  490. tfrc_tx_hist_purge(&hctx->hist);
  491. }
  492. static void ccid3_hc_tx_get_info(struct sock *sk, struct tcp_info *info)
  493. {
  494. info->tcpi_rto = ccid3_hc_tx_sk(sk)->t_rto;
  495. info->tcpi_rtt = ccid3_hc_tx_sk(sk)->rtt;
  496. }
  497. static int ccid3_hc_tx_getsockopt(struct sock *sk, const int optname, int len,
  498. u32 __user *optval, int __user *optlen)
  499. {
  500. const struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  501. struct tfrc_tx_info tfrc;
  502. 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;
  519. }
  520. if (put_user(len, optlen) || copy_to_user(optval, val, len))
  521. return -EFAULT;
  522. return 0;
  523. }
  524. /*
  525. * Receiver Half-Connection Routines
  526. */
  527. /* CCID3 feedback types */
  528. enum ccid3_fback_type {
  529. CCID3_FBACK_NONE = 0,
  530. CCID3_FBACK_INITIAL,
  531. CCID3_FBACK_PERIODIC,
  532. CCID3_FBACK_PARAM_CHANGE
  533. };
  534. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  535. static const char *ccid3_rx_state_name(enum ccid3_hc_rx_states state)
  536. {
  537. static char *ccid3_rx_state_names[] = {
  538. [TFRC_RSTATE_NO_DATA] = "NO_DATA",
  539. [TFRC_RSTATE_DATA] = "DATA",
  540. [TFRC_RSTATE_TERM] = "TERM",
  541. };
  542. return ccid3_rx_state_names[state];
  543. }
  544. #endif
  545. static void ccid3_hc_rx_set_state(struct sock *sk,
  546. enum ccid3_hc_rx_states state)
  547. {
  548. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  549. enum ccid3_hc_rx_states oldstate = hcrx->state;
  550. ccid3_pr_debug("%s(%p) %-8.8s -> %s\n",
  551. dccp_role(sk), sk, ccid3_rx_state_name(oldstate),
  552. ccid3_rx_state_name(state));
  553. WARN_ON(state == oldstate);
  554. hcrx->state = state;
  555. }
  556. static void ccid3_hc_rx_send_feedback(struct sock *sk,
  557. const struct sk_buff *skb,
  558. enum ccid3_fback_type fbtype)
  559. {
  560. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  561. struct dccp_sock *dp = dccp_sk(sk);
  562. ktime_t now;
  563. s64 delta = 0;
  564. if (unlikely(hcrx->state == TFRC_RSTATE_TERM))
  565. return;
  566. now = ktime_get_real();
  567. switch (fbtype) {
  568. case CCID3_FBACK_INITIAL:
  569. hcrx->x_recv = 0;
  570. hcrx->p_inverse = ~0U; /* see RFC 4342, 8.5 */
  571. break;
  572. case CCID3_FBACK_PARAM_CHANGE:
  573. /*
  574. * When parameters change (new loss or p > p_prev), we do not
  575. * have a reliable estimate for R_m of [RFC 3448, 6.2] and so
  576. * need to reuse the previous value of X_recv. However, when
  577. * X_recv was 0 (due to early loss), this would kill X down to
  578. * s/t_mbi (i.e. one packet in 64 seconds).
  579. * To avoid such drastic reduction, we approximate X_recv as
  580. * the number of bytes since last feedback.
  581. * This is a safe fallback, since X is bounded above by X_calc.
  582. */
  583. if (hcrx->x_recv > 0)
  584. break;
  585. /* fall through */
  586. case CCID3_FBACK_PERIODIC:
  587. delta = ktime_us_delta(now, hcrx->tstamp_last_feedback);
  588. if (delta <= 0)
  589. DCCP_BUG("delta (%ld) <= 0", (long)delta);
  590. else
  591. hcrx->x_recv = scaled_div32(hcrx->bytes_recv, delta);
  592. break;
  593. default:
  594. return;
  595. }
  596. ccid3_pr_debug("Interval %ldusec, X_recv=%u, 1/p=%u\n",
  597. (long)delta, hcrx->x_recv, hcrx->p_inverse);
  598. hcrx->tstamp_last_feedback = now;
  599. hcrx->last_counter = dccp_hdr(skb)->dccph_ccval;
  600. hcrx->bytes_recv = 0;
  601. dp->dccps_hc_rx_insert_options = 1;
  602. dccp_send_ack(sk);
  603. }
  604. static int ccid3_hc_rx_insert_options(struct sock *sk, struct sk_buff *skb)
  605. {
  606. const struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  607. __be32 x_recv, pinv;
  608. if (!(sk->sk_state == DCCP_OPEN || sk->sk_state == DCCP_PARTOPEN))
  609. return 0;
  610. if (dccp_packet_without_ack(skb))
  611. return 0;
  612. x_recv = htonl(hcrx->x_recv);
  613. pinv = htonl(hcrx->p_inverse);
  614. if (dccp_insert_option(sk, skb, TFRC_OPT_LOSS_EVENT_RATE,
  615. &pinv, sizeof(pinv)) ||
  616. dccp_insert_option(sk, skb, TFRC_OPT_RECEIVE_RATE,
  617. &x_recv, sizeof(x_recv)))
  618. return -1;
  619. return 0;
  620. }
  621. /** ccid3_first_li - Implements [RFC 3448, 6.3.1]
  622. *
  623. * Determine the length of the first loss interval via inverse lookup.
  624. * Assume that X_recv can be computed by the throughput equation
  625. * s
  626. * X_recv = --------
  627. * R * fval
  628. * Find some p such that f(p) = fval; return 1/p (scaled).
  629. */
  630. static u32 ccid3_first_li(struct sock *sk)
  631. {
  632. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  633. u32 x_recv, p, delta;
  634. u64 fval;
  635. if (hcrx->rtt == 0) {
  636. DCCP_WARN("No RTT estimate available, using fallback RTT\n");
  637. hcrx->rtt = DCCP_FALLBACK_RTT;
  638. }
  639. delta = ktime_to_us(net_timedelta(hcrx->tstamp_last_feedback));
  640. x_recv = scaled_div32(hcrx->bytes_recv, delta);
  641. if (x_recv == 0) { /* would also trigger divide-by-zero */
  642. DCCP_WARN("X_recv==0\n");
  643. if (hcrx->x_recv == 0) {
  644. DCCP_BUG("stored value of X_recv is zero");
  645. return ~0U;
  646. }
  647. x_recv = hcrx->x_recv;
  648. }
  649. fval = scaled_div(hcrx->s, hcrx->rtt);
  650. fval = scaled_div32(fval, x_recv);
  651. p = tfrc_calc_x_reverse_lookup(fval);
  652. ccid3_pr_debug("%s(%p), receive rate=%u bytes/s, implied "
  653. "loss rate=%u\n", dccp_role(sk), sk, x_recv, p);
  654. return p == 0 ? ~0U : scaled_div(1, p);
  655. }
  656. static void ccid3_hc_rx_packet_recv(struct sock *sk, struct sk_buff *skb)
  657. {
  658. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  659. enum ccid3_fback_type do_feedback = CCID3_FBACK_NONE;
  660. const u64 ndp = dccp_sk(sk)->dccps_options_received.dccpor_ndp;
  661. const bool is_data_packet = dccp_data_packet(skb);
  662. if (unlikely(hcrx->state == TFRC_RSTATE_NO_DATA)) {
  663. if (is_data_packet) {
  664. const u32 payload = skb->len - dccp_hdr(skb)->dccph_doff * 4;
  665. do_feedback = CCID3_FBACK_INITIAL;
  666. ccid3_hc_rx_set_state(sk, TFRC_RSTATE_DATA);
  667. hcrx->s = payload;
  668. /*
  669. * Not necessary to update bytes_recv here,
  670. * since X_recv = 0 for the first feedback packet (cf.
  671. * RFC 3448, 6.3) -- gerrit
  672. */
  673. }
  674. goto update_records;
  675. }
  676. if (tfrc_rx_hist_duplicate(&hcrx->hist, skb))
  677. return; /* done receiving */
  678. if (is_data_packet) {
  679. const u32 payload = skb->len - dccp_hdr(skb)->dccph_doff * 4;
  680. /*
  681. * Update moving-average of s and the sum of received payload bytes
  682. */
  683. hcrx->s = tfrc_ewma(hcrx->s, payload, 9);
  684. hcrx->bytes_recv += payload;
  685. }
  686. /*
  687. * Perform loss detection and handle pending losses
  688. */
  689. if (tfrc_rx_handle_loss(&hcrx->hist, &hcrx->li_hist,
  690. skb, ndp, ccid3_first_li, sk)) {
  691. do_feedback = CCID3_FBACK_PARAM_CHANGE;
  692. goto done_receiving;
  693. }
  694. if (tfrc_rx_hist_loss_pending(&hcrx->hist))
  695. return; /* done receiving */
  696. /*
  697. * Handle data packets: RTT sampling and monitoring p
  698. */
  699. if (unlikely(!is_data_packet))
  700. goto update_records;
  701. if (!tfrc_lh_is_initialised(&hcrx->li_hist)) {
  702. const u32 sample = tfrc_rx_hist_sample_rtt(&hcrx->hist, skb);
  703. /*
  704. * Empty loss history: no loss so far, hence p stays 0.
  705. * Sample RTT values, since an RTT estimate is required for the
  706. * computation of p when the first loss occurs; RFC 3448, 6.3.1.
  707. */
  708. if (sample != 0)
  709. hcrx->rtt = tfrc_ewma(hcrx->rtt, sample, 9);
  710. } else if (tfrc_lh_update_i_mean(&hcrx->li_hist, skb)) {
  711. /*
  712. * Step (3) of [RFC 3448, 6.1]: Recompute I_mean and, if I_mean
  713. * has decreased (resp. p has increased), send feedback now.
  714. */
  715. do_feedback = CCID3_FBACK_PARAM_CHANGE;
  716. }
  717. /*
  718. * Check if the periodic once-per-RTT feedback is due; RFC 4342, 10.3
  719. */
  720. if (SUB16(dccp_hdr(skb)->dccph_ccval, hcrx->last_counter) > 3)
  721. do_feedback = CCID3_FBACK_PERIODIC;
  722. update_records:
  723. tfrc_rx_hist_add_packet(&hcrx->hist, skb, ndp);
  724. done_receiving:
  725. if (do_feedback)
  726. ccid3_hc_rx_send_feedback(sk, skb, do_feedback);
  727. }
  728. static int ccid3_hc_rx_init(struct ccid *ccid, struct sock *sk)
  729. {
  730. struct ccid3_hc_rx_sock *hcrx = ccid_priv(ccid);
  731. hcrx->state = TFRC_RSTATE_NO_DATA;
  732. tfrc_lh_init(&hcrx->li_hist);
  733. return tfrc_rx_hist_alloc(&hcrx->hist);
  734. }
  735. static void ccid3_hc_rx_exit(struct sock *sk)
  736. {
  737. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  738. ccid3_hc_rx_set_state(sk, TFRC_RSTATE_TERM);
  739. tfrc_rx_hist_purge(&hcrx->hist);
  740. tfrc_lh_cleanup(&hcrx->li_hist);
  741. }
  742. static void ccid3_hc_rx_get_info(struct sock *sk, struct tcp_info *info)
  743. {
  744. info->tcpi_ca_state = ccid3_hc_rx_sk(sk)->state;
  745. info->tcpi_options |= TCPI_OPT_TIMESTAMPS;
  746. info->tcpi_rcv_rtt = ccid3_hc_rx_sk(sk)->rtt;
  747. }
  748. static int ccid3_hc_rx_getsockopt(struct sock *sk, const int optname, int len,
  749. u32 __user *optval, int __user *optlen)
  750. {
  751. const struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  752. struct tfrc_rx_info rx_info;
  753. const void *val;
  754. switch (optname) {
  755. case DCCP_SOCKOPT_CCID_RX_INFO:
  756. if (len < sizeof(rx_info))
  757. return -EINVAL;
  758. rx_info.tfrcrx_x_recv = hcrx->x_recv;
  759. rx_info.tfrcrx_rtt = hcrx->rtt;
  760. rx_info.tfrcrx_p = hcrx->p_inverse == 0 ? ~0U :
  761. scaled_div(1, hcrx->p_inverse);
  762. len = sizeof(rx_info);
  763. val = &rx_info;
  764. break;
  765. default:
  766. return -ENOPROTOOPT;
  767. }
  768. if (put_user(len, optlen) || copy_to_user(optval, val, len))
  769. return -EFAULT;
  770. return 0;
  771. }
  772. static struct ccid_operations ccid3 = {
  773. .ccid_id = DCCPC_CCID3,
  774. .ccid_name = "TCP-Friendly Rate Control",
  775. .ccid_owner = THIS_MODULE,
  776. .ccid_hc_tx_obj_size = sizeof(struct ccid3_hc_tx_sock),
  777. .ccid_hc_tx_init = ccid3_hc_tx_init,
  778. .ccid_hc_tx_exit = ccid3_hc_tx_exit,
  779. .ccid_hc_tx_send_packet = ccid3_hc_tx_send_packet,
  780. .ccid_hc_tx_packet_sent = ccid3_hc_tx_packet_sent,
  781. .ccid_hc_tx_packet_recv = ccid3_hc_tx_packet_recv,
  782. .ccid_hc_tx_parse_options = ccid3_hc_tx_parse_options,
  783. .ccid_hc_rx_obj_size = sizeof(struct ccid3_hc_rx_sock),
  784. .ccid_hc_rx_init = ccid3_hc_rx_init,
  785. .ccid_hc_rx_exit = ccid3_hc_rx_exit,
  786. .ccid_hc_rx_insert_options = ccid3_hc_rx_insert_options,
  787. .ccid_hc_rx_packet_recv = ccid3_hc_rx_packet_recv,
  788. .ccid_hc_rx_get_info = ccid3_hc_rx_get_info,
  789. .ccid_hc_tx_get_info = ccid3_hc_tx_get_info,
  790. .ccid_hc_rx_getsockopt = ccid3_hc_rx_getsockopt,
  791. .ccid_hc_tx_getsockopt = ccid3_hc_tx_getsockopt,
  792. };
  793. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  794. module_param(ccid3_debug, bool, 0644);
  795. MODULE_PARM_DESC(ccid3_debug, "Enable debug messages");
  796. #endif
  797. static __init int ccid3_module_init(void)
  798. {
  799. return ccid_register(&ccid3);
  800. }
  801. module_init(ccid3_module_init);
  802. static __exit void ccid3_module_exit(void)
  803. {
  804. ccid_unregister(&ccid3);
  805. }
  806. module_exit(ccid3_module_exit);
  807. MODULE_AUTHOR("Ian McDonald <ian.mcdonald@jandi.co.nz>, "
  808. "Arnaldo Carvalho de Melo <acme@ghostprotocols.net>");
  809. MODULE_DESCRIPTION("DCCP TFRC CCID3 CCID");
  810. MODULE_LICENSE("GPL");
  811. MODULE_ALIAS("net-dccp-ccid-3");