forked from Minki/linux
[NET]: Make code static.
This patch makes needlessly global code static. Signed-off-by: Adrian Bunk <bunk@stusta.de> Signed-off-by: David S. Miller <davem@davemloft.net>
This commit is contained in:
parent
e6242e928e
commit
8ce11e6a9f
@ -192,10 +192,6 @@ struct fib6_node *fib6_locate(struct fib6_node *root,
|
||||
struct in6_addr *daddr, int dst_len,
|
||||
struct in6_addr *saddr, int src_len);
|
||||
|
||||
extern void fib6_clean_tree(struct fib6_node *root,
|
||||
int (*func)(struct rt6_info *, void *arg),
|
||||
int prune, void *arg);
|
||||
|
||||
extern void fib6_clean_all(int (*func)(struct rt6_info *, void *arg),
|
||||
int prune, void *arg);
|
||||
|
||||
|
@ -60,7 +60,7 @@ struct cipso_v4_domhsh_entry {
|
||||
* if in practice there are a lot of different DOIs this list should
|
||||
* probably be turned into a hash table or something similar so we
|
||||
* can do quick lookups. */
|
||||
DEFINE_SPINLOCK(cipso_v4_doi_list_lock);
|
||||
static DEFINE_SPINLOCK(cipso_v4_doi_list_lock);
|
||||
static struct list_head cipso_v4_doi_list = LIST_HEAD_INIT(cipso_v4_doi_list);
|
||||
|
||||
/* Label mapping cache */
|
||||
|
@ -101,8 +101,8 @@ int fib_lookup(struct flowi *flp, struct fib_result *res)
|
||||
return err;
|
||||
}
|
||||
|
||||
int fib4_rule_action(struct fib_rule *rule, struct flowi *flp, int flags,
|
||||
struct fib_lookup_arg *arg)
|
||||
static int fib4_rule_action(struct fib_rule *rule, struct flowi *flp,
|
||||
int flags, struct fib_lookup_arg *arg)
|
||||
{
|
||||
int err = -EAGAIN;
|
||||
struct fib_table *tbl;
|
||||
|
@ -66,7 +66,7 @@ struct dst_entry *fib6_rule_lookup(struct flowi *fl, int flags,
|
||||
return (struct dst_entry *) arg.result;
|
||||
}
|
||||
|
||||
int fib6_rule_action(struct fib_rule *rule, struct flowi *flp,
|
||||
static int fib6_rule_action(struct fib_rule *rule, struct flowi *flp,
|
||||
int flags, struct fib_lookup_arg *arg)
|
||||
{
|
||||
struct rt6_info *rt = NULL;
|
||||
|
@ -1169,7 +1169,7 @@ static int fib6_clean_node(struct fib6_walker_t *w)
|
||||
* ignoring pure split nodes) will be scanned.
|
||||
*/
|
||||
|
||||
void fib6_clean_tree(struct fib6_node *root,
|
||||
static void fib6_clean_tree(struct fib6_node *root,
|
||||
int (*func)(struct rt6_info *, void *arg),
|
||||
int prune, void *arg)
|
||||
{
|
||||
|
@ -613,8 +613,8 @@ static struct rt6_info *rt6_alloc_clone(struct rt6_info *ort, struct in6_addr *d
|
||||
return rt;
|
||||
}
|
||||
|
||||
struct rt6_info *ip6_pol_route_input(struct fib6_table *table, struct flowi *fl,
|
||||
int flags)
|
||||
static struct rt6_info *ip6_pol_route_input(struct fib6_table *table,
|
||||
struct flowi *fl, int flags)
|
||||
{
|
||||
struct fib6_node *fn;
|
||||
struct rt6_info *rt, *nrt;
|
||||
@ -872,7 +872,7 @@ static inline unsigned int ipv6_advmss(unsigned int mtu)
|
||||
}
|
||||
|
||||
static struct dst_entry *ndisc_dst_gc_list;
|
||||
DEFINE_SPINLOCK(ndisc_lock);
|
||||
static DEFINE_SPINLOCK(ndisc_lock);
|
||||
|
||||
struct dst_entry *ndisc_dst_alloc(struct net_device *dev,
|
||||
struct neighbour *neigh,
|
||||
|
@ -50,11 +50,11 @@ struct netlbl_domhsh_tbl {
|
||||
/* Domain hash table */
|
||||
/* XXX - updates should be so rare that having one spinlock for the entire
|
||||
* hash table should be okay */
|
||||
DEFINE_SPINLOCK(netlbl_domhsh_lock);
|
||||
static DEFINE_SPINLOCK(netlbl_domhsh_lock);
|
||||
static struct netlbl_domhsh_tbl *netlbl_domhsh = NULL;
|
||||
|
||||
/* Default domain mapping */
|
||||
DEFINE_SPINLOCK(netlbl_domhsh_def_lock);
|
||||
static DEFINE_SPINLOCK(netlbl_domhsh_def_lock);
|
||||
static struct netlbl_dom_map *netlbl_domhsh_def = NULL;
|
||||
|
||||
/*
|
||||
|
Loading…
Reference in New Issue
Block a user