ccid3.c 27 KB

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