aboutsummaryrefslogtreecommitdiffstats
path: root/net/core/sock.c
diff options
context:
space:
mode:
authorPavel Emelyanov <xemul@openvz.org>2008-03-28 19:38:17 -0400
committerDavid S. Miller <davem@davemloft.net>2008-03-28 19:38:17 -0400
commit13ff3d6fa4e6d8b6ee7c64245a0078e6a0e6f977 (patch)
treec52580ac89aff1b4eabbd94e6cb73af15e91051f /net/core/sock.c
parentbc578a54f0fd489d0722303f9a52508495ccaf9a (diff)
[SOCK]: Enumerate struct proto-s to facilitate percpu inuse accounting (v2).
The inuse counters are going to become a per-cpu array. Introduce an index for this array on the struct proto. To handle the case of proto register-unregister-register loop the bitmap is used. All its bits manipulations are protected with proto_list_lock and a sanity check for the bitmap being exhausted is also added. Signed-off-by: Pavel Emelyanov <xemul@openvz.org> Acked-by: Eric Dumazet <dada1@cosmosbay.com> Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'net/core/sock.c')
-rw-r--r--net/core/sock.c34
1 files changed, 34 insertions, 0 deletions
diff --git a/net/core/sock.c b/net/core/sock.c
index 3ee95060dbd0..7d2c8add5f5a 100644
--- a/net/core/sock.c
+++ b/net/core/sock.c
@@ -1940,6 +1940,38 @@ EXPORT_SYMBOL(sk_common_release);
1940static DEFINE_RWLOCK(proto_list_lock); 1940static DEFINE_RWLOCK(proto_list_lock);
1941static LIST_HEAD(proto_list); 1941static LIST_HEAD(proto_list);
1942 1942
1943#ifdef CONFIG_PROC_FS
1944#define PROTO_INUSE_NR 64 /* should be enough for the first time */
1945
1946static DECLARE_BITMAP(proto_inuse_idx, PROTO_INUSE_NR);
1947
1948static void assign_proto_idx(struct proto *prot)
1949{
1950 prot->inuse_idx = find_first_zero_bit(proto_inuse_idx, PROTO_INUSE_NR);
1951
1952 if (unlikely(prot->inuse_idx == PROTO_INUSE_NR - 1)) {
1953 printk(KERN_ERR "PROTO_INUSE_NR exhausted\n");
1954 return;
1955 }
1956
1957 set_bit(prot->inuse_idx, proto_inuse_idx);
1958}
1959
1960static void release_proto_idx(struct proto *prot)
1961{
1962 if (prot->inuse_idx != PROTO_INUSE_NR - 1)
1963 clear_bit(prot->inuse_idx, proto_inuse_idx);
1964}
1965#else
1966static inline void assign_proto_idx(struct proto *prot)
1967{
1968}
1969
1970static inline void release_proto_idx(struct proto *prot)
1971{
1972}
1973#endif
1974
1943int proto_register(struct proto *prot, int alloc_slab) 1975int proto_register(struct proto *prot, int alloc_slab)
1944{ 1976{
1945 char *request_sock_slab_name = NULL; 1977 char *request_sock_slab_name = NULL;
@@ -2000,6 +2032,7 @@ int proto_register(struct proto *prot, int alloc_slab)
2000 2032
2001 write_lock(&proto_list_lock); 2033 write_lock(&proto_list_lock);
2002 list_add(&prot->node, &proto_list); 2034 list_add(&prot->node, &proto_list);
2035 assign_proto_idx(prot);
2003 write_unlock(&proto_list_lock); 2036 write_unlock(&proto_list_lock);
2004 return 0; 2037 return 0;
2005 2038
@@ -2026,6 +2059,7 @@ EXPORT_SYMBOL(proto_register);
2026void proto_unregister(struct proto *prot) 2059void proto_unregister(struct proto *prot)
2027{ 2060{
2028 write_lock(&proto_list_lock); 2061 write_lock(&proto_list_lock);
2062 release_proto_idx(prot);
2029 list_del(&prot->node); 2063 list_del(&prot->node);
2030 write_unlock(&proto_list_lock); 2064 write_unlock(&proto_list_lock);
2031 2065