ccid3.c 29 KB

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