inet_connection_sock.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701
  1. /*
  2. * INET An implementation of the TCP/IP protocol suite for the LINUX
  3. * operating system. INET is implemented using the BSD Socket
  4. * interface as the means of communication with the user level.
  5. *
  6. * Support for INET connection oriented protocols.
  7. *
  8. * Authors: See the TCP sources
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public License
  12. * as published by the Free Software Foundation; either version
  13. * 2 of the License, or(at your option) any later version.
  14. */
  15. #include <linux/module.h>
  16. #include <linux/jhash.h>
  17. #include <net/inet_connection_sock.h>
  18. #include <net/inet_hashtables.h>
  19. #include <net/inet_timewait_sock.h>
  20. #include <net/ip.h>
  21. #include <net/route.h>
  22. #include <net/tcp_states.h>
  23. #include <net/xfrm.h>
  24. #ifdef INET_CSK_DEBUG
  25. const char inet_csk_timer_bug_msg[] = "inet_csk BUG: unknown timer value\n";
  26. EXPORT_SYMBOL(inet_csk_timer_bug_msg);
  27. #endif
  28. /*
  29. * This array holds the first and last local port number.
  30. * For high-usage systems, use sysctl to change this to
  31. * 32768-61000
  32. */
  33. int sysctl_local_port_range[2] = { 1024, 4999 };
  34. int inet_csk_bind_conflict(const struct sock *sk,
  35. const struct inet_bind_bucket *tb)
  36. {
  37. const __be32 sk_rcv_saddr = inet_rcv_saddr(sk);
  38. struct sock *sk2;
  39. struct hlist_node *node;
  40. int reuse = sk->sk_reuse;
  41. sk_for_each_bound(sk2, node, &tb->owners) {
  42. if (sk != sk2 &&
  43. !inet_v6_ipv6only(sk2) &&
  44. (!sk->sk_bound_dev_if ||
  45. !sk2->sk_bound_dev_if ||
  46. sk->sk_bound_dev_if == sk2->sk_bound_dev_if)) {
  47. if (!reuse || !sk2->sk_reuse ||
  48. sk2->sk_state == TCP_LISTEN) {
  49. const __be32 sk2_rcv_saddr = inet_rcv_saddr(sk2);
  50. if (!sk2_rcv_saddr || !sk_rcv_saddr ||
  51. sk2_rcv_saddr == sk_rcv_saddr)
  52. break;
  53. }
  54. }
  55. }
  56. return node != NULL;
  57. }
  58. EXPORT_SYMBOL_GPL(inet_csk_bind_conflict);
  59. /* Obtain a reference to a local port for the given sock,
  60. * if snum is zero it means select any available local port.
  61. */
  62. int inet_csk_get_port(struct inet_hashinfo *hashinfo,
  63. struct sock *sk, unsigned short snum,
  64. int (*bind_conflict)(const struct sock *sk,
  65. const struct inet_bind_bucket *tb))
  66. {
  67. struct inet_bind_hashbucket *head;
  68. struct hlist_node *node;
  69. struct inet_bind_bucket *tb;
  70. int ret;
  71. local_bh_disable();
  72. if (!snum) {
  73. int low = sysctl_local_port_range[0];
  74. int high = sysctl_local_port_range[1];
  75. int remaining = (high - low) + 1;
  76. int rover = net_random() % (high - low) + low;
  77. do {
  78. head = &hashinfo->bhash[inet_bhashfn(rover, hashinfo->bhash_size)];
  79. spin_lock(&head->lock);
  80. inet_bind_bucket_for_each(tb, node, &head->chain)
  81. if (tb->port == rover)
  82. goto next;
  83. break;
  84. next:
  85. spin_unlock(&head->lock);
  86. if (++rover > high)
  87. rover = low;
  88. } while (--remaining > 0);
  89. /* Exhausted local port range during search? It is not
  90. * possible for us to be holding one of the bind hash
  91. * locks if this test triggers, because if 'remaining'
  92. * drops to zero, we broke out of the do/while loop at
  93. * the top level, not from the 'break;' statement.
  94. */
  95. ret = 1;
  96. if (remaining <= 0)
  97. goto fail;
  98. /* OK, here is the one we will use. HEAD is
  99. * non-NULL and we hold it's mutex.
  100. */
  101. snum = rover;
  102. } else {
  103. head = &hashinfo->bhash[inet_bhashfn(snum, hashinfo->bhash_size)];
  104. spin_lock(&head->lock);
  105. inet_bind_bucket_for_each(tb, node, &head->chain)
  106. if (tb->port == snum)
  107. goto tb_found;
  108. }
  109. tb = NULL;
  110. goto tb_not_found;
  111. tb_found:
  112. if (!hlist_empty(&tb->owners)) {
  113. if (sk->sk_reuse > 1)
  114. goto success;
  115. if (tb->fastreuse > 0 &&
  116. sk->sk_reuse && sk->sk_state != TCP_LISTEN) {
  117. goto success;
  118. } else {
  119. ret = 1;
  120. if (bind_conflict(sk, tb))
  121. goto fail_unlock;
  122. }
  123. }
  124. tb_not_found:
  125. ret = 1;
  126. if (!tb && (tb = inet_bind_bucket_create(hashinfo->bind_bucket_cachep, head, snum)) == NULL)
  127. goto fail_unlock;
  128. if (hlist_empty(&tb->owners)) {
  129. if (sk->sk_reuse && sk->sk_state != TCP_LISTEN)
  130. tb->fastreuse = 1;
  131. else
  132. tb->fastreuse = 0;
  133. } else if (tb->fastreuse &&
  134. (!sk->sk_reuse || sk->sk_state == TCP_LISTEN))
  135. tb->fastreuse = 0;
  136. success:
  137. if (!inet_csk(sk)->icsk_bind_hash)
  138. inet_bind_hash(sk, tb, snum);
  139. BUG_TRAP(inet_csk(sk)->icsk_bind_hash == tb);
  140. ret = 0;
  141. fail_unlock:
  142. spin_unlock(&head->lock);
  143. fail:
  144. local_bh_enable();
  145. return ret;
  146. }
  147. EXPORT_SYMBOL_GPL(inet_csk_get_port);
  148. /*
  149. * Wait for an incoming connection, avoid race conditions. This must be called
  150. * with the socket locked.
  151. */
  152. static int inet_csk_wait_for_connect(struct sock *sk, long timeo)
  153. {
  154. struct inet_connection_sock *icsk = inet_csk(sk);
  155. DEFINE_WAIT(wait);
  156. int err;
  157. /*
  158. * True wake-one mechanism for incoming connections: only
  159. * one process gets woken up, not the 'whole herd'.
  160. * Since we do not 'race & poll' for established sockets
  161. * anymore, the common case will execute the loop only once.
  162. *
  163. * Subtle issue: "add_wait_queue_exclusive()" will be added
  164. * after any current non-exclusive waiters, and we know that
  165. * it will always _stay_ after any new non-exclusive waiters
  166. * because all non-exclusive waiters are added at the
  167. * beginning of the wait-queue. As such, it's ok to "drop"
  168. * our exclusiveness temporarily when we get woken up without
  169. * having to remove and re-insert us on the wait queue.
  170. */
  171. for (;;) {
  172. prepare_to_wait_exclusive(sk->sk_sleep, &wait,
  173. TASK_INTERRUPTIBLE);
  174. release_sock(sk);
  175. if (reqsk_queue_empty(&icsk->icsk_accept_queue))
  176. timeo = schedule_timeout(timeo);
  177. lock_sock(sk);
  178. err = 0;
  179. if (!reqsk_queue_empty(&icsk->icsk_accept_queue))
  180. break;
  181. err = -EINVAL;
  182. if (sk->sk_state != TCP_LISTEN)
  183. break;
  184. err = sock_intr_errno(timeo);
  185. if (signal_pending(current))
  186. break;
  187. err = -EAGAIN;
  188. if (!timeo)
  189. break;
  190. }
  191. finish_wait(sk->sk_sleep, &wait);
  192. return err;
  193. }
  194. /*
  195. * This will accept the next outstanding connection.
  196. */
  197. struct sock *inet_csk_accept(struct sock *sk, int flags, int *err)
  198. {
  199. struct inet_connection_sock *icsk = inet_csk(sk);
  200. struct sock *newsk;
  201. int error;
  202. lock_sock(sk);
  203. /* We need to make sure that this socket is listening,
  204. * and that it has something pending.
  205. */
  206. error = -EINVAL;
  207. if (sk->sk_state != TCP_LISTEN)
  208. goto out_err;
  209. /* Find already established connection */
  210. if (reqsk_queue_empty(&icsk->icsk_accept_queue)) {
  211. long timeo = sock_rcvtimeo(sk, flags & O_NONBLOCK);
  212. /* If this is a non blocking socket don't sleep */
  213. error = -EAGAIN;
  214. if (!timeo)
  215. goto out_err;
  216. error = inet_csk_wait_for_connect(sk, timeo);
  217. if (error)
  218. goto out_err;
  219. }
  220. newsk = reqsk_queue_get_child(&icsk->icsk_accept_queue, sk);
  221. BUG_TRAP(newsk->sk_state != TCP_SYN_RECV);
  222. out:
  223. release_sock(sk);
  224. return newsk;
  225. out_err:
  226. newsk = NULL;
  227. *err = error;
  228. goto out;
  229. }
  230. EXPORT_SYMBOL(inet_csk_accept);
  231. /*
  232. * Using different timers for retransmit, delayed acks and probes
  233. * We may wish use just one timer maintaining a list of expire jiffies
  234. * to optimize.
  235. */
  236. void inet_csk_init_xmit_timers(struct sock *sk,
  237. void (*retransmit_handler)(unsigned long),
  238. void (*delack_handler)(unsigned long),
  239. void (*keepalive_handler)(unsigned long))
  240. {
  241. struct inet_connection_sock *icsk = inet_csk(sk);
  242. init_timer(&icsk->icsk_retransmit_timer);
  243. init_timer(&icsk->icsk_delack_timer);
  244. init_timer(&sk->sk_timer);
  245. icsk->icsk_retransmit_timer.function = retransmit_handler;
  246. icsk->icsk_delack_timer.function = delack_handler;
  247. sk->sk_timer.function = keepalive_handler;
  248. icsk->icsk_retransmit_timer.data =
  249. icsk->icsk_delack_timer.data =
  250. sk->sk_timer.data = (unsigned long)sk;
  251. icsk->icsk_pending = icsk->icsk_ack.pending = 0;
  252. }
  253. EXPORT_SYMBOL(inet_csk_init_xmit_timers);
  254. void inet_csk_clear_xmit_timers(struct sock *sk)
  255. {
  256. struct inet_connection_sock *icsk = inet_csk(sk);
  257. icsk->icsk_pending = icsk->icsk_ack.pending = icsk->icsk_ack.blocked = 0;
  258. sk_stop_timer(sk, &icsk->icsk_retransmit_timer);
  259. sk_stop_timer(sk, &icsk->icsk_delack_timer);
  260. sk_stop_timer(sk, &sk->sk_timer);
  261. }
  262. EXPORT_SYMBOL(inet_csk_clear_xmit_timers);
  263. void inet_csk_delete_keepalive_timer(struct sock *sk)
  264. {
  265. sk_stop_timer(sk, &sk->sk_timer);
  266. }
  267. EXPORT_SYMBOL(inet_csk_delete_keepalive_timer);
  268. void inet_csk_reset_keepalive_timer(struct sock *sk, unsigned long len)
  269. {
  270. sk_reset_timer(sk, &sk->sk_timer, jiffies + len);
  271. }
  272. EXPORT_SYMBOL(inet_csk_reset_keepalive_timer);
  273. struct dst_entry* inet_csk_route_req(struct sock *sk,
  274. const struct request_sock *req)
  275. {
  276. struct rtable *rt;
  277. const struct inet_request_sock *ireq = inet_rsk(req);
  278. struct ip_options *opt = inet_rsk(req)->opt;
  279. struct flowi fl = { .oif = sk->sk_bound_dev_if,
  280. .nl_u = { .ip4_u =
  281. { .daddr = ((opt && opt->srr) ?
  282. opt->faddr :
  283. ireq->rmt_addr),
  284. .saddr = ireq->loc_addr,
  285. .tos = RT_CONN_FLAGS(sk) } },
  286. .proto = sk->sk_protocol,
  287. .uli_u = { .ports =
  288. { .sport = inet_sk(sk)->sport,
  289. .dport = ireq->rmt_port } } };
  290. security_req_classify_flow(req, &fl);
  291. if (ip_route_output_flow(&rt, &fl, sk, 0)) {
  292. IP_INC_STATS_BH(IPSTATS_MIB_OUTNOROUTES);
  293. return NULL;
  294. }
  295. if (opt && opt->is_strictroute && rt->rt_dst != rt->rt_gateway) {
  296. ip_rt_put(rt);
  297. IP_INC_STATS_BH(IPSTATS_MIB_OUTNOROUTES);
  298. return NULL;
  299. }
  300. return &rt->u.dst;
  301. }
  302. EXPORT_SYMBOL_GPL(inet_csk_route_req);
  303. static inline u32 inet_synq_hash(const __be32 raddr, const __be16 rport,
  304. const u32 rnd, const u16 synq_hsize)
  305. {
  306. return jhash_2words((__force u32)raddr, (__force u32)rport, rnd) & (synq_hsize - 1);
  307. }
  308. #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
  309. #define AF_INET_FAMILY(fam) ((fam) == AF_INET)
  310. #else
  311. #define AF_INET_FAMILY(fam) 1
  312. #endif
  313. struct request_sock *inet_csk_search_req(const struct sock *sk,
  314. struct request_sock ***prevp,
  315. const __be16 rport, const __be32 raddr,
  316. const __be32 laddr)
  317. {
  318. const struct inet_connection_sock *icsk = inet_csk(sk);
  319. struct listen_sock *lopt = icsk->icsk_accept_queue.listen_opt;
  320. struct request_sock *req, **prev;
  321. for (prev = &lopt->syn_table[inet_synq_hash(raddr, rport, lopt->hash_rnd,
  322. lopt->nr_table_entries)];
  323. (req = *prev) != NULL;
  324. prev = &req->dl_next) {
  325. const struct inet_request_sock *ireq = inet_rsk(req);
  326. if (ireq->rmt_port == rport &&
  327. ireq->rmt_addr == raddr &&
  328. ireq->loc_addr == laddr &&
  329. AF_INET_FAMILY(req->rsk_ops->family)) {
  330. BUG_TRAP(!req->sk);
  331. *prevp = prev;
  332. break;
  333. }
  334. }
  335. return req;
  336. }
  337. EXPORT_SYMBOL_GPL(inet_csk_search_req);
  338. void inet_csk_reqsk_queue_hash_add(struct sock *sk, struct request_sock *req,
  339. unsigned long timeout)
  340. {
  341. struct inet_connection_sock *icsk = inet_csk(sk);
  342. struct listen_sock *lopt = icsk->icsk_accept_queue.listen_opt;
  343. const u32 h = inet_synq_hash(inet_rsk(req)->rmt_addr, inet_rsk(req)->rmt_port,
  344. lopt->hash_rnd, lopt->nr_table_entries);
  345. reqsk_queue_hash_req(&icsk->icsk_accept_queue, h, req, timeout);
  346. inet_csk_reqsk_queue_added(sk, timeout);
  347. }
  348. /* Only thing we need from tcp.h */
  349. extern int sysctl_tcp_synack_retries;
  350. EXPORT_SYMBOL_GPL(inet_csk_reqsk_queue_hash_add);
  351. void inet_csk_reqsk_queue_prune(struct sock *parent,
  352. const unsigned long interval,
  353. const unsigned long timeout,
  354. const unsigned long max_rto)
  355. {
  356. struct inet_connection_sock *icsk = inet_csk(parent);
  357. struct request_sock_queue *queue = &icsk->icsk_accept_queue;
  358. struct listen_sock *lopt = queue->listen_opt;
  359. int max_retries = icsk->icsk_syn_retries ? : sysctl_tcp_synack_retries;
  360. int thresh = max_retries;
  361. unsigned long now = jiffies;
  362. struct request_sock **reqp, *req;
  363. int i, budget;
  364. if (lopt == NULL || lopt->qlen == 0)
  365. return;
  366. /* Normally all the openreqs are young and become mature
  367. * (i.e. converted to established socket) for first timeout.
  368. * If synack was not acknowledged for 3 seconds, it means
  369. * one of the following things: synack was lost, ack was lost,
  370. * rtt is high or nobody planned to ack (i.e. synflood).
  371. * When server is a bit loaded, queue is populated with old
  372. * open requests, reducing effective size of queue.
  373. * When server is well loaded, queue size reduces to zero
  374. * after several minutes of work. It is not synflood,
  375. * it is normal operation. The solution is pruning
  376. * too old entries overriding normal timeout, when
  377. * situation becomes dangerous.
  378. *
  379. * Essentially, we reserve half of room for young
  380. * embrions; and abort old ones without pity, if old
  381. * ones are about to clog our table.
  382. */
  383. if (lopt->qlen>>(lopt->max_qlen_log-1)) {
  384. int young = (lopt->qlen_young<<1);
  385. while (thresh > 2) {
  386. if (lopt->qlen < young)
  387. break;
  388. thresh--;
  389. young <<= 1;
  390. }
  391. }
  392. if (queue->rskq_defer_accept)
  393. max_retries = queue->rskq_defer_accept;
  394. budget = 2 * (lopt->nr_table_entries / (timeout / interval));
  395. i = lopt->clock_hand;
  396. do {
  397. reqp=&lopt->syn_table[i];
  398. while ((req = *reqp) != NULL) {
  399. if (time_after_eq(now, req->expires)) {
  400. if ((req->retrans < thresh ||
  401. (inet_rsk(req)->acked && req->retrans < max_retries))
  402. && !req->rsk_ops->rtx_syn_ack(parent, req, NULL)) {
  403. unsigned long timeo;
  404. if (req->retrans++ == 0)
  405. lopt->qlen_young--;
  406. timeo = min((timeout << req->retrans), max_rto);
  407. req->expires = now + timeo;
  408. reqp = &req->dl_next;
  409. continue;
  410. }
  411. /* Drop this request */
  412. inet_csk_reqsk_queue_unlink(parent, req, reqp);
  413. reqsk_queue_removed(queue, req);
  414. reqsk_free(req);
  415. continue;
  416. }
  417. reqp = &req->dl_next;
  418. }
  419. i = (i + 1) & (lopt->nr_table_entries - 1);
  420. } while (--budget > 0);
  421. lopt->clock_hand = i;
  422. if (lopt->qlen)
  423. inet_csk_reset_keepalive_timer(parent, interval);
  424. }
  425. EXPORT_SYMBOL_GPL(inet_csk_reqsk_queue_prune);
  426. struct sock *inet_csk_clone(struct sock *sk, const struct request_sock *req,
  427. const gfp_t priority)
  428. {
  429. struct sock *newsk = sk_clone(sk, priority);
  430. if (newsk != NULL) {
  431. struct inet_connection_sock *newicsk = inet_csk(newsk);
  432. newsk->sk_state = TCP_SYN_RECV;
  433. newicsk->icsk_bind_hash = NULL;
  434. inet_sk(newsk)->dport = inet_rsk(req)->rmt_port;
  435. newsk->sk_write_space = sk_stream_write_space;
  436. newicsk->icsk_retransmits = 0;
  437. newicsk->icsk_backoff = 0;
  438. newicsk->icsk_probes_out = 0;
  439. /* Deinitialize accept_queue to trap illegal accesses. */
  440. memset(&newicsk->icsk_accept_queue, 0, sizeof(newicsk->icsk_accept_queue));
  441. security_inet_csk_clone(newsk, req);
  442. }
  443. return newsk;
  444. }
  445. EXPORT_SYMBOL_GPL(inet_csk_clone);
  446. /*
  447. * At this point, there should be no process reference to this
  448. * socket, and thus no user references at all. Therefore we
  449. * can assume the socket waitqueue is inactive and nobody will
  450. * try to jump onto it.
  451. */
  452. void inet_csk_destroy_sock(struct sock *sk)
  453. {
  454. BUG_TRAP(sk->sk_state == TCP_CLOSE);
  455. BUG_TRAP(sock_flag(sk, SOCK_DEAD));
  456. /* It cannot be in hash table! */
  457. BUG_TRAP(sk_unhashed(sk));
  458. /* If it has not 0 inet_sk(sk)->num, it must be bound */
  459. BUG_TRAP(!inet_sk(sk)->num || inet_csk(sk)->icsk_bind_hash);
  460. sk->sk_prot->destroy(sk);
  461. sk_stream_kill_queues(sk);
  462. xfrm_sk_free_policy(sk);
  463. sk_refcnt_debug_release(sk);
  464. atomic_dec(sk->sk_prot->orphan_count);
  465. sock_put(sk);
  466. }
  467. EXPORT_SYMBOL(inet_csk_destroy_sock);
  468. int inet_csk_listen_start(struct sock *sk, const int nr_table_entries)
  469. {
  470. struct inet_sock *inet = inet_sk(sk);
  471. struct inet_connection_sock *icsk = inet_csk(sk);
  472. int rc = reqsk_queue_alloc(&icsk->icsk_accept_queue, nr_table_entries);
  473. if (rc != 0)
  474. return rc;
  475. sk->sk_max_ack_backlog = 0;
  476. sk->sk_ack_backlog = 0;
  477. inet_csk_delack_init(sk);
  478. /* There is race window here: we announce ourselves listening,
  479. * but this transition is still not validated by get_port().
  480. * It is OK, because this socket enters to hash table only
  481. * after validation is complete.
  482. */
  483. sk->sk_state = TCP_LISTEN;
  484. if (!sk->sk_prot->get_port(sk, inet->num)) {
  485. inet->sport = htons(inet->num);
  486. sk_dst_reset(sk);
  487. sk->sk_prot->hash(sk);
  488. return 0;
  489. }
  490. sk->sk_state = TCP_CLOSE;
  491. __reqsk_queue_destroy(&icsk->icsk_accept_queue);
  492. return -EADDRINUSE;
  493. }
  494. EXPORT_SYMBOL_GPL(inet_csk_listen_start);
  495. /*
  496. * This routine closes sockets which have been at least partially
  497. * opened, but not yet accepted.
  498. */
  499. void inet_csk_listen_stop(struct sock *sk)
  500. {
  501. struct inet_connection_sock *icsk = inet_csk(sk);
  502. struct request_sock *acc_req;
  503. struct request_sock *req;
  504. inet_csk_delete_keepalive_timer(sk);
  505. /* make all the listen_opt local to us */
  506. acc_req = reqsk_queue_yank_acceptq(&icsk->icsk_accept_queue);
  507. /* Following specs, it would be better either to send FIN
  508. * (and enter FIN-WAIT-1, it is normal close)
  509. * or to send active reset (abort).
  510. * Certainly, it is pretty dangerous while synflood, but it is
  511. * bad justification for our negligence 8)
  512. * To be honest, we are not able to make either
  513. * of the variants now. --ANK
  514. */
  515. reqsk_queue_destroy(&icsk->icsk_accept_queue);
  516. while ((req = acc_req) != NULL) {
  517. struct sock *child = req->sk;
  518. acc_req = req->dl_next;
  519. local_bh_disable();
  520. bh_lock_sock(child);
  521. BUG_TRAP(!sock_owned_by_user(child));
  522. sock_hold(child);
  523. sk->sk_prot->disconnect(child, O_NONBLOCK);
  524. sock_orphan(child);
  525. atomic_inc(sk->sk_prot->orphan_count);
  526. inet_csk_destroy_sock(child);
  527. bh_unlock_sock(child);
  528. local_bh_enable();
  529. sock_put(child);
  530. sk_acceptq_removed(sk);
  531. __reqsk_free(req);
  532. }
  533. BUG_TRAP(!sk->sk_ack_backlog);
  534. }
  535. EXPORT_SYMBOL_GPL(inet_csk_listen_stop);
  536. void inet_csk_addr2sockaddr(struct sock *sk, struct sockaddr *uaddr)
  537. {
  538. struct sockaddr_in *sin = (struct sockaddr_in *)uaddr;
  539. const struct inet_sock *inet = inet_sk(sk);
  540. sin->sin_family = AF_INET;
  541. sin->sin_addr.s_addr = inet->daddr;
  542. sin->sin_port = inet->dport;
  543. }
  544. EXPORT_SYMBOL_GPL(inet_csk_addr2sockaddr);
  545. int inet_csk_ctl_sock_create(struct socket **sock, unsigned short family,
  546. unsigned short type, unsigned char protocol)
  547. {
  548. int rc = sock_create_kern(family, type, protocol, sock);
  549. if (rc == 0) {
  550. (*sock)->sk->sk_allocation = GFP_ATOMIC;
  551. inet_sk((*sock)->sk)->uc_ttl = -1;
  552. /*
  553. * Unhash it so that IP input processing does not even see it,
  554. * we do not wish this socket to see incoming packets.
  555. */
  556. (*sock)->sk->sk_prot->unhash((*sock)->sk);
  557. }
  558. return rc;
  559. }
  560. EXPORT_SYMBOL_GPL(inet_csk_ctl_sock_create);
  561. #ifdef CONFIG_COMPAT
  562. int inet_csk_compat_getsockopt(struct sock *sk, int level, int optname,
  563. char __user *optval, int __user *optlen)
  564. {
  565. const struct inet_connection_sock *icsk = inet_csk(sk);
  566. if (icsk->icsk_af_ops->compat_getsockopt != NULL)
  567. return icsk->icsk_af_ops->compat_getsockopt(sk, level, optname,
  568. optval, optlen);
  569. return icsk->icsk_af_ops->getsockopt(sk, level, optname,
  570. optval, optlen);
  571. }
  572. EXPORT_SYMBOL_GPL(inet_csk_compat_getsockopt);
  573. int inet_csk_compat_setsockopt(struct sock *sk, int level, int optname,
  574. char __user *optval, int optlen)
  575. {
  576. const struct inet_connection_sock *icsk = inet_csk(sk);
  577. if (icsk->icsk_af_ops->compat_setsockopt != NULL)
  578. return icsk->icsk_af_ops->compat_setsockopt(sk, level, optname,
  579. optval, optlen);
  580. return icsk->icsk_af_ops->setsockopt(sk, level, optname,
  581. optval, optlen);
  582. }
  583. EXPORT_SYMBOL_GPL(inet_csk_compat_setsockopt);
  584. #endif