ccid3.c 32 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099
  1. /*
  2. * net/dccp/ccids/ccid3.c
  3. *
  4. * Copyright (c) 2005-7 The University of Waikato, Hamilton, New Zealand.
  5. * Copyright (c) 2005-7 Ian McDonald <ian.mcdonald@jandi.co.nz>
  6. *
  7. * An implementation of the DCCP protocol
  8. *
  9. * This code has been developed by the University of Waikato WAND
  10. * research group. For further information please see http://www.wand.net.nz/
  11. *
  12. * This code also uses code from Lulea University, rereleased as GPL by its
  13. * authors:
  14. * Copyright (c) 2003 Nils-Erik Mattsson, Joacim Haggmark, Magnus Erixzon
  15. *
  16. * Changes to meet Linux coding standards, to make it meet latest ccid3 draft
  17. * and to make it work as a loadable module in the DCCP stack written by
  18. * Arnaldo Carvalho de Melo <acme@conectiva.com.br>.
  19. *
  20. * Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@conectiva.com.br>
  21. *
  22. * This program is free software; you can redistribute it and/or modify
  23. * it under the terms of the GNU General Public License as published by
  24. * the Free Software Foundation; either version 2 of the License, or
  25. * (at your option) any later version.
  26. *
  27. * This program is distributed in the hope that it will be useful,
  28. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  29. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  30. * GNU General Public License for more details.
  31. *
  32. * You should have received a copy of the GNU General Public License
  33. * along with this program; if not, write to the Free Software
  34. * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  35. */
  36. #include "../ccid.h"
  37. #include "../dccp.h"
  38. #include "lib/packet_history.h"
  39. #include "lib/loss_interval.h"
  40. #include "lib/tfrc.h"
  41. #include "ccid3.h"
  42. #include <asm/unaligned.h>
  43. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  44. static int ccid3_debug;
  45. #define ccid3_pr_debug(format, a...) DCCP_PR_DEBUG(ccid3_debug, format, ##a)
  46. #else
  47. #define ccid3_pr_debug(format, a...)
  48. #endif
  49. static struct dccp_tx_hist *ccid3_tx_hist;
  50. static struct dccp_rx_hist *ccid3_rx_hist;
  51. /*
  52. * Transmitter Half-Connection Routines
  53. */
  54. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  55. static const char *ccid3_tx_state_name(enum ccid3_hc_tx_states state)
  56. {
  57. static char *ccid3_state_names[] = {
  58. [TFRC_SSTATE_NO_SENT] = "NO_SENT",
  59. [TFRC_SSTATE_NO_FBACK] = "NO_FBACK",
  60. [TFRC_SSTATE_FBACK] = "FBACK",
  61. [TFRC_SSTATE_TERM] = "TERM",
  62. };
  63. return ccid3_state_names[state];
  64. }
  65. #endif
  66. static void ccid3_hc_tx_set_state(struct sock *sk,
  67. enum ccid3_hc_tx_states state)
  68. {
  69. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  70. enum ccid3_hc_tx_states oldstate = hctx->ccid3hctx_state;
  71. ccid3_pr_debug("%s(%p) %-8.8s -> %s\n",
  72. dccp_role(sk), sk, ccid3_tx_state_name(oldstate),
  73. ccid3_tx_state_name(state));
  74. WARN_ON(state == oldstate);
  75. hctx->ccid3hctx_state = state;
  76. }
  77. /*
  78. * Compute the initial sending rate X_init according to RFC 3390:
  79. * w_init = min(4 * MSS, max(2 * MSS, 4380 bytes))
  80. * X_init = w_init / RTT
  81. * For consistency with other parts of the code, X_init is scaled by 2^6.
  82. */
  83. static inline u64 rfc3390_initial_rate(struct sock *sk)
  84. {
  85. const struct dccp_sock *dp = dccp_sk(sk);
  86. const __u32 w_init = min(4 * dp->dccps_mss_cache,
  87. max(2 * dp->dccps_mss_cache, 4380U));
  88. return scaled_div(w_init << 6, ccid3_hc_tx_sk(sk)->ccid3hctx_rtt);
  89. }
  90. /*
  91. * Recalculate t_ipi and delta (should be called whenever X changes)
  92. */
  93. static inline void ccid3_update_send_interval(struct ccid3_hc_tx_sock *hctx)
  94. {
  95. /* Calculate new t_ipi = s / X_inst (X_inst is in 64 * bytes/second) */
  96. hctx->ccid3hctx_t_ipi = scaled_div32(((u64)hctx->ccid3hctx_s) << 6,
  97. hctx->ccid3hctx_x);
  98. /* Calculate new delta by delta = min(t_ipi / 2, t_gran / 2) */
  99. hctx->ccid3hctx_delta = min_t(u32, hctx->ccid3hctx_t_ipi / 2,
  100. TFRC_OPSYS_HALF_TIME_GRAN);
  101. ccid3_pr_debug("t_ipi=%u, delta=%u, s=%u, X=%u\n",
  102. hctx->ccid3hctx_t_ipi, hctx->ccid3hctx_delta,
  103. hctx->ccid3hctx_s, (unsigned)(hctx->ccid3hctx_x >> 6));
  104. }
  105. /**
  106. * ccid3_hc_tx_update_x - Update allowed sending rate X
  107. * @stamp: most recent time if available - can be left NULL.
  108. * This function tracks draft rfc3448bis, check there for latest details.
  109. *
  110. * Note: X and X_recv are both stored in units of 64 * bytes/second, to support
  111. * fine-grained resolution of sending rates. This requires scaling by 2^6
  112. * throughout the code. Only X_calc is unscaled (in bytes/second).
  113. *
  114. */
  115. static void ccid3_hc_tx_update_x(struct sock *sk, ktime_t *stamp)
  116. {
  117. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  118. __u64 min_rate = 2 * hctx->ccid3hctx_x_recv;
  119. const __u64 old_x = hctx->ccid3hctx_x;
  120. ktime_t now = stamp? *stamp : ktime_get_real();
  121. /*
  122. * Handle IDLE periods: do not reduce below RFC3390 initial sending rate
  123. * when idling [RFC 4342, 5.1]. See also draft-ietf-dccp-rfc3448bis.
  124. * For consistency with X and X_recv, min_rate is also scaled by 2^6.
  125. */
  126. if (unlikely(hctx->ccid3hctx_idle)) {
  127. min_rate = rfc3390_initial_rate(sk);
  128. min_rate = max(min_rate, 2 * hctx->ccid3hctx_x_recv);
  129. }
  130. if (hctx->ccid3hctx_p > 0) {
  131. hctx->ccid3hctx_x = min(((__u64)hctx->ccid3hctx_x_calc) << 6,
  132. min_rate);
  133. hctx->ccid3hctx_x = max(hctx->ccid3hctx_x,
  134. (((__u64)hctx->ccid3hctx_s) << 6) /
  135. TFRC_T_MBI);
  136. } else if (ktime_us_delta(now, hctx->ccid3hctx_t_ld)
  137. - (s64)hctx->ccid3hctx_rtt >= 0) {
  138. hctx->ccid3hctx_x =
  139. max(min(2 * hctx->ccid3hctx_x, min_rate),
  140. scaled_div(((__u64)hctx->ccid3hctx_s) << 6,
  141. hctx->ccid3hctx_rtt));
  142. hctx->ccid3hctx_t_ld = now;
  143. }
  144. if (hctx->ccid3hctx_x != old_x) {
  145. ccid3_pr_debug("X_prev=%u, X_now=%u, X_calc=%u, "
  146. "X_recv=%u\n", (unsigned)(old_x >> 6),
  147. (unsigned)(hctx->ccid3hctx_x >> 6),
  148. hctx->ccid3hctx_x_calc,
  149. (unsigned)(hctx->ccid3hctx_x_recv >> 6));
  150. ccid3_update_send_interval(hctx);
  151. }
  152. }
  153. /*
  154. * Track the mean packet size `s' (cf. RFC 4342, 5.3 and RFC 3448, 4.1)
  155. * @len: DCCP packet payload size in bytes
  156. */
  157. static inline void ccid3_hc_tx_update_s(struct ccid3_hc_tx_sock *hctx, int len)
  158. {
  159. const u16 old_s = hctx->ccid3hctx_s;
  160. hctx->ccid3hctx_s = old_s == 0 ? len : (9 * old_s + len) / 10;
  161. if (hctx->ccid3hctx_s != old_s)
  162. ccid3_update_send_interval(hctx);
  163. }
  164. /*
  165. * Update Window Counter using the algorithm from [RFC 4342, 8.1].
  166. * The algorithm is not applicable if RTT < 4 microseconds.
  167. */
  168. static inline void ccid3_hc_tx_update_win_count(struct ccid3_hc_tx_sock *hctx,
  169. ktime_t now)
  170. {
  171. u32 quarter_rtts;
  172. if (unlikely(hctx->ccid3hctx_rtt < 4)) /* avoid divide-by-zero */
  173. return;
  174. quarter_rtts = ktime_us_delta(now, hctx->ccid3hctx_t_last_win_count);
  175. quarter_rtts /= hctx->ccid3hctx_rtt / 4;
  176. if (quarter_rtts > 0) {
  177. hctx->ccid3hctx_t_last_win_count = now;
  178. hctx->ccid3hctx_last_win_count += min_t(u32, quarter_rtts, 5);
  179. hctx->ccid3hctx_last_win_count &= 0xF; /* mod 16 */
  180. }
  181. }
  182. static void ccid3_hc_tx_no_feedback_timer(unsigned long data)
  183. {
  184. struct sock *sk = (struct sock *)data;
  185. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  186. unsigned long t_nfb = USEC_PER_SEC / 5;
  187. bh_lock_sock(sk);
  188. if (sock_owned_by_user(sk)) {
  189. /* Try again later. */
  190. /* XXX: set some sensible MIB */
  191. goto restart_timer;
  192. }
  193. ccid3_pr_debug("%s(%p, state=%s) - entry \n", dccp_role(sk), sk,
  194. ccid3_tx_state_name(hctx->ccid3hctx_state));
  195. hctx->ccid3hctx_idle = 1;
  196. switch (hctx->ccid3hctx_state) {
  197. case TFRC_SSTATE_NO_FBACK:
  198. /* RFC 3448, 4.4: Halve send rate directly */
  199. hctx->ccid3hctx_x = max(hctx->ccid3hctx_x / 2,
  200. (((__u64)hctx->ccid3hctx_s) << 6) /
  201. TFRC_T_MBI);
  202. ccid3_pr_debug("%s(%p, state=%s), updated tx rate to %u "
  203. "bytes/s\n", dccp_role(sk), sk,
  204. ccid3_tx_state_name(hctx->ccid3hctx_state),
  205. (unsigned)(hctx->ccid3hctx_x >> 6));
  206. /* The value of R is still undefined and so we can not recompute
  207. * the timeout value. Keep initial value as per [RFC 4342, 5]. */
  208. t_nfb = TFRC_INITIAL_TIMEOUT;
  209. ccid3_update_send_interval(hctx);
  210. break;
  211. case TFRC_SSTATE_FBACK:
  212. /*
  213. * Modify the cached value of X_recv [RFC 3448, 4.4]
  214. *
  215. * If (p == 0 || X_calc > 2 * X_recv)
  216. * X_recv = max(X_recv / 2, s / (2 * t_mbi));
  217. * Else
  218. * X_recv = X_calc / 4;
  219. *
  220. * Note that X_recv is scaled by 2^6 while X_calc is not
  221. */
  222. BUG_ON(hctx->ccid3hctx_p && !hctx->ccid3hctx_x_calc);
  223. if (hctx->ccid3hctx_p == 0 ||
  224. (hctx->ccid3hctx_x_calc > (hctx->ccid3hctx_x_recv >> 5))) {
  225. hctx->ccid3hctx_x_recv =
  226. max(hctx->ccid3hctx_x_recv / 2,
  227. (((__u64)hctx->ccid3hctx_s) << 6) /
  228. (2 * TFRC_T_MBI));
  229. } else {
  230. hctx->ccid3hctx_x_recv = hctx->ccid3hctx_x_calc;
  231. hctx->ccid3hctx_x_recv <<= 4;
  232. }
  233. /* Now recalculate X [RFC 3448, 4.3, step (4)] */
  234. ccid3_hc_tx_update_x(sk, NULL);
  235. /*
  236. * Schedule no feedback timer to expire in
  237. * max(t_RTO, 2 * s/X) = max(t_RTO, 2 * t_ipi)
  238. * See comments in packet_recv() regarding the value of t_RTO.
  239. */
  240. t_nfb = max(hctx->ccid3hctx_t_rto, 2 * hctx->ccid3hctx_t_ipi);
  241. break;
  242. case TFRC_SSTATE_NO_SENT:
  243. DCCP_BUG("%s(%p) - Illegal state NO_SENT", dccp_role(sk), sk);
  244. /* fall through */
  245. case TFRC_SSTATE_TERM:
  246. goto out;
  247. }
  248. restart_timer:
  249. sk_reset_timer(sk, &hctx->ccid3hctx_no_feedback_timer,
  250. jiffies + usecs_to_jiffies(t_nfb));
  251. out:
  252. bh_unlock_sock(sk);
  253. sock_put(sk);
  254. }
  255. /*
  256. * returns
  257. * > 0: delay (in msecs) that should pass before actually sending
  258. * = 0: can send immediately
  259. * < 0: error condition; do not send packet
  260. */
  261. static int ccid3_hc_tx_send_packet(struct sock *sk, struct sk_buff *skb)
  262. {
  263. struct dccp_sock *dp = dccp_sk(sk);
  264. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  265. ktime_t now = ktime_get_real();
  266. s64 delay;
  267. /*
  268. * This function is called only for Data and DataAck packets. Sending
  269. * zero-sized Data(Ack)s is theoretically possible, but for congestion
  270. * control this case is pathological - ignore it.
  271. */
  272. if (unlikely(skb->len == 0))
  273. return -EBADMSG;
  274. switch (hctx->ccid3hctx_state) {
  275. case TFRC_SSTATE_NO_SENT:
  276. sk_reset_timer(sk, &hctx->ccid3hctx_no_feedback_timer,
  277. (jiffies +
  278. usecs_to_jiffies(TFRC_INITIAL_TIMEOUT)));
  279. hctx->ccid3hctx_last_win_count = 0;
  280. hctx->ccid3hctx_t_last_win_count = now;
  281. /* Set t_0 for initial packet */
  282. hctx->ccid3hctx_t_nom = now;
  283. hctx->ccid3hctx_s = skb->len;
  284. /*
  285. * Use initial RTT sample when available: recommended by erratum
  286. * to RFC 4342. This implements the initialisation procedure of
  287. * draft rfc3448bis, section 4.2. Remember, X is scaled by 2^6.
  288. */
  289. if (dp->dccps_syn_rtt) {
  290. ccid3_pr_debug("SYN RTT = %uus\n", dp->dccps_syn_rtt);
  291. hctx->ccid3hctx_rtt = dp->dccps_syn_rtt;
  292. hctx->ccid3hctx_x = rfc3390_initial_rate(sk);
  293. hctx->ccid3hctx_t_ld = now;
  294. } else {
  295. /* Sender does not have RTT sample: X = MSS/second */
  296. hctx->ccid3hctx_x = dp->dccps_mss_cache;
  297. hctx->ccid3hctx_x <<= 6;
  298. }
  299. ccid3_update_send_interval(hctx);
  300. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_NO_FBACK);
  301. break;
  302. case TFRC_SSTATE_NO_FBACK:
  303. case TFRC_SSTATE_FBACK:
  304. delay = ktime_us_delta(hctx->ccid3hctx_t_nom, now);
  305. ccid3_pr_debug("delay=%ld\n", (long)delay);
  306. /*
  307. * Scheduling of packet transmissions [RFC 3448, 4.6]
  308. *
  309. * if (t_now > t_nom - delta)
  310. * // send the packet now
  311. * else
  312. * // send the packet in (t_nom - t_now) milliseconds.
  313. */
  314. if (delay - (s64)hctx->ccid3hctx_delta >= 1000)
  315. return (u32)delay / 1000L;
  316. ccid3_hc_tx_update_win_count(hctx, now);
  317. break;
  318. case TFRC_SSTATE_TERM:
  319. DCCP_BUG("%s(%p) - Illegal state TERM", dccp_role(sk), sk);
  320. return -EINVAL;
  321. }
  322. /* prepare to send now (add options etc.) */
  323. dp->dccps_hc_tx_insert_options = 1;
  324. DCCP_SKB_CB(skb)->dccpd_ccval = hctx->ccid3hctx_last_win_count;
  325. hctx->ccid3hctx_idle = 0;
  326. /* set the nominal send time for the next following packet */
  327. hctx->ccid3hctx_t_nom = ktime_add_us(hctx->ccid3hctx_t_nom,
  328. hctx->ccid3hctx_t_ipi);
  329. return 0;
  330. }
  331. static void ccid3_hc_tx_packet_sent(struct sock *sk, int more,
  332. unsigned int len)
  333. {
  334. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  335. struct dccp_tx_hist_entry *packet;
  336. ccid3_hc_tx_update_s(hctx, len);
  337. packet = dccp_tx_hist_entry_new(ccid3_tx_hist, GFP_ATOMIC);
  338. if (unlikely(packet == NULL)) {
  339. DCCP_CRIT("packet history - out of memory!");
  340. return;
  341. }
  342. dccp_tx_hist_add_entry(&hctx->ccid3hctx_hist, packet);
  343. packet->dccphtx_tstamp = ktime_get_real();
  344. packet->dccphtx_seqno = dccp_sk(sk)->dccps_gss;
  345. packet->dccphtx_rtt = hctx->ccid3hctx_rtt;
  346. packet->dccphtx_sent = 1;
  347. }
  348. static void ccid3_hc_tx_packet_recv(struct sock *sk, struct sk_buff *skb)
  349. {
  350. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  351. struct ccid3_options_received *opt_recv;
  352. struct dccp_tx_hist_entry *packet;
  353. ktime_t now;
  354. unsigned long t_nfb;
  355. u32 pinv, r_sample;
  356. /* we are only interested in ACKs */
  357. if (!(DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_ACK ||
  358. DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_DATAACK))
  359. return;
  360. opt_recv = &hctx->ccid3hctx_options_received;
  361. switch (hctx->ccid3hctx_state) {
  362. case TFRC_SSTATE_NO_FBACK:
  363. case TFRC_SSTATE_FBACK:
  364. /* get packet from history to look up t_recvdata */
  365. packet = dccp_tx_hist_find_entry(&hctx->ccid3hctx_hist,
  366. DCCP_SKB_CB(skb)->dccpd_ack_seq);
  367. if (unlikely(packet == NULL)) {
  368. DCCP_WARN("%s(%p), seqno %llu(%s) doesn't exist "
  369. "in history!\n", dccp_role(sk), sk,
  370. (unsigned long long)DCCP_SKB_CB(skb)->dccpd_ack_seq,
  371. dccp_packet_name(DCCP_SKB_CB(skb)->dccpd_type));
  372. return;
  373. }
  374. /* Update receive rate in units of 64 * bytes/second */
  375. hctx->ccid3hctx_x_recv = opt_recv->ccid3or_receive_rate;
  376. hctx->ccid3hctx_x_recv <<= 6;
  377. /* Update loss event rate */
  378. pinv = opt_recv->ccid3or_loss_event_rate;
  379. if (pinv == ~0U || pinv == 0) /* see RFC 4342, 8.5 */
  380. hctx->ccid3hctx_p = 0;
  381. else /* can not exceed 100% */
  382. hctx->ccid3hctx_p = 1000000 / pinv;
  383. now = ktime_get_real();
  384. /*
  385. * Calculate new round trip sample as per [RFC 3448, 4.3] by
  386. * R_sample = (now - t_recvdata) - t_elapsed
  387. */
  388. r_sample = dccp_sample_rtt(sk, ktime_us_delta(now, packet->dccphtx_tstamp));
  389. /*
  390. * Update RTT estimate by
  391. * If (No feedback recv)
  392. * R = R_sample;
  393. * Else
  394. * R = q * R + (1 - q) * R_sample;
  395. *
  396. * q is a constant, RFC 3448 recomments 0.9
  397. */
  398. if (hctx->ccid3hctx_state == TFRC_SSTATE_NO_FBACK) {
  399. /*
  400. * Larger Initial Windows [RFC 4342, sec. 5]
  401. */
  402. hctx->ccid3hctx_rtt = r_sample;
  403. hctx->ccid3hctx_x = rfc3390_initial_rate(sk);
  404. hctx->ccid3hctx_t_ld = now;
  405. ccid3_update_send_interval(hctx);
  406. ccid3_pr_debug("%s(%p), s=%u, MSS=%u, "
  407. "R_sample=%uus, X=%u\n", dccp_role(sk),
  408. sk, hctx->ccid3hctx_s,
  409. dccp_sk(sk)->dccps_mss_cache, r_sample,
  410. (unsigned)(hctx->ccid3hctx_x >> 6));
  411. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_FBACK);
  412. } else {
  413. hctx->ccid3hctx_rtt = (9 * hctx->ccid3hctx_rtt +
  414. r_sample) / 10;
  415. /* Update sending rate (step 4 of [RFC 3448, 4.3]) */
  416. if (hctx->ccid3hctx_p > 0)
  417. hctx->ccid3hctx_x_calc =
  418. tfrc_calc_x(hctx->ccid3hctx_s,
  419. hctx->ccid3hctx_rtt,
  420. hctx->ccid3hctx_p);
  421. ccid3_hc_tx_update_x(sk, &now);
  422. ccid3_pr_debug("%s(%p), RTT=%uus (sample=%uus), s=%u, "
  423. "p=%u, X_calc=%u, X_recv=%u, X=%u\n",
  424. dccp_role(sk),
  425. sk, hctx->ccid3hctx_rtt, r_sample,
  426. hctx->ccid3hctx_s, hctx->ccid3hctx_p,
  427. hctx->ccid3hctx_x_calc,
  428. (unsigned)(hctx->ccid3hctx_x_recv >> 6),
  429. (unsigned)(hctx->ccid3hctx_x >> 6));
  430. }
  431. /* unschedule no feedback timer */
  432. sk_stop_timer(sk, &hctx->ccid3hctx_no_feedback_timer);
  433. /* remove all packets older than the one acked from history */
  434. dccp_tx_hist_purge_older(ccid3_tx_hist,
  435. &hctx->ccid3hctx_hist, packet);
  436. /*
  437. * As we have calculated new ipi, delta, t_nom it is possible
  438. * that we now can send a packet, so wake up dccp_wait_for_ccid
  439. */
  440. sk->sk_write_space(sk);
  441. /*
  442. * Update timeout interval for the nofeedback timer.
  443. * We use a configuration option to increase the lower bound.
  444. * This can help avoid triggering the nofeedback timer too
  445. * often ('spinning') on LANs with small RTTs.
  446. */
  447. hctx->ccid3hctx_t_rto = max_t(u32, 4 * hctx->ccid3hctx_rtt,
  448. CONFIG_IP_DCCP_CCID3_RTO *
  449. (USEC_PER_SEC/1000));
  450. /*
  451. * Schedule no feedback timer to expire in
  452. * max(t_RTO, 2 * s/X) = max(t_RTO, 2 * t_ipi)
  453. */
  454. t_nfb = max(hctx->ccid3hctx_t_rto, 2 * hctx->ccid3hctx_t_ipi);
  455. ccid3_pr_debug("%s(%p), Scheduled no feedback timer to "
  456. "expire in %lu jiffies (%luus)\n",
  457. dccp_role(sk),
  458. sk, usecs_to_jiffies(t_nfb), t_nfb);
  459. sk_reset_timer(sk, &hctx->ccid3hctx_no_feedback_timer,
  460. jiffies + usecs_to_jiffies(t_nfb));
  461. /* set idle flag */
  462. hctx->ccid3hctx_idle = 1;
  463. break;
  464. case TFRC_SSTATE_NO_SENT: /* fall through */
  465. case TFRC_SSTATE_TERM: /* ignore feedback when closing */
  466. break;
  467. }
  468. }
  469. static int ccid3_hc_tx_parse_options(struct sock *sk, unsigned char option,
  470. unsigned char len, u16 idx,
  471. unsigned char *value)
  472. {
  473. int rc = 0;
  474. const struct dccp_sock *dp = dccp_sk(sk);
  475. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  476. struct ccid3_options_received *opt_recv;
  477. __be32 opt_val;
  478. opt_recv = &hctx->ccid3hctx_options_received;
  479. if (opt_recv->ccid3or_seqno != dp->dccps_gsr) {
  480. opt_recv->ccid3or_seqno = dp->dccps_gsr;
  481. opt_recv->ccid3or_loss_event_rate = ~0;
  482. opt_recv->ccid3or_loss_intervals_idx = 0;
  483. opt_recv->ccid3or_loss_intervals_len = 0;
  484. opt_recv->ccid3or_receive_rate = 0;
  485. }
  486. switch (option) {
  487. case TFRC_OPT_LOSS_EVENT_RATE:
  488. if (unlikely(len != 4)) {
  489. DCCP_WARN("%s(%p), invalid len %d "
  490. "for TFRC_OPT_LOSS_EVENT_RATE\n",
  491. dccp_role(sk), sk, len);
  492. rc = -EINVAL;
  493. } else {
  494. opt_val = get_unaligned((__be32 *)value);
  495. opt_recv->ccid3or_loss_event_rate = ntohl(opt_val);
  496. ccid3_pr_debug("%s(%p), LOSS_EVENT_RATE=%u\n",
  497. dccp_role(sk), sk,
  498. opt_recv->ccid3or_loss_event_rate);
  499. }
  500. break;
  501. case TFRC_OPT_LOSS_INTERVALS:
  502. opt_recv->ccid3or_loss_intervals_idx = idx;
  503. opt_recv->ccid3or_loss_intervals_len = len;
  504. ccid3_pr_debug("%s(%p), LOSS_INTERVALS=(%u, %u)\n",
  505. dccp_role(sk), sk,
  506. opt_recv->ccid3or_loss_intervals_idx,
  507. opt_recv->ccid3or_loss_intervals_len);
  508. break;
  509. case TFRC_OPT_RECEIVE_RATE:
  510. if (unlikely(len != 4)) {
  511. DCCP_WARN("%s(%p), invalid len %d "
  512. "for TFRC_OPT_RECEIVE_RATE\n",
  513. dccp_role(sk), sk, len);
  514. rc = -EINVAL;
  515. } else {
  516. opt_val = get_unaligned((__be32 *)value);
  517. opt_recv->ccid3or_receive_rate = ntohl(opt_val);
  518. ccid3_pr_debug("%s(%p), RECEIVE_RATE=%u\n",
  519. dccp_role(sk), sk,
  520. opt_recv->ccid3or_receive_rate);
  521. }
  522. break;
  523. }
  524. return rc;
  525. }
  526. static int ccid3_hc_tx_init(struct ccid *ccid, struct sock *sk)
  527. {
  528. struct ccid3_hc_tx_sock *hctx = ccid_priv(ccid);
  529. hctx->ccid3hctx_state = TFRC_SSTATE_NO_SENT;
  530. INIT_LIST_HEAD(&hctx->ccid3hctx_hist);
  531. hctx->ccid3hctx_no_feedback_timer.function =
  532. ccid3_hc_tx_no_feedback_timer;
  533. hctx->ccid3hctx_no_feedback_timer.data = (unsigned long)sk;
  534. init_timer(&hctx->ccid3hctx_no_feedback_timer);
  535. return 0;
  536. }
  537. static void ccid3_hc_tx_exit(struct sock *sk)
  538. {
  539. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  540. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_TERM);
  541. sk_stop_timer(sk, &hctx->ccid3hctx_no_feedback_timer);
  542. /* Empty packet history */
  543. dccp_tx_hist_purge(ccid3_tx_hist, &hctx->ccid3hctx_hist);
  544. }
  545. static void ccid3_hc_tx_get_info(struct sock *sk, struct tcp_info *info)
  546. {
  547. struct ccid3_hc_tx_sock *hctx;
  548. /* Listen socks doesn't have a private CCID block */
  549. if (sk->sk_state == DCCP_LISTEN)
  550. return;
  551. hctx = ccid3_hc_tx_sk(sk);
  552. info->tcpi_rto = hctx->ccid3hctx_t_rto;
  553. info->tcpi_rtt = hctx->ccid3hctx_rtt;
  554. }
  555. static int ccid3_hc_tx_getsockopt(struct sock *sk, const int optname, int len,
  556. u32 __user *optval, int __user *optlen)
  557. {
  558. const struct ccid3_hc_tx_sock *hctx;
  559. const void *val;
  560. /* Listen socks doesn't have a private CCID block */
  561. if (sk->sk_state == DCCP_LISTEN)
  562. return -EINVAL;
  563. hctx = ccid3_hc_tx_sk(sk);
  564. switch (optname) {
  565. case DCCP_SOCKOPT_CCID_TX_INFO:
  566. if (len < sizeof(hctx->ccid3hctx_tfrc))
  567. return -EINVAL;
  568. len = sizeof(hctx->ccid3hctx_tfrc);
  569. val = &hctx->ccid3hctx_tfrc;
  570. break;
  571. default:
  572. return -ENOPROTOOPT;
  573. }
  574. if (put_user(len, optlen) || copy_to_user(optval, val, len))
  575. return -EFAULT;
  576. return 0;
  577. }
  578. /*
  579. * Receiver Half-Connection Routines
  580. */
  581. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  582. static const char *ccid3_rx_state_name(enum ccid3_hc_rx_states state)
  583. {
  584. static char *ccid3_rx_state_names[] = {
  585. [TFRC_RSTATE_NO_DATA] = "NO_DATA",
  586. [TFRC_RSTATE_DATA] = "DATA",
  587. [TFRC_RSTATE_TERM] = "TERM",
  588. };
  589. return ccid3_rx_state_names[state];
  590. }
  591. #endif
  592. static void ccid3_hc_rx_set_state(struct sock *sk,
  593. enum ccid3_hc_rx_states state)
  594. {
  595. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  596. enum ccid3_hc_rx_states oldstate = hcrx->ccid3hcrx_state;
  597. ccid3_pr_debug("%s(%p) %-8.8s -> %s\n",
  598. dccp_role(sk), sk, ccid3_rx_state_name(oldstate),
  599. ccid3_rx_state_name(state));
  600. WARN_ON(state == oldstate);
  601. hcrx->ccid3hcrx_state = state;
  602. }
  603. static inline void ccid3_hc_rx_update_s(struct ccid3_hc_rx_sock *hcrx, int len)
  604. {
  605. if (unlikely(len == 0)) /* don't update on empty packets (e.g. ACKs) */
  606. ccid3_pr_debug("Packet payload length is 0 - not updating\n");
  607. else
  608. hcrx->ccid3hcrx_s = hcrx->ccid3hcrx_s == 0 ? len :
  609. (9 * hcrx->ccid3hcrx_s + len) / 10;
  610. }
  611. static void ccid3_hc_rx_send_feedback(struct sock *sk)
  612. {
  613. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  614. struct dccp_sock *dp = dccp_sk(sk);
  615. struct dccp_rx_hist_entry *packet;
  616. ktime_t now;
  617. suseconds_t delta;
  618. ccid3_pr_debug("%s(%p) - entry \n", dccp_role(sk), sk);
  619. now = ktime_get_real();
  620. switch (hcrx->ccid3hcrx_state) {
  621. case TFRC_RSTATE_NO_DATA:
  622. hcrx->ccid3hcrx_x_recv = 0;
  623. break;
  624. case TFRC_RSTATE_DATA:
  625. delta = ktime_us_delta(now,
  626. hcrx->ccid3hcrx_tstamp_last_feedback);
  627. DCCP_BUG_ON(delta < 0);
  628. hcrx->ccid3hcrx_x_recv =
  629. scaled_div32(hcrx->ccid3hcrx_bytes_recv, delta);
  630. break;
  631. case TFRC_RSTATE_TERM:
  632. DCCP_BUG("%s(%p) - Illegal state TERM", dccp_role(sk), sk);
  633. return;
  634. }
  635. packet = dccp_rx_hist_find_data_packet(&hcrx->ccid3hcrx_hist);
  636. if (unlikely(packet == NULL)) {
  637. DCCP_WARN("%s(%p), no data packet in history!\n",
  638. dccp_role(sk), sk);
  639. return;
  640. }
  641. hcrx->ccid3hcrx_tstamp_last_feedback = now;
  642. hcrx->ccid3hcrx_ccval_last_counter = packet->dccphrx_ccval;
  643. hcrx->ccid3hcrx_bytes_recv = 0;
  644. /* Elapsed time information [RFC 4340, 13.2] in units of 10 * usecs */
  645. delta = ktime_us_delta(now, packet->dccphrx_tstamp);
  646. DCCP_BUG_ON(delta < 0);
  647. hcrx->ccid3hcrx_elapsed_time = delta / 10;
  648. if (hcrx->ccid3hcrx_p == 0)
  649. hcrx->ccid3hcrx_pinv = ~0U; /* see RFC 4342, 8.5 */
  650. else if (hcrx->ccid3hcrx_p > 1000000) {
  651. DCCP_WARN("p (%u) > 100%%\n", hcrx->ccid3hcrx_p);
  652. hcrx->ccid3hcrx_pinv = 1; /* use 100% in this case */
  653. } else
  654. hcrx->ccid3hcrx_pinv = 1000000 / hcrx->ccid3hcrx_p;
  655. dp->dccps_hc_rx_insert_options = 1;
  656. dccp_send_ack(sk);
  657. }
  658. static int ccid3_hc_rx_insert_options(struct sock *sk, struct sk_buff *skb)
  659. {
  660. const struct ccid3_hc_rx_sock *hcrx;
  661. __be32 x_recv, pinv;
  662. if (!(sk->sk_state == DCCP_OPEN || sk->sk_state == DCCP_PARTOPEN))
  663. return 0;
  664. hcrx = ccid3_hc_rx_sk(sk);
  665. DCCP_SKB_CB(skb)->dccpd_ccval = hcrx->ccid3hcrx_ccval_last_counter;
  666. if (dccp_packet_without_ack(skb))
  667. return 0;
  668. x_recv = htonl(hcrx->ccid3hcrx_x_recv);
  669. pinv = htonl(hcrx->ccid3hcrx_pinv);
  670. if ((hcrx->ccid3hcrx_elapsed_time != 0 &&
  671. dccp_insert_option_elapsed_time(sk, skb,
  672. hcrx->ccid3hcrx_elapsed_time)) ||
  673. dccp_insert_option_timestamp(sk, skb) ||
  674. dccp_insert_option(sk, skb, TFRC_OPT_LOSS_EVENT_RATE,
  675. &pinv, sizeof(pinv)) ||
  676. dccp_insert_option(sk, skb, TFRC_OPT_RECEIVE_RATE,
  677. &x_recv, sizeof(x_recv)))
  678. return -1;
  679. return 0;
  680. }
  681. static int ccid3_hc_rx_detect_loss(struct sock *sk,
  682. struct dccp_rx_hist_entry *packet)
  683. {
  684. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  685. struct dccp_rx_hist_entry *rx_hist =
  686. dccp_rx_hist_head(&hcrx->ccid3hcrx_hist);
  687. u64 seqno = packet->dccphrx_seqno;
  688. u64 tmp_seqno;
  689. int loss = 0;
  690. u8 ccval;
  691. tmp_seqno = hcrx->ccid3hcrx_seqno_nonloss;
  692. if (!rx_hist ||
  693. follows48(packet->dccphrx_seqno, hcrx->ccid3hcrx_seqno_nonloss)) {
  694. hcrx->ccid3hcrx_seqno_nonloss = seqno;
  695. hcrx->ccid3hcrx_ccval_nonloss = packet->dccphrx_ccval;
  696. goto detect_out;
  697. }
  698. while (dccp_delta_seqno(hcrx->ccid3hcrx_seqno_nonloss, seqno)
  699. > TFRC_RECV_NUM_LATE_LOSS) {
  700. loss = 1;
  701. dccp_li_update_li(sk,
  702. &hcrx->ccid3hcrx_li_hist,
  703. &hcrx->ccid3hcrx_hist,
  704. hcrx->ccid3hcrx_tstamp_last_feedback,
  705. hcrx->ccid3hcrx_s,
  706. hcrx->ccid3hcrx_bytes_recv,
  707. hcrx->ccid3hcrx_x_recv,
  708. hcrx->ccid3hcrx_seqno_nonloss,
  709. hcrx->ccid3hcrx_ccval_nonloss);
  710. tmp_seqno = hcrx->ccid3hcrx_seqno_nonloss;
  711. dccp_inc_seqno(&tmp_seqno);
  712. hcrx->ccid3hcrx_seqno_nonloss = tmp_seqno;
  713. dccp_inc_seqno(&tmp_seqno);
  714. while (dccp_rx_hist_find_entry(&hcrx->ccid3hcrx_hist,
  715. tmp_seqno, &ccval)) {
  716. hcrx->ccid3hcrx_seqno_nonloss = tmp_seqno;
  717. hcrx->ccid3hcrx_ccval_nonloss = ccval;
  718. dccp_inc_seqno(&tmp_seqno);
  719. }
  720. }
  721. /* FIXME - this code could be simplified with above while */
  722. /* but works at moment */
  723. if (follows48(packet->dccphrx_seqno, hcrx->ccid3hcrx_seqno_nonloss)) {
  724. hcrx->ccid3hcrx_seqno_nonloss = seqno;
  725. hcrx->ccid3hcrx_ccval_nonloss = packet->dccphrx_ccval;
  726. }
  727. detect_out:
  728. dccp_rx_hist_add_packet(ccid3_rx_hist, &hcrx->ccid3hcrx_hist,
  729. &hcrx->ccid3hcrx_li_hist, packet,
  730. hcrx->ccid3hcrx_seqno_nonloss);
  731. return loss;
  732. }
  733. static void ccid3_hc_rx_packet_recv(struct sock *sk, struct sk_buff *skb)
  734. {
  735. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  736. const struct dccp_options_received *opt_recv;
  737. struct dccp_rx_hist_entry *packet;
  738. u32 p_prev, r_sample, rtt_prev;
  739. int loss, payload_size;
  740. ktime_t now;
  741. opt_recv = &dccp_sk(sk)->dccps_options_received;
  742. switch (DCCP_SKB_CB(skb)->dccpd_type) {
  743. case DCCP_PKT_ACK:
  744. if (hcrx->ccid3hcrx_state == TFRC_RSTATE_NO_DATA)
  745. return;
  746. case DCCP_PKT_DATAACK:
  747. if (opt_recv->dccpor_timestamp_echo == 0)
  748. break;
  749. r_sample = dccp_timestamp() - opt_recv->dccpor_timestamp_echo;
  750. rtt_prev = hcrx->ccid3hcrx_rtt;
  751. r_sample = dccp_sample_rtt(sk, 10 * r_sample);
  752. if (hcrx->ccid3hcrx_state == TFRC_RSTATE_NO_DATA)
  753. hcrx->ccid3hcrx_rtt = r_sample;
  754. else
  755. hcrx->ccid3hcrx_rtt = (hcrx->ccid3hcrx_rtt * 9) / 10 +
  756. r_sample / 10;
  757. if (rtt_prev != hcrx->ccid3hcrx_rtt)
  758. ccid3_pr_debug("%s(%p), New RTT=%uus, elapsed time=%u\n",
  759. dccp_role(sk), sk, hcrx->ccid3hcrx_rtt,
  760. opt_recv->dccpor_elapsed_time);
  761. break;
  762. case DCCP_PKT_DATA:
  763. break;
  764. default: /* We're not interested in other packet types, move along */
  765. return;
  766. }
  767. packet = dccp_rx_hist_entry_new(ccid3_rx_hist, opt_recv->dccpor_ndp,
  768. skb, GFP_ATOMIC);
  769. if (unlikely(packet == NULL)) {
  770. DCCP_WARN("%s(%p), Not enough mem to add rx packet "
  771. "to history, consider it lost!\n", dccp_role(sk), sk);
  772. return;
  773. }
  774. loss = ccid3_hc_rx_detect_loss(sk, packet);
  775. if (DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_ACK)
  776. return;
  777. payload_size = skb->len - dccp_hdr(skb)->dccph_doff * 4;
  778. ccid3_hc_rx_update_s(hcrx, payload_size);
  779. switch (hcrx->ccid3hcrx_state) {
  780. case TFRC_RSTATE_NO_DATA:
  781. ccid3_pr_debug("%s(%p, state=%s), skb=%p, sending initial "
  782. "feedback\n", dccp_role(sk), sk,
  783. dccp_state_name(sk->sk_state), skb);
  784. ccid3_hc_rx_send_feedback(sk);
  785. ccid3_hc_rx_set_state(sk, TFRC_RSTATE_DATA);
  786. return;
  787. case TFRC_RSTATE_DATA:
  788. hcrx->ccid3hcrx_bytes_recv += payload_size;
  789. if (loss)
  790. break;
  791. now = ktime_get_real();
  792. if ((ktime_us_delta(now, hcrx->ccid3hcrx_tstamp_last_ack) -
  793. (s64)hcrx->ccid3hcrx_rtt) >= 0) {
  794. hcrx->ccid3hcrx_tstamp_last_ack = now;
  795. ccid3_hc_rx_send_feedback(sk);
  796. }
  797. return;
  798. case TFRC_RSTATE_TERM:
  799. DCCP_BUG("%s(%p) - Illegal state TERM", dccp_role(sk), sk);
  800. return;
  801. }
  802. /* Dealing with packet loss */
  803. ccid3_pr_debug("%s(%p, state=%s), data loss! Reacting...\n",
  804. dccp_role(sk), sk, dccp_state_name(sk->sk_state));
  805. p_prev = hcrx->ccid3hcrx_p;
  806. /* Calculate loss event rate */
  807. if (!list_empty(&hcrx->ccid3hcrx_li_hist)) {
  808. u32 i_mean = dccp_li_hist_calc_i_mean(&hcrx->ccid3hcrx_li_hist);
  809. /* Scaling up by 1000000 as fixed decimal */
  810. if (i_mean != 0)
  811. hcrx->ccid3hcrx_p = 1000000 / i_mean;
  812. } else
  813. DCCP_BUG("empty loss history");
  814. if (hcrx->ccid3hcrx_p > p_prev) {
  815. ccid3_hc_rx_send_feedback(sk);
  816. return;
  817. }
  818. }
  819. static int ccid3_hc_rx_init(struct ccid *ccid, struct sock *sk)
  820. {
  821. struct ccid3_hc_rx_sock *hcrx = ccid_priv(ccid);
  822. ccid3_pr_debug("entry\n");
  823. hcrx->ccid3hcrx_state = TFRC_RSTATE_NO_DATA;
  824. INIT_LIST_HEAD(&hcrx->ccid3hcrx_hist);
  825. INIT_LIST_HEAD(&hcrx->ccid3hcrx_li_hist);
  826. hcrx->ccid3hcrx_tstamp_last_feedback =
  827. hcrx->ccid3hcrx_tstamp_last_ack = ktime_get_real();
  828. return 0;
  829. }
  830. static void ccid3_hc_rx_exit(struct sock *sk)
  831. {
  832. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  833. ccid3_hc_rx_set_state(sk, TFRC_RSTATE_TERM);
  834. /* Empty packet history */
  835. dccp_rx_hist_purge(ccid3_rx_hist, &hcrx->ccid3hcrx_hist);
  836. /* Empty loss interval history */
  837. dccp_li_hist_purge(&hcrx->ccid3hcrx_li_hist);
  838. }
  839. static void ccid3_hc_rx_get_info(struct sock *sk, struct tcp_info *info)
  840. {
  841. const struct ccid3_hc_rx_sock *hcrx;
  842. /* Listen socks doesn't have a private CCID block */
  843. if (sk->sk_state == DCCP_LISTEN)
  844. return;
  845. hcrx = ccid3_hc_rx_sk(sk);
  846. info->tcpi_ca_state = hcrx->ccid3hcrx_state;
  847. info->tcpi_options |= TCPI_OPT_TIMESTAMPS;
  848. info->tcpi_rcv_rtt = hcrx->ccid3hcrx_rtt;
  849. }
  850. static int ccid3_hc_rx_getsockopt(struct sock *sk, const int optname, int len,
  851. u32 __user *optval, int __user *optlen)
  852. {
  853. const struct ccid3_hc_rx_sock *hcrx;
  854. const void *val;
  855. /* Listen socks doesn't have a private CCID block */
  856. if (sk->sk_state == DCCP_LISTEN)
  857. return -EINVAL;
  858. hcrx = ccid3_hc_rx_sk(sk);
  859. switch (optname) {
  860. case DCCP_SOCKOPT_CCID_RX_INFO:
  861. if (len < sizeof(hcrx->ccid3hcrx_tfrc))
  862. return -EINVAL;
  863. len = sizeof(hcrx->ccid3hcrx_tfrc);
  864. val = &hcrx->ccid3hcrx_tfrc;
  865. break;
  866. default:
  867. return -ENOPROTOOPT;
  868. }
  869. if (put_user(len, optlen) || copy_to_user(optval, val, len))
  870. return -EFAULT;
  871. return 0;
  872. }
  873. static struct ccid_operations ccid3 = {
  874. .ccid_id = DCCPC_CCID3,
  875. .ccid_name = "ccid3",
  876. .ccid_owner = THIS_MODULE,
  877. .ccid_hc_tx_obj_size = sizeof(struct ccid3_hc_tx_sock),
  878. .ccid_hc_tx_init = ccid3_hc_tx_init,
  879. .ccid_hc_tx_exit = ccid3_hc_tx_exit,
  880. .ccid_hc_tx_send_packet = ccid3_hc_tx_send_packet,
  881. .ccid_hc_tx_packet_sent = ccid3_hc_tx_packet_sent,
  882. .ccid_hc_tx_packet_recv = ccid3_hc_tx_packet_recv,
  883. .ccid_hc_tx_parse_options = ccid3_hc_tx_parse_options,
  884. .ccid_hc_rx_obj_size = sizeof(struct ccid3_hc_rx_sock),
  885. .ccid_hc_rx_init = ccid3_hc_rx_init,
  886. .ccid_hc_rx_exit = ccid3_hc_rx_exit,
  887. .ccid_hc_rx_insert_options = ccid3_hc_rx_insert_options,
  888. .ccid_hc_rx_packet_recv = ccid3_hc_rx_packet_recv,
  889. .ccid_hc_rx_get_info = ccid3_hc_rx_get_info,
  890. .ccid_hc_tx_get_info = ccid3_hc_tx_get_info,
  891. .ccid_hc_rx_getsockopt = ccid3_hc_rx_getsockopt,
  892. .ccid_hc_tx_getsockopt = ccid3_hc_tx_getsockopt,
  893. };
  894. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  895. module_param(ccid3_debug, bool, 0444);
  896. MODULE_PARM_DESC(ccid3_debug, "Enable debug messages");
  897. #endif
  898. static __init int ccid3_module_init(void)
  899. {
  900. int rc = -ENOBUFS;
  901. ccid3_rx_hist = dccp_rx_hist_new("ccid3");
  902. if (ccid3_rx_hist == NULL)
  903. goto out;
  904. ccid3_tx_hist = dccp_tx_hist_new("ccid3");
  905. if (ccid3_tx_hist == NULL)
  906. goto out_free_rx;
  907. rc = ccid_register(&ccid3);
  908. if (rc != 0)
  909. goto out_free_tx;
  910. out:
  911. return rc;
  912. out_free_tx:
  913. dccp_tx_hist_delete(ccid3_tx_hist);
  914. ccid3_tx_hist = NULL;
  915. out_free_rx:
  916. dccp_rx_hist_delete(ccid3_rx_hist);
  917. ccid3_rx_hist = NULL;
  918. goto out;
  919. }
  920. module_init(ccid3_module_init);
  921. static __exit void ccid3_module_exit(void)
  922. {
  923. ccid_unregister(&ccid3);
  924. if (ccid3_tx_hist != NULL) {
  925. dccp_tx_hist_delete(ccid3_tx_hist);
  926. ccid3_tx_hist = NULL;
  927. }
  928. if (ccid3_rx_hist != NULL) {
  929. dccp_rx_hist_delete(ccid3_rx_hist);
  930. ccid3_rx_hist = NULL;
  931. }
  932. }
  933. module_exit(ccid3_module_exit);
  934. MODULE_AUTHOR("Ian McDonald <ian.mcdonald@jandi.co.nz>, "
  935. "Arnaldo Carvalho de Melo <acme@ghostprotocols.net>");
  936. MODULE_DESCRIPTION("DCCP TFRC CCID3 CCID");
  937. MODULE_LICENSE("GPL");
  938. MODULE_ALIAS("net-dccp-ccid-3");