inet_connection_sock.c 23 KB

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