2 * net/core/fib_rules.c Generic Routing Rules
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License as
6 * published by the Free Software Foundation, version 2.
8 * Authors: Thomas Graf <tgraf@suug.ch>
11 #include <linux/types.h>
12 #include <linux/kernel.h>
13 #include <linux/list.h>
14 #include <net/fib_rules.h>
16 static LIST_HEAD(rules_ops
);
17 static DEFINE_SPINLOCK(rules_mod_lock
);
19 static void notify_rule_change(int event
, struct fib_rule
*rule
,
20 struct fib_rules_ops
*ops
, struct nlmsghdr
*nlh
,
23 static struct fib_rules_ops
*lookup_rules_ops(int family
)
25 struct fib_rules_ops
*ops
;
28 list_for_each_entry_rcu(ops
, &rules_ops
, list
) {
29 if (ops
->family
== family
) {
30 if (!try_module_get(ops
->owner
))
41 static void rules_ops_put(struct fib_rules_ops
*ops
)
44 module_put(ops
->owner
);
47 int fib_rules_register(struct fib_rules_ops
*ops
)
50 struct fib_rules_ops
*o
;
52 if (ops
->rule_size
< sizeof(struct fib_rule
))
55 if (ops
->match
== NULL
|| ops
->configure
== NULL
||
56 ops
->compare
== NULL
|| ops
->fill
== NULL
||
60 spin_lock(&rules_mod_lock
);
61 list_for_each_entry(o
, &rules_ops
, list
)
62 if (ops
->family
== o
->family
)
65 list_add_tail_rcu(&ops
->list
, &rules_ops
);
68 spin_unlock(&rules_mod_lock
);
73 EXPORT_SYMBOL_GPL(fib_rules_register
);
75 static void cleanup_ops(struct fib_rules_ops
*ops
)
77 struct fib_rule
*rule
, *tmp
;
79 list_for_each_entry_safe(rule
, tmp
, ops
->rules_list
, list
) {
80 list_del_rcu(&rule
->list
);
85 int fib_rules_unregister(struct fib_rules_ops
*ops
)
88 struct fib_rules_ops
*o
;
90 spin_lock(&rules_mod_lock
);
91 list_for_each_entry(o
, &rules_ops
, list
) {
93 list_del_rcu(&o
->list
);
101 spin_unlock(&rules_mod_lock
);
108 EXPORT_SYMBOL_GPL(fib_rules_unregister
);
110 static int fib_rule_match(struct fib_rule
*rule
, struct fib_rules_ops
*ops
,
111 struct flowi
*fl
, int flags
)
115 if (rule
->ifindex
&& (rule
->ifindex
!= fl
->iif
))
118 if ((rule
->mark
^ fl
->mark
) & rule
->mark_mask
)
121 ret
= ops
->match(rule
, fl
, flags
);
123 return (rule
->flags
& FIB_RULE_INVERT
) ? !ret
: ret
;
126 int fib_rules_lookup(struct fib_rules_ops
*ops
, struct flowi
*fl
,
127 int flags
, struct fib_lookup_arg
*arg
)
129 struct fib_rule
*rule
;
134 list_for_each_entry_rcu(rule
, ops
->rules_list
, list
) {
135 if (!fib_rule_match(rule
, ops
, fl
, flags
))
138 err
= ops
->action(rule
, fl
, flags
, arg
);
139 if (err
!= -EAGAIN
) {
153 EXPORT_SYMBOL_GPL(fib_rules_lookup
);
155 static int validate_rulemsg(struct fib_rule_hdr
*frh
, struct nlattr
**tb
,
156 struct fib_rules_ops
*ops
)
161 if (tb
[FRA_SRC
] == NULL
||
162 frh
->src_len
> (ops
->addr_size
* 8) ||
163 nla_len(tb
[FRA_SRC
]) != ops
->addr_size
)
167 if (tb
[FRA_DST
] == NULL
||
168 frh
->dst_len
> (ops
->addr_size
* 8) ||
169 nla_len(tb
[FRA_DST
]) != ops
->addr_size
)
177 int fib_nl_newrule(struct sk_buff
*skb
, struct nlmsghdr
* nlh
, void *arg
)
179 struct fib_rule_hdr
*frh
= nlmsg_data(nlh
);
180 struct fib_rules_ops
*ops
= NULL
;
181 struct fib_rule
*rule
, *r
, *last
= NULL
;
182 struct nlattr
*tb
[FRA_MAX
+1];
185 if (nlh
->nlmsg_len
< nlmsg_msg_size(sizeof(*frh
)))
188 ops
= lookup_rules_ops(frh
->family
);
194 err
= nlmsg_parse(nlh
, sizeof(*frh
), tb
, FRA_MAX
, ops
->policy
);
198 err
= validate_rulemsg(frh
, tb
, ops
);
202 rule
= kzalloc(ops
->rule_size
, GFP_KERNEL
);
208 if (tb
[FRA_PRIORITY
])
209 rule
->pref
= nla_get_u32(tb
[FRA_PRIORITY
]);
211 if (tb
[FRA_IFNAME
]) {
212 struct net_device
*dev
;
215 nla_strlcpy(rule
->ifname
, tb
[FRA_IFNAME
], IFNAMSIZ
);
216 dev
= __dev_get_by_name(rule
->ifname
);
218 rule
->ifindex
= dev
->ifindex
;
221 if (tb
[FRA_FWMARK
]) {
222 rule
->mark
= nla_get_u32(tb
[FRA_FWMARK
]);
224 /* compatibility: if the mark value is non-zero all bits
225 * are compared unless a mask is explicitly specified.
227 rule
->mark_mask
= 0xFFFFFFFF;
231 rule
->mark_mask
= nla_get_u32(tb
[FRA_FWMASK
]);
233 rule
->action
= frh
->action
;
234 rule
->flags
= frh
->flags
;
235 rule
->table
= frh_get_table(frh
, tb
);
237 if (!rule
->pref
&& ops
->default_pref
)
238 rule
->pref
= ops
->default_pref();
240 err
= ops
->configure(rule
, skb
, nlh
, frh
, tb
);
244 list_for_each_entry(r
, ops
->rules_list
, list
) {
245 if (r
->pref
> rule
->pref
)
253 list_add_rcu(&rule
->list
, &last
->list
);
255 list_add_rcu(&rule
->list
, ops
->rules_list
);
257 notify_rule_change(RTM_NEWRULE
, rule
, ops
, nlh
, NETLINK_CB(skb
).pid
);
268 int fib_nl_delrule(struct sk_buff
*skb
, struct nlmsghdr
* nlh
, void *arg
)
270 struct fib_rule_hdr
*frh
= nlmsg_data(nlh
);
271 struct fib_rules_ops
*ops
= NULL
;
272 struct fib_rule
*rule
;
273 struct nlattr
*tb
[FRA_MAX
+1];
276 if (nlh
->nlmsg_len
< nlmsg_msg_size(sizeof(*frh
)))
279 ops
= lookup_rules_ops(frh
->family
);
285 err
= nlmsg_parse(nlh
, sizeof(*frh
), tb
, FRA_MAX
, ops
->policy
);
289 err
= validate_rulemsg(frh
, tb
, ops
);
293 list_for_each_entry(rule
, ops
->rules_list
, list
) {
294 if (frh
->action
&& (frh
->action
!= rule
->action
))
297 if (frh
->table
&& (frh_get_table(frh
, tb
) != rule
->table
))
300 if (tb
[FRA_PRIORITY
] &&
301 (rule
->pref
!= nla_get_u32(tb
[FRA_PRIORITY
])))
304 if (tb
[FRA_IFNAME
] &&
305 nla_strcmp(tb
[FRA_IFNAME
], rule
->ifname
))
308 if (tb
[FRA_FWMARK
] &&
309 (rule
->mark
!= nla_get_u32(tb
[FRA_FWMARK
])))
312 if (tb
[FRA_FWMASK
] &&
313 (rule
->mark_mask
!= nla_get_u32(tb
[FRA_FWMASK
])))
316 if (!ops
->compare(rule
, frh
, tb
))
319 if (rule
->flags
& FIB_RULE_PERMANENT
) {
324 list_del_rcu(&rule
->list
);
326 notify_rule_change(RTM_DELRULE
, rule
, ops
, nlh
,
327 NETLINK_CB(skb
).pid
);
339 static inline size_t fib_rule_nlmsg_size(struct fib_rules_ops
*ops
,
340 struct fib_rule
*rule
)
342 size_t payload
= NLMSG_ALIGN(sizeof(struct fib_rule_hdr
))
343 + nla_total_size(IFNAMSIZ
) /* FRA_IFNAME */
344 + nla_total_size(4) /* FRA_PRIORITY */
345 + nla_total_size(4) /* FRA_TABLE */
346 + nla_total_size(4) /* FRA_FWMARK */
347 + nla_total_size(4); /* FRA_FWMASK */
349 if (ops
->nlmsg_payload
)
350 payload
+= ops
->nlmsg_payload(rule
);
355 static int fib_nl_fill_rule(struct sk_buff
*skb
, struct fib_rule
*rule
,
356 u32 pid
, u32 seq
, int type
, int flags
,
357 struct fib_rules_ops
*ops
)
359 struct nlmsghdr
*nlh
;
360 struct fib_rule_hdr
*frh
;
362 nlh
= nlmsg_put(skb
, pid
, seq
, type
, sizeof(*frh
), flags
);
366 frh
= nlmsg_data(nlh
);
367 frh
->table
= rule
->table
;
368 NLA_PUT_U32(skb
, FRA_TABLE
, rule
->table
);
371 frh
->action
= rule
->action
;
372 frh
->flags
= rule
->flags
;
375 NLA_PUT_STRING(skb
, FRA_IFNAME
, rule
->ifname
);
378 NLA_PUT_U32(skb
, FRA_PRIORITY
, rule
->pref
);
381 NLA_PUT_U32(skb
, FRA_FWMARK
, rule
->mark
);
383 if (rule
->mark_mask
|| rule
->mark
)
384 NLA_PUT_U32(skb
, FRA_FWMASK
, rule
->mark_mask
);
386 if (ops
->fill(rule
, skb
, nlh
, frh
) < 0)
387 goto nla_put_failure
;
389 return nlmsg_end(skb
, nlh
);
392 nlmsg_cancel(skb
, nlh
);
396 int fib_rules_dump(struct sk_buff
*skb
, struct netlink_callback
*cb
, int family
)
399 struct fib_rule
*rule
;
400 struct fib_rules_ops
*ops
;
402 ops
= lookup_rules_ops(family
);
404 return -EAFNOSUPPORT
;
407 list_for_each_entry_rcu(rule
, ops
->rules_list
, list
) {
408 if (idx
< cb
->args
[0])
411 if (fib_nl_fill_rule(skb
, rule
, NETLINK_CB(cb
->skb
).pid
,
412 cb
->nlh
->nlmsg_seq
, RTM_NEWRULE
,
413 NLM_F_MULTI
, ops
) < 0)
425 EXPORT_SYMBOL_GPL(fib_rules_dump
);
427 static void notify_rule_change(int event
, struct fib_rule
*rule
,
428 struct fib_rules_ops
*ops
, struct nlmsghdr
*nlh
,
434 skb
= nlmsg_new(fib_rule_nlmsg_size(ops
, rule
), GFP_KERNEL
);
438 err
= fib_nl_fill_rule(skb
, rule
, pid
, nlh
->nlmsg_seq
, event
, 0, ops
);
440 /* -EMSGSIZE implies BUG in fib_rule_nlmsg_size() */
441 WARN_ON(err
== -EMSGSIZE
);
445 err
= rtnl_notify(skb
, pid
, ops
->nlgroup
, nlh
, GFP_KERNEL
);
448 rtnl_set_sk_err(ops
->nlgroup
, err
);
451 static void attach_rules(struct list_head
*rules
, struct net_device
*dev
)
453 struct fib_rule
*rule
;
455 list_for_each_entry(rule
, rules
, list
) {
456 if (rule
->ifindex
== -1 &&
457 strcmp(dev
->name
, rule
->ifname
) == 0)
458 rule
->ifindex
= dev
->ifindex
;
462 static void detach_rules(struct list_head
*rules
, struct net_device
*dev
)
464 struct fib_rule
*rule
;
466 list_for_each_entry(rule
, rules
, list
)
467 if (rule
->ifindex
== dev
->ifindex
)
472 static int fib_rules_event(struct notifier_block
*this, unsigned long event
,
475 struct net_device
*dev
= ptr
;
476 struct fib_rules_ops
*ops
;
482 case NETDEV_REGISTER
:
483 list_for_each_entry(ops
, &rules_ops
, list
)
484 attach_rules(ops
->rules_list
, dev
);
487 case NETDEV_UNREGISTER
:
488 list_for_each_entry(ops
, &rules_ops
, list
)
489 detach_rules(ops
->rules_list
, dev
);
498 static struct notifier_block fib_rules_notifier
= {
499 .notifier_call
= fib_rules_event
,
502 static int __init
fib_rules_init(void)
504 return register_netdevice_notifier(&fib_rules_notifier
);
507 subsys_initcall(fib_rules_init
);