inet_connection_sock.c 22 KB

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