inet_connection_sock.c 19 KB

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