ccid3.c 32 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103
  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 timout 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_s = 0;
  530. hctx->ccid3hctx_rtt = 0;
  531. hctx->ccid3hctx_state = TFRC_SSTATE_NO_SENT;
  532. INIT_LIST_HEAD(&hctx->ccid3hctx_hist);
  533. hctx->ccid3hctx_no_feedback_timer.function =
  534. ccid3_hc_tx_no_feedback_timer;
  535. hctx->ccid3hctx_no_feedback_timer.data = (unsigned long)sk;
  536. init_timer(&hctx->ccid3hctx_no_feedback_timer);
  537. return 0;
  538. }
  539. static void ccid3_hc_tx_exit(struct sock *sk)
  540. {
  541. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  542. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_TERM);
  543. sk_stop_timer(sk, &hctx->ccid3hctx_no_feedback_timer);
  544. /* Empty packet history */
  545. dccp_tx_hist_purge(ccid3_tx_hist, &hctx->ccid3hctx_hist);
  546. }
  547. static void ccid3_hc_tx_get_info(struct sock *sk, struct tcp_info *info)
  548. {
  549. struct ccid3_hc_tx_sock *hctx;
  550. /* Listen socks doesn't have a private CCID block */
  551. if (sk->sk_state == DCCP_LISTEN)
  552. return;
  553. hctx = ccid3_hc_tx_sk(sk);
  554. info->tcpi_rto = hctx->ccid3hctx_t_rto;
  555. info->tcpi_rtt = hctx->ccid3hctx_rtt;
  556. }
  557. static int ccid3_hc_tx_getsockopt(struct sock *sk, const int optname, int len,
  558. u32 __user *optval, int __user *optlen)
  559. {
  560. const struct ccid3_hc_tx_sock *hctx;
  561. const void *val;
  562. /* Listen socks doesn't have a private CCID block */
  563. if (sk->sk_state == DCCP_LISTEN)
  564. return -EINVAL;
  565. hctx = ccid3_hc_tx_sk(sk);
  566. switch (optname) {
  567. case DCCP_SOCKOPT_CCID_TX_INFO:
  568. if (len < sizeof(hctx->ccid3hctx_tfrc))
  569. return -EINVAL;
  570. len = sizeof(hctx->ccid3hctx_tfrc);
  571. val = &hctx->ccid3hctx_tfrc;
  572. break;
  573. default:
  574. return -ENOPROTOOPT;
  575. }
  576. if (put_user(len, optlen) || copy_to_user(optval, val, len))
  577. return -EFAULT;
  578. return 0;
  579. }
  580. /*
  581. * Receiver Half-Connection Routines
  582. */
  583. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  584. static const char *ccid3_rx_state_name(enum ccid3_hc_rx_states state)
  585. {
  586. static char *ccid3_rx_state_names[] = {
  587. [TFRC_RSTATE_NO_DATA] = "NO_DATA",
  588. [TFRC_RSTATE_DATA] = "DATA",
  589. [TFRC_RSTATE_TERM] = "TERM",
  590. };
  591. return ccid3_rx_state_names[state];
  592. }
  593. #endif
  594. static void ccid3_hc_rx_set_state(struct sock *sk,
  595. enum ccid3_hc_rx_states state)
  596. {
  597. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  598. enum ccid3_hc_rx_states oldstate = hcrx->ccid3hcrx_state;
  599. ccid3_pr_debug("%s(%p) %-8.8s -> %s\n",
  600. dccp_role(sk), sk, ccid3_rx_state_name(oldstate),
  601. ccid3_rx_state_name(state));
  602. WARN_ON(state == oldstate);
  603. hcrx->ccid3hcrx_state = state;
  604. }
  605. static inline void ccid3_hc_rx_update_s(struct ccid3_hc_rx_sock *hcrx, int len)
  606. {
  607. if (unlikely(len == 0)) /* don't update on empty packets (e.g. ACKs) */
  608. ccid3_pr_debug("Packet payload length is 0 - not updating\n");
  609. else
  610. hcrx->ccid3hcrx_s = hcrx->ccid3hcrx_s == 0 ? len :
  611. (9 * hcrx->ccid3hcrx_s + len) / 10;
  612. }
  613. static void ccid3_hc_rx_send_feedback(struct sock *sk)
  614. {
  615. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  616. struct dccp_sock *dp = dccp_sk(sk);
  617. struct dccp_rx_hist_entry *packet;
  618. ktime_t now;
  619. suseconds_t delta;
  620. ccid3_pr_debug("%s(%p) - entry \n", dccp_role(sk), sk);
  621. now = ktime_get_real();
  622. switch (hcrx->ccid3hcrx_state) {
  623. case TFRC_RSTATE_NO_DATA:
  624. hcrx->ccid3hcrx_x_recv = 0;
  625. break;
  626. case TFRC_RSTATE_DATA:
  627. delta = ktime_us_delta(now,
  628. hcrx->ccid3hcrx_tstamp_last_feedback);
  629. DCCP_BUG_ON(delta < 0);
  630. hcrx->ccid3hcrx_x_recv =
  631. scaled_div32(hcrx->ccid3hcrx_bytes_recv, delta);
  632. break;
  633. case TFRC_RSTATE_TERM:
  634. DCCP_BUG("%s(%p) - Illegal state TERM", dccp_role(sk), sk);
  635. return;
  636. }
  637. packet = dccp_rx_hist_find_data_packet(&hcrx->ccid3hcrx_hist);
  638. if (unlikely(packet == NULL)) {
  639. DCCP_WARN("%s(%p), no data packet in history!\n",
  640. dccp_role(sk), sk);
  641. return;
  642. }
  643. hcrx->ccid3hcrx_tstamp_last_feedback = now;
  644. hcrx->ccid3hcrx_ccval_last_counter = packet->dccphrx_ccval;
  645. hcrx->ccid3hcrx_bytes_recv = 0;
  646. /* Elapsed time information [RFC 4340, 13.2] in units of 10 * usecs */
  647. delta = ktime_us_delta(now, packet->dccphrx_tstamp);
  648. DCCP_BUG_ON(delta < 0);
  649. hcrx->ccid3hcrx_elapsed_time = delta / 10;
  650. if (hcrx->ccid3hcrx_p == 0)
  651. hcrx->ccid3hcrx_pinv = ~0U; /* see RFC 4342, 8.5 */
  652. else if (hcrx->ccid3hcrx_p > 1000000) {
  653. DCCP_WARN("p (%u) > 100%%\n", hcrx->ccid3hcrx_p);
  654. hcrx->ccid3hcrx_pinv = 1; /* use 100% in this case */
  655. } else
  656. hcrx->ccid3hcrx_pinv = 1000000 / hcrx->ccid3hcrx_p;
  657. dp->dccps_hc_rx_insert_options = 1;
  658. dccp_send_ack(sk);
  659. }
  660. static int ccid3_hc_rx_insert_options(struct sock *sk, struct sk_buff *skb)
  661. {
  662. const struct ccid3_hc_rx_sock *hcrx;
  663. __be32 x_recv, pinv;
  664. if (!(sk->sk_state == DCCP_OPEN || sk->sk_state == DCCP_PARTOPEN))
  665. return 0;
  666. hcrx = ccid3_hc_rx_sk(sk);
  667. DCCP_SKB_CB(skb)->dccpd_ccval = hcrx->ccid3hcrx_ccval_last_counter;
  668. if (dccp_packet_without_ack(skb))
  669. return 0;
  670. x_recv = htonl(hcrx->ccid3hcrx_x_recv);
  671. pinv = htonl(hcrx->ccid3hcrx_pinv);
  672. if ((hcrx->ccid3hcrx_elapsed_time != 0 &&
  673. dccp_insert_option_elapsed_time(sk, skb,
  674. hcrx->ccid3hcrx_elapsed_time)) ||
  675. dccp_insert_option_timestamp(sk, skb) ||
  676. dccp_insert_option(sk, skb, TFRC_OPT_LOSS_EVENT_RATE,
  677. &pinv, sizeof(pinv)) ||
  678. dccp_insert_option(sk, skb, TFRC_OPT_RECEIVE_RATE,
  679. &x_recv, sizeof(x_recv)))
  680. return -1;
  681. return 0;
  682. }
  683. static int ccid3_hc_rx_detect_loss(struct sock *sk,
  684. struct dccp_rx_hist_entry *packet)
  685. {
  686. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  687. struct dccp_rx_hist_entry *rx_hist =
  688. dccp_rx_hist_head(&hcrx->ccid3hcrx_hist);
  689. u64 seqno = packet->dccphrx_seqno;
  690. u64 tmp_seqno;
  691. int loss = 0;
  692. u8 ccval;
  693. tmp_seqno = hcrx->ccid3hcrx_seqno_nonloss;
  694. if (!rx_hist ||
  695. follows48(packet->dccphrx_seqno, hcrx->ccid3hcrx_seqno_nonloss)) {
  696. hcrx->ccid3hcrx_seqno_nonloss = seqno;
  697. hcrx->ccid3hcrx_ccval_nonloss = packet->dccphrx_ccval;
  698. goto detect_out;
  699. }
  700. while (dccp_delta_seqno(hcrx->ccid3hcrx_seqno_nonloss, seqno)
  701. > TFRC_RECV_NUM_LATE_LOSS) {
  702. loss = 1;
  703. dccp_li_update_li(sk,
  704. &hcrx->ccid3hcrx_li_hist,
  705. &hcrx->ccid3hcrx_hist,
  706. hcrx->ccid3hcrx_tstamp_last_feedback,
  707. hcrx->ccid3hcrx_s,
  708. hcrx->ccid3hcrx_bytes_recv,
  709. hcrx->ccid3hcrx_x_recv,
  710. hcrx->ccid3hcrx_seqno_nonloss,
  711. hcrx->ccid3hcrx_ccval_nonloss);
  712. tmp_seqno = hcrx->ccid3hcrx_seqno_nonloss;
  713. dccp_inc_seqno(&tmp_seqno);
  714. hcrx->ccid3hcrx_seqno_nonloss = tmp_seqno;
  715. dccp_inc_seqno(&tmp_seqno);
  716. while (dccp_rx_hist_find_entry(&hcrx->ccid3hcrx_hist,
  717. tmp_seqno, &ccval)) {
  718. hcrx->ccid3hcrx_seqno_nonloss = tmp_seqno;
  719. hcrx->ccid3hcrx_ccval_nonloss = ccval;
  720. dccp_inc_seqno(&tmp_seqno);
  721. }
  722. }
  723. /* FIXME - this code could be simplified with above while */
  724. /* but works at moment */
  725. if (follows48(packet->dccphrx_seqno, hcrx->ccid3hcrx_seqno_nonloss)) {
  726. hcrx->ccid3hcrx_seqno_nonloss = seqno;
  727. hcrx->ccid3hcrx_ccval_nonloss = packet->dccphrx_ccval;
  728. }
  729. detect_out:
  730. dccp_rx_hist_add_packet(ccid3_rx_hist, &hcrx->ccid3hcrx_hist,
  731. &hcrx->ccid3hcrx_li_hist, packet,
  732. hcrx->ccid3hcrx_seqno_nonloss);
  733. return loss;
  734. }
  735. static void ccid3_hc_rx_packet_recv(struct sock *sk, struct sk_buff *skb)
  736. {
  737. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  738. const struct dccp_options_received *opt_recv;
  739. struct dccp_rx_hist_entry *packet;
  740. u32 p_prev, r_sample, rtt_prev;
  741. int loss, payload_size;
  742. ktime_t now;
  743. opt_recv = &dccp_sk(sk)->dccps_options_received;
  744. switch (DCCP_SKB_CB(skb)->dccpd_type) {
  745. case DCCP_PKT_ACK:
  746. if (hcrx->ccid3hcrx_state == TFRC_RSTATE_NO_DATA)
  747. return;
  748. case DCCP_PKT_DATAACK:
  749. if (opt_recv->dccpor_timestamp_echo == 0)
  750. break;
  751. r_sample = dccp_timestamp() - opt_recv->dccpor_timestamp_echo;
  752. rtt_prev = hcrx->ccid3hcrx_rtt;
  753. r_sample = dccp_sample_rtt(sk, 10 * r_sample);
  754. if (hcrx->ccid3hcrx_state == TFRC_RSTATE_NO_DATA)
  755. hcrx->ccid3hcrx_rtt = r_sample;
  756. else
  757. hcrx->ccid3hcrx_rtt = (hcrx->ccid3hcrx_rtt * 9) / 10 +
  758. r_sample / 10;
  759. if (rtt_prev != hcrx->ccid3hcrx_rtt)
  760. ccid3_pr_debug("%s(%p), New RTT=%uus, elapsed time=%u\n",
  761. dccp_role(sk), sk, hcrx->ccid3hcrx_rtt,
  762. opt_recv->dccpor_elapsed_time);
  763. break;
  764. case DCCP_PKT_DATA:
  765. break;
  766. default: /* We're not interested in other packet types, move along */
  767. return;
  768. }
  769. packet = dccp_rx_hist_entry_new(ccid3_rx_hist, opt_recv->dccpor_ndp,
  770. skb, GFP_ATOMIC);
  771. if (unlikely(packet == NULL)) {
  772. DCCP_WARN("%s(%p), Not enough mem to add rx packet "
  773. "to history, consider it lost!\n", dccp_role(sk), sk);
  774. return;
  775. }
  776. loss = ccid3_hc_rx_detect_loss(sk, packet);
  777. if (DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_ACK)
  778. return;
  779. payload_size = skb->len - dccp_hdr(skb)->dccph_doff * 4;
  780. ccid3_hc_rx_update_s(hcrx, payload_size);
  781. switch (hcrx->ccid3hcrx_state) {
  782. case TFRC_RSTATE_NO_DATA:
  783. ccid3_pr_debug("%s(%p, state=%s), skb=%p, sending initial "
  784. "feedback\n", dccp_role(sk), sk,
  785. dccp_state_name(sk->sk_state), skb);
  786. ccid3_hc_rx_send_feedback(sk);
  787. ccid3_hc_rx_set_state(sk, TFRC_RSTATE_DATA);
  788. return;
  789. case TFRC_RSTATE_DATA:
  790. hcrx->ccid3hcrx_bytes_recv += payload_size;
  791. if (loss)
  792. break;
  793. now = ktime_get_real();
  794. if ((ktime_us_delta(now, hcrx->ccid3hcrx_tstamp_last_ack) -
  795. (s64)hcrx->ccid3hcrx_rtt) >= 0) {
  796. hcrx->ccid3hcrx_tstamp_last_ack = now;
  797. ccid3_hc_rx_send_feedback(sk);
  798. }
  799. return;
  800. case TFRC_RSTATE_TERM:
  801. DCCP_BUG("%s(%p) - Illegal state TERM", dccp_role(sk), sk);
  802. return;
  803. }
  804. /* Dealing with packet loss */
  805. ccid3_pr_debug("%s(%p, state=%s), data loss! Reacting...\n",
  806. dccp_role(sk), sk, dccp_state_name(sk->sk_state));
  807. p_prev = hcrx->ccid3hcrx_p;
  808. /* Calculate loss event rate */
  809. if (!list_empty(&hcrx->ccid3hcrx_li_hist)) {
  810. u32 i_mean = dccp_li_hist_calc_i_mean(&hcrx->ccid3hcrx_li_hist);
  811. /* Scaling up by 1000000 as fixed decimal */
  812. if (i_mean != 0)
  813. hcrx->ccid3hcrx_p = 1000000 / i_mean;
  814. } else
  815. DCCP_BUG("empty loss history");
  816. if (hcrx->ccid3hcrx_p > p_prev) {
  817. ccid3_hc_rx_send_feedback(sk);
  818. return;
  819. }
  820. }
  821. static int ccid3_hc_rx_init(struct ccid *ccid, struct sock *sk)
  822. {
  823. struct ccid3_hc_rx_sock *hcrx = ccid_priv(ccid);
  824. ccid3_pr_debug("entry\n");
  825. hcrx->ccid3hcrx_state = TFRC_RSTATE_NO_DATA;
  826. INIT_LIST_HEAD(&hcrx->ccid3hcrx_hist);
  827. INIT_LIST_HEAD(&hcrx->ccid3hcrx_li_hist);
  828. hcrx->ccid3hcrx_tstamp_last_feedback =
  829. hcrx->ccid3hcrx_tstamp_last_ack = ktime_get_real();
  830. hcrx->ccid3hcrx_s = 0;
  831. hcrx->ccid3hcrx_rtt = 0;
  832. return 0;
  833. }
  834. static void ccid3_hc_rx_exit(struct sock *sk)
  835. {
  836. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  837. ccid3_hc_rx_set_state(sk, TFRC_RSTATE_TERM);
  838. /* Empty packet history */
  839. dccp_rx_hist_purge(ccid3_rx_hist, &hcrx->ccid3hcrx_hist);
  840. /* Empty loss interval history */
  841. dccp_li_hist_purge(&hcrx->ccid3hcrx_li_hist);
  842. }
  843. static void ccid3_hc_rx_get_info(struct sock *sk, struct tcp_info *info)
  844. {
  845. const struct ccid3_hc_rx_sock *hcrx;
  846. /* Listen socks doesn't have a private CCID block */
  847. if (sk->sk_state == DCCP_LISTEN)
  848. return;
  849. hcrx = ccid3_hc_rx_sk(sk);
  850. info->tcpi_ca_state = hcrx->ccid3hcrx_state;
  851. info->tcpi_options |= TCPI_OPT_TIMESTAMPS;
  852. info->tcpi_rcv_rtt = hcrx->ccid3hcrx_rtt;
  853. }
  854. static int ccid3_hc_rx_getsockopt(struct sock *sk, const int optname, int len,
  855. u32 __user *optval, int __user *optlen)
  856. {
  857. const struct ccid3_hc_rx_sock *hcrx;
  858. const void *val;
  859. /* Listen socks doesn't have a private CCID block */
  860. if (sk->sk_state == DCCP_LISTEN)
  861. return -EINVAL;
  862. hcrx = ccid3_hc_rx_sk(sk);
  863. switch (optname) {
  864. case DCCP_SOCKOPT_CCID_RX_INFO:
  865. if (len < sizeof(hcrx->ccid3hcrx_tfrc))
  866. return -EINVAL;
  867. len = sizeof(hcrx->ccid3hcrx_tfrc);
  868. val = &hcrx->ccid3hcrx_tfrc;
  869. break;
  870. default:
  871. return -ENOPROTOOPT;
  872. }
  873. if (put_user(len, optlen) || copy_to_user(optval, val, len))
  874. return -EFAULT;
  875. return 0;
  876. }
  877. static struct ccid_operations ccid3 = {
  878. .ccid_id = DCCPC_CCID3,
  879. .ccid_name = "ccid3",
  880. .ccid_owner = THIS_MODULE,
  881. .ccid_hc_tx_obj_size = sizeof(struct ccid3_hc_tx_sock),
  882. .ccid_hc_tx_init = ccid3_hc_tx_init,
  883. .ccid_hc_tx_exit = ccid3_hc_tx_exit,
  884. .ccid_hc_tx_send_packet = ccid3_hc_tx_send_packet,
  885. .ccid_hc_tx_packet_sent = ccid3_hc_tx_packet_sent,
  886. .ccid_hc_tx_packet_recv = ccid3_hc_tx_packet_recv,
  887. .ccid_hc_tx_parse_options = ccid3_hc_tx_parse_options,
  888. .ccid_hc_rx_obj_size = sizeof(struct ccid3_hc_rx_sock),
  889. .ccid_hc_rx_init = ccid3_hc_rx_init,
  890. .ccid_hc_rx_exit = ccid3_hc_rx_exit,
  891. .ccid_hc_rx_insert_options = ccid3_hc_rx_insert_options,
  892. .ccid_hc_rx_packet_recv = ccid3_hc_rx_packet_recv,
  893. .ccid_hc_rx_get_info = ccid3_hc_rx_get_info,
  894. .ccid_hc_tx_get_info = ccid3_hc_tx_get_info,
  895. .ccid_hc_rx_getsockopt = ccid3_hc_rx_getsockopt,
  896. .ccid_hc_tx_getsockopt = ccid3_hc_tx_getsockopt,
  897. };
  898. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  899. module_param(ccid3_debug, bool, 0444);
  900. MODULE_PARM_DESC(ccid3_debug, "Enable debug messages");
  901. #endif
  902. static __init int ccid3_module_init(void)
  903. {
  904. int rc = -ENOBUFS;
  905. ccid3_rx_hist = dccp_rx_hist_new("ccid3");
  906. if (ccid3_rx_hist == NULL)
  907. goto out;
  908. ccid3_tx_hist = dccp_tx_hist_new("ccid3");
  909. if (ccid3_tx_hist == NULL)
  910. goto out_free_rx;
  911. rc = ccid_register(&ccid3);
  912. if (rc != 0)
  913. goto out_free_tx;
  914. out:
  915. return rc;
  916. out_free_tx:
  917. dccp_tx_hist_delete(ccid3_tx_hist);
  918. ccid3_tx_hist = NULL;
  919. out_free_rx:
  920. dccp_rx_hist_delete(ccid3_rx_hist);
  921. ccid3_rx_hist = NULL;
  922. goto out;
  923. }
  924. module_init(ccid3_module_init);
  925. static __exit void ccid3_module_exit(void)
  926. {
  927. ccid_unregister(&ccid3);
  928. if (ccid3_tx_hist != NULL) {
  929. dccp_tx_hist_delete(ccid3_tx_hist);
  930. ccid3_tx_hist = NULL;
  931. }
  932. if (ccid3_rx_hist != NULL) {
  933. dccp_rx_hist_delete(ccid3_rx_hist);
  934. ccid3_rx_hist = NULL;
  935. }
  936. }
  937. module_exit(ccid3_module_exit);
  938. MODULE_AUTHOR("Ian McDonald <ian.mcdonald@jandi.co.nz>, "
  939. "Arnaldo Carvalho de Melo <acme@ghostprotocols.net>");
  940. MODULE_DESCRIPTION("DCCP TFRC CCID3 CCID");
  941. MODULE_LICENSE("GPL");
  942. MODULE_ALIAS("net-dccp-ccid-3");