Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * DECnet An implementation of the DECnet protocol suite for the LINUX | |
3 | * operating system. DECnet is implemented using the BSD Socket | |
4 | * interface as the means of communication with the user level. | |
5 | * | |
6 | * DECnet Routing Forwarding Information Base (Routing Tables) | |
7 | * | |
8 | * Author: Steve Whitehouse <SteveW@ACM.org> | |
9 | * Mostly copied from the IPv4 routing code | |
10 | * | |
11 | * | |
12 | * Changes: | |
13 | * | |
14 | */ | |
1da177e4 LT |
15 | #include <linux/string.h> |
16 | #include <linux/net.h> | |
17 | #include <linux/socket.h> | |
5a0e3ad6 | 18 | #include <linux/slab.h> |
1da177e4 LT |
19 | #include <linux/sockios.h> |
20 | #include <linux/init.h> | |
21 | #include <linux/skbuff.h> | |
22 | #include <linux/netlink.h> | |
23 | #include <linux/rtnetlink.h> | |
24 | #include <linux/proc_fs.h> | |
25 | #include <linux/netdevice.h> | |
26 | #include <linux/timer.h> | |
27 | #include <linux/spinlock.h> | |
60063497 | 28 | #include <linux/atomic.h> |
1da177e4 LT |
29 | #include <asm/uaccess.h> |
30 | #include <linux/route.h> /* RTF_xxx */ | |
31 | #include <net/neighbour.h> | |
dc5fc579 | 32 | #include <net/netlink.h> |
1da177e4 LT |
33 | #include <net/dst.h> |
34 | #include <net/flow.h> | |
a8731cbf | 35 | #include <net/fib_rules.h> |
1da177e4 LT |
36 | #include <net/dn.h> |
37 | #include <net/dn_route.h> | |
38 | #include <net/dn_fib.h> | |
39 | #include <net/dn_neigh.h> | |
40 | #include <net/dn_dev.h> | |
41 | ||
42 | struct dn_zone | |
43 | { | |
44 | struct dn_zone *dz_next; | |
45 | struct dn_fib_node **dz_hash; | |
46 | int dz_nent; | |
47 | int dz_divisor; | |
48 | u32 dz_hashmask; | |
49 | #define DZ_HASHMASK(dz) ((dz)->dz_hashmask) | |
50 | int dz_order; | |
c4ea94ab | 51 | __le16 dz_mask; |
1da177e4 LT |
52 | #define DZ_MASK(dz) ((dz)->dz_mask) |
53 | }; | |
54 | ||
55 | struct dn_hash | |
56 | { | |
57 | struct dn_zone *dh_zones[17]; | |
58 | struct dn_zone *dh_zone_list; | |
59 | }; | |
60 | ||
61 | #define dz_key_0(key) ((key).datum = 0) | |
1da177e4 LT |
62 | |
63 | #define for_nexthops(fi) { int nhsel; const struct dn_fib_nh *nh;\ | |
429eb0fa | 64 | for(nhsel = 0, nh = (fi)->fib_nh; nhsel < (fi)->fib_nhs; nh++, nhsel++) |
1da177e4 LT |
65 | |
66 | #define endfor_nexthops(fi) } | |
67 | ||
68 | #define DN_MAX_DIVISOR 1024 | |
69 | #define DN_S_ZOMBIE 1 | |
70 | #define DN_S_ACCESSED 2 | |
71 | ||
72 | #define DN_FIB_SCAN(f, fp) \ | |
73 | for( ; ((f) = *(fp)) != NULL; (fp) = &(f)->fn_next) | |
74 | ||
75 | #define DN_FIB_SCAN_KEY(f, fp, key) \ | |
76 | for( ; ((f) = *(fp)) != NULL && dn_key_eq((f)->fn_key, (key)); (fp) = &(f)->fn_next) | |
77 | ||
78 | #define RT_TABLE_MIN 1 | |
abcab268 PM |
79 | #define DN_FIB_TABLE_HASHSZ 256 |
80 | static struct hlist_head dn_fib_table_hash[DN_FIB_TABLE_HASHSZ]; | |
1da177e4 | 81 | static DEFINE_RWLOCK(dn_fib_tables_lock); |
1da177e4 | 82 | |
e18b890b | 83 | static struct kmem_cache *dn_hash_kmem __read_mostly; |
1da177e4 LT |
84 | static int dn_fib_hash_zombies; |
85 | ||
86 | static inline dn_fib_idx_t dn_hash(dn_fib_key_t key, struct dn_zone *dz) | |
87 | { | |
c4106aa8 | 88 | u16 h = le16_to_cpu(key.datum)>>(16 - dz->dz_order); |
1da177e4 LT |
89 | h ^= (h >> 10); |
90 | h ^= (h >> 6); | |
91 | h &= DZ_HASHMASK(dz); | |
92 | return *(dn_fib_idx_t *)&h; | |
93 | } | |
94 | ||
c4ea94ab | 95 | static inline dn_fib_key_t dz_key(__le16 dst, struct dn_zone *dz) |
1da177e4 LT |
96 | { |
97 | dn_fib_key_t k; | |
98 | k.datum = dst & DZ_MASK(dz); | |
99 | return k; | |
100 | } | |
101 | ||
102 | static inline struct dn_fib_node **dn_chain_p(dn_fib_key_t key, struct dn_zone *dz) | |
103 | { | |
104 | return &dz->dz_hash[dn_hash(key, dz).datum]; | |
105 | } | |
106 | ||
107 | static inline struct dn_fib_node *dz_chain(dn_fib_key_t key, struct dn_zone *dz) | |
108 | { | |
109 | return dz->dz_hash[dn_hash(key, dz).datum]; | |
110 | } | |
111 | ||
112 | static inline int dn_key_eq(dn_fib_key_t a, dn_fib_key_t b) | |
113 | { | |
114 | return a.datum == b.datum; | |
115 | } | |
116 | ||
117 | static inline int dn_key_leq(dn_fib_key_t a, dn_fib_key_t b) | |
118 | { | |
119 | return a.datum <= b.datum; | |
120 | } | |
121 | ||
122 | static inline void dn_rebuild_zone(struct dn_zone *dz, | |
123 | struct dn_fib_node **old_ht, | |
124 | int old_divisor) | |
125 | { | |
a01c1335 | 126 | struct dn_fib_node *f, **fp, *next; |
1da177e4 | 127 | int i; |
1da177e4 LT |
128 | |
129 | for(i = 0; i < old_divisor; i++) { | |
a01c1335 DM |
130 | for(f = old_ht[i]; f; f = next) { |
131 | next = f->fn_next; | |
1da177e4 LT |
132 | for(fp = dn_chain_p(f->fn_key, dz); |
133 | *fp && dn_key_leq((*fp)->fn_key, f->fn_key); | |
134 | fp = &(*fp)->fn_next) | |
135 | /* NOTHING */; | |
136 | f->fn_next = *fp; | |
137 | *fp = f; | |
138 | } | |
139 | } | |
140 | } | |
141 | ||
142 | static void dn_rehash_zone(struct dn_zone *dz) | |
143 | { | |
144 | struct dn_fib_node **ht, **old_ht; | |
145 | int old_divisor, new_divisor; | |
146 | u32 new_hashmask; | |
147 | ||
148 | old_divisor = dz->dz_divisor; | |
149 | ||
06f8fe11 JP |
150 | switch (old_divisor) { |
151 | case 16: | |
152 | new_divisor = 256; | |
153 | new_hashmask = 0xFF; | |
154 | break; | |
155 | default: | |
156 | printk(KERN_DEBUG "DECnet: dn_rehash_zone: BUG! %d\n", | |
157 | old_divisor); | |
158 | case 256: | |
159 | new_divisor = 1024; | |
160 | new_hashmask = 0x3FF; | |
161 | break; | |
1da177e4 LT |
162 | } |
163 | ||
0da974f4 | 164 | ht = kcalloc(new_divisor, sizeof(struct dn_fib_node*), GFP_KERNEL); |
1da177e4 LT |
165 | if (ht == NULL) |
166 | return; | |
167 | ||
1da177e4 LT |
168 | write_lock_bh(&dn_fib_tables_lock); |
169 | old_ht = dz->dz_hash; | |
170 | dz->dz_hash = ht; | |
171 | dz->dz_hashmask = new_hashmask; | |
172 | dz->dz_divisor = new_divisor; | |
173 | dn_rebuild_zone(dz, old_ht, old_divisor); | |
174 | write_unlock_bh(&dn_fib_tables_lock); | |
175 | kfree(old_ht); | |
176 | } | |
177 | ||
178 | static void dn_free_node(struct dn_fib_node *f) | |
179 | { | |
180 | dn_fib_release_info(DN_FIB_INFO(f)); | |
181 | kmem_cache_free(dn_hash_kmem, f); | |
182 | } | |
183 | ||
184 | ||
185 | static struct dn_zone *dn_new_zone(struct dn_hash *table, int z) | |
186 | { | |
187 | int i; | |
0da974f4 | 188 | struct dn_zone *dz = kzalloc(sizeof(struct dn_zone), GFP_KERNEL); |
1da177e4 LT |
189 | if (!dz) |
190 | return NULL; | |
191 | ||
1da177e4 LT |
192 | if (z) { |
193 | dz->dz_divisor = 16; | |
194 | dz->dz_hashmask = 0x0F; | |
195 | } else { | |
196 | dz->dz_divisor = 1; | |
197 | dz->dz_hashmask = 0; | |
198 | } | |
199 | ||
0da974f4 | 200 | dz->dz_hash = kcalloc(dz->dz_divisor, sizeof(struct dn_fib_node *), GFP_KERNEL); |
1da177e4 LT |
201 | if (!dz->dz_hash) { |
202 | kfree(dz); | |
203 | return NULL; | |
204 | } | |
205 | ||
1da177e4 LT |
206 | dz->dz_order = z; |
207 | dz->dz_mask = dnet_make_mask(z); | |
208 | ||
209 | for(i = z + 1; i <= 16; i++) | |
210 | if (table->dh_zones[i]) | |
211 | break; | |
212 | ||
213 | write_lock_bh(&dn_fib_tables_lock); | |
214 | if (i>16) { | |
215 | dz->dz_next = table->dh_zone_list; | |
216 | table->dh_zone_list = dz; | |
217 | } else { | |
218 | dz->dz_next = table->dh_zones[i]->dz_next; | |
219 | table->dh_zones[i]->dz_next = dz; | |
220 | } | |
221 | table->dh_zones[z] = dz; | |
222 | write_unlock_bh(&dn_fib_tables_lock); | |
223 | return dz; | |
224 | } | |
225 | ||
226 | ||
227 | static int dn_fib_nh_match(struct rtmsg *r, struct nlmsghdr *nlh, struct dn_kern_rta *rta, struct dn_fib_info *fi) | |
228 | { | |
229 | struct rtnexthop *nhp; | |
230 | int nhlen; | |
231 | ||
232 | if (rta->rta_priority && *rta->rta_priority != fi->fib_priority) | |
233 | return 1; | |
234 | ||
235 | if (rta->rta_oif || rta->rta_gw) { | |
236 | if ((!rta->rta_oif || *rta->rta_oif == fi->fib_nh->nh_oif) && | |
237 | (!rta->rta_gw || memcmp(rta->rta_gw, &fi->fib_nh->nh_gw, 2) == 0)) | |
238 | return 0; | |
239 | return 1; | |
240 | } | |
241 | ||
242 | if (rta->rta_mp == NULL) | |
243 | return 0; | |
244 | ||
245 | nhp = RTA_DATA(rta->rta_mp); | |
246 | nhlen = RTA_PAYLOAD(rta->rta_mp); | |
247 | ||
248 | for_nexthops(fi) { | |
249 | int attrlen = nhlen - sizeof(struct rtnexthop); | |
c4ea94ab | 250 | __le16 gw; |
1da177e4 LT |
251 | |
252 | if (attrlen < 0 || (nhlen -= nhp->rtnh_len) < 0) | |
253 | return -EINVAL; | |
254 | if (nhp->rtnh_ifindex && nhp->rtnh_ifindex != nh->nh_oif) | |
255 | return 1; | |
256 | if (attrlen) { | |
257 | gw = dn_fib_get_attr16(RTNH_DATA(nhp), attrlen, RTA_GATEWAY); | |
258 | ||
259 | if (gw && gw != nh->nh_gw) | |
260 | return 1; | |
261 | } | |
262 | nhp = RTNH_NEXT(nhp); | |
263 | } endfor_nexthops(fi); | |
264 | ||
265 | return 0; | |
266 | } | |
267 | ||
339bf98f TG |
268 | static inline size_t dn_fib_nlmsg_size(struct dn_fib_info *fi) |
269 | { | |
75356f27 | 270 | size_t payload = NLMSG_ALIGN(sizeof(struct rtmsg)) |
339bf98f TG |
271 | + nla_total_size(4) /* RTA_TABLE */ |
272 | + nla_total_size(2) /* RTA_DST */ | |
273 | + nla_total_size(4); /* RTA_PRIORITY */ | |
274 | ||
275 | /* space for nested metrics */ | |
276 | payload += nla_total_size((RTAX_MAX * nla_total_size(4))); | |
277 | ||
278 | if (fi->fib_nhs) { | |
279 | /* Also handles the special case fib_nhs == 1 */ | |
280 | ||
281 | /* each nexthop is packed in an attribute */ | |
282 | size_t nhsize = nla_total_size(sizeof(struct rtnexthop)); | |
283 | ||
284 | /* may contain a gateway attribute */ | |
285 | nhsize += nla_total_size(4); | |
286 | ||
287 | /* all nexthops are packed in a nested attribute */ | |
288 | payload += nla_total_size(fi->fib_nhs * nhsize); | |
289 | } | |
290 | ||
291 | return payload; | |
292 | } | |
293 | ||
1da177e4 | 294 | static int dn_fib_dump_info(struct sk_buff *skb, u32 pid, u32 seq, int event, |
429eb0fa YH |
295 | u32 tb_id, u8 type, u8 scope, void *dst, int dst_len, |
296 | struct dn_fib_info *fi, unsigned int flags) | |
1da177e4 | 297 | { |
429eb0fa YH |
298 | struct rtmsg *rtm; |
299 | struct nlmsghdr *nlh; | |
27a884dc | 300 | unsigned char *b = skb_tail_pointer(skb); |
429eb0fa | 301 | |
3f7a3283 DM |
302 | nlh = nlmsg_put(skb, pid, seq, event, sizeof(*rtm), flags); |
303 | if (!nlh) | |
304 | goto out_nlmsg_trim; | |
305 | rtm = nlmsg_data(nlh); | |
429eb0fa YH |
306 | rtm->rtm_family = AF_DECnet; |
307 | rtm->rtm_dst_len = dst_len; | |
308 | rtm->rtm_src_len = 0; | |
309 | rtm->rtm_tos = 0; | |
310 | rtm->rtm_table = tb_id; | |
9e762a4a | 311 | RTA_PUT_U32(skb, RTA_TABLE, tb_id); |
429eb0fa YH |
312 | rtm->rtm_flags = fi->fib_flags; |
313 | rtm->rtm_scope = scope; | |
1da177e4 | 314 | rtm->rtm_type = type; |
429eb0fa YH |
315 | if (rtm->rtm_dst_len) |
316 | RTA_PUT(skb, RTA_DST, 2, dst); | |
317 | rtm->rtm_protocol = fi->fib_protocol; | |
318 | if (fi->fib_priority) | |
319 | RTA_PUT(skb, RTA_PRIORITY, 4, &fi->fib_priority); | |
1da177e4 LT |
320 | if (rtnetlink_put_metrics(skb, fi->fib_metrics) < 0) |
321 | goto rtattr_failure; | |
429eb0fa YH |
322 | if (fi->fib_nhs == 1) { |
323 | if (fi->fib_nh->nh_gw) | |
324 | RTA_PUT(skb, RTA_GATEWAY, 2, &fi->fib_nh->nh_gw); | |
325 | if (fi->fib_nh->nh_oif) | |
326 | RTA_PUT(skb, RTA_OIF, sizeof(int), &fi->fib_nh->nh_oif); | |
327 | } | |
328 | if (fi->fib_nhs > 1) { | |
329 | struct rtnexthop *nhp; | |
330 | struct rtattr *mp_head; | |
331 | if (skb_tailroom(skb) <= RTA_SPACE(0)) | |
332 | goto rtattr_failure; | |
333 | mp_head = (struct rtattr *)skb_put(skb, RTA_SPACE(0)); | |
334 | ||
335 | for_nexthops(fi) { | |
336 | if (skb_tailroom(skb) < RTA_ALIGN(RTA_ALIGN(sizeof(*nhp)) + 4)) | |
337 | goto rtattr_failure; | |
338 | nhp = (struct rtnexthop *)skb_put(skb, RTA_ALIGN(sizeof(*nhp))); | |
339 | nhp->rtnh_flags = nh->nh_flags & 0xFF; | |
340 | nhp->rtnh_hops = nh->nh_weight - 1; | |
341 | nhp->rtnh_ifindex = nh->nh_oif; | |
342 | if (nh->nh_gw) | |
343 | RTA_PUT(skb, RTA_GATEWAY, 2, &nh->nh_gw); | |
27a884dc | 344 | nhp->rtnh_len = skb_tail_pointer(skb) - (unsigned char *)nhp; |
429eb0fa YH |
345 | } endfor_nexthops(fi); |
346 | mp_head->rta_type = RTA_MULTIPATH; | |
27a884dc | 347 | mp_head->rta_len = skb_tail_pointer(skb) - (u8 *)mp_head; |
429eb0fa YH |
348 | } |
349 | ||
27a884dc | 350 | nlh->nlmsg_len = skb_tail_pointer(skb) - b; |
429eb0fa | 351 | return skb->len; |
1da177e4 | 352 | |
3f7a3283 | 353 | out_nlmsg_trim: |
1da177e4 | 354 | rtattr_failure: |
dc5fc579 | 355 | nlmsg_trim(skb, b); |
429eb0fa | 356 | return -EMSGSIZE; |
1da177e4 LT |
357 | } |
358 | ||
359 | ||
2dfe55b4 | 360 | static void dn_rtmsg_fib(int event, struct dn_fib_node *f, int z, u32 tb_id, |
429eb0fa | 361 | struct nlmsghdr *nlh, struct netlink_skb_parms *req) |
1da177e4 | 362 | { |
429eb0fa YH |
363 | struct sk_buff *skb; |
364 | u32 pid = req ? req->pid : 0; | |
dc738dd8 | 365 | int err = -ENOBUFS; |
1da177e4 | 366 | |
429eb0fa YH |
367 | skb = nlmsg_new(dn_fib_nlmsg_size(DN_FIB_INFO(f)), GFP_KERNEL); |
368 | if (skb == NULL) | |
dc738dd8 | 369 | goto errout; |
1da177e4 | 370 | |
429eb0fa | 371 | err = dn_fib_dump_info(skb, pid, nlh->nlmsg_seq, event, tb_id, |
dc738dd8 TG |
372 | f->fn_type, f->fn_scope, &f->fn_key, z, |
373 | DN_FIB_INFO(f), 0); | |
26932566 PM |
374 | if (err < 0) { |
375 | /* -EMSGSIZE implies BUG in dn_fib_nlmsg_size() */ | |
376 | WARN_ON(err == -EMSGSIZE); | |
377 | kfree_skb(skb); | |
378 | goto errout; | |
379 | } | |
1ce85fe4 PNA |
380 | rtnl_notify(skb, &init_net, pid, RTNLGRP_DECnet_ROUTE, nlh, GFP_KERNEL); |
381 | return; | |
dc738dd8 TG |
382 | errout: |
383 | if (err < 0) | |
97c53cac | 384 | rtnl_set_sk_err(&init_net, RTNLGRP_DECnet_ROUTE, err); |
1da177e4 LT |
385 | } |
386 | ||
429eb0fa | 387 | static __inline__ int dn_hash_dump_bucket(struct sk_buff *skb, |
1da177e4 LT |
388 | struct netlink_callback *cb, |
389 | struct dn_fib_table *tb, | |
390 | struct dn_zone *dz, | |
391 | struct dn_fib_node *f) | |
392 | { | |
393 | int i, s_i; | |
394 | ||
abcab268 | 395 | s_i = cb->args[4]; |
1da177e4 LT |
396 | for(i = 0; f; i++, f = f->fn_next) { |
397 | if (i < s_i) | |
398 | continue; | |
399 | if (f->fn_state & DN_S_ZOMBIE) | |
400 | continue; | |
429eb0fa | 401 | if (dn_fib_dump_info(skb, NETLINK_CB(cb->skb).pid, |
1da177e4 LT |
402 | cb->nlh->nlmsg_seq, |
403 | RTM_NEWROUTE, | |
429eb0fa | 404 | tb->n, |
1da177e4 | 405 | (f->fn_state & DN_S_ZOMBIE) ? 0 : f->fn_type, |
429eb0fa | 406 | f->fn_scope, &f->fn_key, dz->dz_order, |
b6544c0b | 407 | f->fn_info, NLM_F_MULTI) < 0) { |
abcab268 | 408 | cb->args[4] = i; |
1da177e4 LT |
409 | return -1; |
410 | } | |
411 | } | |
abcab268 | 412 | cb->args[4] = i; |
1da177e4 LT |
413 | return skb->len; |
414 | } | |
415 | ||
429eb0fa | 416 | static __inline__ int dn_hash_dump_zone(struct sk_buff *skb, |
1da177e4 LT |
417 | struct netlink_callback *cb, |
418 | struct dn_fib_table *tb, | |
419 | struct dn_zone *dz) | |
420 | { | |
421 | int h, s_h; | |
422 | ||
abcab268 | 423 | s_h = cb->args[3]; |
1da177e4 LT |
424 | for(h = 0; h < dz->dz_divisor; h++) { |
425 | if (h < s_h) | |
426 | continue; | |
427 | if (h > s_h) | |
abcab268 | 428 | memset(&cb->args[4], 0, sizeof(cb->args) - 4*sizeof(cb->args[0])); |
1da177e4 LT |
429 | if (dz->dz_hash == NULL || dz->dz_hash[h] == NULL) |
430 | continue; | |
431 | if (dn_hash_dump_bucket(skb, cb, tb, dz, dz->dz_hash[h]) < 0) { | |
abcab268 | 432 | cb->args[3] = h; |
1da177e4 LT |
433 | return -1; |
434 | } | |
435 | } | |
abcab268 | 436 | cb->args[3] = h; |
1da177e4 LT |
437 | return skb->len; |
438 | } | |
439 | ||
429eb0fa YH |
440 | static int dn_fib_table_dump(struct dn_fib_table *tb, struct sk_buff *skb, |
441 | struct netlink_callback *cb) | |
1da177e4 | 442 | { |
429eb0fa | 443 | int m, s_m; |
1da177e4 LT |
444 | struct dn_zone *dz; |
445 | struct dn_hash *table = (struct dn_hash *)tb->data; | |
446 | ||
abcab268 | 447 | s_m = cb->args[2]; |
1da177e4 LT |
448 | read_lock(&dn_fib_tables_lock); |
449 | for(dz = table->dh_zone_list, m = 0; dz; dz = dz->dz_next, m++) { | |
450 | if (m < s_m) | |
451 | continue; | |
452 | if (m > s_m) | |
abcab268 | 453 | memset(&cb->args[3], 0, sizeof(cb->args) - 3*sizeof(cb->args[0])); |
1da177e4 LT |
454 | |
455 | if (dn_hash_dump_zone(skb, cb, tb, dz) < 0) { | |
abcab268 | 456 | cb->args[2] = m; |
1da177e4 LT |
457 | read_unlock(&dn_fib_tables_lock); |
458 | return -1; | |
459 | } | |
460 | } | |
461 | read_unlock(&dn_fib_tables_lock); | |
abcab268 | 462 | cb->args[2] = m; |
1da177e4 | 463 | |
429eb0fa | 464 | return skb->len; |
1da177e4 LT |
465 | } |
466 | ||
abcab268 PM |
467 | int dn_fib_dump(struct sk_buff *skb, struct netlink_callback *cb) |
468 | { | |
3b1e0a65 | 469 | struct net *net = sock_net(skb->sk); |
abcab268 PM |
470 | unsigned int h, s_h; |
471 | unsigned int e = 0, s_e; | |
472 | struct dn_fib_table *tb; | |
473 | struct hlist_node *node; | |
474 | int dumped = 0; | |
475 | ||
09ad9bc7 | 476 | if (!net_eq(net, &init_net)) |
b854272b DL |
477 | return 0; |
478 | ||
abcab268 | 479 | if (NLMSG_PAYLOAD(cb->nlh, 0) >= sizeof(struct rtmsg) && |
3f7a3283 | 480 | ((struct rtmsg *)nlmsg_data(cb->nlh))->rtm_flags&RTM_F_CLONED) |
abcab268 PM |
481 | return dn_cache_dump(skb, cb); |
482 | ||
483 | s_h = cb->args[0]; | |
484 | s_e = cb->args[1]; | |
485 | ||
486 | for (h = s_h; h < DN_FIB_TABLE_HASHSZ; h++, s_h = 0) { | |
487 | e = 0; | |
488 | hlist_for_each_entry(tb, node, &dn_fib_table_hash[h], hlist) { | |
489 | if (e < s_e) | |
490 | goto next; | |
491 | if (dumped) | |
492 | memset(&cb->args[2], 0, sizeof(cb->args) - | |
429eb0fa | 493 | 2 * sizeof(cb->args[0])); |
abcab268 PM |
494 | if (tb->dump(tb, skb, cb) < 0) |
495 | goto out; | |
496 | dumped = 1; | |
497 | next: | |
498 | e++; | |
499 | } | |
500 | } | |
501 | out: | |
502 | cb->args[1] = e; | |
503 | cb->args[0] = h; | |
504 | ||
505 | return skb->len; | |
506 | } | |
507 | ||
1da177e4 LT |
508 | static int dn_fib_table_insert(struct dn_fib_table *tb, struct rtmsg *r, struct dn_kern_rta *rta, struct nlmsghdr *n, struct netlink_skb_parms *req) |
509 | { | |
510 | struct dn_hash *table = (struct dn_hash *)tb->data; | |
511 | struct dn_fib_node *new_f, *f, **fp, **del_fp; | |
512 | struct dn_zone *dz; | |
513 | struct dn_fib_info *fi; | |
429eb0fa | 514 | int z = r->rtm_dst_len; |
1da177e4 LT |
515 | int type = r->rtm_type; |
516 | dn_fib_key_t key; | |
429eb0fa | 517 | int err; |
1da177e4 | 518 | |
429eb0fa YH |
519 | if (z > 16) |
520 | return -EINVAL; | |
1da177e4 LT |
521 | |
522 | dz = table->dh_zones[z]; | |
523 | if (!dz && !(dz = dn_new_zone(table, z))) | |
524 | return -ENOBUFS; | |
525 | ||
526 | dz_key_0(key); | |
527 | if (rta->rta_dst) { | |
c4ea94ab | 528 | __le16 dst; |
1da177e4 LT |
529 | memcpy(&dst, rta->rta_dst, 2); |
530 | if (dst & ~DZ_MASK(dz)) | |
531 | return -EINVAL; | |
532 | key = dz_key(dst, dz); | |
533 | } | |
534 | ||
429eb0fa YH |
535 | if ((fi = dn_fib_create_info(r, rta, n, &err)) == NULL) |
536 | return err; | |
1da177e4 LT |
537 | |
538 | if (dz->dz_nent > (dz->dz_divisor << 2) && | |
539 | dz->dz_divisor > DN_MAX_DIVISOR && | |
540 | (z==16 || (1<<z) > dz->dz_divisor)) | |
541 | dn_rehash_zone(dz); | |
542 | ||
543 | fp = dn_chain_p(key, dz); | |
544 | ||
545 | DN_FIB_SCAN(f, fp) { | |
546 | if (dn_key_leq(key, f->fn_key)) | |
547 | break; | |
548 | } | |
549 | ||
550 | del_fp = NULL; | |
551 | ||
552 | if (f && (f->fn_state & DN_S_ZOMBIE) && | |
553 | dn_key_eq(f->fn_key, key)) { | |
554 | del_fp = fp; | |
555 | fp = &f->fn_next; | |
556 | f = *fp; | |
557 | goto create; | |
558 | } | |
559 | ||
560 | DN_FIB_SCAN_KEY(f, fp, key) { | |
561 | if (fi->fib_priority <= DN_FIB_INFO(f)->fib_priority) | |
562 | break; | |
563 | } | |
564 | ||
565 | if (f && dn_key_eq(f->fn_key, key) && | |
566 | fi->fib_priority == DN_FIB_INFO(f)->fib_priority) { | |
567 | struct dn_fib_node **ins_fp; | |
568 | ||
569 | err = -EEXIST; | |
570 | if (n->nlmsg_flags & NLM_F_EXCL) | |
571 | goto out; | |
572 | ||
573 | if (n->nlmsg_flags & NLM_F_REPLACE) { | |
574 | del_fp = fp; | |
575 | fp = &f->fn_next; | |
576 | f = *fp; | |
577 | goto replace; | |
578 | } | |
579 | ||
580 | ins_fp = fp; | |
581 | err = -EEXIST; | |
582 | ||
583 | DN_FIB_SCAN_KEY(f, fp, key) { | |
584 | if (fi->fib_priority != DN_FIB_INFO(f)->fib_priority) | |
585 | break; | |
f64f9e71 JP |
586 | if (f->fn_type == type && |
587 | f->fn_scope == r->rtm_scope && | |
588 | DN_FIB_INFO(f) == fi) | |
1da177e4 LT |
589 | goto out; |
590 | } | |
591 | ||
592 | if (!(n->nlmsg_flags & NLM_F_APPEND)) { | |
593 | fp = ins_fp; | |
594 | f = *fp; | |
595 | } | |
596 | } | |
597 | ||
598 | create: | |
599 | err = -ENOENT; | |
600 | if (!(n->nlmsg_flags & NLM_F_CREATE)) | |
601 | goto out; | |
602 | ||
603 | replace: | |
604 | err = -ENOBUFS; | |
c3762229 | 605 | new_f = kmem_cache_zalloc(dn_hash_kmem, GFP_KERNEL); |
1da177e4 LT |
606 | if (new_f == NULL) |
607 | goto out; | |
608 | ||
1da177e4 LT |
609 | new_f->fn_key = key; |
610 | new_f->fn_type = type; | |
611 | new_f->fn_scope = r->rtm_scope; | |
612 | DN_FIB_INFO(new_f) = fi; | |
613 | ||
614 | new_f->fn_next = f; | |
615 | write_lock_bh(&dn_fib_tables_lock); | |
616 | *fp = new_f; | |
617 | write_unlock_bh(&dn_fib_tables_lock); | |
618 | dz->dz_nent++; | |
619 | ||
620 | if (del_fp) { | |
621 | f = *del_fp; | |
622 | write_lock_bh(&dn_fib_tables_lock); | |
623 | *del_fp = f->fn_next; | |
624 | write_unlock_bh(&dn_fib_tables_lock); | |
625 | ||
626 | if (!(f->fn_state & DN_S_ZOMBIE)) | |
627 | dn_rtmsg_fib(RTM_DELROUTE, f, z, tb->n, n, req); | |
628 | if (f->fn_state & DN_S_ACCESSED) | |
629 | dn_rt_cache_flush(-1); | |
630 | dn_free_node(f); | |
631 | dz->dz_nent--; | |
632 | } else { | |
633 | dn_rt_cache_flush(-1); | |
634 | } | |
635 | ||
429eb0fa | 636 | dn_rtmsg_fib(RTM_NEWROUTE, new_f, z, tb->n, n, req); |
1da177e4 | 637 | |
429eb0fa | 638 | return 0; |
1da177e4 LT |
639 | out: |
640 | dn_fib_release_info(fi); | |
641 | return err; | |
642 | } | |
643 | ||
644 | ||
645 | static int dn_fib_table_delete(struct dn_fib_table *tb, struct rtmsg *r, struct dn_kern_rta *rta, struct nlmsghdr *n, struct netlink_skb_parms *req) | |
646 | { | |
647 | struct dn_hash *table = (struct dn_hash*)tb->data; | |
648 | struct dn_fib_node **fp, **del_fp, *f; | |
429eb0fa | 649 | int z = r->rtm_dst_len; |
1da177e4 LT |
650 | struct dn_zone *dz; |
651 | dn_fib_key_t key; | |
652 | int matched; | |
653 | ||
654 | ||
429eb0fa YH |
655 | if (z > 16) |
656 | return -EINVAL; | |
1da177e4 LT |
657 | |
658 | if ((dz = table->dh_zones[z]) == NULL) | |
659 | return -ESRCH; | |
660 | ||
661 | dz_key_0(key); | |
662 | if (rta->rta_dst) { | |
c4ea94ab | 663 | __le16 dst; |
1da177e4 LT |
664 | memcpy(&dst, rta->rta_dst, 2); |
665 | if (dst & ~DZ_MASK(dz)) | |
666 | return -EINVAL; | |
667 | key = dz_key(dst, dz); | |
668 | } | |
669 | ||
670 | fp = dn_chain_p(key, dz); | |
671 | ||
672 | DN_FIB_SCAN(f, fp) { | |
673 | if (dn_key_eq(f->fn_key, key)) | |
674 | break; | |
675 | if (dn_key_leq(key, f->fn_key)) | |
676 | return -ESRCH; | |
677 | } | |
678 | ||
679 | matched = 0; | |
680 | del_fp = NULL; | |
681 | DN_FIB_SCAN_KEY(f, fp, key) { | |
682 | struct dn_fib_info *fi = DN_FIB_INFO(f); | |
683 | ||
684 | if (f->fn_state & DN_S_ZOMBIE) | |
685 | return -ESRCH; | |
686 | ||
687 | matched++; | |
688 | ||
689 | if (del_fp == NULL && | |
690 | (!r->rtm_type || f->fn_type == r->rtm_type) && | |
691 | (r->rtm_scope == RT_SCOPE_NOWHERE || f->fn_scope == r->rtm_scope) && | |
429eb0fa | 692 | (!r->rtm_protocol || |
1da177e4 LT |
693 | fi->fib_protocol == r->rtm_protocol) && |
694 | dn_fib_nh_match(r, n, rta, fi) == 0) | |
695 | del_fp = fp; | |
696 | } | |
697 | ||
698 | if (del_fp) { | |
699 | f = *del_fp; | |
429eb0fa | 700 | dn_rtmsg_fib(RTM_DELROUTE, f, z, tb->n, n, req); |
1da177e4 LT |
701 | |
702 | if (matched != 1) { | |
703 | write_lock_bh(&dn_fib_tables_lock); | |
704 | *del_fp = f->fn_next; | |
705 | write_unlock_bh(&dn_fib_tables_lock); | |
706 | ||
707 | if (f->fn_state & DN_S_ACCESSED) | |
708 | dn_rt_cache_flush(-1); | |
709 | dn_free_node(f); | |
710 | dz->dz_nent--; | |
711 | } else { | |
712 | f->fn_state |= DN_S_ZOMBIE; | |
713 | if (f->fn_state & DN_S_ACCESSED) { | |
714 | f->fn_state &= ~DN_S_ACCESSED; | |
715 | dn_rt_cache_flush(-1); | |
716 | } | |
717 | if (++dn_fib_hash_zombies > 128) | |
718 | dn_fib_flush(); | |
719 | } | |
720 | ||
721 | return 0; | |
722 | } | |
723 | ||
429eb0fa | 724 | return -ESRCH; |
1da177e4 LT |
725 | } |
726 | ||
727 | static inline int dn_flush_list(struct dn_fib_node **fp, int z, struct dn_hash *table) | |
728 | { | |
729 | int found = 0; | |
730 | struct dn_fib_node *f; | |
731 | ||
732 | while((f = *fp) != NULL) { | |
733 | struct dn_fib_info *fi = DN_FIB_INFO(f); | |
734 | ||
735 | if (fi && ((f->fn_state & DN_S_ZOMBIE) || (fi->fib_flags & RTNH_F_DEAD))) { | |
736 | write_lock_bh(&dn_fib_tables_lock); | |
737 | *fp = f->fn_next; | |
738 | write_unlock_bh(&dn_fib_tables_lock); | |
739 | ||
740 | dn_free_node(f); | |
741 | found++; | |
742 | continue; | |
743 | } | |
744 | fp = &f->fn_next; | |
745 | } | |
746 | ||
747 | return found; | |
748 | } | |
749 | ||
750 | static int dn_fib_table_flush(struct dn_fib_table *tb) | |
751 | { | |
752 | struct dn_hash *table = (struct dn_hash *)tb->data; | |
753 | struct dn_zone *dz; | |
754 | int found = 0; | |
755 | ||
756 | dn_fib_hash_zombies = 0; | |
757 | for(dz = table->dh_zone_list; dz; dz = dz->dz_next) { | |
758 | int i; | |
759 | int tmp = 0; | |
760 | for(i = dz->dz_divisor-1; i >= 0; i--) | |
761 | tmp += dn_flush_list(&dz->dz_hash[i], dz->dz_order, table); | |
762 | dz->dz_nent -= tmp; | |
763 | found += tmp; | |
764 | } | |
765 | ||
766 | return found; | |
767 | } | |
768 | ||
bef55aeb | 769 | static int dn_fib_table_lookup(struct dn_fib_table *tb, const struct flowidn *flp, struct dn_fib_res *res) |
1da177e4 | 770 | { |
429eb0fa | 771 | int err; |
1da177e4 LT |
772 | struct dn_zone *dz; |
773 | struct dn_hash *t = (struct dn_hash *)tb->data; | |
774 | ||
775 | read_lock(&dn_fib_tables_lock); | |
776 | for(dz = t->dh_zone_list; dz; dz = dz->dz_next) { | |
777 | struct dn_fib_node *f; | |
bef55aeb | 778 | dn_fib_key_t k = dz_key(flp->daddr, dz); |
1da177e4 LT |
779 | |
780 | for(f = dz_chain(k, dz); f; f = f->fn_next) { | |
781 | if (!dn_key_eq(k, f->fn_key)) { | |
782 | if (dn_key_leq(k, f->fn_key)) | |
783 | break; | |
784 | else | |
785 | continue; | |
786 | } | |
787 | ||
788 | f->fn_state |= DN_S_ACCESSED; | |
789 | ||
790 | if (f->fn_state&DN_S_ZOMBIE) | |
791 | continue; | |
792 | ||
bef55aeb | 793 | if (f->fn_scope < flp->flowidn_scope) |
1da177e4 LT |
794 | continue; |
795 | ||
796 | err = dn_fib_semantic_match(f->fn_type, DN_FIB_INFO(f), flp, res); | |
797 | ||
798 | if (err == 0) { | |
799 | res->type = f->fn_type; | |
429eb0fa | 800 | res->scope = f->fn_scope; |
1da177e4 LT |
801 | res->prefixlen = dz->dz_order; |
802 | goto out; | |
803 | } | |
804 | if (err < 0) | |
805 | goto out; | |
806 | } | |
807 | } | |
808 | err = 1; | |
809 | out: | |
810 | read_unlock(&dn_fib_tables_lock); | |
429eb0fa | 811 | return err; |
1da177e4 LT |
812 | } |
813 | ||
814 | ||
2dfe55b4 | 815 | struct dn_fib_table *dn_fib_get_table(u32 n, int create) |
1da177e4 | 816 | { |
429eb0fa | 817 | struct dn_fib_table *t; |
abcab268 PM |
818 | struct hlist_node *node; |
819 | unsigned int h; | |
1da177e4 | 820 | |
429eb0fa YH |
821 | if (n < RT_TABLE_MIN) |
822 | return NULL; | |
1da177e4 | 823 | |
429eb0fa YH |
824 | if (n > RT_TABLE_MAX) |
825 | return NULL; | |
1da177e4 | 826 | |
abcab268 PM |
827 | h = n & (DN_FIB_TABLE_HASHSZ - 1); |
828 | rcu_read_lock(); | |
829 | hlist_for_each_entry_rcu(t, node, &dn_fib_table_hash[h], hlist) { | |
830 | if (t->n == n) { | |
831 | rcu_read_unlock(); | |
832 | return t; | |
833 | } | |
834 | } | |
835 | rcu_read_unlock(); | |
1da177e4 | 836 | |
429eb0fa YH |
837 | if (!create) |
838 | return NULL; | |
1da177e4 | 839 | |
e87cc472 JP |
840 | if (in_interrupt()) { |
841 | net_dbg_ratelimited("DECnet: BUG! Attempt to create routing table from interrupt\n"); | |
429eb0fa YH |
842 | return NULL; |
843 | } | |
1da177e4 | 844 | |
429eb0fa | 845 | t = kzalloc(sizeof(struct dn_fib_table) + sizeof(struct dn_hash), |
e6b61105 | 846 | GFP_KERNEL); |
429eb0fa YH |
847 | if (t == NULL) |
848 | return NULL; | |
849 | ||
850 | t->n = n; | |
851 | t->insert = dn_fib_table_insert; | |
852 | t->delete = dn_fib_table_delete; | |
853 | t->lookup = dn_fib_table_lookup; | |
854 | t->flush = dn_fib_table_flush; | |
855 | t->dump = dn_fib_table_dump; | |
abcab268 | 856 | hlist_add_head_rcu(&t->hlist, &dn_fib_table_hash[h]); |
1da177e4 | 857 | |
429eb0fa | 858 | return t; |
1da177e4 LT |
859 | } |
860 | ||
1da177e4 LT |
861 | struct dn_fib_table *dn_fib_empty_table(void) |
862 | { | |
429eb0fa | 863 | u32 id; |
1da177e4 | 864 | |
429eb0fa | 865 | for(id = RT_TABLE_MIN; id <= RT_TABLE_MAX; id++) |
abcab268 | 866 | if (dn_fib_get_table(id, 0) == NULL) |
429eb0fa YH |
867 | return dn_fib_get_table(id, 1); |
868 | return NULL; | |
1da177e4 LT |
869 | } |
870 | ||
abcab268 PM |
871 | void dn_fib_flush(void) |
872 | { | |
429eb0fa YH |
873 | int flushed = 0; |
874 | struct dn_fib_table *tb; | |
abcab268 PM |
875 | struct hlist_node *node; |
876 | unsigned int h; | |
877 | ||
878 | for (h = 0; h < DN_FIB_TABLE_HASHSZ; h++) { | |
879 | hlist_for_each_entry(tb, node, &dn_fib_table_hash[h], hlist) | |
429eb0fa YH |
880 | flushed += tb->flush(tb); |
881 | } | |
abcab268 | 882 | |
429eb0fa YH |
883 | if (flushed) |
884 | dn_rt_cache_flush(-1); | |
abcab268 PM |
885 | } |
886 | ||
1da177e4 LT |
887 | void __init dn_fib_table_init(void) |
888 | { | |
889 | dn_hash_kmem = kmem_cache_create("dn_fib_info_cache", | |
890 | sizeof(struct dn_fib_info), | |
891 | 0, SLAB_HWCACHE_ALIGN, | |
20c2df83 | 892 | NULL); |
1da177e4 LT |
893 | } |
894 | ||
895 | void __exit dn_fib_table_cleanup(void) | |
896 | { | |
abcab268 PM |
897 | struct dn_fib_table *t; |
898 | struct hlist_node *node, *next; | |
899 | unsigned int h; | |
1da177e4 | 900 | |
abcab268 PM |
901 | write_lock(&dn_fib_tables_lock); |
902 | for (h = 0; h < DN_FIB_TABLE_HASHSZ; h++) { | |
903 | hlist_for_each_entry_safe(t, node, next, &dn_fib_table_hash[h], | |
429eb0fa | 904 | hlist) { |
abcab268 PM |
905 | hlist_del(&t->hlist); |
906 | kfree(t); | |
907 | } | |
908 | } | |
909 | write_unlock(&dn_fib_tables_lock); | |
1da177e4 | 910 | } |