input.c 33 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230
  1. /* SCTP kernel implementation
  2. * Copyright (c) 1999-2000 Cisco, Inc.
  3. * Copyright (c) 1999-2001 Motorola, Inc.
  4. * Copyright (c) 2001-2003 International Business Machines, Corp.
  5. * Copyright (c) 2001 Intel Corp.
  6. * Copyright (c) 2001 Nokia, Inc.
  7. * Copyright (c) 2001 La Monte H.P. Yarroll
  8. *
  9. * This file is part of the SCTP kernel implementation
  10. *
  11. * These functions handle all input from the IP layer into SCTP.
  12. *
  13. * This SCTP implementation is free software;
  14. * you can redistribute it and/or modify it under the terms of
  15. * the GNU General Public License as published by
  16. * the Free Software Foundation; either version 2, or (at your option)
  17. * any later version.
  18. *
  19. * This SCTP implementation is distributed in the hope that it
  20. * will be useful, but WITHOUT ANY WARRANTY; without even the implied
  21. * ************************
  22. * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  23. * See the GNU General Public License for more details.
  24. *
  25. * You should have received a copy of the GNU General Public License
  26. * along with GNU CC; see the file COPYING. If not, see
  27. * <http://www.gnu.org/licenses/>.
  28. *
  29. * Please send any bug reports or fixes you make to the
  30. * email address(es):
  31. * lksctp developers <linux-sctp@vger.kernel.org>
  32. *
  33. * Written or modified by:
  34. * La Monte H.P. Yarroll <piggy@acm.org>
  35. * Karl Knutson <karl@athena.chicago.il.us>
  36. * Xingang Guo <xingang.guo@intel.com>
  37. * Jon Grimm <jgrimm@us.ibm.com>
  38. * Hui Huang <hui.huang@nokia.com>
  39. * Daisy Chang <daisyc@us.ibm.com>
  40. * Sridhar Samudrala <sri@us.ibm.com>
  41. * Ardelle Fan <ardelle.fan@intel.com>
  42. */
  43. #include <linux/types.h>
  44. #include <linux/list.h> /* For struct list_head */
  45. #include <linux/socket.h>
  46. #include <linux/ip.h>
  47. #include <linux/time.h> /* For struct timeval */
  48. #include <linux/slab.h>
  49. #include <net/ip.h>
  50. #include <net/icmp.h>
  51. #include <net/snmp.h>
  52. #include <net/sock.h>
  53. #include <net/xfrm.h>
  54. #include <net/sctp/sctp.h>
  55. #include <net/sctp/sm.h>
  56. #include <net/sctp/checksum.h>
  57. #include <net/net_namespace.h>
  58. /* Forward declarations for internal helpers. */
  59. static int sctp_rcv_ootb(struct sk_buff *);
  60. static struct sctp_association *__sctp_rcv_lookup(struct net *net,
  61. struct sk_buff *skb,
  62. const union sctp_addr *paddr,
  63. const union sctp_addr *laddr,
  64. struct sctp_transport **transportp);
  65. static struct sctp_endpoint *__sctp_rcv_lookup_endpoint(struct net *net,
  66. const union sctp_addr *laddr);
  67. static struct sctp_association *__sctp_lookup_association(
  68. struct net *net,
  69. const union sctp_addr *local,
  70. const union sctp_addr *peer,
  71. struct sctp_transport **pt);
  72. static int sctp_add_backlog(struct sock *sk, struct sk_buff *skb);
  73. /* Calculate the SCTP checksum of an SCTP packet. */
  74. static inline int sctp_rcv_checksum(struct net *net, struct sk_buff *skb)
  75. {
  76. struct sctphdr *sh = sctp_hdr(skb);
  77. __le32 cmp = sh->checksum;
  78. __le32 val = sctp_compute_cksum(skb, 0);
  79. if (val != cmp) {
  80. /* CRC failure, dump it. */
  81. __SCTP_INC_STATS(net, SCTP_MIB_CHECKSUMERRORS);
  82. return -1;
  83. }
  84. return 0;
  85. }
  86. /*
  87. * This is the routine which IP calls when receiving an SCTP packet.
  88. */
  89. int sctp_rcv(struct sk_buff *skb)
  90. {
  91. struct sock *sk;
  92. struct sctp_association *asoc;
  93. struct sctp_endpoint *ep = NULL;
  94. struct sctp_ep_common *rcvr;
  95. struct sctp_transport *transport = NULL;
  96. struct sctp_chunk *chunk;
  97. union sctp_addr src;
  98. union sctp_addr dest;
  99. int family;
  100. struct sctp_af *af;
  101. struct net *net = dev_net(skb->dev);
  102. if (skb->pkt_type != PACKET_HOST)
  103. goto discard_it;
  104. __SCTP_INC_STATS(net, SCTP_MIB_INSCTPPACKS);
  105. /* If packet is too small to contain a single chunk, let's not
  106. * waste time on it anymore.
  107. */
  108. if (skb->len < sizeof(struct sctphdr) + sizeof(struct sctp_chunkhdr) +
  109. skb_transport_offset(skb))
  110. goto discard_it;
  111. /* If the packet is fragmented and we need to do crc checking,
  112. * it's better to just linearize it otherwise crc computing
  113. * takes longer.
  114. */
  115. if ((!(skb_shinfo(skb)->gso_type & SKB_GSO_SCTP) &&
  116. skb_linearize(skb)) ||
  117. !pskb_may_pull(skb, sizeof(struct sctphdr)))
  118. goto discard_it;
  119. /* Pull up the IP header. */
  120. __skb_pull(skb, skb_transport_offset(skb));
  121. skb->csum_valid = 0; /* Previous value not applicable */
  122. if (skb_csum_unnecessary(skb))
  123. __skb_decr_checksum_unnecessary(skb);
  124. else if (!sctp_checksum_disable &&
  125. !(skb_shinfo(skb)->gso_type & SKB_GSO_SCTP) &&
  126. sctp_rcv_checksum(net, skb) < 0)
  127. goto discard_it;
  128. skb->csum_valid = 1;
  129. __skb_pull(skb, sizeof(struct sctphdr));
  130. family = ipver2af(ip_hdr(skb)->version);
  131. af = sctp_get_af_specific(family);
  132. if (unlikely(!af))
  133. goto discard_it;
  134. SCTP_INPUT_CB(skb)->af = af;
  135. /* Initialize local addresses for lookups. */
  136. af->from_skb(&src, skb, 1);
  137. af->from_skb(&dest, skb, 0);
  138. /* If the packet is to or from a non-unicast address,
  139. * silently discard the packet.
  140. *
  141. * This is not clearly defined in the RFC except in section
  142. * 8.4 - OOTB handling. However, based on the book "Stream Control
  143. * Transmission Protocol" 2.1, "It is important to note that the
  144. * IP address of an SCTP transport address must be a routable
  145. * unicast address. In other words, IP multicast addresses and
  146. * IP broadcast addresses cannot be used in an SCTP transport
  147. * address."
  148. */
  149. if (!af->addr_valid(&src, NULL, skb) ||
  150. !af->addr_valid(&dest, NULL, skb))
  151. goto discard_it;
  152. asoc = __sctp_rcv_lookup(net, skb, &src, &dest, &transport);
  153. if (!asoc)
  154. ep = __sctp_rcv_lookup_endpoint(net, &dest);
  155. /* Retrieve the common input handling substructure. */
  156. rcvr = asoc ? &asoc->base : &ep->base;
  157. sk = rcvr->sk;
  158. /*
  159. * If a frame arrives on an interface and the receiving socket is
  160. * bound to another interface, via SO_BINDTODEVICE, treat it as OOTB
  161. */
  162. if (sk->sk_bound_dev_if && (sk->sk_bound_dev_if != af->skb_iif(skb))) {
  163. if (transport) {
  164. sctp_transport_put(transport);
  165. asoc = NULL;
  166. transport = NULL;
  167. } else {
  168. sctp_endpoint_put(ep);
  169. ep = NULL;
  170. }
  171. sk = net->sctp.ctl_sock;
  172. ep = sctp_sk(sk)->ep;
  173. sctp_endpoint_hold(ep);
  174. rcvr = &ep->base;
  175. }
  176. /*
  177. * RFC 2960, 8.4 - Handle "Out of the blue" Packets.
  178. * An SCTP packet is called an "out of the blue" (OOTB)
  179. * packet if it is correctly formed, i.e., passed the
  180. * receiver's checksum check, but the receiver is not
  181. * able to identify the association to which this
  182. * packet belongs.
  183. */
  184. if (!asoc) {
  185. if (sctp_rcv_ootb(skb)) {
  186. __SCTP_INC_STATS(net, SCTP_MIB_OUTOFBLUES);
  187. goto discard_release;
  188. }
  189. }
  190. if (!xfrm_policy_check(sk, XFRM_POLICY_IN, skb, family))
  191. goto discard_release;
  192. nf_reset(skb);
  193. if (sk_filter(sk, skb))
  194. goto discard_release;
  195. /* Create an SCTP packet structure. */
  196. chunk = sctp_chunkify(skb, asoc, sk, GFP_ATOMIC);
  197. if (!chunk)
  198. goto discard_release;
  199. SCTP_INPUT_CB(skb)->chunk = chunk;
  200. /* Remember what endpoint is to handle this packet. */
  201. chunk->rcvr = rcvr;
  202. /* Remember the SCTP header. */
  203. chunk->sctp_hdr = sctp_hdr(skb);
  204. /* Set the source and destination addresses of the incoming chunk. */
  205. sctp_init_addrs(chunk, &src, &dest);
  206. /* Remember where we came from. */
  207. chunk->transport = transport;
  208. /* Acquire access to the sock lock. Note: We are safe from other
  209. * bottom halves on this lock, but a user may be in the lock too,
  210. * so check if it is busy.
  211. */
  212. bh_lock_sock(sk);
  213. if (sk != rcvr->sk) {
  214. /* Our cached sk is different from the rcvr->sk. This is
  215. * because migrate()/accept() may have moved the association
  216. * to a new socket and released all the sockets. So now we
  217. * are holding a lock on the old socket while the user may
  218. * be doing something with the new socket. Switch our veiw
  219. * of the current sk.
  220. */
  221. bh_unlock_sock(sk);
  222. sk = rcvr->sk;
  223. bh_lock_sock(sk);
  224. }
  225. if (sock_owned_by_user(sk)) {
  226. if (sctp_add_backlog(sk, skb)) {
  227. bh_unlock_sock(sk);
  228. sctp_chunk_free(chunk);
  229. skb = NULL; /* sctp_chunk_free already freed the skb */
  230. goto discard_release;
  231. }
  232. __SCTP_INC_STATS(net, SCTP_MIB_IN_PKT_BACKLOG);
  233. } else {
  234. __SCTP_INC_STATS(net, SCTP_MIB_IN_PKT_SOFTIRQ);
  235. sctp_inq_push(&chunk->rcvr->inqueue, chunk);
  236. }
  237. bh_unlock_sock(sk);
  238. /* Release the asoc/ep ref we took in the lookup calls. */
  239. if (transport)
  240. sctp_transport_put(transport);
  241. else
  242. sctp_endpoint_put(ep);
  243. return 0;
  244. discard_it:
  245. __SCTP_INC_STATS(net, SCTP_MIB_IN_PKT_DISCARDS);
  246. kfree_skb(skb);
  247. return 0;
  248. discard_release:
  249. /* Release the asoc/ep ref we took in the lookup calls. */
  250. if (transport)
  251. sctp_transport_put(transport);
  252. else
  253. sctp_endpoint_put(ep);
  254. goto discard_it;
  255. }
  256. /* Process the backlog queue of the socket. Every skb on
  257. * the backlog holds a ref on an association or endpoint.
  258. * We hold this ref throughout the state machine to make
  259. * sure that the structure we need is still around.
  260. */
  261. int sctp_backlog_rcv(struct sock *sk, struct sk_buff *skb)
  262. {
  263. struct sctp_chunk *chunk = SCTP_INPUT_CB(skb)->chunk;
  264. struct sctp_inq *inqueue = &chunk->rcvr->inqueue;
  265. struct sctp_transport *t = chunk->transport;
  266. struct sctp_ep_common *rcvr = NULL;
  267. int backloged = 0;
  268. rcvr = chunk->rcvr;
  269. /* If the rcvr is dead then the association or endpoint
  270. * has been deleted and we can safely drop the chunk
  271. * and refs that we are holding.
  272. */
  273. if (rcvr->dead) {
  274. sctp_chunk_free(chunk);
  275. goto done;
  276. }
  277. if (unlikely(rcvr->sk != sk)) {
  278. /* In this case, the association moved from one socket to
  279. * another. We are currently sitting on the backlog of the
  280. * old socket, so we need to move.
  281. * However, since we are here in the process context we
  282. * need to take make sure that the user doesn't own
  283. * the new socket when we process the packet.
  284. * If the new socket is user-owned, queue the chunk to the
  285. * backlog of the new socket without dropping any refs.
  286. * Otherwise, we can safely push the chunk on the inqueue.
  287. */
  288. sk = rcvr->sk;
  289. local_bh_disable();
  290. bh_lock_sock(sk);
  291. if (sock_owned_by_user(sk)) {
  292. if (sk_add_backlog(sk, skb, sk->sk_rcvbuf))
  293. sctp_chunk_free(chunk);
  294. else
  295. backloged = 1;
  296. } else
  297. sctp_inq_push(inqueue, chunk);
  298. bh_unlock_sock(sk);
  299. local_bh_enable();
  300. /* If the chunk was backloged again, don't drop refs */
  301. if (backloged)
  302. return 0;
  303. } else {
  304. sctp_inq_push(inqueue, chunk);
  305. }
  306. done:
  307. /* Release the refs we took in sctp_add_backlog */
  308. if (SCTP_EP_TYPE_ASSOCIATION == rcvr->type)
  309. sctp_transport_put(t);
  310. else if (SCTP_EP_TYPE_SOCKET == rcvr->type)
  311. sctp_endpoint_put(sctp_ep(rcvr));
  312. else
  313. BUG();
  314. return 0;
  315. }
  316. static int sctp_add_backlog(struct sock *sk, struct sk_buff *skb)
  317. {
  318. struct sctp_chunk *chunk = SCTP_INPUT_CB(skb)->chunk;
  319. struct sctp_transport *t = chunk->transport;
  320. struct sctp_ep_common *rcvr = chunk->rcvr;
  321. int ret;
  322. ret = sk_add_backlog(sk, skb, sk->sk_rcvbuf);
  323. if (!ret) {
  324. /* Hold the assoc/ep while hanging on the backlog queue.
  325. * This way, we know structures we need will not disappear
  326. * from us
  327. */
  328. if (SCTP_EP_TYPE_ASSOCIATION == rcvr->type)
  329. sctp_transport_hold(t);
  330. else if (SCTP_EP_TYPE_SOCKET == rcvr->type)
  331. sctp_endpoint_hold(sctp_ep(rcvr));
  332. else
  333. BUG();
  334. }
  335. return ret;
  336. }
  337. /* Handle icmp frag needed error. */
  338. void sctp_icmp_frag_needed(struct sock *sk, struct sctp_association *asoc,
  339. struct sctp_transport *t, __u32 pmtu)
  340. {
  341. if (!t || (t->pathmtu <= pmtu))
  342. return;
  343. if (sock_owned_by_user(sk)) {
  344. asoc->pmtu_pending = 1;
  345. t->pmtu_pending = 1;
  346. return;
  347. }
  348. if (t->param_flags & SPP_PMTUD_ENABLE) {
  349. /* Update transports view of the MTU */
  350. sctp_transport_update_pmtu(sk, t, pmtu);
  351. /* Update association pmtu. */
  352. sctp_assoc_sync_pmtu(sk, asoc);
  353. }
  354. /* Retransmit with the new pmtu setting.
  355. * Normally, if PMTU discovery is disabled, an ICMP Fragmentation
  356. * Needed will never be sent, but if a message was sent before
  357. * PMTU discovery was disabled that was larger than the PMTU, it
  358. * would not be fragmented, so it must be re-transmitted fragmented.
  359. */
  360. sctp_retransmit(&asoc->outqueue, t, SCTP_RTXR_PMTUD);
  361. }
  362. void sctp_icmp_redirect(struct sock *sk, struct sctp_transport *t,
  363. struct sk_buff *skb)
  364. {
  365. struct dst_entry *dst;
  366. if (!t)
  367. return;
  368. dst = sctp_transport_dst_check(t);
  369. if (dst)
  370. dst->ops->redirect(dst, sk, skb);
  371. }
  372. /*
  373. * SCTP Implementer's Guide, 2.37 ICMP handling procedures
  374. *
  375. * ICMP8) If the ICMP code is a "Unrecognized next header type encountered"
  376. * or a "Protocol Unreachable" treat this message as an abort
  377. * with the T bit set.
  378. *
  379. * This function sends an event to the state machine, which will abort the
  380. * association.
  381. *
  382. */
  383. void sctp_icmp_proto_unreachable(struct sock *sk,
  384. struct sctp_association *asoc,
  385. struct sctp_transport *t)
  386. {
  387. if (sock_owned_by_user(sk)) {
  388. if (timer_pending(&t->proto_unreach_timer))
  389. return;
  390. else {
  391. if (!mod_timer(&t->proto_unreach_timer,
  392. jiffies + (HZ/20)))
  393. sctp_association_hold(asoc);
  394. }
  395. } else {
  396. struct net *net = sock_net(sk);
  397. pr_debug("%s: unrecognized next header type "
  398. "encountered!\n", __func__);
  399. if (del_timer(&t->proto_unreach_timer))
  400. sctp_association_put(asoc);
  401. sctp_do_sm(net, SCTP_EVENT_T_OTHER,
  402. SCTP_ST_OTHER(SCTP_EVENT_ICMP_PROTO_UNREACH),
  403. asoc->state, asoc->ep, asoc, t,
  404. GFP_ATOMIC);
  405. }
  406. }
  407. /* Common lookup code for icmp/icmpv6 error handler. */
  408. struct sock *sctp_err_lookup(struct net *net, int family, struct sk_buff *skb,
  409. struct sctphdr *sctphdr,
  410. struct sctp_association **app,
  411. struct sctp_transport **tpp)
  412. {
  413. struct sctp_init_chunk *chunkhdr, _chunkhdr;
  414. union sctp_addr saddr;
  415. union sctp_addr daddr;
  416. struct sctp_af *af;
  417. struct sock *sk = NULL;
  418. struct sctp_association *asoc;
  419. struct sctp_transport *transport = NULL;
  420. __u32 vtag = ntohl(sctphdr->vtag);
  421. *app = NULL; *tpp = NULL;
  422. af = sctp_get_af_specific(family);
  423. if (unlikely(!af)) {
  424. return NULL;
  425. }
  426. /* Initialize local addresses for lookups. */
  427. af->from_skb(&saddr, skb, 1);
  428. af->from_skb(&daddr, skb, 0);
  429. /* Look for an association that matches the incoming ICMP error
  430. * packet.
  431. */
  432. asoc = __sctp_lookup_association(net, &saddr, &daddr, &transport);
  433. if (!asoc)
  434. return NULL;
  435. sk = asoc->base.sk;
  436. /* RFC 4960, Appendix C. ICMP Handling
  437. *
  438. * ICMP6) An implementation MUST validate that the Verification Tag
  439. * contained in the ICMP message matches the Verification Tag of
  440. * the peer. If the Verification Tag is not 0 and does NOT
  441. * match, discard the ICMP message. If it is 0 and the ICMP
  442. * message contains enough bytes to verify that the chunk type is
  443. * an INIT chunk and that the Initiate Tag matches the tag of the
  444. * peer, continue with ICMP7. If the ICMP message is too short
  445. * or the chunk type or the Initiate Tag does not match, silently
  446. * discard the packet.
  447. */
  448. if (vtag == 0) {
  449. /* chunk header + first 4 octects of init header */
  450. chunkhdr = skb_header_pointer(skb, skb_transport_offset(skb) +
  451. sizeof(struct sctphdr),
  452. sizeof(struct sctp_chunkhdr) +
  453. sizeof(__be32), &_chunkhdr);
  454. if (!chunkhdr ||
  455. chunkhdr->chunk_hdr.type != SCTP_CID_INIT ||
  456. ntohl(chunkhdr->init_hdr.init_tag) != asoc->c.my_vtag)
  457. goto out;
  458. } else if (vtag != asoc->c.peer_vtag) {
  459. goto out;
  460. }
  461. bh_lock_sock(sk);
  462. /* If too many ICMPs get dropped on busy
  463. * servers this needs to be solved differently.
  464. */
  465. if (sock_owned_by_user(sk))
  466. __NET_INC_STATS(net, LINUX_MIB_LOCKDROPPEDICMPS);
  467. *app = asoc;
  468. *tpp = transport;
  469. return sk;
  470. out:
  471. sctp_transport_put(transport);
  472. return NULL;
  473. }
  474. /* Common cleanup code for icmp/icmpv6 error handler. */
  475. void sctp_err_finish(struct sock *sk, struct sctp_transport *t)
  476. {
  477. bh_unlock_sock(sk);
  478. sctp_transport_put(t);
  479. }
  480. /*
  481. * This routine is called by the ICMP module when it gets some
  482. * sort of error condition. If err < 0 then the socket should
  483. * be closed and the error returned to the user. If err > 0
  484. * it's just the icmp type << 8 | icmp code. After adjustment
  485. * header points to the first 8 bytes of the sctp header. We need
  486. * to find the appropriate port.
  487. *
  488. * The locking strategy used here is very "optimistic". When
  489. * someone else accesses the socket the ICMP is just dropped
  490. * and for some paths there is no check at all.
  491. * A more general error queue to queue errors for later handling
  492. * is probably better.
  493. *
  494. */
  495. void sctp_v4_err(struct sk_buff *skb, __u32 info)
  496. {
  497. const struct iphdr *iph = (const struct iphdr *)skb->data;
  498. const int ihlen = iph->ihl * 4;
  499. const int type = icmp_hdr(skb)->type;
  500. const int code = icmp_hdr(skb)->code;
  501. struct sock *sk;
  502. struct sctp_association *asoc = NULL;
  503. struct sctp_transport *transport;
  504. struct inet_sock *inet;
  505. __u16 saveip, savesctp;
  506. int err;
  507. struct net *net = dev_net(skb->dev);
  508. /* Fix up skb to look at the embedded net header. */
  509. saveip = skb->network_header;
  510. savesctp = skb->transport_header;
  511. skb_reset_network_header(skb);
  512. skb_set_transport_header(skb, ihlen);
  513. sk = sctp_err_lookup(net, AF_INET, skb, sctp_hdr(skb), &asoc, &transport);
  514. /* Put back, the original values. */
  515. skb->network_header = saveip;
  516. skb->transport_header = savesctp;
  517. if (!sk) {
  518. __ICMP_INC_STATS(net, ICMP_MIB_INERRORS);
  519. return;
  520. }
  521. /* Warning: The sock lock is held. Remember to call
  522. * sctp_err_finish!
  523. */
  524. switch (type) {
  525. case ICMP_PARAMETERPROB:
  526. err = EPROTO;
  527. break;
  528. case ICMP_DEST_UNREACH:
  529. if (code > NR_ICMP_UNREACH)
  530. goto out_unlock;
  531. /* PMTU discovery (RFC1191) */
  532. if (ICMP_FRAG_NEEDED == code) {
  533. sctp_icmp_frag_needed(sk, asoc, transport,
  534. SCTP_TRUNC4(info));
  535. goto out_unlock;
  536. } else {
  537. if (ICMP_PROT_UNREACH == code) {
  538. sctp_icmp_proto_unreachable(sk, asoc,
  539. transport);
  540. goto out_unlock;
  541. }
  542. }
  543. err = icmp_err_convert[code].errno;
  544. break;
  545. case ICMP_TIME_EXCEEDED:
  546. /* Ignore any time exceeded errors due to fragment reassembly
  547. * timeouts.
  548. */
  549. if (ICMP_EXC_FRAGTIME == code)
  550. goto out_unlock;
  551. err = EHOSTUNREACH;
  552. break;
  553. case ICMP_REDIRECT:
  554. sctp_icmp_redirect(sk, transport, skb);
  555. /* Fall through to out_unlock. */
  556. default:
  557. goto out_unlock;
  558. }
  559. inet = inet_sk(sk);
  560. if (!sock_owned_by_user(sk) && inet->recverr) {
  561. sk->sk_err = err;
  562. sk->sk_error_report(sk);
  563. } else { /* Only an error on timeout */
  564. sk->sk_err_soft = err;
  565. }
  566. out_unlock:
  567. sctp_err_finish(sk, transport);
  568. }
  569. /*
  570. * RFC 2960, 8.4 - Handle "Out of the blue" Packets.
  571. *
  572. * This function scans all the chunks in the OOTB packet to determine if
  573. * the packet should be discarded right away. If a response might be needed
  574. * for this packet, or, if further processing is possible, the packet will
  575. * be queued to a proper inqueue for the next phase of handling.
  576. *
  577. * Output:
  578. * Return 0 - If further processing is needed.
  579. * Return 1 - If the packet can be discarded right away.
  580. */
  581. static int sctp_rcv_ootb(struct sk_buff *skb)
  582. {
  583. sctp_chunkhdr_t *ch, _ch;
  584. int ch_end, offset = 0;
  585. /* Scan through all the chunks in the packet. */
  586. do {
  587. /* Make sure we have at least the header there */
  588. if (offset + sizeof(sctp_chunkhdr_t) > skb->len)
  589. break;
  590. ch = skb_header_pointer(skb, offset, sizeof(*ch), &_ch);
  591. /* Break out if chunk length is less then minimal. */
  592. if (ntohs(ch->length) < sizeof(sctp_chunkhdr_t))
  593. break;
  594. ch_end = offset + SCTP_PAD4(ntohs(ch->length));
  595. if (ch_end > skb->len)
  596. break;
  597. /* RFC 8.4, 2) If the OOTB packet contains an ABORT chunk, the
  598. * receiver MUST silently discard the OOTB packet and take no
  599. * further action.
  600. */
  601. if (SCTP_CID_ABORT == ch->type)
  602. goto discard;
  603. /* RFC 8.4, 6) If the packet contains a SHUTDOWN COMPLETE
  604. * chunk, the receiver should silently discard the packet
  605. * and take no further action.
  606. */
  607. if (SCTP_CID_SHUTDOWN_COMPLETE == ch->type)
  608. goto discard;
  609. /* RFC 4460, 2.11.2
  610. * This will discard packets with INIT chunk bundled as
  611. * subsequent chunks in the packet. When INIT is first,
  612. * the normal INIT processing will discard the chunk.
  613. */
  614. if (SCTP_CID_INIT == ch->type && (void *)ch != skb->data)
  615. goto discard;
  616. offset = ch_end;
  617. } while (ch_end < skb->len);
  618. return 0;
  619. discard:
  620. return 1;
  621. }
  622. /* Insert endpoint into the hash table. */
  623. static void __sctp_hash_endpoint(struct sctp_endpoint *ep)
  624. {
  625. struct net *net = sock_net(ep->base.sk);
  626. struct sctp_ep_common *epb;
  627. struct sctp_hashbucket *head;
  628. epb = &ep->base;
  629. epb->hashent = sctp_ep_hashfn(net, epb->bind_addr.port);
  630. head = &sctp_ep_hashtable[epb->hashent];
  631. write_lock(&head->lock);
  632. hlist_add_head(&epb->node, &head->chain);
  633. write_unlock(&head->lock);
  634. }
  635. /* Add an endpoint to the hash. Local BH-safe. */
  636. void sctp_hash_endpoint(struct sctp_endpoint *ep)
  637. {
  638. local_bh_disable();
  639. __sctp_hash_endpoint(ep);
  640. local_bh_enable();
  641. }
  642. /* Remove endpoint from the hash table. */
  643. static void __sctp_unhash_endpoint(struct sctp_endpoint *ep)
  644. {
  645. struct net *net = sock_net(ep->base.sk);
  646. struct sctp_hashbucket *head;
  647. struct sctp_ep_common *epb;
  648. epb = &ep->base;
  649. epb->hashent = sctp_ep_hashfn(net, epb->bind_addr.port);
  650. head = &sctp_ep_hashtable[epb->hashent];
  651. write_lock(&head->lock);
  652. hlist_del_init(&epb->node);
  653. write_unlock(&head->lock);
  654. }
  655. /* Remove endpoint from the hash. Local BH-safe. */
  656. void sctp_unhash_endpoint(struct sctp_endpoint *ep)
  657. {
  658. local_bh_disable();
  659. __sctp_unhash_endpoint(ep);
  660. local_bh_enable();
  661. }
  662. /* Look up an endpoint. */
  663. static struct sctp_endpoint *__sctp_rcv_lookup_endpoint(struct net *net,
  664. const union sctp_addr *laddr)
  665. {
  666. struct sctp_hashbucket *head;
  667. struct sctp_ep_common *epb;
  668. struct sctp_endpoint *ep;
  669. int hash;
  670. hash = sctp_ep_hashfn(net, ntohs(laddr->v4.sin_port));
  671. head = &sctp_ep_hashtable[hash];
  672. read_lock(&head->lock);
  673. sctp_for_each_hentry(epb, &head->chain) {
  674. ep = sctp_ep(epb);
  675. if (sctp_endpoint_is_match(ep, net, laddr))
  676. goto hit;
  677. }
  678. ep = sctp_sk(net->sctp.ctl_sock)->ep;
  679. hit:
  680. sctp_endpoint_hold(ep);
  681. read_unlock(&head->lock);
  682. return ep;
  683. }
  684. /* rhashtable for transport */
  685. struct sctp_hash_cmp_arg {
  686. const struct sctp_endpoint *ep;
  687. const union sctp_addr *laddr;
  688. const union sctp_addr *paddr;
  689. const struct net *net;
  690. };
  691. static inline int sctp_hash_cmp(struct rhashtable_compare_arg *arg,
  692. const void *ptr)
  693. {
  694. struct sctp_transport *t = (struct sctp_transport *)ptr;
  695. const struct sctp_hash_cmp_arg *x = arg->key;
  696. struct sctp_association *asoc;
  697. int err = 1;
  698. if (!sctp_cmp_addr_exact(&t->ipaddr, x->paddr))
  699. return err;
  700. if (!sctp_transport_hold(t))
  701. return err;
  702. asoc = t->asoc;
  703. if (!net_eq(sock_net(asoc->base.sk), x->net))
  704. goto out;
  705. if (x->ep) {
  706. if (x->ep != asoc->ep)
  707. goto out;
  708. } else {
  709. if (x->laddr->v4.sin_port != htons(asoc->base.bind_addr.port))
  710. goto out;
  711. if (!sctp_bind_addr_match(&asoc->base.bind_addr,
  712. x->laddr, sctp_sk(asoc->base.sk)))
  713. goto out;
  714. }
  715. err = 0;
  716. out:
  717. sctp_transport_put(t);
  718. return err;
  719. }
  720. static inline u32 sctp_hash_obj(const void *data, u32 len, u32 seed)
  721. {
  722. const struct sctp_transport *t = data;
  723. const union sctp_addr *paddr = &t->ipaddr;
  724. const struct net *net = sock_net(t->asoc->base.sk);
  725. u16 lport = htons(t->asoc->base.bind_addr.port);
  726. u32 addr;
  727. if (paddr->sa.sa_family == AF_INET6)
  728. addr = jhash(&paddr->v6.sin6_addr, 16, seed);
  729. else
  730. addr = paddr->v4.sin_addr.s_addr;
  731. return jhash_3words(addr, ((__u32)paddr->v4.sin_port) << 16 |
  732. (__force __u32)lport, net_hash_mix(net), seed);
  733. }
  734. static inline u32 sctp_hash_key(const void *data, u32 len, u32 seed)
  735. {
  736. const struct sctp_hash_cmp_arg *x = data;
  737. const union sctp_addr *paddr = x->paddr;
  738. const struct net *net = x->net;
  739. u16 lport;
  740. u32 addr;
  741. lport = x->ep ? htons(x->ep->base.bind_addr.port) :
  742. x->laddr->v4.sin_port;
  743. if (paddr->sa.sa_family == AF_INET6)
  744. addr = jhash(&paddr->v6.sin6_addr, 16, seed);
  745. else
  746. addr = paddr->v4.sin_addr.s_addr;
  747. return jhash_3words(addr, ((__u32)paddr->v4.sin_port) << 16 |
  748. (__force __u32)lport, net_hash_mix(net), seed);
  749. }
  750. static const struct rhashtable_params sctp_hash_params = {
  751. .head_offset = offsetof(struct sctp_transport, node),
  752. .hashfn = sctp_hash_key,
  753. .obj_hashfn = sctp_hash_obj,
  754. .obj_cmpfn = sctp_hash_cmp,
  755. .automatic_shrinking = true,
  756. };
  757. int sctp_transport_hashtable_init(void)
  758. {
  759. return rhashtable_init(&sctp_transport_hashtable, &sctp_hash_params);
  760. }
  761. void sctp_transport_hashtable_destroy(void)
  762. {
  763. rhashtable_destroy(&sctp_transport_hashtable);
  764. }
  765. void sctp_hash_transport(struct sctp_transport *t)
  766. {
  767. struct sctp_hash_cmp_arg arg;
  768. if (t->asoc->temp)
  769. return;
  770. arg.ep = t->asoc->ep;
  771. arg.paddr = &t->ipaddr;
  772. arg.net = sock_net(t->asoc->base.sk);
  773. reinsert:
  774. if (rhashtable_lookup_insert_key(&sctp_transport_hashtable, &arg,
  775. &t->node, sctp_hash_params) == -EBUSY)
  776. goto reinsert;
  777. }
  778. void sctp_unhash_transport(struct sctp_transport *t)
  779. {
  780. if (t->asoc->temp)
  781. return;
  782. rhashtable_remove_fast(&sctp_transport_hashtable, &t->node,
  783. sctp_hash_params);
  784. }
  785. struct sctp_transport *sctp_addrs_lookup_transport(
  786. struct net *net,
  787. const union sctp_addr *laddr,
  788. const union sctp_addr *paddr)
  789. {
  790. struct sctp_hash_cmp_arg arg = {
  791. .ep = NULL,
  792. .laddr = laddr,
  793. .paddr = paddr,
  794. .net = net,
  795. };
  796. return rhashtable_lookup_fast(&sctp_transport_hashtable, &arg,
  797. sctp_hash_params);
  798. }
  799. struct sctp_transport *sctp_epaddr_lookup_transport(
  800. const struct sctp_endpoint *ep,
  801. const union sctp_addr *paddr)
  802. {
  803. struct net *net = sock_net(ep->base.sk);
  804. struct sctp_hash_cmp_arg arg = {
  805. .ep = ep,
  806. .paddr = paddr,
  807. .net = net,
  808. };
  809. return rhashtable_lookup_fast(&sctp_transport_hashtable, &arg,
  810. sctp_hash_params);
  811. }
  812. /* Look up an association. */
  813. static struct sctp_association *__sctp_lookup_association(
  814. struct net *net,
  815. const union sctp_addr *local,
  816. const union sctp_addr *peer,
  817. struct sctp_transport **pt)
  818. {
  819. struct sctp_transport *t;
  820. struct sctp_association *asoc = NULL;
  821. t = sctp_addrs_lookup_transport(net, local, peer);
  822. if (!t || !sctp_transport_hold(t))
  823. goto out;
  824. asoc = t->asoc;
  825. *pt = t;
  826. out:
  827. return asoc;
  828. }
  829. /* Look up an association. protected by RCU read lock */
  830. static
  831. struct sctp_association *sctp_lookup_association(struct net *net,
  832. const union sctp_addr *laddr,
  833. const union sctp_addr *paddr,
  834. struct sctp_transport **transportp)
  835. {
  836. struct sctp_association *asoc;
  837. rcu_read_lock();
  838. asoc = __sctp_lookup_association(net, laddr, paddr, transportp);
  839. rcu_read_unlock();
  840. return asoc;
  841. }
  842. /* Is there an association matching the given local and peer addresses? */
  843. int sctp_has_association(struct net *net,
  844. const union sctp_addr *laddr,
  845. const union sctp_addr *paddr)
  846. {
  847. struct sctp_association *asoc;
  848. struct sctp_transport *transport;
  849. if ((asoc = sctp_lookup_association(net, laddr, paddr, &transport))) {
  850. sctp_transport_put(transport);
  851. return 1;
  852. }
  853. return 0;
  854. }
  855. /*
  856. * SCTP Implementors Guide, 2.18 Handling of address
  857. * parameters within the INIT or INIT-ACK.
  858. *
  859. * D) When searching for a matching TCB upon reception of an INIT
  860. * or INIT-ACK chunk the receiver SHOULD use not only the
  861. * source address of the packet (containing the INIT or
  862. * INIT-ACK) but the receiver SHOULD also use all valid
  863. * address parameters contained within the chunk.
  864. *
  865. * 2.18.3 Solution description
  866. *
  867. * This new text clearly specifies to an implementor the need
  868. * to look within the INIT or INIT-ACK. Any implementation that
  869. * does not do this, may not be able to establish associations
  870. * in certain circumstances.
  871. *
  872. */
  873. static struct sctp_association *__sctp_rcv_init_lookup(struct net *net,
  874. struct sk_buff *skb,
  875. const union sctp_addr *laddr, struct sctp_transport **transportp)
  876. {
  877. struct sctp_association *asoc;
  878. union sctp_addr addr;
  879. union sctp_addr *paddr = &addr;
  880. struct sctphdr *sh = sctp_hdr(skb);
  881. union sctp_params params;
  882. sctp_init_chunk_t *init;
  883. struct sctp_af *af;
  884. /*
  885. * This code will NOT touch anything inside the chunk--it is
  886. * strictly READ-ONLY.
  887. *
  888. * RFC 2960 3 SCTP packet Format
  889. *
  890. * Multiple chunks can be bundled into one SCTP packet up to
  891. * the MTU size, except for the INIT, INIT ACK, and SHUTDOWN
  892. * COMPLETE chunks. These chunks MUST NOT be bundled with any
  893. * other chunk in a packet. See Section 6.10 for more details
  894. * on chunk bundling.
  895. */
  896. /* Find the start of the TLVs and the end of the chunk. This is
  897. * the region we search for address parameters.
  898. */
  899. init = (sctp_init_chunk_t *)skb->data;
  900. /* Walk the parameters looking for embedded addresses. */
  901. sctp_walk_params(params, init, init_hdr.params) {
  902. /* Note: Ignoring hostname addresses. */
  903. af = sctp_get_af_specific(param_type2af(params.p->type));
  904. if (!af)
  905. continue;
  906. af->from_addr_param(paddr, params.addr, sh->source, 0);
  907. asoc = __sctp_lookup_association(net, laddr, paddr, transportp);
  908. if (asoc)
  909. return asoc;
  910. }
  911. return NULL;
  912. }
  913. /* ADD-IP, Section 5.2
  914. * When an endpoint receives an ASCONF Chunk from the remote peer
  915. * special procedures may be needed to identify the association the
  916. * ASCONF Chunk is associated with. To properly find the association
  917. * the following procedures SHOULD be followed:
  918. *
  919. * D2) If the association is not found, use the address found in the
  920. * Address Parameter TLV combined with the port number found in the
  921. * SCTP common header. If found proceed to rule D4.
  922. *
  923. * D2-ext) If more than one ASCONF Chunks are packed together, use the
  924. * address found in the ASCONF Address Parameter TLV of each of the
  925. * subsequent ASCONF Chunks. If found, proceed to rule D4.
  926. */
  927. static struct sctp_association *__sctp_rcv_asconf_lookup(
  928. struct net *net,
  929. sctp_chunkhdr_t *ch,
  930. const union sctp_addr *laddr,
  931. __be16 peer_port,
  932. struct sctp_transport **transportp)
  933. {
  934. sctp_addip_chunk_t *asconf = (struct sctp_addip_chunk *)ch;
  935. struct sctp_af *af;
  936. union sctp_addr_param *param;
  937. union sctp_addr paddr;
  938. /* Skip over the ADDIP header and find the Address parameter */
  939. param = (union sctp_addr_param *)(asconf + 1);
  940. af = sctp_get_af_specific(param_type2af(param->p.type));
  941. if (unlikely(!af))
  942. return NULL;
  943. af->from_addr_param(&paddr, param, peer_port, 0);
  944. return __sctp_lookup_association(net, laddr, &paddr, transportp);
  945. }
  946. /* SCTP-AUTH, Section 6.3:
  947. * If the receiver does not find a STCB for a packet containing an AUTH
  948. * chunk as the first chunk and not a COOKIE-ECHO chunk as the second
  949. * chunk, it MUST use the chunks after the AUTH chunk to look up an existing
  950. * association.
  951. *
  952. * This means that any chunks that can help us identify the association need
  953. * to be looked at to find this association.
  954. */
  955. static struct sctp_association *__sctp_rcv_walk_lookup(struct net *net,
  956. struct sk_buff *skb,
  957. const union sctp_addr *laddr,
  958. struct sctp_transport **transportp)
  959. {
  960. struct sctp_association *asoc = NULL;
  961. sctp_chunkhdr_t *ch;
  962. int have_auth = 0;
  963. unsigned int chunk_num = 1;
  964. __u8 *ch_end;
  965. /* Walk through the chunks looking for AUTH or ASCONF chunks
  966. * to help us find the association.
  967. */
  968. ch = (sctp_chunkhdr_t *) skb->data;
  969. do {
  970. /* Break out if chunk length is less then minimal. */
  971. if (ntohs(ch->length) < sizeof(sctp_chunkhdr_t))
  972. break;
  973. ch_end = ((__u8 *)ch) + SCTP_PAD4(ntohs(ch->length));
  974. if (ch_end > skb_tail_pointer(skb))
  975. break;
  976. switch (ch->type) {
  977. case SCTP_CID_AUTH:
  978. have_auth = chunk_num;
  979. break;
  980. case SCTP_CID_COOKIE_ECHO:
  981. /* If a packet arrives containing an AUTH chunk as
  982. * a first chunk, a COOKIE-ECHO chunk as the second
  983. * chunk, and possibly more chunks after them, and
  984. * the receiver does not have an STCB for that
  985. * packet, then authentication is based on
  986. * the contents of the COOKIE- ECHO chunk.
  987. */
  988. if (have_auth == 1 && chunk_num == 2)
  989. return NULL;
  990. break;
  991. case SCTP_CID_ASCONF:
  992. if (have_auth || net->sctp.addip_noauth)
  993. asoc = __sctp_rcv_asconf_lookup(
  994. net, ch, laddr,
  995. sctp_hdr(skb)->source,
  996. transportp);
  997. default:
  998. break;
  999. }
  1000. if (asoc)
  1001. break;
  1002. ch = (sctp_chunkhdr_t *) ch_end;
  1003. chunk_num++;
  1004. } while (ch_end < skb_tail_pointer(skb));
  1005. return asoc;
  1006. }
  1007. /*
  1008. * There are circumstances when we need to look inside the SCTP packet
  1009. * for information to help us find the association. Examples
  1010. * include looking inside of INIT/INIT-ACK chunks or after the AUTH
  1011. * chunks.
  1012. */
  1013. static struct sctp_association *__sctp_rcv_lookup_harder(struct net *net,
  1014. struct sk_buff *skb,
  1015. const union sctp_addr *laddr,
  1016. struct sctp_transport **transportp)
  1017. {
  1018. sctp_chunkhdr_t *ch;
  1019. /* We do not allow GSO frames here as we need to linearize and
  1020. * then cannot guarantee frame boundaries. This shouldn't be an
  1021. * issue as packets hitting this are mostly INIT or INIT-ACK and
  1022. * those cannot be on GSO-style anyway.
  1023. */
  1024. if ((skb_shinfo(skb)->gso_type & SKB_GSO_SCTP) == SKB_GSO_SCTP)
  1025. return NULL;
  1026. ch = (sctp_chunkhdr_t *) skb->data;
  1027. /* The code below will attempt to walk the chunk and extract
  1028. * parameter information. Before we do that, we need to verify
  1029. * that the chunk length doesn't cause overflow. Otherwise, we'll
  1030. * walk off the end.
  1031. */
  1032. if (SCTP_PAD4(ntohs(ch->length)) > skb->len)
  1033. return NULL;
  1034. /* If this is INIT/INIT-ACK look inside the chunk too. */
  1035. if (ch->type == SCTP_CID_INIT || ch->type == SCTP_CID_INIT_ACK)
  1036. return __sctp_rcv_init_lookup(net, skb, laddr, transportp);
  1037. return __sctp_rcv_walk_lookup(net, skb, laddr, transportp);
  1038. }
  1039. /* Lookup an association for an inbound skb. */
  1040. static struct sctp_association *__sctp_rcv_lookup(struct net *net,
  1041. struct sk_buff *skb,
  1042. const union sctp_addr *paddr,
  1043. const union sctp_addr *laddr,
  1044. struct sctp_transport **transportp)
  1045. {
  1046. struct sctp_association *asoc;
  1047. asoc = __sctp_lookup_association(net, laddr, paddr, transportp);
  1048. /* Further lookup for INIT/INIT-ACK packets.
  1049. * SCTP Implementors Guide, 2.18 Handling of address
  1050. * parameters within the INIT or INIT-ACK.
  1051. */
  1052. if (!asoc)
  1053. asoc = __sctp_rcv_lookup_harder(net, skb, laddr, transportp);
  1054. return asoc;
  1055. }