ccid3.c 29 KB

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