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.
6 * Support for INET connection oriented protocols.
8 * Authors: See the TCP sources
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.
16 #include <linux/module.h>
17 #include <linux/jhash.h>
19 #include <net/inet_connection_sock.h>
20 #include <net/inet_hashtables.h>
21 #include <net/inet_timewait_sock.h>
23 #include <net/route.h>
24 #include <net/tcp_states.h>
28 const char inet_csk_timer_bug_msg
[] = "inet_csk BUG: unknown timer value\n";
29 EXPORT_SYMBOL(inet_csk_timer_bug_msg
);
33 * This struct holds the first and last local port number.
35 struct local_ports sysctl_local_ports __read_mostly
= {
36 .lock
= SEQLOCK_UNLOCKED
,
37 .range
= { 32768, 61000 },
40 unsigned long *sysctl_local_reserved_ports
;
41 EXPORT_SYMBOL(sysctl_local_reserved_ports
);
43 void inet_get_local_port_range(int *low
, int *high
)
47 seq
= read_seqbegin(&sysctl_local_ports
.lock
);
49 *low
= sysctl_local_ports
.range
[0];
50 *high
= sysctl_local_ports
.range
[1];
51 } while (read_seqretry(&sysctl_local_ports
.lock
, seq
));
53 EXPORT_SYMBOL(inet_get_local_port_range
);
55 int inet_csk_bind_conflict(const struct sock
*sk
,
56 const struct inet_bind_bucket
*tb
)
59 struct hlist_node
*node
;
60 int reuse
= sk
->sk_reuse
;
63 * Unlike other sk lookup places we do not check
64 * for sk_net here, since _all_ the socks listed
65 * in tb->owners list belong to the same net - the
66 * one this bucket belongs to.
69 sk_for_each_bound(sk2
, node
, &tb
->owners
) {
71 !inet_v6_ipv6only(sk2
) &&
72 (!sk
->sk_bound_dev_if
||
73 !sk2
->sk_bound_dev_if
||
74 sk
->sk_bound_dev_if
== sk2
->sk_bound_dev_if
)) {
75 if (!reuse
|| !sk2
->sk_reuse
||
76 sk2
->sk_state
== TCP_LISTEN
) {
77 const __be32 sk2_rcv_saddr
= sk_rcv_saddr(sk2
);
78 if (!sk2_rcv_saddr
|| !sk_rcv_saddr(sk
) ||
79 sk2_rcv_saddr
== sk_rcv_saddr(sk
))
86 EXPORT_SYMBOL_GPL(inet_csk_bind_conflict
);
88 /* Obtain a reference to a local port for the given sock,
89 * if snum is zero it means select any available local port.
91 int inet_csk_get_port(struct sock
*sk
, unsigned short snum
)
93 struct inet_hashinfo
*hashinfo
= sk
->sk_prot
->h
.hashinfo
;
94 struct inet_bind_hashbucket
*head
;
95 struct hlist_node
*node
;
96 struct inet_bind_bucket
*tb
;
97 int ret
, attempts
= 5;
98 struct net
*net
= sock_net(sk
);
99 int smallest_size
= -1, smallest_rover
;
103 int remaining
, rover
, low
, high
;
106 inet_get_local_port_range(&low
, &high
);
107 remaining
= (high
- low
) + 1;
108 smallest_rover
= rover
= net_random() % remaining
+ low
;
112 if (inet_is_reserved_local_port(rover
))
114 head
= &hashinfo
->bhash
[inet_bhashfn(net
, rover
,
115 hashinfo
->bhash_size
)];
116 spin_lock(&head
->lock
);
117 inet_bind_bucket_for_each(tb
, node
, &head
->chain
)
118 if (net_eq(ib_net(tb
), net
) && tb
->port
== rover
) {
119 if (tb
->fastreuse
> 0 &&
121 sk
->sk_state
!= TCP_LISTEN
&&
122 (tb
->num_owners
< smallest_size
|| smallest_size
== -1)) {
123 smallest_size
= tb
->num_owners
;
124 smallest_rover
= rover
;
125 if (atomic_read(&hashinfo
->bsockets
) > (high
- low
) + 1) {
126 spin_unlock(&head
->lock
);
127 snum
= smallest_rover
;
135 spin_unlock(&head
->lock
);
139 } while (--remaining
> 0);
141 /* Exhausted local port range during search? It is not
142 * possible for us to be holding one of the bind hash
143 * locks if this test triggers, because if 'remaining'
144 * drops to zero, we broke out of the do/while loop at
145 * the top level, not from the 'break;' statement.
148 if (remaining
<= 0) {
149 if (smallest_size
!= -1) {
150 snum
= smallest_rover
;
155 /* OK, here is the one we will use. HEAD is
156 * non-NULL and we hold it's mutex.
161 head
= &hashinfo
->bhash
[inet_bhashfn(net
, snum
,
162 hashinfo
->bhash_size
)];
163 spin_lock(&head
->lock
);
164 inet_bind_bucket_for_each(tb
, node
, &head
->chain
)
165 if (net_eq(ib_net(tb
), net
) && tb
->port
== snum
)
171 if (!hlist_empty(&tb
->owners
)) {
172 if (tb
->fastreuse
> 0 &&
173 sk
->sk_reuse
&& sk
->sk_state
!= TCP_LISTEN
&&
174 smallest_size
== -1) {
178 if (inet_csk(sk
)->icsk_af_ops
->bind_conflict(sk
, tb
)) {
179 if (sk
->sk_reuse
&& sk
->sk_state
!= TCP_LISTEN
&&
180 smallest_size
!= -1 && --attempts
>= 0) {
181 spin_unlock(&head
->lock
);
190 if (!tb
&& (tb
= inet_bind_bucket_create(hashinfo
->bind_bucket_cachep
,
191 net
, head
, snum
)) == NULL
)
193 if (hlist_empty(&tb
->owners
)) {
194 if (sk
->sk_reuse
&& sk
->sk_state
!= TCP_LISTEN
)
198 } else if (tb
->fastreuse
&&
199 (!sk
->sk_reuse
|| sk
->sk_state
== TCP_LISTEN
))
202 if (!inet_csk(sk
)->icsk_bind_hash
)
203 inet_bind_hash(sk
, tb
, snum
);
204 WARN_ON(inet_csk(sk
)->icsk_bind_hash
!= tb
);
208 spin_unlock(&head
->lock
);
213 EXPORT_SYMBOL_GPL(inet_csk_get_port
);
216 * Wait for an incoming connection, avoid race conditions. This must be called
217 * with the socket locked.
219 static int inet_csk_wait_for_connect(struct sock
*sk
, long timeo
)
221 struct inet_connection_sock
*icsk
= inet_csk(sk
);
226 * True wake-one mechanism for incoming connections: only
227 * one process gets woken up, not the 'whole herd'.
228 * Since we do not 'race & poll' for established sockets
229 * anymore, the common case will execute the loop only once.
231 * Subtle issue: "add_wait_queue_exclusive()" will be added
232 * after any current non-exclusive waiters, and we know that
233 * it will always _stay_ after any new non-exclusive waiters
234 * because all non-exclusive waiters are added at the
235 * beginning of the wait-queue. As such, it's ok to "drop"
236 * our exclusiveness temporarily when we get woken up without
237 * having to remove and re-insert us on the wait queue.
240 prepare_to_wait_exclusive(sk_sleep(sk
), &wait
,
243 if (reqsk_queue_empty(&icsk
->icsk_accept_queue
))
244 timeo
= schedule_timeout(timeo
);
247 if (!reqsk_queue_empty(&icsk
->icsk_accept_queue
))
250 if (sk
->sk_state
!= TCP_LISTEN
)
252 err
= sock_intr_errno(timeo
);
253 if (signal_pending(current
))
259 finish_wait(sk_sleep(sk
), &wait
);
264 * This will accept the next outstanding connection.
266 struct sock
*inet_csk_accept(struct sock
*sk
, int flags
, int *err
)
268 struct inet_connection_sock
*icsk
= inet_csk(sk
);
274 /* We need to make sure that this socket is listening,
275 * and that it has something pending.
278 if (sk
->sk_state
!= TCP_LISTEN
)
281 /* Find already established connection */
282 if (reqsk_queue_empty(&icsk
->icsk_accept_queue
)) {
283 long timeo
= sock_rcvtimeo(sk
, flags
& O_NONBLOCK
);
285 /* If this is a non blocking socket don't sleep */
290 error
= inet_csk_wait_for_connect(sk
, timeo
);
295 newsk
= reqsk_queue_get_child(&icsk
->icsk_accept_queue
, sk
);
296 WARN_ON(newsk
->sk_state
== TCP_SYN_RECV
);
305 EXPORT_SYMBOL(inet_csk_accept
);
308 * Using different timers for retransmit, delayed acks and probes
309 * We may wish use just one timer maintaining a list of expire jiffies
312 void inet_csk_init_xmit_timers(struct sock
*sk
,
313 void (*retransmit_handler
)(unsigned long),
314 void (*delack_handler
)(unsigned long),
315 void (*keepalive_handler
)(unsigned long))
317 struct inet_connection_sock
*icsk
= inet_csk(sk
);
319 setup_timer(&icsk
->icsk_retransmit_timer
, retransmit_handler
,
321 setup_timer(&icsk
->icsk_delack_timer
, delack_handler
,
323 setup_timer(&sk
->sk_timer
, keepalive_handler
, (unsigned long)sk
);
324 icsk
->icsk_pending
= icsk
->icsk_ack
.pending
= 0;
326 EXPORT_SYMBOL(inet_csk_init_xmit_timers
);
328 void inet_csk_clear_xmit_timers(struct sock
*sk
)
330 struct inet_connection_sock
*icsk
= inet_csk(sk
);
332 icsk
->icsk_pending
= icsk
->icsk_ack
.pending
= icsk
->icsk_ack
.blocked
= 0;
334 sk_stop_timer(sk
, &icsk
->icsk_retransmit_timer
);
335 sk_stop_timer(sk
, &icsk
->icsk_delack_timer
);
336 sk_stop_timer(sk
, &sk
->sk_timer
);
338 EXPORT_SYMBOL(inet_csk_clear_xmit_timers
);
340 void inet_csk_delete_keepalive_timer(struct sock
*sk
)
342 sk_stop_timer(sk
, &sk
->sk_timer
);
344 EXPORT_SYMBOL(inet_csk_delete_keepalive_timer
);
346 void inet_csk_reset_keepalive_timer(struct sock
*sk
, unsigned long len
)
348 sk_reset_timer(sk
, &sk
->sk_timer
, jiffies
+ len
);
350 EXPORT_SYMBOL(inet_csk_reset_keepalive_timer
);
352 struct dst_entry
*inet_csk_route_req(struct sock
*sk
,
353 const struct request_sock
*req
)
356 const struct inet_request_sock
*ireq
= inet_rsk(req
);
357 struct ip_options
*opt
= inet_rsk(req
)->opt
;
358 struct flowi4 fl4
= {
359 .flowi4_oif
= sk
->sk_bound_dev_if
,
360 .flowi4_mark
= sk
->sk_mark
,
361 .daddr
= ((opt
&& opt
->srr
) ?
362 opt
->faddr
: ireq
->rmt_addr
),
363 .saddr
= ireq
->loc_addr
,
364 .flowi4_tos
= RT_CONN_FLAGS(sk
),
365 .flowi4_proto
= sk
->sk_protocol
,
366 .flowi4_flags
= inet_sk_flowi_flags(sk
),
367 .fl4_sport
= inet_sk(sk
)->inet_sport
,
368 .fl4_dport
= ireq
->rmt_port
,
370 struct net
*net
= sock_net(sk
);
372 security_req_classify_flow(req
, flowi4_to_flowi(&fl4
));
373 rt
= ip_route_output_flow(net
, &fl4
, sk
);
376 if (opt
&& opt
->is_strictroute
&& rt
->rt_dst
!= rt
->rt_gateway
)
383 IP_INC_STATS_BH(net
, IPSTATS_MIB_OUTNOROUTES
);
386 EXPORT_SYMBOL_GPL(inet_csk_route_req
);
388 static inline u32
inet_synq_hash(const __be32 raddr
, const __be16 rport
,
389 const u32 rnd
, const u32 synq_hsize
)
391 return jhash_2words((__force u32
)raddr
, (__force u32
)rport
, rnd
) & (synq_hsize
- 1);
394 #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
395 #define AF_INET_FAMILY(fam) ((fam) == AF_INET)
397 #define AF_INET_FAMILY(fam) 1
400 struct request_sock
*inet_csk_search_req(const struct sock
*sk
,
401 struct request_sock
***prevp
,
402 const __be16 rport
, const __be32 raddr
,
405 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
406 struct listen_sock
*lopt
= icsk
->icsk_accept_queue
.listen_opt
;
407 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
);
415 if (ireq
->rmt_port
== rport
&&
416 ireq
->rmt_addr
== raddr
&&
417 ireq
->loc_addr
== laddr
&&
418 AF_INET_FAMILY(req
->rsk_ops
->family
)) {
427 EXPORT_SYMBOL_GPL(inet_csk_search_req
);
429 void inet_csk_reqsk_queue_hash_add(struct sock
*sk
, struct request_sock
*req
,
430 unsigned long timeout
)
432 struct inet_connection_sock
*icsk
= inet_csk(sk
);
433 struct listen_sock
*lopt
= icsk
->icsk_accept_queue
.listen_opt
;
434 const u32 h
= inet_synq_hash(inet_rsk(req
)->rmt_addr
, inet_rsk(req
)->rmt_port
,
435 lopt
->hash_rnd
, lopt
->nr_table_entries
);
437 reqsk_queue_hash_req(&icsk
->icsk_accept_queue
, h
, req
, timeout
);
438 inet_csk_reqsk_queue_added(sk
, timeout
);
440 EXPORT_SYMBOL_GPL(inet_csk_reqsk_queue_hash_add
);
442 /* Only thing we need from tcp.h */
443 extern int sysctl_tcp_synack_retries
;
446 /* Decide when to expire the request and when to resend SYN-ACK */
447 static inline void syn_ack_recalc(struct request_sock
*req
, const int thresh
,
448 const int max_retries
,
449 const u8 rskq_defer_accept
,
450 int *expire
, int *resend
)
452 if (!rskq_defer_accept
) {
453 *expire
= req
->retrans
>= thresh
;
457 *expire
= req
->retrans
>= thresh
&&
458 (!inet_rsk(req
)->acked
|| req
->retrans
>= max_retries
);
460 * Do not resend while waiting for data after ACK,
461 * start to resend on end of deferring period to give
462 * last chance for data or ACK to create established socket.
464 *resend
= !inet_rsk(req
)->acked
||
465 req
->retrans
>= rskq_defer_accept
- 1;
468 void inet_csk_reqsk_queue_prune(struct sock
*parent
,
469 const unsigned long interval
,
470 const unsigned long timeout
,
471 const unsigned long max_rto
)
473 struct inet_connection_sock
*icsk
= inet_csk(parent
);
474 struct request_sock_queue
*queue
= &icsk
->icsk_accept_queue
;
475 struct listen_sock
*lopt
= queue
->listen_opt
;
476 int max_retries
= icsk
->icsk_syn_retries
? : sysctl_tcp_synack_retries
;
477 int thresh
= max_retries
;
478 unsigned long now
= jiffies
;
479 struct request_sock
**reqp
, *req
;
482 if (lopt
== NULL
|| lopt
->qlen
== 0)
485 /* Normally all the openreqs are young and become mature
486 * (i.e. converted to established socket) for first timeout.
487 * If synack was not acknowledged for 3 seconds, it means
488 * one of the following things: synack was lost, ack was lost,
489 * rtt is high or nobody planned to ack (i.e. synflood).
490 * When server is a bit loaded, queue is populated with old
491 * open requests, reducing effective size of queue.
492 * When server is well loaded, queue size reduces to zero
493 * after several minutes of work. It is not synflood,
494 * it is normal operation. The solution is pruning
495 * too old entries overriding normal timeout, when
496 * situation becomes dangerous.
498 * Essentially, we reserve half of room for young
499 * embrions; and abort old ones without pity, if old
500 * ones are about to clog our table.
502 if (lopt
->qlen
>>(lopt
->max_qlen_log
-1)) {
503 int young
= (lopt
->qlen_young
<<1);
506 if (lopt
->qlen
< young
)
513 if (queue
->rskq_defer_accept
)
514 max_retries
= queue
->rskq_defer_accept
;
516 budget
= 2 * (lopt
->nr_table_entries
/ (timeout
/ interval
));
517 i
= lopt
->clock_hand
;
520 reqp
=&lopt
->syn_table
[i
];
521 while ((req
= *reqp
) != NULL
) {
522 if (time_after_eq(now
, req
->expires
)) {
523 int expire
= 0, resend
= 0;
525 syn_ack_recalc(req
, thresh
, max_retries
,
526 queue
->rskq_defer_accept
,
528 if (req
->rsk_ops
->syn_ack_timeout
)
529 req
->rsk_ops
->syn_ack_timeout(parent
, req
);
532 !req
->rsk_ops
->rtx_syn_ack(parent
, req
, NULL
) ||
533 inet_rsk(req
)->acked
)) {
536 if (req
->retrans
++ == 0)
538 timeo
= min((timeout
<< req
->retrans
), max_rto
);
539 req
->expires
= now
+ timeo
;
540 reqp
= &req
->dl_next
;
544 /* Drop this request */
545 inet_csk_reqsk_queue_unlink(parent
, req
, reqp
);
546 reqsk_queue_removed(queue
, req
);
550 reqp
= &req
->dl_next
;
553 i
= (i
+ 1) & (lopt
->nr_table_entries
- 1);
555 } while (--budget
> 0);
557 lopt
->clock_hand
= i
;
560 inet_csk_reset_keepalive_timer(parent
, interval
);
562 EXPORT_SYMBOL_GPL(inet_csk_reqsk_queue_prune
);
564 struct sock
*inet_csk_clone(struct sock
*sk
, const struct request_sock
*req
,
565 const gfp_t priority
)
567 struct sock
*newsk
= sk_clone(sk
, priority
);
570 struct inet_connection_sock
*newicsk
= inet_csk(newsk
);
572 newsk
->sk_state
= TCP_SYN_RECV
;
573 newicsk
->icsk_bind_hash
= NULL
;
575 inet_sk(newsk
)->inet_dport
= inet_rsk(req
)->rmt_port
;
576 inet_sk(newsk
)->inet_num
= ntohs(inet_rsk(req
)->loc_port
);
577 inet_sk(newsk
)->inet_sport
= inet_rsk(req
)->loc_port
;
578 newsk
->sk_write_space
= sk_stream_write_space
;
580 newicsk
->icsk_retransmits
= 0;
581 newicsk
->icsk_backoff
= 0;
582 newicsk
->icsk_probes_out
= 0;
584 /* Deinitialize accept_queue to trap illegal accesses. */
585 memset(&newicsk
->icsk_accept_queue
, 0, sizeof(newicsk
->icsk_accept_queue
));
587 security_inet_csk_clone(newsk
, req
);
591 EXPORT_SYMBOL_GPL(inet_csk_clone
);
594 * At this point, there should be no process reference to this
595 * socket, and thus no user references at all. Therefore we
596 * can assume the socket waitqueue is inactive and nobody will
597 * try to jump onto it.
599 void inet_csk_destroy_sock(struct sock
*sk
)
601 WARN_ON(sk
->sk_state
!= TCP_CLOSE
);
602 WARN_ON(!sock_flag(sk
, SOCK_DEAD
));
604 /* It cannot be in hash table! */
605 WARN_ON(!sk_unhashed(sk
));
607 /* If it has not 0 inet_sk(sk)->inet_num, it must be bound */
608 WARN_ON(inet_sk(sk
)->inet_num
&& !inet_csk(sk
)->icsk_bind_hash
);
610 sk
->sk_prot
->destroy(sk
);
612 sk_stream_kill_queues(sk
);
614 xfrm_sk_free_policy(sk
);
616 sk_refcnt_debug_release(sk
);
618 percpu_counter_dec(sk
->sk_prot
->orphan_count
);
621 EXPORT_SYMBOL(inet_csk_destroy_sock
);
623 int inet_csk_listen_start(struct sock
*sk
, const int nr_table_entries
)
625 struct inet_sock
*inet
= inet_sk(sk
);
626 struct inet_connection_sock
*icsk
= inet_csk(sk
);
627 int rc
= reqsk_queue_alloc(&icsk
->icsk_accept_queue
, nr_table_entries
);
632 sk
->sk_max_ack_backlog
= 0;
633 sk
->sk_ack_backlog
= 0;
634 inet_csk_delack_init(sk
);
636 /* There is race window here: we announce ourselves listening,
637 * but this transition is still not validated by get_port().
638 * It is OK, because this socket enters to hash table only
639 * after validation is complete.
641 sk
->sk_state
= TCP_LISTEN
;
642 if (!sk
->sk_prot
->get_port(sk
, inet
->inet_num
)) {
643 inet
->inet_sport
= htons(inet
->inet_num
);
646 sk
->sk_prot
->hash(sk
);
651 sk
->sk_state
= TCP_CLOSE
;
652 __reqsk_queue_destroy(&icsk
->icsk_accept_queue
);
655 EXPORT_SYMBOL_GPL(inet_csk_listen_start
);
658 * This routine closes sockets which have been at least partially
659 * opened, but not yet accepted.
661 void inet_csk_listen_stop(struct sock
*sk
)
663 struct inet_connection_sock
*icsk
= inet_csk(sk
);
664 struct request_sock
*acc_req
;
665 struct request_sock
*req
;
667 inet_csk_delete_keepalive_timer(sk
);
669 /* make all the listen_opt local to us */
670 acc_req
= reqsk_queue_yank_acceptq(&icsk
->icsk_accept_queue
);
672 /* Following specs, it would be better either to send FIN
673 * (and enter FIN-WAIT-1, it is normal close)
674 * or to send active reset (abort).
675 * Certainly, it is pretty dangerous while synflood, but it is
676 * bad justification for our negligence 8)
677 * To be honest, we are not able to make either
678 * of the variants now. --ANK
680 reqsk_queue_destroy(&icsk
->icsk_accept_queue
);
682 while ((req
= acc_req
) != NULL
) {
683 struct sock
*child
= req
->sk
;
685 acc_req
= req
->dl_next
;
689 WARN_ON(sock_owned_by_user(child
));
692 sk
->sk_prot
->disconnect(child
, O_NONBLOCK
);
696 percpu_counter_inc(sk
->sk_prot
->orphan_count
);
698 inet_csk_destroy_sock(child
);
700 bh_unlock_sock(child
);
704 sk_acceptq_removed(sk
);
707 WARN_ON(sk
->sk_ack_backlog
);
709 EXPORT_SYMBOL_GPL(inet_csk_listen_stop
);
711 void inet_csk_addr2sockaddr(struct sock
*sk
, struct sockaddr
*uaddr
)
713 struct sockaddr_in
*sin
= (struct sockaddr_in
*)uaddr
;
714 const struct inet_sock
*inet
= inet_sk(sk
);
716 sin
->sin_family
= AF_INET
;
717 sin
->sin_addr
.s_addr
= inet
->inet_daddr
;
718 sin
->sin_port
= inet
->inet_dport
;
720 EXPORT_SYMBOL_GPL(inet_csk_addr2sockaddr
);
723 int inet_csk_compat_getsockopt(struct sock
*sk
, int level
, int optname
,
724 char __user
*optval
, int __user
*optlen
)
726 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
728 if (icsk
->icsk_af_ops
->compat_getsockopt
!= NULL
)
729 return icsk
->icsk_af_ops
->compat_getsockopt(sk
, level
, optname
,
731 return icsk
->icsk_af_ops
->getsockopt(sk
, level
, optname
,
734 EXPORT_SYMBOL_GPL(inet_csk_compat_getsockopt
);
736 int inet_csk_compat_setsockopt(struct sock
*sk
, int level
, int optname
,
737 char __user
*optval
, unsigned int optlen
)
739 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
741 if (icsk
->icsk_af_ops
->compat_setsockopt
!= NULL
)
742 return icsk
->icsk_af_ops
->compat_setsockopt(sk
, level
, optname
,
744 return icsk
->icsk_af_ops
->setsockopt(sk
, level
, optname
,
747 EXPORT_SYMBOL_GPL(inet_csk_compat_setsockopt
);