ccid3.c 30 KB

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