ccid3.c 37 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287
  1. /*
  2. * net/dccp/ccids/ccid3.c
  3. *
  4. * Copyright (c) 2005 The University of Waikato, Hamilton, New Zealand.
  5. * Copyright (c) 2005-6 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. /*
  43. * Reason for maths here is to avoid 32 bit overflow when a is big.
  44. * With this we get close to the limit.
  45. */
  46. static u32 usecs_div(const u32 a, const u32 b)
  47. {
  48. const u32 div = a < (UINT_MAX / (USEC_PER_SEC / 10)) ? 10 :
  49. a < (UINT_MAX / (USEC_PER_SEC / 50)) ? 50 :
  50. a < (UINT_MAX / (USEC_PER_SEC / 100)) ? 100 :
  51. a < (UINT_MAX / (USEC_PER_SEC / 500)) ? 500 :
  52. a < (UINT_MAX / (USEC_PER_SEC / 1000)) ? 1000 :
  53. a < (UINT_MAX / (USEC_PER_SEC / 5000)) ? 5000 :
  54. a < (UINT_MAX / (USEC_PER_SEC / 10000)) ? 10000 :
  55. a < (UINT_MAX / (USEC_PER_SEC / 50000)) ? 50000 :
  56. 100000;
  57. const u32 tmp = a * (USEC_PER_SEC / div);
  58. return (b >= 2 * div) ? tmp / (b / div) : tmp;
  59. }
  60. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  61. static int ccid3_debug;
  62. #define ccid3_pr_debug(format, a...) DCCP_PR_DEBUG(ccid3_debug, format, ##a)
  63. #else
  64. #define ccid3_pr_debug(format, a...)
  65. #endif
  66. static struct dccp_tx_hist *ccid3_tx_hist;
  67. static struct dccp_rx_hist *ccid3_rx_hist;
  68. static struct dccp_li_hist *ccid3_li_hist;
  69. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  70. static const char *ccid3_tx_state_name(enum ccid3_hc_tx_states state)
  71. {
  72. static char *ccid3_state_names[] = {
  73. [TFRC_SSTATE_NO_SENT] = "NO_SENT",
  74. [TFRC_SSTATE_NO_FBACK] = "NO_FBACK",
  75. [TFRC_SSTATE_FBACK] = "FBACK",
  76. [TFRC_SSTATE_TERM] = "TERM",
  77. };
  78. return ccid3_state_names[state];
  79. }
  80. #endif
  81. static void ccid3_hc_tx_set_state(struct sock *sk,
  82. enum ccid3_hc_tx_states state)
  83. {
  84. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  85. enum ccid3_hc_tx_states oldstate = hctx->ccid3hctx_state;
  86. ccid3_pr_debug("%s(%p) %-8.8s -> %s\n",
  87. dccp_role(sk), sk, ccid3_tx_state_name(oldstate),
  88. ccid3_tx_state_name(state));
  89. WARN_ON(state == oldstate);
  90. hctx->ccid3hctx_state = state;
  91. }
  92. /*
  93. * Recalculate scheduled nominal send time t_nom, inter-packet interval
  94. * t_ipi, and delta value. Should be called after each change to X.
  95. */
  96. static inline void ccid3_update_send_time(struct ccid3_hc_tx_sock *hctx)
  97. {
  98. timeval_sub_usecs(&hctx->ccid3hctx_t_nom, hctx->ccid3hctx_t_ipi);
  99. /* Calculate new t_ipi (inter packet interval) by t_ipi = s / X_inst */
  100. hctx->ccid3hctx_t_ipi = usecs_div(hctx->ccid3hctx_s, hctx->ccid3hctx_x);
  101. /* Update nominal send time with regard to the new t_ipi */
  102. timeval_add_usecs(&hctx->ccid3hctx_t_nom, hctx->ccid3hctx_t_ipi);
  103. /* Calculate new delta by delta = min(t_ipi / 2, t_gran / 2) */
  104. hctx->ccid3hctx_delta = min_t(u32, hctx->ccid3hctx_t_ipi / 2,
  105. TFRC_OPSYS_HALF_TIME_GRAN);
  106. }
  107. /*
  108. * Update X by
  109. * If (p > 0)
  110. * X_calc = calcX(s, R, p);
  111. * X = max(min(X_calc, 2 * X_recv), s / t_mbi);
  112. * Else
  113. * If (now - tld >= R)
  114. * X = max(min(2 * X, 2 * X_recv), s / R);
  115. * tld = now;
  116. *
  117. * If X has changed, we also update the scheduled send time t_now,
  118. * the inter-packet interval t_ipi, and the delta value.
  119. */
  120. static void ccid3_hc_tx_update_x(struct sock *sk, struct timeval *now)
  121. {
  122. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  123. const __u32 old_x = hctx->ccid3hctx_x;
  124. if (hctx->ccid3hctx_p > 0) {
  125. hctx->ccid3hctx_x = max_t(u32, min(hctx->ccid3hctx_x_calc,
  126. hctx->ccid3hctx_x_recv * 2),
  127. hctx->ccid3hctx_s / TFRC_T_MBI);
  128. } else if (timeval_delta(now, &hctx->ccid3hctx_t_ld) >=
  129. hctx->ccid3hctx_rtt) {
  130. hctx->ccid3hctx_x = max(min(hctx->ccid3hctx_x_recv,
  131. hctx->ccid3hctx_x ) * 2,
  132. usecs_div(hctx->ccid3hctx_s,
  133. hctx->ccid3hctx_rtt) );
  134. hctx->ccid3hctx_t_ld = *now;
  135. }
  136. if (hctx->ccid3hctx_x != old_x)
  137. ccid3_update_send_time(hctx);
  138. }
  139. /*
  140. * Track the mean packet size `s' (cf. RFC 4342, 5.3 and RFC 3448, 4.1)
  141. * @len: DCCP packet payload size in bytes
  142. */
  143. static inline void ccid3_hc_tx_update_s(struct ccid3_hc_tx_sock *hctx, int len)
  144. {
  145. if (unlikely(len == 0))
  146. ccid3_pr_debug("Packet payload length is 0 - not updating\n");
  147. else
  148. hctx->ccid3hctx_s = hctx->ccid3hctx_s == 0 ? len :
  149. (9 * hctx->ccid3hctx_s + len) / 10;
  150. /*
  151. * Note: We could do a potential optimisation here - when `s' changes,
  152. * recalculate sending rate and consequently t_ipi, t_delta, and
  153. * t_now. This is however non-standard, and the benefits are not
  154. * clear, so it is currently left out.
  155. */
  156. }
  157. static void ccid3_hc_tx_no_feedback_timer(unsigned long data)
  158. {
  159. struct sock *sk = (struct sock *)data;
  160. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  161. unsigned long t_nfb = USEC_PER_SEC / 5;
  162. bh_lock_sock(sk);
  163. if (sock_owned_by_user(sk)) {
  164. /* Try again later. */
  165. /* XXX: set some sensible MIB */
  166. goto restart_timer;
  167. }
  168. ccid3_pr_debug("%s, sk=%p, state=%s\n", dccp_role(sk), sk,
  169. ccid3_tx_state_name(hctx->ccid3hctx_state));
  170. switch (hctx->ccid3hctx_state) {
  171. case TFRC_SSTATE_NO_FBACK:
  172. /* RFC 3448, 4.4: Halve send rate directly */
  173. hctx->ccid3hctx_x = min_t(u32, hctx->ccid3hctx_x / 2,
  174. hctx->ccid3hctx_s / TFRC_T_MBI);
  175. ccid3_pr_debug("%s, sk=%p, state=%s, updated tx rate to %d "
  176. "bytes/s\n",
  177. dccp_role(sk), sk,
  178. ccid3_tx_state_name(hctx->ccid3hctx_state),
  179. hctx->ccid3hctx_x);
  180. /* The value of R is still undefined and so we can not recompute
  181. * the timout value. Keep initial value as per [RFC 4342, 5]. */
  182. t_nfb = TFRC_INITIAL_TIMEOUT;
  183. ccid3_update_send_time(hctx);
  184. break;
  185. case TFRC_SSTATE_FBACK:
  186. /*
  187. * Check if IDLE since last timeout and recv rate is less than
  188. * 4 packets per RTT
  189. */
  190. if (!hctx->ccid3hctx_idle ||
  191. (hctx->ccid3hctx_x_recv >=
  192. 4 * usecs_div(hctx->ccid3hctx_s, hctx->ccid3hctx_rtt))) {
  193. struct timeval now;
  194. ccid3_pr_debug("%s, sk=%p, state=%s, not idle\n",
  195. dccp_role(sk), sk,
  196. ccid3_tx_state_name(hctx->ccid3hctx_state));
  197. /*
  198. * Modify the cached value of X_recv [RFC 3448, 4.4]
  199. *
  200. * If (p == 0 || X_calc > 2 * X_recv)
  201. * X_recv = max(X_recv / 2, s / (2 * t_mbi));
  202. * Else
  203. * X_recv = X_calc / 4;
  204. */
  205. BUG_ON(hctx->ccid3hctx_p && !hctx->ccid3hctx_x_calc);
  206. if (hctx->ccid3hctx_p == 0 ||
  207. hctx->ccid3hctx_x_calc > 2 * hctx->ccid3hctx_x_recv) {
  208. hctx->ccid3hctx_x_recv = max_t(u32, hctx->ccid3hctx_x_recv / 2,
  209. hctx->ccid3hctx_s / (2 * TFRC_T_MBI));
  210. if (hctx->ccid3hctx_p == 0)
  211. dccp_timestamp(sk, &now);
  212. } else
  213. hctx->ccid3hctx_x_recv = hctx->ccid3hctx_x_calc / 4;
  214. /* Now recalculate X [RFC 3448, 4.3, step (4)] */
  215. ccid3_hc_tx_update_x(sk, &now);
  216. }
  217. /*
  218. * Schedule no feedback timer to expire in
  219. * max(t_RTO, 2 * s/X) = max(t_RTO, 2 * t_ipi)
  220. * See comments in packet_recv() regarding the value of t_RTO.
  221. */
  222. t_nfb = max(hctx->ccid3hctx_t_rto, 2 * hctx->ccid3hctx_t_ipi);
  223. break;
  224. case TFRC_SSTATE_NO_SENT:
  225. DCCP_BUG("Illegal %s state NO_SENT, sk=%p", dccp_role(sk), sk);
  226. /* fall through */
  227. case TFRC_SSTATE_TERM:
  228. goto out;
  229. }
  230. hctx->ccid3hctx_idle = 1;
  231. restart_timer:
  232. sk_reset_timer(sk, &hctx->ccid3hctx_no_feedback_timer,
  233. jiffies + usecs_to_jiffies(t_nfb));
  234. out:
  235. bh_unlock_sock(sk);
  236. sock_put(sk);
  237. }
  238. /*
  239. * returns
  240. * > 0: delay (in msecs) that should pass before actually sending
  241. * = 0: can send immediately
  242. * < 0: error condition; do not send packet
  243. */
  244. static int ccid3_hc_tx_send_packet(struct sock *sk, struct sk_buff *skb)
  245. {
  246. struct dccp_sock *dp = dccp_sk(sk);
  247. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  248. struct dccp_tx_hist_entry *new_packet;
  249. struct timeval now;
  250. long delay;
  251. BUG_ON(hctx == NULL);
  252. /*
  253. * This function is called only for Data and DataAck packets. Sending
  254. * zero-sized Data(Ack)s is theoretically possible, but for congestion
  255. * control this case is pathological - ignore it.
  256. */
  257. if (unlikely(skb->len == 0))
  258. return -EBADMSG;
  259. /* See if last packet allocated was not sent */
  260. new_packet = dccp_tx_hist_head(&hctx->ccid3hctx_hist);
  261. if (new_packet == NULL || new_packet->dccphtx_sent) {
  262. new_packet = dccp_tx_hist_entry_new(ccid3_tx_hist,
  263. GFP_ATOMIC);
  264. if (unlikely(new_packet == NULL)) {
  265. DCCP_WARN("%s, sk=%p, not enough mem to add to history,"
  266. "send refused\n", dccp_role(sk), sk);
  267. return -ENOBUFS;
  268. }
  269. dccp_tx_hist_add_entry(&hctx->ccid3hctx_hist, new_packet);
  270. }
  271. dccp_timestamp(sk, &now);
  272. switch (hctx->ccid3hctx_state) {
  273. case TFRC_SSTATE_NO_SENT:
  274. sk_reset_timer(sk, &hctx->ccid3hctx_no_feedback_timer,
  275. jiffies + usecs_to_jiffies(TFRC_INITIAL_TIMEOUT));
  276. hctx->ccid3hctx_last_win_count = 0;
  277. hctx->ccid3hctx_t_last_win_count = now;
  278. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_NO_FBACK);
  279. /* Set initial sending rate to 1 packet per second */
  280. ccid3_hc_tx_update_s(hctx, skb->len);
  281. hctx->ccid3hctx_x = hctx->ccid3hctx_s;
  282. /* First timeout, according to [RFC 3448, 4.2], is 1 second */
  283. hctx->ccid3hctx_t_ipi = USEC_PER_SEC;
  284. /* Initial delta: minimum of 0.5 sec and t_gran/2 */
  285. hctx->ccid3hctx_delta = TFRC_OPSYS_HALF_TIME_GRAN;
  286. /* Set t_0 for initial packet */
  287. hctx->ccid3hctx_t_nom = now;
  288. break;
  289. case TFRC_SSTATE_NO_FBACK:
  290. case TFRC_SSTATE_FBACK:
  291. delay = timeval_delta(&hctx->ccid3hctx_t_nom, &now);
  292. /*
  293. * Scheduling of packet transmissions [RFC 3448, 4.6]
  294. *
  295. * if (t_now > t_nom - delta)
  296. * // send the packet now
  297. * else
  298. * // send the packet in (t_nom - t_now) milliseconds.
  299. */
  300. if (delay - (long)hctx->ccid3hctx_delta >= 0)
  301. return delay / 1000L;
  302. break;
  303. case TFRC_SSTATE_TERM:
  304. DCCP_BUG("Illegal %s state TERM, sk=%p", dccp_role(sk), sk);
  305. return -EINVAL;
  306. }
  307. /* prepare to send now (add options etc.) */
  308. dp->dccps_hc_tx_insert_options = 1;
  309. new_packet->dccphtx_ccval = DCCP_SKB_CB(skb)->dccpd_ccval =
  310. hctx->ccid3hctx_last_win_count;
  311. timeval_add_usecs(&hctx->ccid3hctx_t_nom, hctx->ccid3hctx_t_ipi);
  312. return 0;
  313. }
  314. static void ccid3_hc_tx_packet_sent(struct sock *sk, int more, unsigned int len)
  315. {
  316. const struct dccp_sock *dp = dccp_sk(sk);
  317. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  318. struct timeval now;
  319. unsigned long quarter_rtt;
  320. struct dccp_tx_hist_entry *packet;
  321. BUG_ON(hctx == NULL);
  322. dccp_timestamp(sk, &now);
  323. ccid3_hc_tx_update_s(hctx, len);
  324. packet = dccp_tx_hist_head(&hctx->ccid3hctx_hist);
  325. if (unlikely(packet == NULL)) {
  326. DCCP_WARN("packet doesn't exist in history!\n");
  327. return;
  328. }
  329. if (unlikely(packet->dccphtx_sent)) {
  330. DCCP_WARN("no unsent packet in history!\n");
  331. return;
  332. }
  333. packet->dccphtx_tstamp = now;
  334. packet->dccphtx_seqno = dp->dccps_gss;
  335. /*
  336. * Check if win_count have changed
  337. * Algorithm in "8.1. Window Counter Value" in RFC 4342.
  338. */
  339. quarter_rtt = timeval_delta(&now, &hctx->ccid3hctx_t_last_win_count);
  340. if (likely(hctx->ccid3hctx_rtt > 8))
  341. quarter_rtt /= hctx->ccid3hctx_rtt / 4;
  342. if (quarter_rtt > 0) {
  343. hctx->ccid3hctx_t_last_win_count = now;
  344. hctx->ccid3hctx_last_win_count = (hctx->ccid3hctx_last_win_count +
  345. min_t(unsigned long, quarter_rtt, 5)) % 16;
  346. ccid3_pr_debug("%s, sk=%p, window changed from "
  347. "%u to %u!\n",
  348. dccp_role(sk), sk,
  349. packet->dccphtx_ccval,
  350. hctx->ccid3hctx_last_win_count);
  351. }
  352. hctx->ccid3hctx_idle = 0;
  353. packet->dccphtx_rtt = hctx->ccid3hctx_rtt;
  354. packet->dccphtx_sent = 1;
  355. }
  356. static void ccid3_hc_tx_packet_recv(struct sock *sk, struct sk_buff *skb)
  357. {
  358. const struct dccp_sock *dp = dccp_sk(sk);
  359. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  360. struct ccid3_options_received *opt_recv;
  361. struct dccp_tx_hist_entry *packet;
  362. struct timeval now;
  363. unsigned long t_nfb;
  364. u32 pinv;
  365. long r_sample, t_elapsed;
  366. BUG_ON(hctx == NULL);
  367. /* we are only interested in ACKs */
  368. if (!(DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_ACK ||
  369. DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_DATAACK))
  370. return;
  371. opt_recv = &hctx->ccid3hctx_options_received;
  372. switch (hctx->ccid3hctx_state) {
  373. case TFRC_SSTATE_NO_FBACK:
  374. case TFRC_SSTATE_FBACK:
  375. /* get packet from history to look up t_recvdata */
  376. packet = dccp_tx_hist_find_entry(&hctx->ccid3hctx_hist,
  377. DCCP_SKB_CB(skb)->dccpd_ack_seq);
  378. if (unlikely(packet == NULL)) {
  379. DCCP_WARN("%s(%p), seqno %llu(%s) doesn't exist "
  380. "in history!\n", dccp_role(sk), sk,
  381. (unsigned long long)DCCP_SKB_CB(skb)->dccpd_ack_seq,
  382. dccp_packet_name(DCCP_SKB_CB(skb)->dccpd_type));
  383. return;
  384. }
  385. /* Update receive rate */
  386. hctx->ccid3hctx_x_recv = opt_recv->ccid3or_receive_rate;
  387. /* Update loss event rate */
  388. pinv = opt_recv->ccid3or_loss_event_rate;
  389. if (pinv == ~0U || pinv == 0) /* see RFC 4342, 8.5 */
  390. hctx->ccid3hctx_p = 0;
  391. else /* can not exceed 100% */
  392. hctx->ccid3hctx_p = 1000000 / pinv;
  393. dccp_timestamp(sk, &now);
  394. /*
  395. * Calculate new round trip sample as per [RFC 3448, 4.3] by
  396. * R_sample = (now - t_recvdata) - t_elapsed
  397. */
  398. r_sample = timeval_delta(&now, &packet->dccphtx_tstamp);
  399. t_elapsed = dp->dccps_options_received.dccpor_elapsed_time * 10;
  400. if (unlikely(r_sample <= 0)) {
  401. DCCP_WARN("WARNING: R_sample (%ld) <= 0!\n", r_sample);
  402. r_sample = 0;
  403. } else if (unlikely(r_sample <= t_elapsed))
  404. DCCP_WARN("WARNING: r_sample=%ldus <= t_elapsed=%ldus\n",
  405. r_sample, t_elapsed);
  406. else
  407. r_sample -= t_elapsed;
  408. /* Update RTT estimate by
  409. * If (No feedback recv)
  410. * R = R_sample;
  411. * Else
  412. * R = q * R + (1 - q) * R_sample;
  413. *
  414. * q is a constant, RFC 3448 recomments 0.9
  415. */
  416. if (hctx->ccid3hctx_state == TFRC_SSTATE_NO_FBACK) {
  417. /* Use Larger Initial Windows [RFC 4342, sec. 5]
  418. * We deviate in that we use `s' instead of `MSS'. */
  419. u16 w_init = max( 4 * hctx->ccid3hctx_s,
  420. max(2 * hctx->ccid3hctx_s, 4380));
  421. hctx->ccid3hctx_rtt = r_sample;
  422. hctx->ccid3hctx_x = usecs_div(w_init, r_sample);
  423. hctx->ccid3hctx_t_ld = now;
  424. ccid3_update_send_time(hctx);
  425. ccid3_pr_debug("%s(%p), s=%u, w_init=%u, "
  426. "R_sample=%ldus, X=%u\n", dccp_role(sk),
  427. sk, hctx->ccid3hctx_s, w_init, r_sample,
  428. hctx->ccid3hctx_x);
  429. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_FBACK);
  430. } else {
  431. hctx->ccid3hctx_rtt = (9 * hctx->ccid3hctx_rtt +
  432. (u32)r_sample ) / 10;
  433. /* Update sending rate (step 4 of [RFC 3448, 4.3]) */
  434. if (hctx->ccid3hctx_p > 0)
  435. hctx->ccid3hctx_x_calc =
  436. tfrc_calc_x(hctx->ccid3hctx_s,
  437. hctx->ccid3hctx_rtt,
  438. hctx->ccid3hctx_p);
  439. ccid3_hc_tx_update_x(sk, &now);
  440. ccid3_pr_debug("%s(%p), RTT=%uus (sample=%ldus), s=%u, "
  441. "p=%u, X_calc=%u, X=%u\n", dccp_role(sk),
  442. sk, hctx->ccid3hctx_rtt, r_sample,
  443. hctx->ccid3hctx_s, hctx->ccid3hctx_p,
  444. hctx->ccid3hctx_x_calc,
  445. hctx->ccid3hctx_x);
  446. }
  447. /* unschedule no feedback timer */
  448. sk_stop_timer(sk, &hctx->ccid3hctx_no_feedback_timer);
  449. /* remove all packets older than the one acked from history */
  450. dccp_tx_hist_purge_older(ccid3_tx_hist,
  451. &hctx->ccid3hctx_hist, packet);
  452. /*
  453. * As we have calculated new ipi, delta, t_nom it is possible that
  454. * we now can send a packet, so wake up dccp_wait_for_ccid
  455. */
  456. sk->sk_write_space(sk);
  457. /*
  458. * Update timeout interval for the nofeedback timer.
  459. * We use a configuration option to increase the lower bound.
  460. * This can help avoid triggering the nofeedback timer too often
  461. * ('spinning') on LANs with small RTTs.
  462. */
  463. hctx->ccid3hctx_t_rto = max_t(u32, 4 * hctx->ccid3hctx_rtt,
  464. CONFIG_IP_DCCP_CCID3_RTO *
  465. (USEC_PER_SEC/1000) );
  466. /*
  467. * Schedule no feedback timer to expire in
  468. * max(t_RTO, 2 * s/X) = max(t_RTO, 2 * t_ipi)
  469. */
  470. t_nfb = max(hctx->ccid3hctx_t_rto, 2 * hctx->ccid3hctx_t_ipi);
  471. ccid3_pr_debug("%s, sk=%p, Scheduled no feedback timer to "
  472. "expire in %lu jiffies (%luus)\n",
  473. dccp_role(sk), sk,
  474. usecs_to_jiffies(t_nfb), t_nfb);
  475. sk_reset_timer(sk, &hctx->ccid3hctx_no_feedback_timer,
  476. jiffies + usecs_to_jiffies(t_nfb));
  477. /* set idle flag */
  478. hctx->ccid3hctx_idle = 1;
  479. break;
  480. case TFRC_SSTATE_NO_SENT:
  481. if (dccp_sk(sk)->dccps_role == DCCP_ROLE_CLIENT)
  482. DCCP_WARN("Illegal ACK received - no packet sent\n");
  483. /* fall through */
  484. case TFRC_SSTATE_TERM: /* ignore feedback when closing */
  485. break;
  486. }
  487. }
  488. static int ccid3_hc_tx_insert_options(struct sock *sk, struct sk_buff *skb)
  489. {
  490. const struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  491. BUG_ON(hctx == NULL);
  492. if (sk->sk_state == DCCP_OPEN || sk->sk_state == DCCP_PARTOPEN)
  493. DCCP_SKB_CB(skb)->dccpd_ccval = hctx->ccid3hctx_last_win_count;
  494. return 0;
  495. }
  496. static int ccid3_hc_tx_parse_options(struct sock *sk, unsigned char option,
  497. unsigned char len, u16 idx,
  498. unsigned char *value)
  499. {
  500. int rc = 0;
  501. const struct dccp_sock *dp = dccp_sk(sk);
  502. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  503. struct ccid3_options_received *opt_recv;
  504. BUG_ON(hctx == NULL);
  505. opt_recv = &hctx->ccid3hctx_options_received;
  506. if (opt_recv->ccid3or_seqno != dp->dccps_gsr) {
  507. opt_recv->ccid3or_seqno = dp->dccps_gsr;
  508. opt_recv->ccid3or_loss_event_rate = ~0;
  509. opt_recv->ccid3or_loss_intervals_idx = 0;
  510. opt_recv->ccid3or_loss_intervals_len = 0;
  511. opt_recv->ccid3or_receive_rate = 0;
  512. }
  513. switch (option) {
  514. case TFRC_OPT_LOSS_EVENT_RATE:
  515. if (unlikely(len != 4)) {
  516. DCCP_WARN("%s, sk=%p, invalid len %d "
  517. "for TFRC_OPT_LOSS_EVENT_RATE\n",
  518. dccp_role(sk), sk, len);
  519. rc = -EINVAL;
  520. } else {
  521. opt_recv->ccid3or_loss_event_rate = ntohl(*(__be32 *)value);
  522. ccid3_pr_debug("%s, sk=%p, LOSS_EVENT_RATE=%u\n",
  523. dccp_role(sk), sk,
  524. opt_recv->ccid3or_loss_event_rate);
  525. }
  526. break;
  527. case TFRC_OPT_LOSS_INTERVALS:
  528. opt_recv->ccid3or_loss_intervals_idx = idx;
  529. opt_recv->ccid3or_loss_intervals_len = len;
  530. ccid3_pr_debug("%s, sk=%p, LOSS_INTERVALS=(%u, %u)\n",
  531. dccp_role(sk), sk,
  532. opt_recv->ccid3or_loss_intervals_idx,
  533. opt_recv->ccid3or_loss_intervals_len);
  534. break;
  535. case TFRC_OPT_RECEIVE_RATE:
  536. if (unlikely(len != 4)) {
  537. DCCP_WARN("%s, sk=%p, invalid len %d "
  538. "for TFRC_OPT_RECEIVE_RATE\n",
  539. dccp_role(sk), sk, len);
  540. rc = -EINVAL;
  541. } else {
  542. opt_recv->ccid3or_receive_rate = ntohl(*(__be32 *)value);
  543. ccid3_pr_debug("%s, sk=%p, RECEIVE_RATE=%u\n",
  544. dccp_role(sk), sk,
  545. opt_recv->ccid3or_receive_rate);
  546. }
  547. break;
  548. }
  549. return rc;
  550. }
  551. static int ccid3_hc_tx_init(struct ccid *ccid, struct sock *sk)
  552. {
  553. struct ccid3_hc_tx_sock *hctx = ccid_priv(ccid);
  554. hctx->ccid3hctx_s = 0;
  555. hctx->ccid3hctx_state = TFRC_SSTATE_NO_SENT;
  556. INIT_LIST_HEAD(&hctx->ccid3hctx_hist);
  557. hctx->ccid3hctx_no_feedback_timer.function = ccid3_hc_tx_no_feedback_timer;
  558. hctx->ccid3hctx_no_feedback_timer.data = (unsigned long)sk;
  559. init_timer(&hctx->ccid3hctx_no_feedback_timer);
  560. return 0;
  561. }
  562. static void ccid3_hc_tx_exit(struct sock *sk)
  563. {
  564. struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  565. BUG_ON(hctx == NULL);
  566. ccid3_hc_tx_set_state(sk, TFRC_SSTATE_TERM);
  567. sk_stop_timer(sk, &hctx->ccid3hctx_no_feedback_timer);
  568. /* Empty packet history */
  569. dccp_tx_hist_purge(ccid3_tx_hist, &hctx->ccid3hctx_hist);
  570. }
  571. /*
  572. * RX Half Connection methods
  573. */
  574. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  575. static const char *ccid3_rx_state_name(enum ccid3_hc_rx_states state)
  576. {
  577. static char *ccid3_rx_state_names[] = {
  578. [TFRC_RSTATE_NO_DATA] = "NO_DATA",
  579. [TFRC_RSTATE_DATA] = "DATA",
  580. [TFRC_RSTATE_TERM] = "TERM",
  581. };
  582. return ccid3_rx_state_names[state];
  583. }
  584. #endif
  585. static void ccid3_hc_rx_set_state(struct sock *sk,
  586. enum ccid3_hc_rx_states state)
  587. {
  588. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  589. enum ccid3_hc_rx_states oldstate = hcrx->ccid3hcrx_state;
  590. ccid3_pr_debug("%s(%p) %-8.8s -> %s\n",
  591. dccp_role(sk), sk, ccid3_rx_state_name(oldstate),
  592. ccid3_rx_state_name(state));
  593. WARN_ON(state == oldstate);
  594. hcrx->ccid3hcrx_state = state;
  595. }
  596. static inline void ccid3_hc_rx_update_s(struct ccid3_hc_rx_sock *hcrx, int len)
  597. {
  598. if (unlikely(len == 0)) /* don't update on empty packets (e.g. ACKs) */
  599. ccid3_pr_debug("Packet payload length is 0 - not updating\n");
  600. else
  601. hcrx->ccid3hcrx_s = hcrx->ccid3hcrx_s == 0 ? len :
  602. (9 * hcrx->ccid3hcrx_s + len) / 10;
  603. }
  604. static void ccid3_hc_rx_send_feedback(struct sock *sk)
  605. {
  606. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  607. struct dccp_sock *dp = dccp_sk(sk);
  608. struct dccp_rx_hist_entry *packet;
  609. struct timeval now;
  610. ccid3_pr_debug("%s, sk=%p\n", dccp_role(sk), sk);
  611. dccp_timestamp(sk, &now);
  612. switch (hcrx->ccid3hcrx_state) {
  613. case TFRC_RSTATE_NO_DATA:
  614. hcrx->ccid3hcrx_x_recv = 0;
  615. break;
  616. case TFRC_RSTATE_DATA: {
  617. const u32 delta = timeval_delta(&now,
  618. &hcrx->ccid3hcrx_tstamp_last_feedback);
  619. hcrx->ccid3hcrx_x_recv = usecs_div(hcrx->ccid3hcrx_bytes_recv,
  620. delta);
  621. }
  622. break;
  623. case TFRC_RSTATE_TERM:
  624. DCCP_BUG("Illegal %s state TERM, sk=%p", dccp_role(sk), sk);
  625. return;
  626. }
  627. packet = dccp_rx_hist_find_data_packet(&hcrx->ccid3hcrx_hist);
  628. if (unlikely(packet == NULL)) {
  629. DCCP_WARN("%s, sk=%p, no data packet in history!\n",
  630. dccp_role(sk), sk);
  631. return;
  632. }
  633. hcrx->ccid3hcrx_tstamp_last_feedback = now;
  634. hcrx->ccid3hcrx_ccval_last_counter = packet->dccphrx_ccval;
  635. hcrx->ccid3hcrx_bytes_recv = 0;
  636. /* Convert to multiples of 10us */
  637. hcrx->ccid3hcrx_elapsed_time =
  638. timeval_delta(&now, &packet->dccphrx_tstamp) / 10;
  639. if (hcrx->ccid3hcrx_p == 0)
  640. hcrx->ccid3hcrx_pinv = ~0U; /* see RFC 4342, 8.5 */
  641. else if (hcrx->ccid3hcrx_p > 1000000) {
  642. DCCP_WARN("p (%u) > 100%%\n", hcrx->ccid3hcrx_p);
  643. hcrx->ccid3hcrx_pinv = 1; /* use 100% in this case */
  644. } else
  645. hcrx->ccid3hcrx_pinv = 1000000 / hcrx->ccid3hcrx_p;
  646. dp->dccps_hc_rx_insert_options = 1;
  647. dccp_send_ack(sk);
  648. }
  649. static int ccid3_hc_rx_insert_options(struct sock *sk, struct sk_buff *skb)
  650. {
  651. const struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  652. __be32 x_recv, pinv;
  653. BUG_ON(hcrx == NULL);
  654. if (!(sk->sk_state == DCCP_OPEN || sk->sk_state == DCCP_PARTOPEN))
  655. return 0;
  656. DCCP_SKB_CB(skb)->dccpd_ccval = hcrx->ccid3hcrx_ccval_last_counter;
  657. if (dccp_packet_without_ack(skb))
  658. return 0;
  659. x_recv = htonl(hcrx->ccid3hcrx_x_recv);
  660. pinv = htonl(hcrx->ccid3hcrx_pinv);
  661. if ((hcrx->ccid3hcrx_elapsed_time != 0 &&
  662. dccp_insert_option_elapsed_time(sk, skb,
  663. hcrx->ccid3hcrx_elapsed_time)) ||
  664. dccp_insert_option_timestamp(sk, skb) ||
  665. dccp_insert_option(sk, skb, TFRC_OPT_LOSS_EVENT_RATE,
  666. &pinv, sizeof(pinv)) ||
  667. dccp_insert_option(sk, skb, TFRC_OPT_RECEIVE_RATE,
  668. &x_recv, sizeof(x_recv)))
  669. return -1;
  670. return 0;
  671. }
  672. /* calculate first loss interval
  673. *
  674. * returns estimated loss interval in usecs */
  675. static u32 ccid3_hc_rx_calc_first_li(struct sock *sk)
  676. {
  677. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  678. struct dccp_rx_hist_entry *entry, *next, *tail = NULL;
  679. u32 rtt, delta, x_recv, fval, p, tmp2;
  680. struct timeval tstamp = { 0, };
  681. int interval = 0;
  682. int win_count = 0;
  683. int step = 0;
  684. u64 tmp1;
  685. list_for_each_entry_safe(entry, next, &hcrx->ccid3hcrx_hist,
  686. dccphrx_node) {
  687. if (dccp_rx_hist_entry_data_packet(entry)) {
  688. tail = entry;
  689. switch (step) {
  690. case 0:
  691. tstamp = entry->dccphrx_tstamp;
  692. win_count = entry->dccphrx_ccval;
  693. step = 1;
  694. break;
  695. case 1:
  696. interval = win_count - entry->dccphrx_ccval;
  697. if (interval < 0)
  698. interval += TFRC_WIN_COUNT_LIMIT;
  699. if (interval > 4)
  700. goto found;
  701. break;
  702. }
  703. }
  704. }
  705. if (unlikely(step == 0)) {
  706. DCCP_WARN("%s, sk=%p, packet history has no data packets!\n",
  707. dccp_role(sk), sk);
  708. return ~0;
  709. }
  710. if (unlikely(interval == 0)) {
  711. DCCP_WARN("%s, sk=%p, Could not find a win_count interval > 0."
  712. "Defaulting to 1\n", dccp_role(sk), sk);
  713. interval = 1;
  714. }
  715. found:
  716. if (!tail) {
  717. DCCP_CRIT("tail is null\n");
  718. return ~0;
  719. }
  720. rtt = timeval_delta(&tstamp, &tail->dccphrx_tstamp) * 4 / interval;
  721. ccid3_pr_debug("%s, sk=%p, approximated RTT to %uus\n",
  722. dccp_role(sk), sk, rtt);
  723. if (rtt == 0) {
  724. DCCP_WARN("RTT==0, setting to 1\n");
  725. rtt = 1;
  726. }
  727. dccp_timestamp(sk, &tstamp);
  728. delta = timeval_delta(&tstamp, &hcrx->ccid3hcrx_tstamp_last_feedback);
  729. x_recv = usecs_div(hcrx->ccid3hcrx_bytes_recv, delta);
  730. if (x_recv == 0)
  731. x_recv = hcrx->ccid3hcrx_x_recv;
  732. tmp1 = (u64)x_recv * (u64)rtt;
  733. do_div(tmp1,10000000);
  734. tmp2 = (u32)tmp1;
  735. if (!tmp2) {
  736. DCCP_CRIT("tmp2 = 0, x_recv = %u, rtt =%u\n", x_recv, rtt);
  737. return ~0;
  738. }
  739. fval = (hcrx->ccid3hcrx_s * 100000) / tmp2;
  740. /* do not alter order above or you will get overflow on 32 bit */
  741. p = tfrc_calc_x_reverse_lookup(fval);
  742. ccid3_pr_debug("%s, sk=%p, receive rate=%u bytes/s, implied "
  743. "loss rate=%u\n", dccp_role(sk), sk, x_recv, p);
  744. if (p == 0)
  745. return ~0;
  746. else
  747. return 1000000 / p;
  748. }
  749. static void ccid3_hc_rx_update_li(struct sock *sk, u64 seq_loss, u8 win_loss)
  750. {
  751. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  752. struct dccp_li_hist_entry *head;
  753. u64 seq_temp;
  754. if (list_empty(&hcrx->ccid3hcrx_li_hist)) {
  755. if (!dccp_li_hist_interval_new(ccid3_li_hist,
  756. &hcrx->ccid3hcrx_li_hist, seq_loss, win_loss))
  757. return;
  758. head = list_entry(hcrx->ccid3hcrx_li_hist.next,
  759. struct dccp_li_hist_entry, dccplih_node);
  760. head->dccplih_interval = ccid3_hc_rx_calc_first_li(sk);
  761. } else {
  762. struct dccp_li_hist_entry *entry;
  763. struct list_head *tail;
  764. head = list_entry(hcrx->ccid3hcrx_li_hist.next,
  765. struct dccp_li_hist_entry, dccplih_node);
  766. /* FIXME win count check removed as was wrong */
  767. /* should make this check with receive history */
  768. /* and compare there as per section 10.2 of RFC4342 */
  769. /* new loss event detected */
  770. /* calculate last interval length */
  771. seq_temp = dccp_delta_seqno(head->dccplih_seqno, seq_loss);
  772. entry = dccp_li_hist_entry_new(ccid3_li_hist, GFP_ATOMIC);
  773. if (entry == NULL) {
  774. DCCP_BUG("out of memory - can not allocate entry");
  775. return;
  776. }
  777. list_add(&entry->dccplih_node, &hcrx->ccid3hcrx_li_hist);
  778. tail = hcrx->ccid3hcrx_li_hist.prev;
  779. list_del(tail);
  780. kmem_cache_free(ccid3_li_hist->dccplih_slab, tail);
  781. /* Create the newest interval */
  782. entry->dccplih_seqno = seq_loss;
  783. entry->dccplih_interval = seq_temp;
  784. entry->dccplih_win_count = win_loss;
  785. }
  786. }
  787. static int ccid3_hc_rx_detect_loss(struct sock *sk,
  788. struct dccp_rx_hist_entry *packet)
  789. {
  790. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  791. struct dccp_rx_hist_entry *rx_hist = dccp_rx_hist_head(&hcrx->ccid3hcrx_hist);
  792. u64 seqno = packet->dccphrx_seqno;
  793. u64 tmp_seqno;
  794. int loss = 0;
  795. u8 ccval;
  796. tmp_seqno = hcrx->ccid3hcrx_seqno_nonloss;
  797. if (!rx_hist ||
  798. follows48(packet->dccphrx_seqno, hcrx->ccid3hcrx_seqno_nonloss)) {
  799. hcrx->ccid3hcrx_seqno_nonloss = seqno;
  800. hcrx->ccid3hcrx_ccval_nonloss = packet->dccphrx_ccval;
  801. goto detect_out;
  802. }
  803. while (dccp_delta_seqno(hcrx->ccid3hcrx_seqno_nonloss, seqno)
  804. > TFRC_RECV_NUM_LATE_LOSS) {
  805. loss = 1;
  806. ccid3_hc_rx_update_li(sk, hcrx->ccid3hcrx_seqno_nonloss,
  807. hcrx->ccid3hcrx_ccval_nonloss);
  808. tmp_seqno = hcrx->ccid3hcrx_seqno_nonloss;
  809. dccp_inc_seqno(&tmp_seqno);
  810. hcrx->ccid3hcrx_seqno_nonloss = tmp_seqno;
  811. dccp_inc_seqno(&tmp_seqno);
  812. while (dccp_rx_hist_find_entry(&hcrx->ccid3hcrx_hist,
  813. tmp_seqno, &ccval)) {
  814. hcrx->ccid3hcrx_seqno_nonloss = tmp_seqno;
  815. hcrx->ccid3hcrx_ccval_nonloss = ccval;
  816. dccp_inc_seqno(&tmp_seqno);
  817. }
  818. }
  819. /* FIXME - this code could be simplified with above while */
  820. /* but works at moment */
  821. if (follows48(packet->dccphrx_seqno, hcrx->ccid3hcrx_seqno_nonloss)) {
  822. hcrx->ccid3hcrx_seqno_nonloss = seqno;
  823. hcrx->ccid3hcrx_ccval_nonloss = packet->dccphrx_ccval;
  824. }
  825. detect_out:
  826. dccp_rx_hist_add_packet(ccid3_rx_hist, &hcrx->ccid3hcrx_hist,
  827. &hcrx->ccid3hcrx_li_hist, packet,
  828. hcrx->ccid3hcrx_seqno_nonloss);
  829. return loss;
  830. }
  831. static void ccid3_hc_rx_packet_recv(struct sock *sk, struct sk_buff *skb)
  832. {
  833. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  834. const struct dccp_options_received *opt_recv;
  835. struct dccp_rx_hist_entry *packet;
  836. struct timeval now;
  837. u32 p_prev, rtt_prev, r_sample, t_elapsed;
  838. int loss, payload_size;
  839. BUG_ON(hcrx == NULL);
  840. opt_recv = &dccp_sk(sk)->dccps_options_received;
  841. switch (DCCP_SKB_CB(skb)->dccpd_type) {
  842. case DCCP_PKT_ACK:
  843. if (hcrx->ccid3hcrx_state == TFRC_RSTATE_NO_DATA)
  844. return;
  845. case DCCP_PKT_DATAACK:
  846. if (opt_recv->dccpor_timestamp_echo == 0)
  847. break;
  848. rtt_prev = hcrx->ccid3hcrx_rtt;
  849. dccp_timestamp(sk, &now);
  850. timeval_sub_usecs(&now, opt_recv->dccpor_timestamp_echo * 10);
  851. r_sample = timeval_usecs(&now);
  852. t_elapsed = opt_recv->dccpor_elapsed_time * 10;
  853. if (unlikely(r_sample <= t_elapsed))
  854. DCCP_WARN("r_sample=%uus, t_elapsed=%uus\n",
  855. r_sample, t_elapsed);
  856. else
  857. r_sample -= t_elapsed;
  858. if (hcrx->ccid3hcrx_state == TFRC_RSTATE_NO_DATA)
  859. hcrx->ccid3hcrx_rtt = r_sample;
  860. else
  861. hcrx->ccid3hcrx_rtt = (hcrx->ccid3hcrx_rtt * 9) / 10 +
  862. r_sample / 10;
  863. if (rtt_prev != hcrx->ccid3hcrx_rtt)
  864. ccid3_pr_debug("%s, New RTT=%uus, elapsed time=%u\n",
  865. dccp_role(sk), hcrx->ccid3hcrx_rtt,
  866. opt_recv->dccpor_elapsed_time);
  867. break;
  868. case DCCP_PKT_DATA:
  869. break;
  870. default: /* We're not interested in other packet types, move along */
  871. return;
  872. }
  873. packet = dccp_rx_hist_entry_new(ccid3_rx_hist, sk, opt_recv->dccpor_ndp,
  874. skb, GFP_ATOMIC);
  875. if (unlikely(packet == NULL)) {
  876. DCCP_WARN("%s, sk=%p, Not enough mem to add rx packet "
  877. "to history, consider it lost!\n", dccp_role(sk), sk);
  878. return;
  879. }
  880. loss = ccid3_hc_rx_detect_loss(sk, packet);
  881. if (DCCP_SKB_CB(skb)->dccpd_type == DCCP_PKT_ACK)
  882. return;
  883. payload_size = skb->len - dccp_hdr(skb)->dccph_doff * 4;
  884. ccid3_hc_rx_update_s(hcrx, payload_size);
  885. switch (hcrx->ccid3hcrx_state) {
  886. case TFRC_RSTATE_NO_DATA:
  887. ccid3_pr_debug("%s, sk=%p(%s), skb=%p, sending initial "
  888. "feedback\n",
  889. dccp_role(sk), sk,
  890. dccp_state_name(sk->sk_state), skb);
  891. ccid3_hc_rx_send_feedback(sk);
  892. ccid3_hc_rx_set_state(sk, TFRC_RSTATE_DATA);
  893. return;
  894. case TFRC_RSTATE_DATA:
  895. hcrx->ccid3hcrx_bytes_recv += payload_size;
  896. if (loss)
  897. break;
  898. dccp_timestamp(sk, &now);
  899. if (timeval_delta(&now, &hcrx->ccid3hcrx_tstamp_last_ack) >=
  900. hcrx->ccid3hcrx_rtt) {
  901. hcrx->ccid3hcrx_tstamp_last_ack = now;
  902. ccid3_hc_rx_send_feedback(sk);
  903. }
  904. return;
  905. case TFRC_RSTATE_TERM:
  906. DCCP_BUG("Illegal %s state TERM, sk=%p", dccp_role(sk), sk);
  907. return;
  908. }
  909. /* Dealing with packet loss */
  910. ccid3_pr_debug("%s, sk=%p(%s), data loss! Reacting...\n",
  911. dccp_role(sk), sk, dccp_state_name(sk->sk_state));
  912. p_prev = hcrx->ccid3hcrx_p;
  913. /* Calculate loss event rate */
  914. if (!list_empty(&hcrx->ccid3hcrx_li_hist)) {
  915. u32 i_mean = dccp_li_hist_calc_i_mean(&hcrx->ccid3hcrx_li_hist);
  916. /* Scaling up by 1000000 as fixed decimal */
  917. if (i_mean != 0)
  918. hcrx->ccid3hcrx_p = 1000000 / i_mean;
  919. } else
  920. DCCP_BUG("empty loss history");
  921. if (hcrx->ccid3hcrx_p > p_prev) {
  922. ccid3_hc_rx_send_feedback(sk);
  923. return;
  924. }
  925. }
  926. static int ccid3_hc_rx_init(struct ccid *ccid, struct sock *sk)
  927. {
  928. struct ccid3_hc_rx_sock *hcrx = ccid_priv(ccid);
  929. ccid3_pr_debug("%s, sk=%p\n", dccp_role(sk), sk);
  930. hcrx->ccid3hcrx_state = TFRC_RSTATE_NO_DATA;
  931. INIT_LIST_HEAD(&hcrx->ccid3hcrx_hist);
  932. INIT_LIST_HEAD(&hcrx->ccid3hcrx_li_hist);
  933. dccp_timestamp(sk, &hcrx->ccid3hcrx_tstamp_last_ack);
  934. hcrx->ccid3hcrx_tstamp_last_feedback = hcrx->ccid3hcrx_tstamp_last_ack;
  935. hcrx->ccid3hcrx_s = 0;
  936. hcrx->ccid3hcrx_rtt = 5000; /* XXX 5ms for now... */
  937. return 0;
  938. }
  939. static void ccid3_hc_rx_exit(struct sock *sk)
  940. {
  941. struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  942. BUG_ON(hcrx == NULL);
  943. ccid3_hc_rx_set_state(sk, TFRC_RSTATE_TERM);
  944. /* Empty packet history */
  945. dccp_rx_hist_purge(ccid3_rx_hist, &hcrx->ccid3hcrx_hist);
  946. /* Empty loss interval history */
  947. dccp_li_hist_purge(ccid3_li_hist, &hcrx->ccid3hcrx_li_hist);
  948. }
  949. static void ccid3_hc_rx_get_info(struct sock *sk, struct tcp_info *info)
  950. {
  951. const struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  952. /* Listen socks doesn't have a private CCID block */
  953. if (sk->sk_state == DCCP_LISTEN)
  954. return;
  955. BUG_ON(hcrx == NULL);
  956. info->tcpi_ca_state = hcrx->ccid3hcrx_state;
  957. info->tcpi_options |= TCPI_OPT_TIMESTAMPS;
  958. info->tcpi_rcv_rtt = hcrx->ccid3hcrx_rtt;
  959. }
  960. static void ccid3_hc_tx_get_info(struct sock *sk, struct tcp_info *info)
  961. {
  962. const struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  963. /* Listen socks doesn't have a private CCID block */
  964. if (sk->sk_state == DCCP_LISTEN)
  965. return;
  966. BUG_ON(hctx == NULL);
  967. info->tcpi_rto = hctx->ccid3hctx_t_rto;
  968. info->tcpi_rtt = hctx->ccid3hctx_rtt;
  969. }
  970. static int ccid3_hc_rx_getsockopt(struct sock *sk, const int optname, int len,
  971. u32 __user *optval, int __user *optlen)
  972. {
  973. const struct ccid3_hc_rx_sock *hcrx = ccid3_hc_rx_sk(sk);
  974. const void *val;
  975. /* Listen socks doesn't have a private CCID block */
  976. if (sk->sk_state == DCCP_LISTEN)
  977. return -EINVAL;
  978. switch (optname) {
  979. case DCCP_SOCKOPT_CCID_RX_INFO:
  980. if (len < sizeof(hcrx->ccid3hcrx_tfrc))
  981. return -EINVAL;
  982. len = sizeof(hcrx->ccid3hcrx_tfrc);
  983. val = &hcrx->ccid3hcrx_tfrc;
  984. break;
  985. default:
  986. return -ENOPROTOOPT;
  987. }
  988. if (put_user(len, optlen) || copy_to_user(optval, val, len))
  989. return -EFAULT;
  990. return 0;
  991. }
  992. static int ccid3_hc_tx_getsockopt(struct sock *sk, const int optname, int len,
  993. u32 __user *optval, int __user *optlen)
  994. {
  995. const struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk);
  996. const void *val;
  997. /* Listen socks doesn't have a private CCID block */
  998. if (sk->sk_state == DCCP_LISTEN)
  999. return -EINVAL;
  1000. switch (optname) {
  1001. case DCCP_SOCKOPT_CCID_TX_INFO:
  1002. if (len < sizeof(hctx->ccid3hctx_tfrc))
  1003. return -EINVAL;
  1004. len = sizeof(hctx->ccid3hctx_tfrc);
  1005. val = &hctx->ccid3hctx_tfrc;
  1006. break;
  1007. default:
  1008. return -ENOPROTOOPT;
  1009. }
  1010. if (put_user(len, optlen) || copy_to_user(optval, val, len))
  1011. return -EFAULT;
  1012. return 0;
  1013. }
  1014. static struct ccid_operations ccid3 = {
  1015. .ccid_id = DCCPC_CCID3,
  1016. .ccid_name = "ccid3",
  1017. .ccid_owner = THIS_MODULE,
  1018. .ccid_hc_tx_obj_size = sizeof(struct ccid3_hc_tx_sock),
  1019. .ccid_hc_tx_init = ccid3_hc_tx_init,
  1020. .ccid_hc_tx_exit = ccid3_hc_tx_exit,
  1021. .ccid_hc_tx_send_packet = ccid3_hc_tx_send_packet,
  1022. .ccid_hc_tx_packet_sent = ccid3_hc_tx_packet_sent,
  1023. .ccid_hc_tx_packet_recv = ccid3_hc_tx_packet_recv,
  1024. .ccid_hc_tx_insert_options = ccid3_hc_tx_insert_options,
  1025. .ccid_hc_tx_parse_options = ccid3_hc_tx_parse_options,
  1026. .ccid_hc_rx_obj_size = sizeof(struct ccid3_hc_rx_sock),
  1027. .ccid_hc_rx_init = ccid3_hc_rx_init,
  1028. .ccid_hc_rx_exit = ccid3_hc_rx_exit,
  1029. .ccid_hc_rx_insert_options = ccid3_hc_rx_insert_options,
  1030. .ccid_hc_rx_packet_recv = ccid3_hc_rx_packet_recv,
  1031. .ccid_hc_rx_get_info = ccid3_hc_rx_get_info,
  1032. .ccid_hc_tx_get_info = ccid3_hc_tx_get_info,
  1033. .ccid_hc_rx_getsockopt = ccid3_hc_rx_getsockopt,
  1034. .ccid_hc_tx_getsockopt = ccid3_hc_tx_getsockopt,
  1035. };
  1036. #ifdef CONFIG_IP_DCCP_CCID3_DEBUG
  1037. module_param(ccid3_debug, int, 0444);
  1038. MODULE_PARM_DESC(ccid3_debug, "Enable debug messages");
  1039. #endif
  1040. static __init int ccid3_module_init(void)
  1041. {
  1042. int rc = -ENOBUFS;
  1043. ccid3_rx_hist = dccp_rx_hist_new("ccid3");
  1044. if (ccid3_rx_hist == NULL)
  1045. goto out;
  1046. ccid3_tx_hist = dccp_tx_hist_new("ccid3");
  1047. if (ccid3_tx_hist == NULL)
  1048. goto out_free_rx;
  1049. ccid3_li_hist = dccp_li_hist_new("ccid3");
  1050. if (ccid3_li_hist == NULL)
  1051. goto out_free_tx;
  1052. rc = ccid_register(&ccid3);
  1053. if (rc != 0)
  1054. goto out_free_loss_interval_history;
  1055. out:
  1056. return rc;
  1057. out_free_loss_interval_history:
  1058. dccp_li_hist_delete(ccid3_li_hist);
  1059. ccid3_li_hist = NULL;
  1060. out_free_tx:
  1061. dccp_tx_hist_delete(ccid3_tx_hist);
  1062. ccid3_tx_hist = NULL;
  1063. out_free_rx:
  1064. dccp_rx_hist_delete(ccid3_rx_hist);
  1065. ccid3_rx_hist = NULL;
  1066. goto out;
  1067. }
  1068. module_init(ccid3_module_init);
  1069. static __exit void ccid3_module_exit(void)
  1070. {
  1071. ccid_unregister(&ccid3);
  1072. if (ccid3_tx_hist != NULL) {
  1073. dccp_tx_hist_delete(ccid3_tx_hist);
  1074. ccid3_tx_hist = NULL;
  1075. }
  1076. if (ccid3_rx_hist != NULL) {
  1077. dccp_rx_hist_delete(ccid3_rx_hist);
  1078. ccid3_rx_hist = NULL;
  1079. }
  1080. if (ccid3_li_hist != NULL) {
  1081. dccp_li_hist_delete(ccid3_li_hist);
  1082. ccid3_li_hist = NULL;
  1083. }
  1084. }
  1085. module_exit(ccid3_module_exit);
  1086. MODULE_AUTHOR("Ian McDonald <ian.mcdonald@jandi.co.nz>, "
  1087. "Arnaldo Carvalho de Melo <acme@ghostprotocols.net>");
  1088. MODULE_DESCRIPTION("DCCP TFRC CCID3 CCID");
  1089. MODULE_LICENSE("GPL");
  1090. MODULE_ALIAS("net-dccp-ccid-3");