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 * Generic INET6 transport hashtables
8 * Authors: Lotsa people, from code originally in tcp, generalised here
9 * by Arnaldo Carvalho de Melo <acme@mandriva.com>
11 * This program is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU General Public License
13 * as published by the Free Software Foundation; either version
14 * 2 of the License, or (at your option) any later version.
17 #include <linux/module.h>
18 #include <linux/random.h>
20 #include <net/inet_connection_sock.h>
21 #include <net/inet_hashtables.h>
22 #include <net/inet6_hashtables.h>
25 void __inet6_hash(struct inet_hashinfo
*hashinfo
,
28 struct hlist_head
*list
;
31 BUG_TRAP(sk_unhashed(sk
));
33 if (sk
->sk_state
== TCP_LISTEN
) {
34 list
= &hashinfo
->listening_hash
[inet_sk_listen_hashfn(sk
)];
35 lock
= &hashinfo
->lhash_lock
;
36 inet_listen_wlock(hashinfo
);
39 sk
->sk_hash
= hash
= inet6_sk_ehashfn(sk
);
40 list
= &inet_ehash_bucket(hashinfo
, hash
)->chain
;
41 lock
= inet_ehash_lockp(hashinfo
, hash
);
45 __sk_add_node(sk
, list
);
46 sock_prot_inc_use(sk
->sk_prot
);
49 EXPORT_SYMBOL(__inet6_hash
);
52 * Sockets in TCP_CLOSE state are _always_ taken out of the hash, so
53 * we need not check it for TCP lookups anymore, thanks Alexey. -DaveM
55 * The sockhash lock must be held as a reader here.
57 struct sock
*__inet6_lookup_established(struct inet_hashinfo
*hashinfo
,
58 const struct in6_addr
*saddr
,
60 const struct in6_addr
*daddr
,
65 const struct hlist_node
*node
;
66 const __portpair ports
= INET_COMBINED_PORTS(sport
, hnum
);
67 /* Optimize here for direct hit, only listening connections can
68 * have wildcards anyways.
70 unsigned int hash
= inet6_ehashfn(daddr
, hnum
, saddr
, sport
);
71 struct inet_ehash_bucket
*head
= inet_ehash_bucket(hashinfo
, hash
);
72 rwlock_t
*lock
= inet_ehash_lockp(hashinfo
, hash
);
74 prefetch(head
->chain
.first
);
76 sk_for_each(sk
, node
, &head
->chain
) {
77 /* For IPV6 do the cheaper port and family tests first. */
78 if (INET6_MATCH(sk
, hash
, saddr
, daddr
, ports
, dif
))
79 goto hit
; /* You sunk my battleship! */
81 /* Must check for a TIME_WAIT'er before going to listener hash. */
82 sk_for_each(sk
, node
, &head
->twchain
) {
83 const struct inet_timewait_sock
*tw
= inet_twsk(sk
);
85 if(*((__portpair
*)&(tw
->tw_dport
)) == ports
&&
86 sk
->sk_family
== PF_INET6
) {
87 const struct inet6_timewait_sock
*tw6
= inet6_twsk(sk
);
89 if (ipv6_addr_equal(&tw6
->tw_v6_daddr
, saddr
) &&
90 ipv6_addr_equal(&tw6
->tw_v6_rcv_saddr
, daddr
) &&
91 (!sk
->sk_bound_dev_if
|| sk
->sk_bound_dev_if
== dif
))
103 EXPORT_SYMBOL(__inet6_lookup_established
);
105 struct sock
*inet6_lookup_listener(struct inet_hashinfo
*hashinfo
,
106 const struct in6_addr
*daddr
,
107 const unsigned short hnum
, const int dif
)
110 const struct hlist_node
*node
;
111 struct sock
*result
= NULL
;
112 int score
, hiscore
= 0;
114 read_lock(&hashinfo
->lhash_lock
);
115 sk_for_each(sk
, node
, &hashinfo
->listening_hash
[inet_lhashfn(hnum
)]) {
116 if (inet_sk(sk
)->num
== hnum
&& sk
->sk_family
== PF_INET6
) {
117 const struct ipv6_pinfo
*np
= inet6_sk(sk
);
120 if (!ipv6_addr_any(&np
->rcv_saddr
)) {
121 if (!ipv6_addr_equal(&np
->rcv_saddr
, daddr
))
125 if (sk
->sk_bound_dev_if
) {
126 if (sk
->sk_bound_dev_if
!= dif
)
134 if (score
> hiscore
) {
142 read_unlock(&hashinfo
->lhash_lock
);
146 EXPORT_SYMBOL_GPL(inet6_lookup_listener
);
148 struct sock
*inet6_lookup(struct inet_hashinfo
*hashinfo
,
149 const struct in6_addr
*saddr
, const __be16 sport
,
150 const struct in6_addr
*daddr
, const __be16 dport
,
156 sk
= __inet6_lookup(hashinfo
, saddr
, sport
, daddr
, ntohs(dport
), dif
);
162 EXPORT_SYMBOL_GPL(inet6_lookup
);
164 static int __inet6_check_established(struct inet_timewait_death_row
*death_row
,
165 struct sock
*sk
, const __u16 lport
,
166 struct inet_timewait_sock
**twp
)
168 struct inet_hashinfo
*hinfo
= death_row
->hashinfo
;
169 struct inet_sock
*inet
= inet_sk(sk
);
170 const struct ipv6_pinfo
*np
= inet6_sk(sk
);
171 const struct in6_addr
*daddr
= &np
->rcv_saddr
;
172 const struct in6_addr
*saddr
= &np
->daddr
;
173 const int dif
= sk
->sk_bound_dev_if
;
174 const __portpair ports
= INET_COMBINED_PORTS(inet
->dport
, lport
);
175 const unsigned int hash
= inet6_ehashfn(daddr
, lport
, saddr
,
177 struct inet_ehash_bucket
*head
= inet_ehash_bucket(hinfo
, hash
);
178 rwlock_t
*lock
= inet_ehash_lockp(hinfo
, hash
);
180 const struct hlist_node
*node
;
181 struct inet_timewait_sock
*tw
;
183 prefetch(head
->chain
.first
);
186 /* Check TIME-WAIT sockets first. */
187 sk_for_each(sk2
, node
, &head
->twchain
) {
188 const struct inet6_timewait_sock
*tw6
= inet6_twsk(sk2
);
192 if(*((__portpair
*)&(tw
->tw_dport
)) == ports
&&
193 sk2
->sk_family
== PF_INET6
&&
194 ipv6_addr_equal(&tw6
->tw_v6_daddr
, saddr
) &&
195 ipv6_addr_equal(&tw6
->tw_v6_rcv_saddr
, daddr
) &&
196 sk2
->sk_bound_dev_if
== sk
->sk_bound_dev_if
) {
197 if (twsk_unique(sk
, sk2
, twp
))
205 /* And established part... */
206 sk_for_each(sk2
, node
, &head
->chain
) {
207 if (INET6_MATCH(sk2
, hash
, saddr
, daddr
, ports
, dif
))
212 /* Must record num and sport now. Otherwise we will see
213 * in hash table socket with a funny identity. */
215 inet
->sport
= htons(lport
);
216 BUG_TRAP(sk_unhashed(sk
));
217 __sk_add_node(sk
, &head
->chain
);
219 sock_prot_inc_use(sk
->sk_prot
);
224 NET_INC_STATS_BH(LINUX_MIB_TIMEWAITRECYCLED
);
225 } else if (tw
!= NULL
) {
226 /* Silly. Should hash-dance instead... */
227 inet_twsk_deschedule(tw
, death_row
);
228 NET_INC_STATS_BH(LINUX_MIB_TIMEWAITRECYCLED
);
236 return -EADDRNOTAVAIL
;
239 static inline u32
inet6_sk_port_offset(const struct sock
*sk
)
241 const struct inet_sock
*inet
= inet_sk(sk
);
242 const struct ipv6_pinfo
*np
= inet6_sk(sk
);
243 return secure_ipv6_port_ephemeral(np
->rcv_saddr
.s6_addr32
,
248 int inet6_hash_connect(struct inet_timewait_death_row
*death_row
,
251 struct inet_hashinfo
*hinfo
= death_row
->hashinfo
;
252 const unsigned short snum
= inet_sk(sk
)->num
;
253 struct inet_bind_hashbucket
*head
;
254 struct inet_bind_bucket
*tb
;
258 int i
, port
, low
, high
, remaining
;
260 const u32 offset
= hint
+ inet6_sk_port_offset(sk
);
261 struct hlist_node
*node
;
262 struct inet_timewait_sock
*tw
= NULL
;
264 inet_get_local_port_range(&low
, &high
);
265 remaining
= (high
- low
) + 1;
268 for (i
= 1; i
<= remaining
; i
++) {
269 port
= low
+ (i
+ offset
) % remaining
;
270 head
= &hinfo
->bhash
[inet_bhashfn(port
, hinfo
->bhash_size
)];
271 spin_lock(&head
->lock
);
273 /* Does not bother with rcv_saddr checks,
274 * because the established check is already
277 inet_bind_bucket_for_each(tb
, node
, &head
->chain
) {
278 if (tb
->port
== port
) {
279 BUG_TRAP(!hlist_empty(&tb
->owners
));
280 if (tb
->fastreuse
>= 0)
282 if (!__inet6_check_established(death_row
,
290 tb
= inet_bind_bucket_create(hinfo
->bind_bucket_cachep
,
293 spin_unlock(&head
->lock
);
300 spin_unlock(&head
->lock
);
304 return -EADDRNOTAVAIL
;
309 /* Head lock still held and bh's disabled */
310 inet_bind_hash(sk
, tb
, port
);
311 if (sk_unhashed(sk
)) {
312 inet_sk(sk
)->sport
= htons(port
);
313 __inet6_hash(hinfo
, sk
);
315 spin_unlock(&head
->lock
);
318 inet_twsk_deschedule(tw
, death_row
);
326 head
= &hinfo
->bhash
[inet_bhashfn(snum
, hinfo
->bhash_size
)];
327 tb
= inet_csk(sk
)->icsk_bind_hash
;
328 spin_lock_bh(&head
->lock
);
330 if (sk_head(&tb
->owners
) == sk
&& sk
->sk_bind_node
.next
== NULL
) {
331 __inet6_hash(hinfo
, sk
);
332 spin_unlock_bh(&head
->lock
);
335 spin_unlock(&head
->lock
);
336 /* No definite answer... Walk to established hash table */
337 ret
= __inet6_check_established(death_row
, sk
, snum
, NULL
);
344 EXPORT_SYMBOL_GPL(inet6_hash_connect
);