ccid3.c 32 KB

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