options.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580
  1. /*
  2. * net/dccp/options.c
  3. *
  4. * An implementation of the DCCP protocol
  5. * Copyright (c) 2005 Aristeu Sergio Rozanski Filho <aris@cathedrallabs.org>
  6. * Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@ghostprotocols.net>
  7. * Copyright (c) 2005 Ian McDonald <ian.mcdonald@jandi.co.nz>
  8. *
  9. * This program is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU General Public License
  11. * as published by the Free Software Foundation; either version
  12. * 2 of the License, or (at your option) any later version.
  13. */
  14. #include <linux/dccp.h>
  15. #include <linux/module.h>
  16. #include <linux/types.h>
  17. #include <linux/kernel.h>
  18. #include <linux/skbuff.h>
  19. #include "ackvec.h"
  20. #include "ccid.h"
  21. #include "dccp.h"
  22. #include "feat.h"
  23. int sysctl_dccp_feat_sequence_window = DCCPF_INITIAL_SEQUENCE_WINDOW;
  24. int sysctl_dccp_feat_rx_ccid = DCCPF_INITIAL_CCID;
  25. int sysctl_dccp_feat_tx_ccid = DCCPF_INITIAL_CCID;
  26. int sysctl_dccp_feat_ack_ratio = DCCPF_INITIAL_ACK_RATIO;
  27. int sysctl_dccp_feat_send_ack_vector = DCCPF_INITIAL_SEND_ACK_VECTOR;
  28. int sysctl_dccp_feat_send_ndp_count = DCCPF_INITIAL_SEND_NDP_COUNT;
  29. void dccp_minisock_init(struct dccp_minisock *dmsk)
  30. {
  31. dmsk->dccpms_sequence_window = sysctl_dccp_feat_sequence_window;
  32. dmsk->dccpms_rx_ccid = sysctl_dccp_feat_rx_ccid;
  33. dmsk->dccpms_tx_ccid = sysctl_dccp_feat_tx_ccid;
  34. dmsk->dccpms_ack_ratio = sysctl_dccp_feat_ack_ratio;
  35. dmsk->dccpms_send_ack_vector = sysctl_dccp_feat_send_ack_vector;
  36. dmsk->dccpms_send_ndp_count = sysctl_dccp_feat_send_ndp_count;
  37. }
  38. static u32 dccp_decode_value_var(const unsigned char *bf, const u8 len)
  39. {
  40. u32 value = 0;
  41. if (len > 3)
  42. value += *bf++ << 24;
  43. if (len > 2)
  44. value += *bf++ << 16;
  45. if (len > 1)
  46. value += *bf++ << 8;
  47. if (len > 0)
  48. value += *bf;
  49. return value;
  50. }
  51. int dccp_parse_options(struct sock *sk, struct sk_buff *skb)
  52. {
  53. struct dccp_sock *dp = dccp_sk(sk);
  54. const struct dccp_hdr *dh = dccp_hdr(skb);
  55. const u8 pkt_type = DCCP_SKB_CB(skb)->dccpd_type;
  56. u64 ackno = DCCP_SKB_CB(skb)->dccpd_ack_seq;
  57. unsigned char *options = (unsigned char *)dh + dccp_hdr_len(skb);
  58. unsigned char *opt_ptr = options;
  59. const unsigned char *opt_end = (unsigned char *)dh +
  60. (dh->dccph_doff * 4);
  61. struct dccp_options_received *opt_recv = &dp->dccps_options_received;
  62. unsigned char opt, len;
  63. unsigned char *value;
  64. u32 elapsed_time;
  65. int rc;
  66. int mandatory = 0;
  67. memset(opt_recv, 0, sizeof(*opt_recv));
  68. opt = len = 0;
  69. while (opt_ptr != opt_end) {
  70. opt = *opt_ptr++;
  71. len = 0;
  72. value = NULL;
  73. /* Check if this isn't a single byte option */
  74. if (opt > DCCPO_MAX_RESERVED) {
  75. if (opt_ptr == opt_end)
  76. goto out_invalid_option;
  77. len = *opt_ptr++;
  78. if (len < 3)
  79. goto out_invalid_option;
  80. /*
  81. * Remove the type and len fields, leaving
  82. * just the value size
  83. */
  84. len -= 2;
  85. value = opt_ptr;
  86. opt_ptr += len;
  87. if (opt_ptr > opt_end)
  88. goto out_invalid_option;
  89. }
  90. switch (opt) {
  91. case DCCPO_PADDING:
  92. break;
  93. case DCCPO_MANDATORY:
  94. if (mandatory)
  95. goto out_invalid_option;
  96. if (pkt_type != DCCP_PKT_DATA)
  97. mandatory = 1;
  98. break;
  99. case DCCPO_NDP_COUNT:
  100. if (len > 3)
  101. goto out_invalid_option;
  102. opt_recv->dccpor_ndp = dccp_decode_value_var(value, len);
  103. dccp_pr_debug("%s rx opt: NDP count=%d\n", dccp_role(sk),
  104. opt_recv->dccpor_ndp);
  105. break;
  106. case DCCPO_CHANGE_L:
  107. /* fall through */
  108. case DCCPO_CHANGE_R:
  109. if (len < 2)
  110. goto out_invalid_option;
  111. rc = dccp_feat_change_recv(sk, opt, *value, value + 1,
  112. len - 1);
  113. /*
  114. * When there is a change error, change_recv is
  115. * responsible for dealing with it. i.e. reply with an
  116. * empty confirm.
  117. * If the change was mandatory, then we need to die.
  118. */
  119. if (rc && mandatory)
  120. goto out_invalid_option;
  121. break;
  122. case DCCPO_CONFIRM_L:
  123. /* fall through */
  124. case DCCPO_CONFIRM_R:
  125. if (len < 2)
  126. goto out_invalid_option;
  127. if (dccp_feat_confirm_recv(sk, opt, *value,
  128. value + 1, len - 1))
  129. goto out_invalid_option;
  130. break;
  131. case DCCPO_ACK_VECTOR_0:
  132. case DCCPO_ACK_VECTOR_1:
  133. if (pkt_type == DCCP_PKT_DATA)
  134. break;
  135. if (dccp_msk(sk)->dccpms_send_ack_vector &&
  136. dccp_ackvec_parse(sk, skb, &ackno, opt, value, len))
  137. goto out_invalid_option;
  138. break;
  139. case DCCPO_TIMESTAMP:
  140. if (len != 4)
  141. goto out_invalid_option;
  142. opt_recv->dccpor_timestamp = ntohl(*(__be32 *)value);
  143. dp->dccps_timestamp_echo = opt_recv->dccpor_timestamp;
  144. dccp_timestamp(sk, &dp->dccps_timestamp_time);
  145. dccp_pr_debug("%s rx opt: TIMESTAMP=%u, ackno=%llu\n",
  146. dccp_role(sk), opt_recv->dccpor_timestamp,
  147. (unsigned long long)
  148. DCCP_SKB_CB(skb)->dccpd_ack_seq);
  149. break;
  150. case DCCPO_TIMESTAMP_ECHO:
  151. if (len != 4 && len != 6 && len != 8)
  152. goto out_invalid_option;
  153. opt_recv->dccpor_timestamp_echo = ntohl(*(__be32 *)value);
  154. dccp_pr_debug("%s rx opt: TIMESTAMP_ECHO=%u, len=%d, "
  155. "ackno=%llu, ", dccp_role(sk),
  156. opt_recv->dccpor_timestamp_echo,
  157. len + 2,
  158. (unsigned long long)
  159. DCCP_SKB_CB(skb)->dccpd_ack_seq);
  160. if (len == 4)
  161. break;
  162. if (len == 6)
  163. elapsed_time = ntohs(*(__be16 *)(value + 4));
  164. else
  165. elapsed_time = ntohl(*(__be32 *)(value + 4));
  166. /* Give precedence to the biggest ELAPSED_TIME */
  167. if (elapsed_time > opt_recv->dccpor_elapsed_time)
  168. opt_recv->dccpor_elapsed_time = elapsed_time;
  169. break;
  170. case DCCPO_ELAPSED_TIME:
  171. if (len != 2 && len != 4)
  172. goto out_invalid_option;
  173. if (pkt_type == DCCP_PKT_DATA)
  174. continue;
  175. if (len == 2)
  176. elapsed_time = ntohs(*(__be16 *)value);
  177. else
  178. elapsed_time = ntohl(*(__be32 *)value);
  179. if (elapsed_time > opt_recv->dccpor_elapsed_time)
  180. opt_recv->dccpor_elapsed_time = elapsed_time;
  181. dccp_pr_debug("%s rx opt: ELAPSED_TIME=%d\n",
  182. dccp_role(sk), elapsed_time);
  183. break;
  184. /*
  185. * From RFC 4340, sec. 10.3:
  186. *
  187. * Option numbers 128 through 191 are for
  188. * options sent from the HC-Sender to the
  189. * HC-Receiver; option numbers 192 through 255
  190. * are for options sent from the HC-Receiver to
  191. * the HC-Sender.
  192. */
  193. case 128 ... 191: {
  194. const u16 idx = value - options;
  195. if (ccid_hc_rx_parse_options(dp->dccps_hc_rx_ccid, sk,
  196. opt, len, idx,
  197. value) != 0)
  198. goto out_invalid_option;
  199. }
  200. break;
  201. case 192 ... 255: {
  202. const u16 idx = value - options;
  203. if (ccid_hc_tx_parse_options(dp->dccps_hc_tx_ccid, sk,
  204. opt, len, idx,
  205. value) != 0)
  206. goto out_invalid_option;
  207. }
  208. break;
  209. default:
  210. DCCP_CRIT("DCCP(%p): option %d(len=%d) not "
  211. "implemented, ignoring", sk, opt, len);
  212. break;
  213. }
  214. if (opt != DCCPO_MANDATORY)
  215. mandatory = 0;
  216. }
  217. /* mandatory was the last byte in option list -> reset connection */
  218. if (mandatory)
  219. goto out_invalid_option;
  220. return 0;
  221. out_invalid_option:
  222. DCCP_INC_STATS_BH(DCCP_MIB_INVALIDOPT);
  223. DCCP_SKB_CB(skb)->dccpd_reset_code = DCCP_RESET_CODE_OPTION_ERROR;
  224. DCCP_WARN("DCCP(%p): invalid option %d, len=%d", sk, opt, len);
  225. return -1;
  226. }
  227. EXPORT_SYMBOL_GPL(dccp_parse_options);
  228. static void dccp_encode_value_var(const u32 value, unsigned char *to,
  229. const unsigned int len)
  230. {
  231. if (len > 3)
  232. *to++ = (value & 0xFF000000) >> 24;
  233. if (len > 2)
  234. *to++ = (value & 0xFF0000) >> 16;
  235. if (len > 1)
  236. *to++ = (value & 0xFF00) >> 8;
  237. if (len > 0)
  238. *to++ = (value & 0xFF);
  239. }
  240. static inline int dccp_ndp_len(const int ndp)
  241. {
  242. return likely(ndp <= 0xFF) ? 1 : ndp <= 0xFFFF ? 2 : 3;
  243. }
  244. int dccp_insert_option(struct sock *sk, struct sk_buff *skb,
  245. const unsigned char option,
  246. const void *value, const unsigned char len)
  247. {
  248. unsigned char *to;
  249. if (DCCP_SKB_CB(skb)->dccpd_opt_len + len + 2 > DCCP_MAX_OPT_LEN)
  250. return -1;
  251. DCCP_SKB_CB(skb)->dccpd_opt_len += len + 2;
  252. to = skb_push(skb, len + 2);
  253. *to++ = option;
  254. *to++ = len + 2;
  255. memcpy(to, value, len);
  256. return 0;
  257. }
  258. EXPORT_SYMBOL_GPL(dccp_insert_option);
  259. static int dccp_insert_option_ndp(struct sock *sk, struct sk_buff *skb)
  260. {
  261. struct dccp_sock *dp = dccp_sk(sk);
  262. int ndp = dp->dccps_ndp_count;
  263. if (dccp_non_data_packet(skb))
  264. ++dp->dccps_ndp_count;
  265. else
  266. dp->dccps_ndp_count = 0;
  267. if (ndp > 0) {
  268. unsigned char *ptr;
  269. const int ndp_len = dccp_ndp_len(ndp);
  270. const int len = ndp_len + 2;
  271. if (DCCP_SKB_CB(skb)->dccpd_opt_len + len > DCCP_MAX_OPT_LEN)
  272. return -1;
  273. DCCP_SKB_CB(skb)->dccpd_opt_len += len;
  274. ptr = skb_push(skb, len);
  275. *ptr++ = DCCPO_NDP_COUNT;
  276. *ptr++ = len;
  277. dccp_encode_value_var(ndp, ptr, ndp_len);
  278. }
  279. return 0;
  280. }
  281. static inline int dccp_elapsed_time_len(const u32 elapsed_time)
  282. {
  283. return elapsed_time == 0 ? 0 : elapsed_time <= 0xFFFF ? 2 : 4;
  284. }
  285. int dccp_insert_option_elapsed_time(struct sock *sk, struct sk_buff *skb,
  286. u32 elapsed_time)
  287. {
  288. const int elapsed_time_len = dccp_elapsed_time_len(elapsed_time);
  289. const int len = 2 + elapsed_time_len;
  290. unsigned char *to;
  291. if (elapsed_time_len == 0)
  292. return 0;
  293. if (DCCP_SKB_CB(skb)->dccpd_opt_len + len > DCCP_MAX_OPT_LEN)
  294. return -1;
  295. DCCP_SKB_CB(skb)->dccpd_opt_len += len;
  296. to = skb_push(skb, len);
  297. *to++ = DCCPO_ELAPSED_TIME;
  298. *to++ = len;
  299. if (elapsed_time_len == 2) {
  300. const __be16 var16 = htons((u16)elapsed_time);
  301. memcpy(to, &var16, 2);
  302. } else {
  303. const __be32 var32 = htonl(elapsed_time);
  304. memcpy(to, &var32, 4);
  305. }
  306. return 0;
  307. }
  308. EXPORT_SYMBOL_GPL(dccp_insert_option_elapsed_time);
  309. void dccp_timestamp(const struct sock *sk, struct timeval *tv)
  310. {
  311. const struct dccp_sock *dp = dccp_sk(sk);
  312. do_gettimeofday(tv);
  313. tv->tv_sec -= dp->dccps_epoch.tv_sec;
  314. tv->tv_usec -= dp->dccps_epoch.tv_usec;
  315. while (tv->tv_usec < 0) {
  316. tv->tv_sec--;
  317. tv->tv_usec += USEC_PER_SEC;
  318. }
  319. }
  320. EXPORT_SYMBOL_GPL(dccp_timestamp);
  321. int dccp_insert_option_timestamp(struct sock *sk, struct sk_buff *skb)
  322. {
  323. struct timeval tv;
  324. __be32 now;
  325. dccp_timestamp(sk, &tv);
  326. now = htonl(timeval_usecs(&tv) / 10);
  327. /* yes this will overflow but that is the point as we want a
  328. * 10 usec 32 bit timer which mean it wraps every 11.9 hours */
  329. return dccp_insert_option(sk, skb, DCCPO_TIMESTAMP, &now, sizeof(now));
  330. }
  331. EXPORT_SYMBOL_GPL(dccp_insert_option_timestamp);
  332. static int dccp_insert_option_timestamp_echo(struct sock *sk,
  333. struct sk_buff *skb)
  334. {
  335. struct dccp_sock *dp = dccp_sk(sk);
  336. struct timeval now;
  337. __be32 tstamp_echo;
  338. u32 elapsed_time;
  339. int len, elapsed_time_len;
  340. unsigned char *to;
  341. dccp_timestamp(sk, &now);
  342. elapsed_time = timeval_delta(&now, &dp->dccps_timestamp_time) / 10;
  343. elapsed_time_len = dccp_elapsed_time_len(elapsed_time);
  344. len = 6 + elapsed_time_len;
  345. if (DCCP_SKB_CB(skb)->dccpd_opt_len + len > DCCP_MAX_OPT_LEN)
  346. return -1;
  347. DCCP_SKB_CB(skb)->dccpd_opt_len += len;
  348. to = skb_push(skb, len);
  349. *to++ = DCCPO_TIMESTAMP_ECHO;
  350. *to++ = len;
  351. tstamp_echo = htonl(dp->dccps_timestamp_echo);
  352. memcpy(to, &tstamp_echo, 4);
  353. to += 4;
  354. if (elapsed_time_len == 2) {
  355. const __be16 var16 = htons((u16)elapsed_time);
  356. memcpy(to, &var16, 2);
  357. } else if (elapsed_time_len == 4) {
  358. const __be32 var32 = htonl(elapsed_time);
  359. memcpy(to, &var32, 4);
  360. }
  361. dp->dccps_timestamp_echo = 0;
  362. dp->dccps_timestamp_time.tv_sec = 0;
  363. dp->dccps_timestamp_time.tv_usec = 0;
  364. return 0;
  365. }
  366. static int dccp_insert_feat_opt(struct sk_buff *skb, u8 type, u8 feat,
  367. u8 *val, u8 len)
  368. {
  369. u8 *to;
  370. if (DCCP_SKB_CB(skb)->dccpd_opt_len + len + 3 > DCCP_MAX_OPT_LEN) {
  371. DCCP_WARN("packet too small for feature %d option!\n", feat);
  372. return -1;
  373. }
  374. DCCP_SKB_CB(skb)->dccpd_opt_len += len + 3;
  375. to = skb_push(skb, len + 3);
  376. *to++ = type;
  377. *to++ = len + 3;
  378. *to++ = feat;
  379. if (len)
  380. memcpy(to, val, len);
  381. dccp_pr_debug("%s(%s (%d), ...), length %d\n",
  382. dccp_feat_typename(type),
  383. dccp_feat_name(feat), feat, len);
  384. return 0;
  385. }
  386. static int dccp_insert_options_feat(struct sock *sk, struct sk_buff *skb)
  387. {
  388. struct dccp_sock *dp = dccp_sk(sk);
  389. struct dccp_minisock *dmsk = dccp_msk(sk);
  390. struct dccp_opt_pend *opt, *next;
  391. int change = 0;
  392. /* confirm any options [NN opts] */
  393. list_for_each_entry_safe(opt, next, &dmsk->dccpms_conf, dccpop_node) {
  394. dccp_insert_feat_opt(skb, opt->dccpop_type,
  395. opt->dccpop_feat, opt->dccpop_val,
  396. opt->dccpop_len);
  397. /* fear empty confirms */
  398. if (opt->dccpop_val)
  399. kfree(opt->dccpop_val);
  400. kfree(opt);
  401. }
  402. INIT_LIST_HEAD(&dmsk->dccpms_conf);
  403. /* see which features we need to send */
  404. list_for_each_entry(opt, &dmsk->dccpms_pending, dccpop_node) {
  405. /* see if we need to send any confirm */
  406. if (opt->dccpop_sc) {
  407. dccp_insert_feat_opt(skb, opt->dccpop_type + 1,
  408. opt->dccpop_feat,
  409. opt->dccpop_sc->dccpoc_val,
  410. opt->dccpop_sc->dccpoc_len);
  411. BUG_ON(!opt->dccpop_sc->dccpoc_val);
  412. kfree(opt->dccpop_sc->dccpoc_val);
  413. kfree(opt->dccpop_sc);
  414. opt->dccpop_sc = NULL;
  415. }
  416. /* any option not confirmed, re-send it */
  417. if (!opt->dccpop_conf) {
  418. dccp_insert_feat_opt(skb, opt->dccpop_type,
  419. opt->dccpop_feat, opt->dccpop_val,
  420. opt->dccpop_len);
  421. change++;
  422. }
  423. }
  424. /* Retransmit timer.
  425. * If this is the master listening sock, we don't set a timer on it. It
  426. * should be fine because if the dude doesn't receive our RESPONSE
  427. * [which will contain the CHANGE] he will send another REQUEST which
  428. * will "retrnasmit" the change.
  429. */
  430. if (change && dp->dccps_role != DCCP_ROLE_LISTEN) {
  431. dccp_pr_debug("reset feat negotiation timer %p\n", sk);
  432. /* XXX don't reset the timer on re-transmissions. I.e. reset it
  433. * only when sending new stuff i guess. Currently the timer
  434. * never backs off because on re-transmission it just resets it!
  435. */
  436. inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
  437. inet_csk(sk)->icsk_rto, DCCP_RTO_MAX);
  438. }
  439. return 0;
  440. }
  441. int dccp_insert_options(struct sock *sk, struct sk_buff *skb)
  442. {
  443. struct dccp_sock *dp = dccp_sk(sk);
  444. struct dccp_minisock *dmsk = dccp_msk(sk);
  445. DCCP_SKB_CB(skb)->dccpd_opt_len = 0;
  446. if (dmsk->dccpms_send_ndp_count &&
  447. dccp_insert_option_ndp(sk, skb))
  448. return -1;
  449. if (!dccp_packet_without_ack(skb)) {
  450. if (dmsk->dccpms_send_ack_vector &&
  451. dccp_ackvec_pending(dp->dccps_hc_rx_ackvec) &&
  452. dccp_insert_option_ackvec(sk, skb))
  453. return -1;
  454. if (dp->dccps_timestamp_echo != 0 &&
  455. dccp_insert_option_timestamp_echo(sk, skb))
  456. return -1;
  457. }
  458. if (dp->dccps_hc_rx_insert_options) {
  459. if (ccid_hc_rx_insert_options(dp->dccps_hc_rx_ccid, sk, skb))
  460. return -1;
  461. dp->dccps_hc_rx_insert_options = 0;
  462. }
  463. /* Feature negotiation */
  464. /* Data packets can't do feat negotiation */
  465. if (DCCP_SKB_CB(skb)->dccpd_type != DCCP_PKT_DATA &&
  466. DCCP_SKB_CB(skb)->dccpd_type != DCCP_PKT_DATAACK &&
  467. dccp_insert_options_feat(sk, skb))
  468. return -1;
  469. /* XXX: insert other options when appropriate */
  470. if (DCCP_SKB_CB(skb)->dccpd_opt_len != 0) {
  471. /* The length of all options has to be a multiple of 4 */
  472. int padding = DCCP_SKB_CB(skb)->dccpd_opt_len % 4;
  473. if (padding != 0) {
  474. padding = 4 - padding;
  475. memset(skb_push(skb, padding), 0, padding);
  476. DCCP_SKB_CB(skb)->dccpd_opt_len += padding;
  477. }
  478. }
  479. return 0;
  480. }