ccid3.c 24 KB

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