endpointola.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489
  1. /* SCTP kernel implementation
  2. * Copyright (c) 1999-2000 Cisco, Inc.
  3. * Copyright (c) 1999-2001 Motorola, Inc.
  4. * Copyright (c) 2001-2002 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. * This abstraction represents an SCTP endpoint.
  12. *
  13. * The 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. * The 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, write to
  27. * the Free Software Foundation, 59 Temple Place - Suite 330,
  28. * Boston, MA 02111-1307, USA.
  29. *
  30. * Please send any bug reports or fixes you make to the
  31. * email address(es):
  32. * lksctp developers <lksctp-developers@lists.sourceforge.net>
  33. *
  34. * Or submit a bug report through the following website:
  35. * http://www.sf.net/projects/lksctp
  36. *
  37. * Written or modified by:
  38. * La Monte H.P. Yarroll <piggy@acm.org>
  39. * Karl Knutson <karl@athena.chicago.il.us>
  40. * Jon Grimm <jgrimm@austin.ibm.com>
  41. * Daisy Chang <daisyc@us.ibm.com>
  42. * Dajiang Zhang <dajiang.zhang@nokia.com>
  43. *
  44. * Any bugs reported given to us we will try to fix... any fixes shared will
  45. * be incorporated into the next SCTP release.
  46. */
  47. #include <linux/types.h>
  48. #include <linux/slab.h>
  49. #include <linux/in.h>
  50. #include <linux/random.h> /* get_random_bytes() */
  51. #include <linux/crypto.h>
  52. #include <net/sock.h>
  53. #include <net/ipv6.h>
  54. #include <net/sctp/sctp.h>
  55. #include <net/sctp/sm.h>
  56. /* Forward declarations for internal helpers. */
  57. static void sctp_endpoint_bh_rcv(struct work_struct *work);
  58. /*
  59. * Initialize the base fields of the endpoint structure.
  60. */
  61. static struct sctp_endpoint *sctp_endpoint_init(struct sctp_endpoint *ep,
  62. struct sock *sk,
  63. gfp_t gfp)
  64. {
  65. struct sctp_hmac_algo_param *auth_hmacs = NULL;
  66. struct sctp_chunks_param *auth_chunks = NULL;
  67. struct sctp_shared_key *null_key;
  68. int err;
  69. memset(ep, 0, sizeof(struct sctp_endpoint));
  70. ep->digest = kzalloc(SCTP_SIGNATURE_SIZE, gfp);
  71. if (!ep->digest)
  72. return NULL;
  73. if (sctp_auth_enable) {
  74. /* Allocate space for HMACS and CHUNKS authentication
  75. * variables. There are arrays that we encode directly
  76. * into parameters to make the rest of the operations easier.
  77. */
  78. auth_hmacs = kzalloc(sizeof(sctp_hmac_algo_param_t) +
  79. sizeof(__u16) * SCTP_AUTH_NUM_HMACS, gfp);
  80. if (!auth_hmacs)
  81. goto nomem;
  82. auth_chunks = kzalloc(sizeof(sctp_chunks_param_t) +
  83. SCTP_NUM_CHUNK_TYPES, gfp);
  84. if (!auth_chunks)
  85. goto nomem;
  86. /* Initialize the HMACS parameter.
  87. * SCTP-AUTH: Section 3.3
  88. * Every endpoint supporting SCTP chunk authentication MUST
  89. * support the HMAC based on the SHA-1 algorithm.
  90. */
  91. auth_hmacs->param_hdr.type = SCTP_PARAM_HMAC_ALGO;
  92. auth_hmacs->param_hdr.length =
  93. htons(sizeof(sctp_paramhdr_t) + 2);
  94. auth_hmacs->hmac_ids[0] = htons(SCTP_AUTH_HMAC_ID_SHA1);
  95. /* Initialize the CHUNKS parameter */
  96. auth_chunks->param_hdr.type = SCTP_PARAM_CHUNKS;
  97. auth_chunks->param_hdr.length = htons(sizeof(sctp_paramhdr_t));
  98. /* If the Add-IP functionality is enabled, we must
  99. * authenticate, ASCONF and ASCONF-ACK chunks
  100. */
  101. if (sctp_addip_enable) {
  102. auth_chunks->chunks[0] = SCTP_CID_ASCONF;
  103. auth_chunks->chunks[1] = SCTP_CID_ASCONF_ACK;
  104. auth_chunks->param_hdr.length += htons(2);
  105. }
  106. }
  107. /* Initialize the base structure. */
  108. /* What type of endpoint are we? */
  109. ep->base.type = SCTP_EP_TYPE_SOCKET;
  110. /* Initialize the basic object fields. */
  111. atomic_set(&ep->base.refcnt, 1);
  112. ep->base.dead = 0;
  113. ep->base.malloced = 1;
  114. /* Create an input queue. */
  115. sctp_inq_init(&ep->base.inqueue);
  116. /* Set its top-half handler */
  117. sctp_inq_set_th_handler(&ep->base.inqueue, sctp_endpoint_bh_rcv);
  118. /* Initialize the bind addr area */
  119. sctp_bind_addr_init(&ep->base.bind_addr, 0);
  120. /* Remember who we are attached to. */
  121. ep->base.sk = sk;
  122. sock_hold(ep->base.sk);
  123. /* Create the lists of associations. */
  124. INIT_LIST_HEAD(&ep->asocs);
  125. /* Use SCTP specific send buffer space queues. */
  126. ep->sndbuf_policy = sctp_sndbuf_policy;
  127. sk->sk_write_space = sctp_write_space;
  128. sock_set_flag(sk, SOCK_USE_WRITE_QUEUE);
  129. /* Get the receive buffer policy for this endpoint */
  130. ep->rcvbuf_policy = sctp_rcvbuf_policy;
  131. /* Initialize the secret key used with cookie. */
  132. get_random_bytes(&ep->secret_key[0], SCTP_SECRET_SIZE);
  133. ep->last_key = ep->current_key = 0;
  134. ep->key_changed_at = jiffies;
  135. /* SCTP-AUTH extensions*/
  136. INIT_LIST_HEAD(&ep->endpoint_shared_keys);
  137. null_key = sctp_auth_shkey_create(0, GFP_KERNEL);
  138. if (!null_key)
  139. goto nomem;
  140. list_add(&null_key->key_list, &ep->endpoint_shared_keys);
  141. /* Allocate and initialize transorms arrays for suported HMACs. */
  142. err = sctp_auth_init_hmacs(ep, gfp);
  143. if (err)
  144. goto nomem_hmacs;
  145. /* Add the null key to the endpoint shared keys list and
  146. * set the hmcas and chunks pointers.
  147. */
  148. ep->auth_hmacs_list = auth_hmacs;
  149. ep->auth_chunk_list = auth_chunks;
  150. return ep;
  151. nomem_hmacs:
  152. sctp_auth_destroy_keys(&ep->endpoint_shared_keys);
  153. nomem:
  154. /* Free all allocations */
  155. kfree(auth_hmacs);
  156. kfree(auth_chunks);
  157. kfree(ep->digest);
  158. return NULL;
  159. }
  160. /* Create a sctp_endpoint with all that boring stuff initialized.
  161. * Returns NULL if there isn't enough memory.
  162. */
  163. struct sctp_endpoint *sctp_endpoint_new(struct sock *sk, gfp_t gfp)
  164. {
  165. struct sctp_endpoint *ep;
  166. /* Build a local endpoint. */
  167. ep = t_new(struct sctp_endpoint, gfp);
  168. if (!ep)
  169. goto fail;
  170. if (!sctp_endpoint_init(ep, sk, gfp))
  171. goto fail_init;
  172. ep->base.malloced = 1;
  173. SCTP_DBG_OBJCNT_INC(ep);
  174. return ep;
  175. fail_init:
  176. kfree(ep);
  177. fail:
  178. return NULL;
  179. }
  180. /* Add an association to an endpoint. */
  181. void sctp_endpoint_add_asoc(struct sctp_endpoint *ep,
  182. struct sctp_association *asoc)
  183. {
  184. struct sock *sk = ep->base.sk;
  185. /* If this is a temporary association, don't bother
  186. * since we'll be removing it shortly and don't
  187. * want anyone to find it anyway.
  188. */
  189. if (asoc->temp)
  190. return;
  191. /* Now just add it to our list of asocs */
  192. list_add_tail(&asoc->asocs, &ep->asocs);
  193. /* Increment the backlog value for a TCP-style listening socket. */
  194. if (sctp_style(sk, TCP) && sctp_sstate(sk, LISTENING))
  195. sk->sk_ack_backlog++;
  196. }
  197. /* Free the endpoint structure. Delay cleanup until
  198. * all users have released their reference count on this structure.
  199. */
  200. void sctp_endpoint_free(struct sctp_endpoint *ep)
  201. {
  202. ep->base.dead = 1;
  203. ep->base.sk->sk_state = SCTP_SS_CLOSED;
  204. /* Unlink this endpoint, so we can't find it again! */
  205. sctp_unhash_endpoint(ep);
  206. sctp_endpoint_put(ep);
  207. }
  208. /* Final destructor for endpoint. */
  209. static void sctp_endpoint_destroy(struct sctp_endpoint *ep)
  210. {
  211. SCTP_ASSERT(ep->base.dead, "Endpoint is not dead", return);
  212. /* Free up the HMAC transform. */
  213. crypto_free_hash(sctp_sk(ep->base.sk)->hmac);
  214. /* Free the digest buffer */
  215. kfree(ep->digest);
  216. /* SCTP-AUTH: Free up AUTH releated data such as shared keys
  217. * chunks and hmacs arrays that were allocated
  218. */
  219. sctp_auth_destroy_keys(&ep->endpoint_shared_keys);
  220. kfree(ep->auth_hmacs_list);
  221. kfree(ep->auth_chunk_list);
  222. /* AUTH - Free any allocated HMAC transform containers */
  223. sctp_auth_destroy_hmacs(ep->auth_hmacs);
  224. /* Cleanup. */
  225. sctp_inq_free(&ep->base.inqueue);
  226. sctp_bind_addr_free(&ep->base.bind_addr);
  227. /* Remove and free the port */
  228. if (sctp_sk(ep->base.sk)->bind_hash)
  229. sctp_put_port(ep->base.sk);
  230. /* Give up our hold on the sock. */
  231. if (ep->base.sk)
  232. sock_put(ep->base.sk);
  233. /* Finally, free up our memory. */
  234. if (ep->base.malloced) {
  235. kfree(ep);
  236. SCTP_DBG_OBJCNT_DEC(ep);
  237. }
  238. }
  239. /* Hold a reference to an endpoint. */
  240. void sctp_endpoint_hold(struct sctp_endpoint *ep)
  241. {
  242. atomic_inc(&ep->base.refcnt);
  243. }
  244. /* Release a reference to an endpoint and clean up if there are
  245. * no more references.
  246. */
  247. void sctp_endpoint_put(struct sctp_endpoint *ep)
  248. {
  249. if (atomic_dec_and_test(&ep->base.refcnt))
  250. sctp_endpoint_destroy(ep);
  251. }
  252. /* Is this the endpoint we are looking for? */
  253. struct sctp_endpoint *sctp_endpoint_is_match(struct sctp_endpoint *ep,
  254. const union sctp_addr *laddr)
  255. {
  256. struct sctp_endpoint *retval = NULL;
  257. if (htons(ep->base.bind_addr.port) == laddr->v4.sin_port) {
  258. if (sctp_bind_addr_match(&ep->base.bind_addr, laddr,
  259. sctp_sk(ep->base.sk)))
  260. retval = ep;
  261. }
  262. return retval;
  263. }
  264. /* Find the association that goes with this chunk.
  265. * We do a linear search of the associations for this endpoint.
  266. * We return the matching transport address too.
  267. */
  268. static struct sctp_association *__sctp_endpoint_lookup_assoc(
  269. const struct sctp_endpoint *ep,
  270. const union sctp_addr *paddr,
  271. struct sctp_transport **transport)
  272. {
  273. struct sctp_association *asoc = NULL;
  274. struct sctp_transport *t = NULL;
  275. struct sctp_hashbucket *head;
  276. struct sctp_ep_common *epb;
  277. struct hlist_node *node;
  278. int hash;
  279. int rport;
  280. *transport = NULL;
  281. rport = ntohs(paddr->v4.sin_port);
  282. hash = sctp_assoc_hashfn(ep->base.bind_addr.port, rport);
  283. head = &sctp_assoc_hashtable[hash];
  284. read_lock(&head->lock);
  285. sctp_for_each_hentry(epb, node, &head->chain) {
  286. asoc = sctp_assoc(epb);
  287. if (asoc->ep != ep || rport != asoc->peer.port)
  288. goto next;
  289. t = sctp_assoc_lookup_paddr(asoc, paddr);
  290. if (t) {
  291. *transport = t;
  292. break;
  293. }
  294. next:
  295. asoc = NULL;
  296. }
  297. read_unlock(&head->lock);
  298. return asoc;
  299. }
  300. /* Lookup association on an endpoint based on a peer address. BH-safe. */
  301. struct sctp_association *sctp_endpoint_lookup_assoc(
  302. const struct sctp_endpoint *ep,
  303. const union sctp_addr *paddr,
  304. struct sctp_transport **transport)
  305. {
  306. struct sctp_association *asoc;
  307. sctp_local_bh_disable();
  308. asoc = __sctp_endpoint_lookup_assoc(ep, paddr, transport);
  309. sctp_local_bh_enable();
  310. return asoc;
  311. }
  312. /* Look for any peeled off association from the endpoint that matches the
  313. * given peer address.
  314. */
  315. int sctp_endpoint_is_peeled_off(struct sctp_endpoint *ep,
  316. const union sctp_addr *paddr)
  317. {
  318. struct sctp_sockaddr_entry *addr;
  319. struct sctp_bind_addr *bp;
  320. bp = &ep->base.bind_addr;
  321. /* This function is called with the socket lock held,
  322. * so the address_list can not change.
  323. */
  324. list_for_each_entry(addr, &bp->address_list, list) {
  325. if (sctp_has_association(&addr->a, paddr))
  326. return 1;
  327. }
  328. return 0;
  329. }
  330. /* Do delayed input processing. This is scheduled by sctp_rcv().
  331. * This may be called on BH or task time.
  332. */
  333. static void sctp_endpoint_bh_rcv(struct work_struct *work)
  334. {
  335. struct sctp_endpoint *ep =
  336. container_of(work, struct sctp_endpoint,
  337. base.inqueue.immediate);
  338. struct sctp_association *asoc;
  339. struct sock *sk;
  340. struct sctp_transport *transport;
  341. struct sctp_chunk *chunk;
  342. struct sctp_inq *inqueue;
  343. sctp_subtype_t subtype;
  344. sctp_state_t state;
  345. int error = 0;
  346. int first_time = 1; /* is this the first time through the looop */
  347. if (ep->base.dead)
  348. return;
  349. asoc = NULL;
  350. inqueue = &ep->base.inqueue;
  351. sk = ep->base.sk;
  352. while (NULL != (chunk = sctp_inq_pop(inqueue))) {
  353. subtype = SCTP_ST_CHUNK(chunk->chunk_hdr->type);
  354. /* If the first chunk in the packet is AUTH, do special
  355. * processing specified in Section 6.3 of SCTP-AUTH spec
  356. */
  357. if (first_time && (subtype.chunk == SCTP_CID_AUTH)) {
  358. struct sctp_chunkhdr *next_hdr;
  359. next_hdr = sctp_inq_peek(inqueue);
  360. if (!next_hdr)
  361. goto normal;
  362. /* If the next chunk is COOKIE-ECHO, skip the AUTH
  363. * chunk while saving a pointer to it so we can do
  364. * Authentication later (during cookie-echo
  365. * processing).
  366. */
  367. if (next_hdr->type == SCTP_CID_COOKIE_ECHO) {
  368. chunk->auth_chunk = skb_clone(chunk->skb,
  369. GFP_ATOMIC);
  370. chunk->auth = 1;
  371. continue;
  372. }
  373. }
  374. normal:
  375. /* We might have grown an association since last we
  376. * looked, so try again.
  377. *
  378. * This happens when we've just processed our
  379. * COOKIE-ECHO chunk.
  380. */
  381. if (NULL == chunk->asoc) {
  382. asoc = sctp_endpoint_lookup_assoc(ep,
  383. sctp_source(chunk),
  384. &transport);
  385. chunk->asoc = asoc;
  386. chunk->transport = transport;
  387. }
  388. state = asoc ? asoc->state : SCTP_STATE_CLOSED;
  389. if (sctp_auth_recv_cid(subtype.chunk, asoc) && !chunk->auth)
  390. continue;
  391. /* Remember where the last DATA chunk came from so we
  392. * know where to send the SACK.
  393. */
  394. if (asoc && sctp_chunk_is_data(chunk))
  395. asoc->peer.last_data_from = chunk->transport;
  396. else
  397. SCTP_INC_STATS(SCTP_MIB_INCTRLCHUNKS);
  398. if (chunk->transport)
  399. chunk->transport->last_time_heard = jiffies;
  400. error = sctp_do_sm(SCTP_EVENT_T_CHUNK, subtype, state,
  401. ep, asoc, chunk, GFP_ATOMIC);
  402. if (error && chunk)
  403. chunk->pdiscard = 1;
  404. /* Check to see if the endpoint is freed in response to
  405. * the incoming chunk. If so, get out of the while loop.
  406. */
  407. if (!sctp_sk(sk)->ep)
  408. break;
  409. if (first_time)
  410. first_time = 0;
  411. }
  412. }