endpointola.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490
  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 =
  105. htons(sizeof(sctp_paramhdr_t) + 2);
  106. }
  107. }
  108. /* Initialize the base structure. */
  109. /* What type of endpoint are we? */
  110. ep->base.type = SCTP_EP_TYPE_SOCKET;
  111. /* Initialize the basic object fields. */
  112. atomic_set(&ep->base.refcnt, 1);
  113. ep->base.dead = 0;
  114. ep->base.malloced = 1;
  115. /* Create an input queue. */
  116. sctp_inq_init(&ep->base.inqueue);
  117. /* Set its top-half handler */
  118. sctp_inq_set_th_handler(&ep->base.inqueue, sctp_endpoint_bh_rcv);
  119. /* Initialize the bind addr area */
  120. sctp_bind_addr_init(&ep->base.bind_addr, 0);
  121. /* Remember who we are attached to. */
  122. ep->base.sk = sk;
  123. sock_hold(ep->base.sk);
  124. /* Create the lists of associations. */
  125. INIT_LIST_HEAD(&ep->asocs);
  126. /* Use SCTP specific send buffer space queues. */
  127. ep->sndbuf_policy = sctp_sndbuf_policy;
  128. sk->sk_write_space = sctp_write_space;
  129. sock_set_flag(sk, SOCK_USE_WRITE_QUEUE);
  130. /* Get the receive buffer policy for this endpoint */
  131. ep->rcvbuf_policy = sctp_rcvbuf_policy;
  132. /* Initialize the secret key used with cookie. */
  133. get_random_bytes(&ep->secret_key[0], SCTP_SECRET_SIZE);
  134. ep->last_key = ep->current_key = 0;
  135. ep->key_changed_at = jiffies;
  136. /* SCTP-AUTH extensions*/
  137. INIT_LIST_HEAD(&ep->endpoint_shared_keys);
  138. null_key = sctp_auth_shkey_create(0, GFP_KERNEL);
  139. if (!null_key)
  140. goto nomem;
  141. list_add(&null_key->key_list, &ep->endpoint_shared_keys);
  142. /* Allocate and initialize transorms arrays for suported HMACs. */
  143. err = sctp_auth_init_hmacs(ep, gfp);
  144. if (err)
  145. goto nomem_hmacs;
  146. /* Add the null key to the endpoint shared keys list and
  147. * set the hmcas and chunks pointers.
  148. */
  149. ep->auth_hmacs_list = auth_hmacs;
  150. ep->auth_chunk_list = auth_chunks;
  151. return ep;
  152. nomem_hmacs:
  153. sctp_auth_destroy_keys(&ep->endpoint_shared_keys);
  154. nomem:
  155. /* Free all allocations */
  156. kfree(auth_hmacs);
  157. kfree(auth_chunks);
  158. kfree(ep->digest);
  159. return NULL;
  160. }
  161. /* Create a sctp_endpoint with all that boring stuff initialized.
  162. * Returns NULL if there isn't enough memory.
  163. */
  164. struct sctp_endpoint *sctp_endpoint_new(struct sock *sk, gfp_t gfp)
  165. {
  166. struct sctp_endpoint *ep;
  167. /* Build a local endpoint. */
  168. ep = t_new(struct sctp_endpoint, gfp);
  169. if (!ep)
  170. goto fail;
  171. if (!sctp_endpoint_init(ep, sk, gfp))
  172. goto fail_init;
  173. ep->base.malloced = 1;
  174. SCTP_DBG_OBJCNT_INC(ep);
  175. return ep;
  176. fail_init:
  177. kfree(ep);
  178. fail:
  179. return NULL;
  180. }
  181. /* Add an association to an endpoint. */
  182. void sctp_endpoint_add_asoc(struct sctp_endpoint *ep,
  183. struct sctp_association *asoc)
  184. {
  185. struct sock *sk = ep->base.sk;
  186. /* If this is a temporary association, don't bother
  187. * since we'll be removing it shortly and don't
  188. * want anyone to find it anyway.
  189. */
  190. if (asoc->temp)
  191. return;
  192. /* Now just add it to our list of asocs */
  193. list_add_tail(&asoc->asocs, &ep->asocs);
  194. /* Increment the backlog value for a TCP-style listening socket. */
  195. if (sctp_style(sk, TCP) && sctp_sstate(sk, LISTENING))
  196. sk->sk_ack_backlog++;
  197. }
  198. /* Free the endpoint structure. Delay cleanup until
  199. * all users have released their reference count on this structure.
  200. */
  201. void sctp_endpoint_free(struct sctp_endpoint *ep)
  202. {
  203. ep->base.dead = 1;
  204. ep->base.sk->sk_state = SCTP_SS_CLOSED;
  205. /* Unlink this endpoint, so we can't find it again! */
  206. sctp_unhash_endpoint(ep);
  207. sctp_endpoint_put(ep);
  208. }
  209. /* Final destructor for endpoint. */
  210. static void sctp_endpoint_destroy(struct sctp_endpoint *ep)
  211. {
  212. SCTP_ASSERT(ep->base.dead, "Endpoint is not dead", return);
  213. /* Free up the HMAC transform. */
  214. crypto_free_hash(sctp_sk(ep->base.sk)->hmac);
  215. /* Free the digest buffer */
  216. kfree(ep->digest);
  217. /* SCTP-AUTH: Free up AUTH releated data such as shared keys
  218. * chunks and hmacs arrays that were allocated
  219. */
  220. sctp_auth_destroy_keys(&ep->endpoint_shared_keys);
  221. kfree(ep->auth_hmacs_list);
  222. kfree(ep->auth_chunk_list);
  223. /* AUTH - Free any allocated HMAC transform containers */
  224. sctp_auth_destroy_hmacs(ep->auth_hmacs);
  225. /* Cleanup. */
  226. sctp_inq_free(&ep->base.inqueue);
  227. sctp_bind_addr_free(&ep->base.bind_addr);
  228. /* Remove and free the port */
  229. if (sctp_sk(ep->base.sk)->bind_hash)
  230. sctp_put_port(ep->base.sk);
  231. /* Give up our hold on the sock. */
  232. if (ep->base.sk)
  233. sock_put(ep->base.sk);
  234. /* Finally, free up our memory. */
  235. if (ep->base.malloced) {
  236. kfree(ep);
  237. SCTP_DBG_OBJCNT_DEC(ep);
  238. }
  239. }
  240. /* Hold a reference to an endpoint. */
  241. void sctp_endpoint_hold(struct sctp_endpoint *ep)
  242. {
  243. atomic_inc(&ep->base.refcnt);
  244. }
  245. /* Release a reference to an endpoint and clean up if there are
  246. * no more references.
  247. */
  248. void sctp_endpoint_put(struct sctp_endpoint *ep)
  249. {
  250. if (atomic_dec_and_test(&ep->base.refcnt))
  251. sctp_endpoint_destroy(ep);
  252. }
  253. /* Is this the endpoint we are looking for? */
  254. struct sctp_endpoint *sctp_endpoint_is_match(struct sctp_endpoint *ep,
  255. const union sctp_addr *laddr)
  256. {
  257. struct sctp_endpoint *retval = NULL;
  258. if (htons(ep->base.bind_addr.port) == laddr->v4.sin_port) {
  259. if (sctp_bind_addr_match(&ep->base.bind_addr, laddr,
  260. sctp_sk(ep->base.sk)))
  261. retval = ep;
  262. }
  263. return retval;
  264. }
  265. /* Find the association that goes with this chunk.
  266. * We do a linear search of the associations for this endpoint.
  267. * We return the matching transport address too.
  268. */
  269. static struct sctp_association *__sctp_endpoint_lookup_assoc(
  270. const struct sctp_endpoint *ep,
  271. const union sctp_addr *paddr,
  272. struct sctp_transport **transport)
  273. {
  274. struct sctp_association *asoc = NULL;
  275. struct sctp_transport *t = NULL;
  276. struct sctp_hashbucket *head;
  277. struct sctp_ep_common *epb;
  278. struct hlist_node *node;
  279. int hash;
  280. int rport;
  281. *transport = NULL;
  282. rport = ntohs(paddr->v4.sin_port);
  283. hash = sctp_assoc_hashfn(ep->base.bind_addr.port, rport);
  284. head = &sctp_assoc_hashtable[hash];
  285. read_lock(&head->lock);
  286. sctp_for_each_hentry(epb, node, &head->chain) {
  287. asoc = sctp_assoc(epb);
  288. if (asoc->ep != ep || rport != asoc->peer.port)
  289. goto next;
  290. t = sctp_assoc_lookup_paddr(asoc, paddr);
  291. if (t) {
  292. *transport = t;
  293. break;
  294. }
  295. next:
  296. asoc = NULL;
  297. }
  298. read_unlock(&head->lock);
  299. return asoc;
  300. }
  301. /* Lookup association on an endpoint based on a peer address. BH-safe. */
  302. struct sctp_association *sctp_endpoint_lookup_assoc(
  303. const struct sctp_endpoint *ep,
  304. const union sctp_addr *paddr,
  305. struct sctp_transport **transport)
  306. {
  307. struct sctp_association *asoc;
  308. sctp_local_bh_disable();
  309. asoc = __sctp_endpoint_lookup_assoc(ep, paddr, transport);
  310. sctp_local_bh_enable();
  311. return asoc;
  312. }
  313. /* Look for any peeled off association from the endpoint that matches the
  314. * given peer address.
  315. */
  316. int sctp_endpoint_is_peeled_off(struct sctp_endpoint *ep,
  317. const union sctp_addr *paddr)
  318. {
  319. struct sctp_sockaddr_entry *addr;
  320. struct sctp_bind_addr *bp;
  321. bp = &ep->base.bind_addr;
  322. /* This function is called with the socket lock held,
  323. * so the address_list can not change.
  324. */
  325. list_for_each_entry(addr, &bp->address_list, list) {
  326. if (sctp_has_association(&addr->a, paddr))
  327. return 1;
  328. }
  329. return 0;
  330. }
  331. /* Do delayed input processing. This is scheduled by sctp_rcv().
  332. * This may be called on BH or task time.
  333. */
  334. static void sctp_endpoint_bh_rcv(struct work_struct *work)
  335. {
  336. struct sctp_endpoint *ep =
  337. container_of(work, struct sctp_endpoint,
  338. base.inqueue.immediate);
  339. struct sctp_association *asoc;
  340. struct sock *sk;
  341. struct sctp_transport *transport;
  342. struct sctp_chunk *chunk;
  343. struct sctp_inq *inqueue;
  344. sctp_subtype_t subtype;
  345. sctp_state_t state;
  346. int error = 0;
  347. int first_time = 1; /* is this the first time through the looop */
  348. if (ep->base.dead)
  349. return;
  350. asoc = NULL;
  351. inqueue = &ep->base.inqueue;
  352. sk = ep->base.sk;
  353. while (NULL != (chunk = sctp_inq_pop(inqueue))) {
  354. subtype = SCTP_ST_CHUNK(chunk->chunk_hdr->type);
  355. /* If the first chunk in the packet is AUTH, do special
  356. * processing specified in Section 6.3 of SCTP-AUTH spec
  357. */
  358. if (first_time && (subtype.chunk == SCTP_CID_AUTH)) {
  359. struct sctp_chunkhdr *next_hdr;
  360. next_hdr = sctp_inq_peek(inqueue);
  361. if (!next_hdr)
  362. goto normal;
  363. /* If the next chunk is COOKIE-ECHO, skip the AUTH
  364. * chunk while saving a pointer to it so we can do
  365. * Authentication later (during cookie-echo
  366. * processing).
  367. */
  368. if (next_hdr->type == SCTP_CID_COOKIE_ECHO) {
  369. chunk->auth_chunk = skb_clone(chunk->skb,
  370. GFP_ATOMIC);
  371. chunk->auth = 1;
  372. continue;
  373. }
  374. }
  375. normal:
  376. /* We might have grown an association since last we
  377. * looked, so try again.
  378. *
  379. * This happens when we've just processed our
  380. * COOKIE-ECHO chunk.
  381. */
  382. if (NULL == chunk->asoc) {
  383. asoc = sctp_endpoint_lookup_assoc(ep,
  384. sctp_source(chunk),
  385. &transport);
  386. chunk->asoc = asoc;
  387. chunk->transport = transport;
  388. }
  389. state = asoc ? asoc->state : SCTP_STATE_CLOSED;
  390. if (sctp_auth_recv_cid(subtype.chunk, asoc) && !chunk->auth)
  391. continue;
  392. /* Remember where the last DATA chunk came from so we
  393. * know where to send the SACK.
  394. */
  395. if (asoc && sctp_chunk_is_data(chunk))
  396. asoc->peer.last_data_from = chunk->transport;
  397. else
  398. SCTP_INC_STATS(SCTP_MIB_INCTRLCHUNKS);
  399. if (chunk->transport)
  400. chunk->transport->last_time_heard = jiffies;
  401. error = sctp_do_sm(SCTP_EVENT_T_CHUNK, subtype, state,
  402. ep, asoc, chunk, GFP_ATOMIC);
  403. if (error && chunk)
  404. chunk->pdiscard = 1;
  405. /* Check to see if the endpoint is freed in response to
  406. * the incoming chunk. If so, get out of the while loop.
  407. */
  408. if (!sctp_sk(sk)->ep)
  409. break;
  410. if (first_time)
  411. first_time = 0;
  412. }
  413. }