Loading include/net/ip6_fib.h +0 −4 Original line number Diff line number Diff line Loading @@ -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); Loading net/ipv4/cipso_ipv4.c +1 −1 Original line number Diff line number Diff line Loading @@ -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 */ Loading net/ipv4/fib_rules.c +2 −2 Original line number Diff line number Diff line Loading @@ -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; Loading net/ipv6/fib6_rules.c +2 −2 Original line number Diff line number Diff line Loading @@ -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; Loading net/ipv6/ip6_fib.c +3 −3 Original line number Diff line number Diff line Loading @@ -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) { Loading Loading
include/net/ip6_fib.h +0 −4 Original line number Diff line number Diff line Loading @@ -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); Loading
net/ipv4/cipso_ipv4.c +1 −1 Original line number Diff line number Diff line Loading @@ -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 */ Loading
net/ipv4/fib_rules.c +2 −2 Original line number Diff line number Diff line Loading @@ -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; Loading
net/ipv6/fib6_rules.c +2 −2 Original line number Diff line number Diff line Loading @@ -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; Loading
net/ipv6/ip6_fib.c +3 −3 Original line number Diff line number Diff line Loading @@ -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) { Loading