ccid3.c 27 KB

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