ccid3.c 25 KB

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