ccid3.c 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982
  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 =
  143. max(min(2 * hctx->ccid3hctx_x, min_rate),
  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. /* Sender does not have RTT sample: X_pps = 1 pkt/sec */
  291. hctx->ccid3hctx_x = hctx->ccid3hctx_s;
  292. hctx->ccid3hctx_x <<= 6;
  293. }
  294. ccid3_update_send_interval(hctx);
  295. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_NO_FBACK);
  296. break;
  297. case TFRC_SSTATE_NO_FBACK:
  298. case TFRC_SSTATE_FBACK:
  299. delay = ktime_us_delta(hctx->ccid3hctx_t_nom, now);
  300. ccid3_pr_debug("delay=%ld\n", (long)delay);
  301. /*
  302. * Scheduling of packet transmissions [RFC 3448, 4.6]
  303. *
  304. * if (t_now > t_nom - delta)
  305. * // send the packet now
  306. * else
  307. * // send the packet in (t_nom - t_now) milliseconds.
  308. */
  309. if (delay - (s64)hctx->ccid3hctx_delta >= 1000)
  310. return (u32)delay / 1000L;
  311. ccid3_hc_tx_update_win_count(hctx, now);
  312. break;
  313. case TFRC_SSTATE_TERM:
  314. DCCP_BUG("%s(%p) - Illegal state TERM", dccp_role(sk), sk);
  315. return -EINVAL;
  316. }
  317. /* prepare to send now (add options etc.) */
  318. dp->dccps_hc_tx_insert_options = 1;
  319. DCCP_SKB_CB(skb)->dccpd_ccval = hctx->ccid3hctx_last_win_count;
  320. /* set the nominal send time for the next following packet */
  321. hctx->ccid3hctx_t_nom = ktime_add_us(hctx->ccid3hctx_t_nom,
  322. hctx->ccid3hctx_t_ipi);
  323. return 0;
  324. }
  325. static void ccid3_hc_tx_packet_sent(struct sock *sk, int more,
  326. unsigned int len)
  327. {
  328. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  329. ccid3_hc_tx_update_s(hctx, len);
  330. if (tfrc_tx_hist_add(&hctx->ccid3hctx_hist, dccp_sk(sk)->dccps_gss))
  331. DCCP_CRIT("packet history - out of memory!");
  332. }
  333. static void ccid3_hc_tx_packet_recv(struct sock *sk, struct sk_buff *skb)
  334. {
  335. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  336. struct ccid3_options_received *opt_recv;
  337. ktime_t now;
  338. unsigned long t_nfb;
  339. u32 pinv, r_sample;
  340. /* we are only interested in ACKs */
  341. if (!(DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_ACK ||
  342. DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_DATAACK))
  343. return;
  344. /* ... and only in the established state */
  345. if (hctx->ccid3hctx_state != TFRC_SSTATE_FBACK &&
  346. hctx->ccid3hctx_state != TFRC_SSTATE_NO_FBACK)
  347. return;
  348. opt_recv = &hctx->ccid3hctx_options_received;
  349. now = ktime_get_real();
  350. /* Estimate RTT from history if ACK number is valid */
  351. r_sample = tfrc_tx_hist_rtt(hctx->ccid3hctx_hist,
  352. DCCP_SKB_CB(skb)->dccpd_ack_seq, now);
  353. if (r_sample == 0) {
  354. DCCP_WARN("%s(%p): %s with bogus ACK-%llu\n", dccp_role(sk), sk,
  355. dccp_packet_name(DCCP_SKB_CB(skb)->dccpd_type),
  356. (unsigned long long)DCCP_SKB_CB(skb)->dccpd_ack_seq);
  357. return;
  358. }
  359. /* Update receive rate in units of 64 * bytes/second */
  360. hctx->ccid3hctx_x_recv = opt_recv->ccid3or_receive_rate;
  361. hctx->ccid3hctx_x_recv <<= 6;
  362. /* Update loss event rate (which is scaled by 1e6) */
  363. pinv = opt_recv->ccid3or_loss_event_rate;
  364. if (pinv == ~0U || pinv == 0) /* see RFC 4342, 8.5 */
  365. hctx->ccid3hctx_p = 0;
  366. else /* can not exceed 100% */
  367. hctx->ccid3hctx_p = scaled_div(1, pinv);
  368. /*
  369. * Validate new RTT sample and update moving average
  370. */
  371. r_sample = dccp_sample_rtt(sk, r_sample);
  372. hctx->ccid3hctx_rtt = tfrc_ewma(hctx->ccid3hctx_rtt, r_sample, 9);
  373. /*
  374. * Update allowed sending rate X as per draft rfc3448bis-00, 4.2/3
  375. */
  376. if (hctx->ccid3hctx_state == TFRC_SSTATE_NO_FBACK) {
  377. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_FBACK);
  378. if (hctx->ccid3hctx_t_rto == 0) {
  379. /*
  380. * Initial feedback packet: Larger Initial Windows (4.2)
  381. */
  382. hctx->ccid3hctx_x = rfc3390_initial_rate(sk);
  383. hctx->ccid3hctx_t_ld = now;
  384. ccid3_update_send_interval(hctx);
  385. goto done_computing_x;
  386. } else if (hctx->ccid3hctx_p == 0) {
  387. /*
  388. * First feedback after nofeedback timer expiry (4.3)
  389. */
  390. goto done_computing_x;
  391. }
  392. }
  393. /* Update sending rate (step 4 of [RFC 3448, 4.3]) */
  394. if (hctx->ccid3hctx_p > 0)
  395. hctx->ccid3hctx_x_calc =
  396. tfrc_calc_x(hctx->ccid3hctx_s,
  397. hctx->ccid3hctx_rtt,
  398. hctx->ccid3hctx_p);
  399. ccid3_hc_tx_update_x(sk, &now);
  400. done_computing_x:
  401. ccid3_pr_debug("%s(%p), RTT=%uus (sample=%uus), s=%u, "
  402. "p=%u, X_calc=%u, X_recv=%u, X=%u\n",
  403. dccp_role(sk),
  404. sk, hctx->ccid3hctx_rtt, r_sample,
  405. hctx->ccid3hctx_s, hctx->ccid3hctx_p,
  406. hctx->ccid3hctx_x_calc,
  407. (unsigned)(hctx->ccid3hctx_x_recv >> 6),
  408. (unsigned)(hctx->ccid3hctx_x >> 6));
  409. /* unschedule no feedback timer */
  410. sk_stop_timer(sk, &hctx->ccid3hctx_no_feedback_timer);
  411. /*
  412. * As we have calculated new ipi, delta, t_nom it is possible
  413. * that we now can send a packet, so wake up dccp_wait_for_ccid
  414. */
  415. sk->sk_write_space(sk);
  416. /*
  417. * Update timeout interval for the nofeedback timer.
  418. * We use a configuration option to increase the lower bound.
  419. * This can help avoid triggering the nofeedback timer too
  420. * often ('spinning') on LANs with small RTTs.
  421. */
  422. hctx->ccid3hctx_t_rto = max_t(u32, 4 * hctx->ccid3hctx_rtt,
  423. (CONFIG_IP_DCCP_CCID3_RTO *
  424. (USEC_PER_SEC / 1000)));
  425. /*
  426. * Schedule no feedback timer to expire in
  427. * max(t_RTO, 2 * s/X) = max(t_RTO, 2 * t_ipi)
  428. */
  429. t_nfb = max(hctx->ccid3hctx_t_rto, 2 * hctx->ccid3hctx_t_ipi);
  430. ccid3_pr_debug("%s(%p), Scheduled no feedback timer to "
  431. "expire in %lu jiffies (%luus)\n",
  432. dccp_role(sk),
  433. sk, usecs_to_jiffies(t_nfb), t_nfb);
  434. sk_reset_timer(sk, &hctx->ccid3hctx_no_feedback_timer,
  435. jiffies + usecs_to_jiffies(t_nfb));
  436. }
  437. static int ccid3_hc_tx_parse_options(struct sock *sk, unsigned char option,
  438. unsigned char len, u16 idx,
  439. unsigned char *value)
  440. {
  441. int rc = 0;
  442. const struct dccp_sock *dp = dccp_sk(sk);
  443. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  444. struct ccid3_options_received *opt_recv;
  445. __be32 opt_val;
  446. opt_recv = &hctx->ccid3hctx_options_received;
  447. if (opt_recv->ccid3or_seqno != dp->dccps_gsr) {
  448. opt_recv->ccid3or_seqno = dp->dccps_gsr;
  449. opt_recv->ccid3or_loss_event_rate = ~0;
  450. opt_recv->ccid3or_loss_intervals_idx = 0;
  451. opt_recv->ccid3or_loss_intervals_len = 0;
  452. opt_recv->ccid3or_receive_rate = 0;
  453. }
  454. switch (option) {
  455. case TFRC_OPT_LOSS_EVENT_RATE:
  456. if (unlikely(len != 4)) {
  457. DCCP_WARN("%s(%p), invalid len %d "
  458. "for TFRC_OPT_LOSS_EVENT_RATE\n",
  459. dccp_role(sk), sk, len);
  460. rc = -EINVAL;
  461. } else {
  462. opt_val = get_unaligned((__be32 *)value);
  463. opt_recv->ccid3or_loss_event_rate = ntohl(opt_val);
  464. ccid3_pr_debug("%s(%p), LOSS_EVENT_RATE=%u\n",
  465. dccp_role(sk), sk,
  466. opt_recv->ccid3or_loss_event_rate);
  467. }
  468. break;
  469. case TFRC_OPT_LOSS_INTERVALS:
  470. opt_recv->ccid3or_loss_intervals_idx = idx;
  471. opt_recv->ccid3or_loss_intervals_len = len;
  472. ccid3_pr_debug("%s(%p), LOSS_INTERVALS=(%u, %u)\n",
  473. dccp_role(sk), sk,
  474. opt_recv->ccid3or_loss_intervals_idx,
  475. opt_recv->ccid3or_loss_intervals_len);
  476. break;
  477. case TFRC_OPT_RECEIVE_RATE:
  478. if (unlikely(len != 4)) {
  479. DCCP_WARN("%s(%p), invalid len %d "
  480. "for TFRC_OPT_RECEIVE_RATE\n",
  481. dccp_role(sk), sk, len);
  482. rc = -EINVAL;
  483. } else {
  484. opt_val = get_unaligned((__be32 *)value);
  485. opt_recv->ccid3or_receive_rate = ntohl(opt_val);
  486. ccid3_pr_debug("%s(%p), RECEIVE_RATE=%u\n",
  487. dccp_role(sk), sk,
  488. opt_recv->ccid3or_receive_rate);
  489. }
  490. break;
  491. }
  492. return rc;
  493. }
  494. static int ccid3_hc_tx_init(struct ccid *ccid, struct sock *sk)
  495. {
  496. struct ccid3_hc_tx_sock *hctx = ccid_priv(ccid);
  497. hctx->ccid3hctx_state = TFRC_SSTATE_NO_SENT;
  498. hctx->ccid3hctx_hist = NULL;
  499. setup_timer(&hctx->ccid3hctx_no_feedback_timer,
  500. ccid3_hc_tx_no_feedback_timer, (unsigned long)sk);
  501. return 0;
  502. }
  503. static void ccid3_hc_tx_exit(struct sock *sk)
  504. {
  505. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  506. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_TERM);
  507. sk_stop_timer(sk, &hctx->ccid3hctx_no_feedback_timer);
  508. tfrc_tx_hist_purge(&hctx->ccid3hctx_hist);
  509. }
  510. static void ccid3_hc_tx_get_info(struct sock *sk, struct tcp_info *info)
  511. {
  512. struct ccid3_hc_tx_sock *hctx;
  513. /* Listen socks doesn't have a private CCID block */
  514. if (sk->sk_state == DCCP_LISTEN)
  515. return;
  516. hctx = ccid3_hc_tx_sk(sk);
  517. info->tcpi_rto = hctx->ccid3hctx_t_rto;
  518. info->tcpi_rtt = hctx->ccid3hctx_rtt;
  519. }
  520. static int ccid3_hc_tx_getsockopt(struct sock *sk, const int optname, int len,
  521. u32 __user *optval, int __user *optlen)
  522. {
  523. const struct ccid3_hc_tx_sock *hctx;
  524. const void *val;
  525. /* Listen socks doesn't have a private CCID block */
  526. if (sk->sk_state == DCCP_LISTEN)
  527. return -EINVAL;
  528. hctx = ccid3_hc_tx_sk(sk);
  529. switch (optname) {
  530. case DCCP_SOCKOPT_CCID_TX_INFO:
  531. if (len < sizeof(hctx->ccid3hctx_tfrc))
  532. return -EINVAL;
  533. len = sizeof(hctx->ccid3hctx_tfrc);
  534. val = &hctx->ccid3hctx_tfrc;
  535. break;
  536. default:
  537. return -ENOPROTOOPT;
  538. }
  539. if (put_user(len, optlen) || copy_to_user(optval, val, len))
  540. return -EFAULT;
  541. return 0;
  542. }
  543. /*
  544. * Receiver Half-Connection Routines
  545. */
  546. /* CCID3 feedback types */
  547. enum ccid3_fback_type {
  548. CCID3_FBACK_NONE = 0,
  549. CCID3_FBACK_INITIAL,
  550. CCID3_FBACK_PERIODIC,
  551. CCID3_FBACK_PARAM_CHANGE
  552. };
  553. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  554. static const char *ccid3_rx_state_name(enum ccid3_hc_rx_states state)
  555. {
  556. static char *ccid3_rx_state_names[] = {
  557. [TFRC_RSTATE_NO_DATA] = "NO_DATA",
  558. [TFRC_RSTATE_DATA] = "DATA",
  559. [TFRC_RSTATE_TERM] = "TERM",
  560. };
  561. return ccid3_rx_state_names[state];
  562. }
  563. #endif
  564. static void ccid3_hc_rx_set_state(struct sock *sk,
  565. enum ccid3_hc_rx_states state)
  566. {
  567. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  568. enum ccid3_hc_rx_states oldstate = hcrx->ccid3hcrx_state;
  569. ccid3_pr_debug("%s(%p) %-8.8s -> %s\n",
  570. dccp_role(sk), sk, ccid3_rx_state_name(oldstate),
  571. ccid3_rx_state_name(state));
  572. WARN_ON(state == oldstate);
  573. hcrx->ccid3hcrx_state = state;
  574. }
  575. static void ccid3_hc_rx_send_feedback(struct sock *sk,
  576. const struct sk_buff *skb,
  577. enum ccid3_fback_type fbtype)
  578. {
  579. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  580. struct dccp_sock *dp = dccp_sk(sk);
  581. ktime_t now;
  582. s64 delta = 0;
  583. if (unlikely(hcrx->ccid3hcrx_state == TFRC_RSTATE_TERM))
  584. return;
  585. now = ktime_get_real();
  586. switch (fbtype) {
  587. case CCID3_FBACK_INITIAL:
  588. hcrx->ccid3hcrx_x_recv = 0;
  589. hcrx->ccid3hcrx_pinv = ~0U; /* see RFC 4342, 8.5 */
  590. break;
  591. case CCID3_FBACK_PARAM_CHANGE:
  592. /*
  593. * When parameters change (new loss or p > p_prev), we do not
  594. * have a reliable estimate for R_m of [RFC 3448, 6.2] and so
  595. * need to reuse the previous value of X_recv. However, when
  596. * X_recv was 0 (due to early loss), this would kill X down to
  597. * s/t_mbi (i.e. one packet in 64 seconds).
  598. * To avoid such drastic reduction, we approximate X_recv as
  599. * the number of bytes since last feedback.
  600. * This is a safe fallback, since X is bounded above by X_calc.
  601. */
  602. if (hcrx->ccid3hcrx_x_recv > 0)
  603. break;
  604. /* fall through */
  605. case CCID3_FBACK_PERIODIC:
  606. delta = ktime_us_delta(now, hcrx->ccid3hcrx_tstamp_last_feedback);
  607. if (delta <= 0)
  608. DCCP_BUG("delta (%ld) <= 0", (long)delta);
  609. else
  610. hcrx->ccid3hcrx_x_recv =
  611. scaled_div32(hcrx->ccid3hcrx_bytes_recv, delta);
  612. break;
  613. default:
  614. return;
  615. }
  616. ccid3_pr_debug("Interval %ldusec, X_recv=%u, 1/p=%u\n", (long)delta,
  617. hcrx->ccid3hcrx_x_recv, hcrx->ccid3hcrx_pinv);
  618. hcrx->ccid3hcrx_tstamp_last_feedback = now;
  619. hcrx->ccid3hcrx_last_counter = dccp_hdr(skb)->dccph_ccval;
  620. hcrx->ccid3hcrx_bytes_recv = 0;
  621. dp->dccps_hc_rx_insert_options = 1;
  622. dccp_send_ack(sk);
  623. }
  624. static int ccid3_hc_rx_insert_options(struct sock *sk, struct sk_buff *skb)
  625. {
  626. const struct ccid3_hc_rx_sock *hcrx;
  627. __be32 x_recv, pinv;
  628. if (!(sk->sk_state == DCCP_OPEN || sk->sk_state == DCCP_PARTOPEN))
  629. return 0;
  630. hcrx = ccid3_hc_rx_sk(sk);
  631. if (dccp_packet_without_ack(skb))
  632. return 0;
  633. x_recv = htonl(hcrx->ccid3hcrx_x_recv);
  634. pinv = htonl(hcrx->ccid3hcrx_pinv);
  635. if (dccp_insert_option(sk, skb, TFRC_OPT_LOSS_EVENT_RATE,
  636. &pinv, sizeof(pinv)) ||
  637. dccp_insert_option(sk, skb, TFRC_OPT_RECEIVE_RATE,
  638. &x_recv, sizeof(x_recv)))
  639. return -1;
  640. return 0;
  641. }
  642. /** ccid3_first_li - Implements [RFC 3448, 6.3.1]
  643. *
  644. * Determine the length of the first loss interval via inverse lookup.
  645. * Assume that X_recv can be computed by the throughput equation
  646. * s
  647. * X_recv = --------
  648. * R * fval
  649. * Find some p such that f(p) = fval; return 1/p (scaled).
  650. */
  651. static u32 ccid3_first_li(struct sock *sk)
  652. {
  653. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  654. u32 x_recv, p, delta;
  655. u64 fval;
  656. if (hcrx->ccid3hcrx_rtt == 0) {
  657. DCCP_WARN("No RTT estimate available, using fallback RTT\n");
  658. hcrx->ccid3hcrx_rtt = DCCP_FALLBACK_RTT;
  659. }
  660. delta = ktime_to_us(net_timedelta(hcrx->ccid3hcrx_tstamp_last_feedback));
  661. x_recv = scaled_div32(hcrx->ccid3hcrx_bytes_recv, delta);
  662. if (x_recv == 0) { /* would also trigger divide-by-zero */
  663. DCCP_WARN("X_recv==0\n");
  664. if ((x_recv = hcrx->ccid3hcrx_x_recv) == 0) {
  665. DCCP_BUG("stored value of X_recv is zero");
  666. return ~0U;
  667. }
  668. }
  669. fval = scaled_div(hcrx->ccid3hcrx_s, hcrx->ccid3hcrx_rtt);
  670. fval = scaled_div32(fval, x_recv);
  671. p = tfrc_calc_x_reverse_lookup(fval);
  672. ccid3_pr_debug("%s(%p), receive rate=%u bytes/s, implied "
  673. "loss rate=%u\n", dccp_role(sk), sk, x_recv, p);
  674. return p == 0 ? ~0U : scaled_div(1, p);
  675. }
  676. static void ccid3_hc_rx_packet_recv(struct sock *sk, struct sk_buff *skb)
  677. {
  678. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  679. enum ccid3_fback_type do_feedback = CCID3_FBACK_NONE;
  680. const u32 ndp = dccp_sk(sk)->dccps_options_received.dccpor_ndp;
  681. const bool is_data_packet = dccp_data_packet(skb);
  682. if (unlikely(hcrx->ccid3hcrx_state == TFRC_RSTATE_NO_DATA)) {
  683. if (is_data_packet) {
  684. const u32 payload = skb->len - dccp_hdr(skb)->dccph_doff * 4;
  685. do_feedback = CCID3_FBACK_INITIAL;
  686. ccid3_hc_rx_set_state(sk, TFRC_RSTATE_DATA);
  687. hcrx->ccid3hcrx_s = payload;
  688. /*
  689. * Not necessary to update ccid3hcrx_bytes_recv here,
  690. * since X_recv = 0 for the first feedback packet (cf.
  691. * RFC 3448, 6.3) -- gerrit
  692. */
  693. }
  694. goto update_records;
  695. }
  696. if (tfrc_rx_hist_duplicate(&hcrx->ccid3hcrx_hist, skb))
  697. return; /* done receiving */
  698. if (is_data_packet) {
  699. const u32 payload = skb->len - dccp_hdr(skb)->dccph_doff * 4;
  700. /*
  701. * Update moving-average of s and the sum of received payload bytes
  702. */
  703. hcrx->ccid3hcrx_s = tfrc_ewma(hcrx->ccid3hcrx_s, payload, 9);
  704. hcrx->ccid3hcrx_bytes_recv += payload;
  705. }
  706. /*
  707. * Handle pending losses and otherwise check for new loss
  708. */
  709. if (tfrc_rx_hist_loss_pending(&hcrx->ccid3hcrx_hist) &&
  710. tfrc_rx_handle_loss(&hcrx->ccid3hcrx_hist,
  711. &hcrx->ccid3hcrx_li_hist,
  712. skb, ndp, ccid3_first_li, sk) ) {
  713. do_feedback = CCID3_FBACK_PARAM_CHANGE;
  714. goto done_receiving;
  715. }
  716. if (tfrc_rx_hist_new_loss_indicated(&hcrx->ccid3hcrx_hist, skb, ndp))
  717. goto update_records;
  718. /*
  719. * Handle data packets: RTT sampling and monitoring p
  720. */
  721. if (unlikely(!is_data_packet))
  722. goto update_records;
  723. if (!tfrc_lh_is_initialised(&hcrx->ccid3hcrx_li_hist)) {
  724. const u32 sample = tfrc_rx_hist_sample_rtt(&hcrx->ccid3hcrx_hist, skb);
  725. /*
  726. * Empty loss history: no loss so far, hence p stays 0.
  727. * Sample RTT values, since an RTT estimate is required for the
  728. * computation of p when the first loss occurs; RFC 3448, 6.3.1.
  729. */
  730. if (sample != 0)
  731. hcrx->ccid3hcrx_rtt = tfrc_ewma(hcrx->ccid3hcrx_rtt, sample, 9);
  732. } else if (tfrc_lh_update_i_mean(&hcrx->ccid3hcrx_li_hist, skb)) {
  733. /*
  734. * Step (3) of [RFC 3448, 6.1]: Recompute I_mean and, if I_mean
  735. * has decreased (resp. p has increased), send feedback now.
  736. */
  737. do_feedback = CCID3_FBACK_PARAM_CHANGE;
  738. }
  739. /*
  740. * Check if the periodic once-per-RTT feedback is due; RFC 4342, 10.3
  741. */
  742. if (SUB16(dccp_hdr(skb)->dccph_ccval, hcrx->ccid3hcrx_last_counter) > 3)
  743. do_feedback = CCID3_FBACK_PERIODIC;
  744. update_records:
  745. tfrc_rx_hist_add_packet(&hcrx->ccid3hcrx_hist, skb, ndp);
  746. done_receiving:
  747. if (do_feedback)
  748. ccid3_hc_rx_send_feedback(sk, skb, do_feedback);
  749. }
  750. static int ccid3_hc_rx_init(struct ccid *ccid, struct sock *sk)
  751. {
  752. struct ccid3_hc_rx_sock *hcrx = ccid_priv(ccid);
  753. hcrx->ccid3hcrx_state = TFRC_RSTATE_NO_DATA;
  754. tfrc_lh_init(&hcrx->ccid3hcrx_li_hist);
  755. return tfrc_rx_hist_alloc(&hcrx->ccid3hcrx_hist);
  756. }
  757. static void ccid3_hc_rx_exit(struct sock *sk)
  758. {
  759. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  760. ccid3_hc_rx_set_state(sk, TFRC_RSTATE_TERM);
  761. tfrc_rx_hist_purge(&hcrx->ccid3hcrx_hist);
  762. tfrc_lh_cleanup(&hcrx->ccid3hcrx_li_hist);
  763. }
  764. static void ccid3_hc_rx_get_info(struct sock *sk, struct tcp_info *info)
  765. {
  766. const struct ccid3_hc_rx_sock *hcrx;
  767. /* Listen socks doesn't have a private CCID block */
  768. if (sk->sk_state == DCCP_LISTEN)
  769. return;
  770. hcrx = ccid3_hc_rx_sk(sk);
  771. info->tcpi_ca_state = hcrx->ccid3hcrx_state;
  772. info->tcpi_options |= TCPI_OPT_TIMESTAMPS;
  773. info->tcpi_rcv_rtt = hcrx->ccid3hcrx_rtt;
  774. }
  775. static int ccid3_hc_rx_getsockopt(struct sock *sk, const int optname, int len,
  776. u32 __user *optval, int __user *optlen)
  777. {
  778. const struct ccid3_hc_rx_sock *hcrx;
  779. struct tfrc_rx_info rx_info;
  780. const void *val;
  781. /* Listen socks doesn't have a private CCID block */
  782. if (sk->sk_state == DCCP_LISTEN)
  783. return -EINVAL;
  784. hcrx = ccid3_hc_rx_sk(sk);
  785. switch (optname) {
  786. case DCCP_SOCKOPT_CCID_RX_INFO:
  787. if (len < sizeof(rx_info))
  788. return -EINVAL;
  789. rx_info.tfrcrx_x_recv = hcrx->ccid3hcrx_x_recv;
  790. rx_info.tfrcrx_rtt = hcrx->ccid3hcrx_rtt;
  791. rx_info.tfrcrx_p = hcrx->ccid3hcrx_pinv == 0 ? ~0U :
  792. scaled_div(1, hcrx->ccid3hcrx_pinv);
  793. len = sizeof(rx_info);
  794. val = &rx_info;
  795. break;
  796. default:
  797. return -ENOPROTOOPT;
  798. }
  799. if (put_user(len, optlen) || copy_to_user(optval, val, len))
  800. return -EFAULT;
  801. return 0;
  802. }
  803. static struct ccid_operations ccid3 = {
  804. .ccid_id = DCCPC_CCID3,
  805. .ccid_name = "TCP-Friendly Rate Control",
  806. .ccid_owner = THIS_MODULE,
  807. .ccid_hc_tx_obj_size = sizeof(struct ccid3_hc_tx_sock),
  808. .ccid_hc_tx_init = ccid3_hc_tx_init,
  809. .ccid_hc_tx_exit = ccid3_hc_tx_exit,
  810. .ccid_hc_tx_send_packet = ccid3_hc_tx_send_packet,
  811. .ccid_hc_tx_packet_sent = ccid3_hc_tx_packet_sent,
  812. .ccid_hc_tx_packet_recv = ccid3_hc_tx_packet_recv,
  813. .ccid_hc_tx_parse_options = ccid3_hc_tx_parse_options,
  814. .ccid_hc_rx_obj_size = sizeof(struct ccid3_hc_rx_sock),
  815. .ccid_hc_rx_init = ccid3_hc_rx_init,
  816. .ccid_hc_rx_exit = ccid3_hc_rx_exit,
  817. .ccid_hc_rx_insert_options = ccid3_hc_rx_insert_options,
  818. .ccid_hc_rx_packet_recv = ccid3_hc_rx_packet_recv,
  819. .ccid_hc_rx_get_info = ccid3_hc_rx_get_info,
  820. .ccid_hc_tx_get_info = ccid3_hc_tx_get_info,
  821. .ccid_hc_rx_getsockopt = ccid3_hc_rx_getsockopt,
  822. .ccid_hc_tx_getsockopt = ccid3_hc_tx_getsockopt,
  823. };
  824. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  825. module_param(ccid3_debug, bool, 0444);
  826. MODULE_PARM_DESC(ccid3_debug, "Enable debug messages");
  827. #endif
  828. static __init int ccid3_module_init(void)
  829. {
  830. return ccid_register(&ccid3);
  831. }
  832. module_init(ccid3_module_init);
  833. static __exit void ccid3_module_exit(void)
  834. {
  835. ccid_unregister(&ccid3);
  836. }
  837. module_exit(ccid3_module_exit);
  838. MODULE_AUTHOR("Ian McDonald <ian.mcdonald@jandi.co.nz>, "
  839. "Arnaldo Carvalho de Melo <acme@ghostprotocols.net>");
  840. MODULE_DESCRIPTION("DCCP TFRC CCID3 CCID");
  841. MODULE_LICENSE("GPL");
  842. MODULE_ALIAS("net-dccp-ccid-3");