Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * This program is free software; you can redistribute it and/or modify | |
3 | * it under the terms of the GNU General Public License as published by | |
4 | * the Free Software Foundation; either version 2 of the License, or | |
5 | * (at your option) any later version. | |
6 | * | |
7 | * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk) | |
8 | * Copyright (C) Terry Dawson VK2KTJ (terry@animats.net) | |
9 | */ | |
10 | #include <linux/errno.h> | |
11 | #include <linux/types.h> | |
12 | #include <linux/socket.h> | |
13 | #include <linux/in.h> | |
14 | #include <linux/kernel.h> | |
1da177e4 LT |
15 | #include <linux/timer.h> |
16 | #include <linux/string.h> | |
17 | #include <linux/sockios.h> | |
18 | #include <linux/net.h> | |
5a0e3ad6 | 19 | #include <linux/slab.h> |
1da177e4 LT |
20 | #include <net/ax25.h> |
21 | #include <linux/inet.h> | |
22 | #include <linux/netdevice.h> | |
23 | #include <net/arp.h> | |
24 | #include <linux/if_arp.h> | |
25 | #include <linux/skbuff.h> | |
26 | #include <net/sock.h> | |
c752f073 | 27 | #include <net/tcp_states.h> |
7c0f6ba6 | 28 | #include <linux/uaccess.h> |
1da177e4 LT |
29 | #include <linux/fcntl.h> |
30 | #include <linux/termios.h> /* For TIOCINQ/OUTQ */ | |
31 | #include <linux/mm.h> | |
32 | #include <linux/interrupt.h> | |
33 | #include <linux/notifier.h> | |
1da177e4 LT |
34 | #include <linux/init.h> |
35 | #include <net/rose.h> | |
36 | #include <linux/seq_file.h> | |
bc3b2d7f | 37 | #include <linux/export.h> |
1da177e4 LT |
38 | |
39 | static unsigned int rose_neigh_no = 1; | |
40 | ||
41 | static struct rose_node *rose_node_list; | |
42 | static DEFINE_SPINLOCK(rose_node_list_lock); | |
43 | static struct rose_neigh *rose_neigh_list; | |
44 | static DEFINE_SPINLOCK(rose_neigh_list_lock); | |
45 | static struct rose_route *rose_route_list; | |
46 | static DEFINE_SPINLOCK(rose_route_list_lock); | |
47 | ||
891e6a93 | 48 | struct rose_neigh *rose_loopback_neigh; |
1da177e4 | 49 | |
1da177e4 LT |
50 | /* |
51 | * Add a new route to a node, and in the process add the node and the | |
52 | * neighbour if it is new. | |
53 | */ | |
c9266b99 | 54 | static int __must_check rose_add_node(struct rose_route_struct *rose_route, |
1da177e4 LT |
55 | struct net_device *dev) |
56 | { | |
57 | struct rose_node *rose_node, *rose_tmpn, *rose_tmpp; | |
58 | struct rose_neigh *rose_neigh; | |
59 | int i, res = 0; | |
60 | ||
61 | spin_lock_bh(&rose_node_list_lock); | |
62 | spin_lock_bh(&rose_neigh_list_lock); | |
63 | ||
64 | rose_node = rose_node_list; | |
65 | while (rose_node != NULL) { | |
66 | if ((rose_node->mask == rose_route->mask) && | |
67 | (rosecmpm(&rose_route->address, &rose_node->address, | |
3dcf7c5e | 68 | rose_route->mask) == 0)) |
1da177e4 LT |
69 | break; |
70 | rose_node = rose_node->next; | |
71 | } | |
72 | ||
73 | if (rose_node != NULL && rose_node->loopback) { | |
74 | res = -EINVAL; | |
75 | goto out; | |
76 | } | |
77 | ||
78 | rose_neigh = rose_neigh_list; | |
79 | while (rose_neigh != NULL) { | |
f64f9e71 JP |
80 | if (ax25cmp(&rose_route->neighbour, |
81 | &rose_neigh->callsign) == 0 && | |
82 | rose_neigh->dev == dev) | |
1da177e4 LT |
83 | break; |
84 | rose_neigh = rose_neigh->next; | |
85 | } | |
86 | ||
87 | if (rose_neigh == NULL) { | |
88 | rose_neigh = kmalloc(sizeof(*rose_neigh), GFP_ATOMIC); | |
89 | if (rose_neigh == NULL) { | |
90 | res = -ENOMEM; | |
91 | goto out; | |
92 | } | |
93 | ||
94 | rose_neigh->callsign = rose_route->neighbour; | |
95 | rose_neigh->digipeat = NULL; | |
96 | rose_neigh->ax25 = NULL; | |
97 | rose_neigh->dev = dev; | |
98 | rose_neigh->count = 0; | |
99 | rose_neigh->use = 0; | |
100 | rose_neigh->dce_mode = 0; | |
101 | rose_neigh->loopback = 0; | |
102 | rose_neigh->number = rose_neigh_no++; | |
103 | rose_neigh->restarted = 0; | |
104 | ||
105 | skb_queue_head_init(&rose_neigh->queue); | |
106 | ||
4966babd KC |
107 | timer_setup(&rose_neigh->ftimer, NULL, 0); |
108 | timer_setup(&rose_neigh->t0timer, NULL, 0); | |
1da177e4 LT |
109 | |
110 | if (rose_route->ndigis != 0) { | |
e2e0c7c9 JL |
111 | rose_neigh->digipeat = |
112 | kmalloc(sizeof(ax25_digi), GFP_ATOMIC); | |
113 | if (rose_neigh->digipeat == NULL) { | |
1da177e4 LT |
114 | kfree(rose_neigh); |
115 | res = -ENOMEM; | |
116 | goto out; | |
117 | } | |
118 | ||
119 | rose_neigh->digipeat->ndigi = rose_route->ndigis; | |
120 | rose_neigh->digipeat->lastrepeat = -1; | |
121 | ||
122 | for (i = 0; i < rose_route->ndigis; i++) { | |
123 | rose_neigh->digipeat->calls[i] = | |
124 | rose_route->digipeaters[i]; | |
125 | rose_neigh->digipeat->repeated[i] = 0; | |
126 | } | |
127 | } | |
128 | ||
129 | rose_neigh->next = rose_neigh_list; | |
130 | rose_neigh_list = rose_neigh; | |
131 | } | |
132 | ||
133 | /* | |
134 | * This is a new node to be inserted into the list. Find where it needs | |
135 | * to be inserted into the list, and insert it. We want to be sure | |
136 | * to order the list in descending order of mask size to ensure that | |
137 | * later when we are searching this list the first match will be the | |
138 | * best match. | |
139 | */ | |
140 | if (rose_node == NULL) { | |
141 | rose_tmpn = rose_node_list; | |
142 | rose_tmpp = NULL; | |
143 | ||
144 | while (rose_tmpn != NULL) { | |
145 | if (rose_tmpn->mask > rose_route->mask) { | |
146 | rose_tmpp = rose_tmpn; | |
147 | rose_tmpn = rose_tmpn->next; | |
148 | } else { | |
149 | break; | |
150 | } | |
151 | } | |
152 | ||
153 | /* create new node */ | |
154 | rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC); | |
155 | if (rose_node == NULL) { | |
156 | res = -ENOMEM; | |
157 | goto out; | |
158 | } | |
159 | ||
160 | rose_node->address = rose_route->address; | |
161 | rose_node->mask = rose_route->mask; | |
162 | rose_node->count = 1; | |
163 | rose_node->loopback = 0; | |
164 | rose_node->neighbour[0] = rose_neigh; | |
165 | ||
166 | if (rose_tmpn == NULL) { | |
167 | if (rose_tmpp == NULL) { /* Empty list */ | |
168 | rose_node_list = rose_node; | |
169 | rose_node->next = NULL; | |
170 | } else { | |
171 | rose_tmpp->next = rose_node; | |
172 | rose_node->next = NULL; | |
173 | } | |
174 | } else { | |
175 | if (rose_tmpp == NULL) { /* 1st node */ | |
176 | rose_node->next = rose_node_list; | |
177 | rose_node_list = rose_node; | |
178 | } else { | |
179 | rose_tmpp->next = rose_node; | |
180 | rose_node->next = rose_tmpn; | |
181 | } | |
182 | } | |
183 | rose_neigh->count++; | |
184 | ||
185 | goto out; | |
186 | } | |
187 | ||
188 | /* We have space, slot it in */ | |
189 | if (rose_node->count < 3) { | |
190 | rose_node->neighbour[rose_node->count] = rose_neigh; | |
191 | rose_node->count++; | |
192 | rose_neigh->count++; | |
193 | } | |
194 | ||
195 | out: | |
196 | spin_unlock_bh(&rose_neigh_list_lock); | |
197 | spin_unlock_bh(&rose_node_list_lock); | |
198 | ||
199 | return res; | |
200 | } | |
201 | ||
202 | /* | |
203 | * Caller is holding rose_node_list_lock. | |
204 | */ | |
205 | static void rose_remove_node(struct rose_node *rose_node) | |
206 | { | |
207 | struct rose_node *s; | |
208 | ||
209 | if ((s = rose_node_list) == rose_node) { | |
210 | rose_node_list = rose_node->next; | |
211 | kfree(rose_node); | |
212 | return; | |
213 | } | |
214 | ||
215 | while (s != NULL && s->next != NULL) { | |
216 | if (s->next == rose_node) { | |
217 | s->next = rose_node->next; | |
218 | kfree(rose_node); | |
219 | return; | |
220 | } | |
221 | ||
222 | s = s->next; | |
223 | } | |
224 | } | |
225 | ||
226 | /* | |
227 | * Caller is holding rose_neigh_list_lock. | |
228 | */ | |
229 | static void rose_remove_neigh(struct rose_neigh *rose_neigh) | |
230 | { | |
231 | struct rose_neigh *s; | |
232 | ||
233 | rose_stop_ftimer(rose_neigh); | |
234 | rose_stop_t0timer(rose_neigh); | |
235 | ||
236 | skb_queue_purge(&rose_neigh->queue); | |
237 | ||
1da177e4 LT |
238 | if ((s = rose_neigh_list) == rose_neigh) { |
239 | rose_neigh_list = rose_neigh->next; | |
d00c362f JP |
240 | if (rose_neigh->ax25) |
241 | ax25_cb_put(rose_neigh->ax25); | |
a51482bd | 242 | kfree(rose_neigh->digipeat); |
1da177e4 LT |
243 | kfree(rose_neigh); |
244 | return; | |
245 | } | |
246 | ||
247 | while (s != NULL && s->next != NULL) { | |
248 | if (s->next == rose_neigh) { | |
249 | s->next = rose_neigh->next; | |
d00c362f JP |
250 | if (rose_neigh->ax25) |
251 | ax25_cb_put(rose_neigh->ax25); | |
a51482bd | 252 | kfree(rose_neigh->digipeat); |
1da177e4 LT |
253 | kfree(rose_neigh); |
254 | return; | |
255 | } | |
256 | ||
257 | s = s->next; | |
258 | } | |
1da177e4 LT |
259 | } |
260 | ||
261 | /* | |
262 | * Caller is holding rose_route_list_lock. | |
263 | */ | |
264 | static void rose_remove_route(struct rose_route *rose_route) | |
265 | { | |
266 | struct rose_route *s; | |
267 | ||
268 | if (rose_route->neigh1 != NULL) | |
269 | rose_route->neigh1->use--; | |
270 | ||
271 | if (rose_route->neigh2 != NULL) | |
272 | rose_route->neigh2->use--; | |
273 | ||
274 | if ((s = rose_route_list) == rose_route) { | |
275 | rose_route_list = rose_route->next; | |
276 | kfree(rose_route); | |
277 | return; | |
278 | } | |
279 | ||
280 | while (s != NULL && s->next != NULL) { | |
281 | if (s->next == rose_route) { | |
282 | s->next = rose_route->next; | |
283 | kfree(rose_route); | |
284 | return; | |
285 | } | |
286 | ||
287 | s = s->next; | |
288 | } | |
289 | } | |
290 | ||
291 | /* | |
292 | * "Delete" a node. Strictly speaking remove a route to a node. The node | |
293 | * is only deleted if no routes are left to it. | |
294 | */ | |
295 | static int rose_del_node(struct rose_route_struct *rose_route, | |
296 | struct net_device *dev) | |
297 | { | |
298 | struct rose_node *rose_node; | |
299 | struct rose_neigh *rose_neigh; | |
300 | int i, err = 0; | |
301 | ||
302 | spin_lock_bh(&rose_node_list_lock); | |
303 | spin_lock_bh(&rose_neigh_list_lock); | |
304 | ||
305 | rose_node = rose_node_list; | |
306 | while (rose_node != NULL) { | |
307 | if ((rose_node->mask == rose_route->mask) && | |
308 | (rosecmpm(&rose_route->address, &rose_node->address, | |
3dcf7c5e | 309 | rose_route->mask) == 0)) |
1da177e4 LT |
310 | break; |
311 | rose_node = rose_node->next; | |
312 | } | |
313 | ||
314 | if (rose_node == NULL || rose_node->loopback) { | |
315 | err = -EINVAL; | |
316 | goto out; | |
317 | } | |
318 | ||
319 | rose_neigh = rose_neigh_list; | |
320 | while (rose_neigh != NULL) { | |
f64f9e71 JP |
321 | if (ax25cmp(&rose_route->neighbour, |
322 | &rose_neigh->callsign) == 0 && | |
323 | rose_neigh->dev == dev) | |
1da177e4 LT |
324 | break; |
325 | rose_neigh = rose_neigh->next; | |
326 | } | |
327 | ||
328 | if (rose_neigh == NULL) { | |
329 | err = -EINVAL; | |
330 | goto out; | |
331 | } | |
332 | ||
333 | for (i = 0; i < rose_node->count; i++) { | |
334 | if (rose_node->neighbour[i] == rose_neigh) { | |
335 | rose_neigh->count--; | |
336 | ||
337 | if (rose_neigh->count == 0 && rose_neigh->use == 0) | |
338 | rose_remove_neigh(rose_neigh); | |
339 | ||
340 | rose_node->count--; | |
341 | ||
342 | if (rose_node->count == 0) { | |
343 | rose_remove_node(rose_node); | |
344 | } else { | |
345 | switch (i) { | |
346 | case 0: | |
347 | rose_node->neighbour[0] = | |
348 | rose_node->neighbour[1]; | |
a05b8c43 | 349 | /* fall through */ |
1da177e4 LT |
350 | case 1: |
351 | rose_node->neighbour[1] = | |
352 | rose_node->neighbour[2]; | |
353 | case 2: | |
354 | break; | |
355 | } | |
356 | } | |
357 | goto out; | |
358 | } | |
359 | } | |
360 | err = -EINVAL; | |
361 | ||
362 | out: | |
363 | spin_unlock_bh(&rose_neigh_list_lock); | |
364 | spin_unlock_bh(&rose_node_list_lock); | |
365 | ||
366 | return err; | |
367 | } | |
368 | ||
369 | /* | |
370 | * Add the loopback neighbour. | |
371 | */ | |
a3d38402 | 372 | void rose_add_loopback_neigh(void) |
1da177e4 | 373 | { |
891e6a93 AD |
374 | struct rose_neigh *sn; |
375 | ||
376 | rose_loopback_neigh = kmalloc(sizeof(struct rose_neigh), GFP_KERNEL); | |
377 | if (!rose_loopback_neigh) | |
378 | return; | |
379 | sn = rose_loopback_neigh; | |
1da177e4 | 380 | |
a3d38402 RB |
381 | sn->callsign = null_ax25_address; |
382 | sn->digipeat = NULL; | |
383 | sn->ax25 = NULL; | |
384 | sn->dev = NULL; | |
385 | sn->count = 0; | |
386 | sn->use = 0; | |
387 | sn->dce_mode = 1; | |
388 | sn->loopback = 1; | |
389 | sn->number = rose_neigh_no++; | |
390 | sn->restarted = 1; | |
1da177e4 | 391 | |
a3d38402 | 392 | skb_queue_head_init(&sn->queue); |
1da177e4 | 393 | |
4966babd KC |
394 | timer_setup(&sn->ftimer, NULL, 0); |
395 | timer_setup(&sn->t0timer, NULL, 0); | |
1da177e4 LT |
396 | |
397 | spin_lock_bh(&rose_neigh_list_lock); | |
a3d38402 RB |
398 | sn->next = rose_neigh_list; |
399 | rose_neigh_list = sn; | |
1da177e4 | 400 | spin_unlock_bh(&rose_neigh_list_lock); |
1da177e4 LT |
401 | } |
402 | ||
403 | /* | |
404 | * Add a loopback node. | |
405 | */ | |
406 | int rose_add_loopback_node(rose_address *address) | |
407 | { | |
408 | struct rose_node *rose_node; | |
0506d406 | 409 | int err = 0; |
1da177e4 LT |
410 | |
411 | spin_lock_bh(&rose_node_list_lock); | |
412 | ||
413 | rose_node = rose_node_list; | |
414 | while (rose_node != NULL) { | |
415 | if ((rose_node->mask == 10) && | |
416 | (rosecmpm(address, &rose_node->address, 10) == 0) && | |
417 | rose_node->loopback) | |
418 | break; | |
419 | rose_node = rose_node->next; | |
420 | } | |
421 | ||
422 | if (rose_node != NULL) | |
423 | goto out; | |
424 | ||
425 | if ((rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC)) == NULL) { | |
426 | err = -ENOMEM; | |
427 | goto out; | |
428 | } | |
429 | ||
430 | rose_node->address = *address; | |
431 | rose_node->mask = 10; | |
432 | rose_node->count = 1; | |
433 | rose_node->loopback = 1; | |
891e6a93 | 434 | rose_node->neighbour[0] = rose_loopback_neigh; |
1da177e4 LT |
435 | |
436 | /* Insert at the head of list. Address is always mask=10 */ | |
437 | rose_node->next = rose_node_list; | |
438 | rose_node_list = rose_node; | |
439 | ||
891e6a93 | 440 | rose_loopback_neigh->count++; |
1da177e4 LT |
441 | |
442 | out: | |
443 | spin_unlock_bh(&rose_node_list_lock); | |
444 | ||
0506d406 | 445 | return err; |
1da177e4 LT |
446 | } |
447 | ||
448 | /* | |
449 | * Delete a loopback node. | |
450 | */ | |
451 | void rose_del_loopback_node(rose_address *address) | |
452 | { | |
453 | struct rose_node *rose_node; | |
454 | ||
455 | spin_lock_bh(&rose_node_list_lock); | |
456 | ||
457 | rose_node = rose_node_list; | |
458 | while (rose_node != NULL) { | |
459 | if ((rose_node->mask == 10) && | |
460 | (rosecmpm(address, &rose_node->address, 10) == 0) && | |
461 | rose_node->loopback) | |
462 | break; | |
463 | rose_node = rose_node->next; | |
464 | } | |
465 | ||
466 | if (rose_node == NULL) | |
467 | goto out; | |
468 | ||
469 | rose_remove_node(rose_node); | |
470 | ||
891e6a93 | 471 | rose_loopback_neigh->count--; |
1da177e4 LT |
472 | |
473 | out: | |
474 | spin_unlock_bh(&rose_node_list_lock); | |
475 | } | |
476 | ||
477 | /* | |
478 | * A device has been removed. Remove its routes and neighbours. | |
479 | */ | |
480 | void rose_rt_device_down(struct net_device *dev) | |
481 | { | |
482 | struct rose_neigh *s, *rose_neigh; | |
483 | struct rose_node *t, *rose_node; | |
484 | int i; | |
485 | ||
486 | spin_lock_bh(&rose_node_list_lock); | |
487 | spin_lock_bh(&rose_neigh_list_lock); | |
488 | rose_neigh = rose_neigh_list; | |
489 | while (rose_neigh != NULL) { | |
490 | s = rose_neigh; | |
491 | rose_neigh = rose_neigh->next; | |
492 | ||
493 | if (s->dev != dev) | |
494 | continue; | |
495 | ||
496 | rose_node = rose_node_list; | |
497 | ||
498 | while (rose_node != NULL) { | |
499 | t = rose_node; | |
500 | rose_node = rose_node->next; | |
501 | ||
502 | for (i = 0; i < t->count; i++) { | |
503 | if (t->neighbour[i] != s) | |
504 | continue; | |
505 | ||
506 | t->count--; | |
507 | ||
508 | switch (i) { | |
509 | case 0: | |
510 | t->neighbour[0] = t->neighbour[1]; | |
a05b8c43 | 511 | /* fall through */ |
1da177e4 LT |
512 | case 1: |
513 | t->neighbour[1] = t->neighbour[2]; | |
514 | case 2: | |
515 | break; | |
516 | } | |
517 | } | |
518 | ||
519 | if (t->count <= 0) | |
520 | rose_remove_node(t); | |
521 | } | |
522 | ||
523 | rose_remove_neigh(s); | |
524 | } | |
525 | spin_unlock_bh(&rose_neigh_list_lock); | |
526 | spin_unlock_bh(&rose_node_list_lock); | |
527 | } | |
528 | ||
529 | #if 0 /* Currently unused */ | |
530 | /* | |
531 | * A device has been removed. Remove its links. | |
532 | */ | |
533 | void rose_route_device_down(struct net_device *dev) | |
534 | { | |
535 | struct rose_route *s, *rose_route; | |
536 | ||
537 | spin_lock_bh(&rose_route_list_lock); | |
538 | rose_route = rose_route_list; | |
539 | while (rose_route != NULL) { | |
540 | s = rose_route; | |
541 | rose_route = rose_route->next; | |
542 | ||
543 | if (s->neigh1->dev == dev || s->neigh2->dev == dev) | |
544 | rose_remove_route(s); | |
545 | } | |
546 | spin_unlock_bh(&rose_route_list_lock); | |
547 | } | |
548 | #endif | |
549 | ||
550 | /* | |
551 | * Clear all nodes and neighbours out, except for neighbours with | |
552 | * active connections going through them. | |
553 | * Do not clear loopback neighbour and nodes. | |
554 | */ | |
555 | static int rose_clear_routes(void) | |
556 | { | |
557 | struct rose_neigh *s, *rose_neigh; | |
558 | struct rose_node *t, *rose_node; | |
559 | ||
560 | spin_lock_bh(&rose_node_list_lock); | |
561 | spin_lock_bh(&rose_neigh_list_lock); | |
562 | ||
563 | rose_neigh = rose_neigh_list; | |
564 | rose_node = rose_node_list; | |
565 | ||
566 | while (rose_node != NULL) { | |
567 | t = rose_node; | |
568 | rose_node = rose_node->next; | |
569 | if (!t->loopback) | |
570 | rose_remove_node(t); | |
571 | } | |
572 | ||
573 | while (rose_neigh != NULL) { | |
574 | s = rose_neigh; | |
575 | rose_neigh = rose_neigh->next; | |
576 | ||
577 | if (s->use == 0 && !s->loopback) { | |
578 | s->count = 0; | |
579 | rose_remove_neigh(s); | |
580 | } | |
581 | } | |
582 | ||
583 | spin_unlock_bh(&rose_neigh_list_lock); | |
584 | spin_unlock_bh(&rose_node_list_lock); | |
585 | ||
586 | return 0; | |
587 | } | |
588 | ||
589 | /* | |
590 | * Check that the device given is a valid AX.25 interface that is "up". | |
25985edc | 591 | * called with RTNL |
1da177e4 | 592 | */ |
b4ec8240 | 593 | static struct net_device *rose_ax25_dev_find(char *devname) |
1da177e4 LT |
594 | { |
595 | struct net_device *dev; | |
596 | ||
b4ec8240 | 597 | if ((dev = __dev_get_by_name(&init_net, devname)) == NULL) |
1da177e4 LT |
598 | return NULL; |
599 | ||
600 | if ((dev->flags & IFF_UP) && dev->type == ARPHRD_AX25) | |
601 | return dev; | |
602 | ||
1da177e4 LT |
603 | return NULL; |
604 | } | |
605 | ||
606 | /* | |
607 | * Find the first active ROSE device, usually "rose0". | |
608 | */ | |
609 | struct net_device *rose_dev_first(void) | |
610 | { | |
611 | struct net_device *dev, *first = NULL; | |
612 | ||
c6d14c84 ED |
613 | rcu_read_lock(); |
614 | for_each_netdev_rcu(&init_net, dev) { | |
1da177e4 LT |
615 | if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE) |
616 | if (first == NULL || strncmp(dev->name, first->name, 3) < 0) | |
617 | first = dev; | |
618 | } | |
c6d14c84 | 619 | rcu_read_unlock(); |
1da177e4 LT |
620 | |
621 | return first; | |
622 | } | |
623 | ||
624 | /* | |
625 | * Find the ROSE device for the given address. | |
626 | */ | |
627 | struct net_device *rose_dev_get(rose_address *addr) | |
628 | { | |
629 | struct net_device *dev; | |
630 | ||
c6d14c84 ED |
631 | rcu_read_lock(); |
632 | for_each_netdev_rcu(&init_net, dev) { | |
1da177e4 LT |
633 | if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE && rosecmp(addr, (rose_address *)dev->dev_addr) == 0) { |
634 | dev_hold(dev); | |
635 | goto out; | |
636 | } | |
637 | } | |
7562f876 | 638 | dev = NULL; |
1da177e4 | 639 | out: |
c6d14c84 | 640 | rcu_read_unlock(); |
1da177e4 LT |
641 | return dev; |
642 | } | |
643 | ||
644 | static int rose_dev_exists(rose_address *addr) | |
645 | { | |
646 | struct net_device *dev; | |
647 | ||
c6d14c84 ED |
648 | rcu_read_lock(); |
649 | for_each_netdev_rcu(&init_net, dev) { | |
1da177e4 LT |
650 | if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE && rosecmp(addr, (rose_address *)dev->dev_addr) == 0) |
651 | goto out; | |
652 | } | |
7562f876 | 653 | dev = NULL; |
1da177e4 | 654 | out: |
c6d14c84 | 655 | rcu_read_unlock(); |
1da177e4 LT |
656 | return dev != NULL; |
657 | } | |
658 | ||
659 | ||
660 | ||
661 | ||
662 | struct rose_route *rose_route_free_lci(unsigned int lci, struct rose_neigh *neigh) | |
663 | { | |
664 | struct rose_route *rose_route; | |
665 | ||
666 | for (rose_route = rose_route_list; rose_route != NULL; rose_route = rose_route->next) | |
667 | if ((rose_route->neigh1 == neigh && rose_route->lci1 == lci) || | |
668 | (rose_route->neigh2 == neigh && rose_route->lci2 == lci)) | |
669 | return rose_route; | |
670 | ||
671 | return NULL; | |
672 | } | |
673 | ||
674 | /* | |
fe2c802a | 675 | * Find a neighbour or a route given a ROSE address. |
1da177e4 LT |
676 | */ |
677 | struct rose_neigh *rose_get_neigh(rose_address *addr, unsigned char *cause, | |
c5d8b24a | 678 | unsigned char *diagnostic, int route_frame) |
1da177e4 LT |
679 | { |
680 | struct rose_neigh *res = NULL; | |
681 | struct rose_node *node; | |
682 | int failed = 0; | |
683 | int i; | |
684 | ||
c5d8b24a | 685 | if (!route_frame) spin_lock_bh(&rose_node_list_lock); |
1da177e4 LT |
686 | for (node = rose_node_list; node != NULL; node = node->next) { |
687 | if (rosecmpm(addr, &node->address, node->mask) == 0) { | |
688 | for (i = 0; i < node->count; i++) { | |
c5d8b24a BP |
689 | if (node->neighbour[i]->restarted) { |
690 | res = node->neighbour[i]; | |
691 | goto out; | |
fe2c802a | 692 | } |
c5d8b24a BP |
693 | } |
694 | } | |
695 | } | |
696 | if (!route_frame) { /* connect request */ | |
697 | for (node = rose_node_list; node != NULL; node = node->next) { | |
698 | if (rosecmpm(addr, &node->address, node->mask) == 0) { | |
699 | for (i = 0; i < node->count; i++) { | |
fe2c802a BP |
700 | if (!rose_ftimer_running(node->neighbour[i])) { |
701 | res = node->neighbour[i]; | |
c5d8b24a | 702 | failed = 0; |
fe2c802a | 703 | goto out; |
c5d8b24a BP |
704 | } |
705 | failed = 1; | |
fe2c802a | 706 | } |
1da177e4 | 707 | } |
1da177e4 LT |
708 | } |
709 | } | |
710 | ||
711 | if (failed) { | |
712 | *cause = ROSE_OUT_OF_ORDER; | |
713 | *diagnostic = 0; | |
714 | } else { | |
715 | *cause = ROSE_NOT_OBTAINABLE; | |
716 | *diagnostic = 0; | |
717 | } | |
718 | ||
719 | out: | |
c5d8b24a | 720 | if (!route_frame) spin_unlock_bh(&rose_node_list_lock); |
1da177e4 LT |
721 | return res; |
722 | } | |
723 | ||
724 | /* | |
725 | * Handle the ioctls that control the routing functions. | |
726 | */ | |
727 | int rose_rt_ioctl(unsigned int cmd, void __user *arg) | |
728 | { | |
729 | struct rose_route_struct rose_route; | |
730 | struct net_device *dev; | |
731 | int err; | |
732 | ||
733 | switch (cmd) { | |
734 | case SIOCADDRT: | |
735 | if (copy_from_user(&rose_route, arg, sizeof(struct rose_route_struct))) | |
736 | return -EFAULT; | |
b4ec8240 | 737 | if ((dev = rose_ax25_dev_find(rose_route.device)) == NULL) |
1da177e4 | 738 | return -EINVAL; |
b4ec8240 | 739 | if (rose_dev_exists(&rose_route.address)) /* Can't add routes to ourself */ |
1da177e4 | 740 | return -EINVAL; |
1da177e4 LT |
741 | if (rose_route.mask > 10) /* Mask can't be more than 10 digits */ |
742 | return -EINVAL; | |
95df1c04 | 743 | if (rose_route.ndigis > AX25_MAX_DIGIS) |
1da177e4 LT |
744 | return -EINVAL; |
745 | err = rose_add_node(&rose_route, dev); | |
1da177e4 LT |
746 | return err; |
747 | ||
748 | case SIOCDELRT: | |
749 | if (copy_from_user(&rose_route, arg, sizeof(struct rose_route_struct))) | |
750 | return -EFAULT; | |
b4ec8240 | 751 | if ((dev = rose_ax25_dev_find(rose_route.device)) == NULL) |
1da177e4 LT |
752 | return -EINVAL; |
753 | err = rose_del_node(&rose_route, dev); | |
1da177e4 LT |
754 | return err; |
755 | ||
756 | case SIOCRSCLRRT: | |
757 | return rose_clear_routes(); | |
758 | ||
759 | default: | |
760 | return -EINVAL; | |
761 | } | |
762 | ||
763 | return 0; | |
764 | } | |
765 | ||
766 | static void rose_del_route_by_neigh(struct rose_neigh *rose_neigh) | |
767 | { | |
768 | struct rose_route *rose_route, *s; | |
769 | ||
770 | rose_neigh->restarted = 0; | |
771 | ||
772 | rose_stop_t0timer(rose_neigh); | |
773 | rose_start_ftimer(rose_neigh); | |
774 | ||
775 | skb_queue_purge(&rose_neigh->queue); | |
776 | ||
777 | spin_lock_bh(&rose_route_list_lock); | |
778 | ||
779 | rose_route = rose_route_list; | |
780 | ||
781 | while (rose_route != NULL) { | |
782 | if ((rose_route->neigh1 == rose_neigh && rose_route->neigh2 == rose_neigh) || | |
783 | (rose_route->neigh1 == rose_neigh && rose_route->neigh2 == NULL) || | |
784 | (rose_route->neigh2 == rose_neigh && rose_route->neigh1 == NULL)) { | |
785 | s = rose_route->next; | |
786 | rose_remove_route(rose_route); | |
787 | rose_route = s; | |
788 | continue; | |
789 | } | |
790 | ||
791 | if (rose_route->neigh1 == rose_neigh) { | |
792 | rose_route->neigh1->use--; | |
793 | rose_route->neigh1 = NULL; | |
794 | rose_transmit_clear_request(rose_route->neigh2, rose_route->lci2, ROSE_OUT_OF_ORDER, 0); | |
795 | } | |
796 | ||
797 | if (rose_route->neigh2 == rose_neigh) { | |
798 | rose_route->neigh2->use--; | |
799 | rose_route->neigh2 = NULL; | |
800 | rose_transmit_clear_request(rose_route->neigh1, rose_route->lci1, ROSE_OUT_OF_ORDER, 0); | |
801 | } | |
802 | ||
803 | rose_route = rose_route->next; | |
804 | } | |
805 | spin_unlock_bh(&rose_route_list_lock); | |
806 | } | |
807 | ||
808 | /* | |
809 | * A level 2 link has timed out, therefore it appears to be a poor link, | |
810 | * then don't use that neighbour until it is reset. Blow away all through | |
811 | * routes and connections using this route. | |
812 | */ | |
813 | void rose_link_failed(ax25_cb *ax25, int reason) | |
814 | { | |
815 | struct rose_neigh *rose_neigh; | |
816 | ||
817 | spin_lock_bh(&rose_neigh_list_lock); | |
818 | rose_neigh = rose_neigh_list; | |
819 | while (rose_neigh != NULL) { | |
820 | if (rose_neigh->ax25 == ax25) | |
821 | break; | |
822 | rose_neigh = rose_neigh->next; | |
823 | } | |
824 | ||
825 | if (rose_neigh != NULL) { | |
826 | rose_neigh->ax25 = NULL; | |
d00c362f | 827 | ax25_cb_put(ax25); |
1da177e4 LT |
828 | |
829 | rose_del_route_by_neigh(rose_neigh); | |
830 | rose_kill_by_neigh(rose_neigh); | |
831 | } | |
832 | spin_unlock_bh(&rose_neigh_list_lock); | |
833 | } | |
834 | ||
835 | /* | |
836 | * A device has been "downed" remove its link status. Blow away all | |
837 | * through routes and connections that use this device. | |
838 | */ | |
839 | void rose_link_device_down(struct net_device *dev) | |
840 | { | |
841 | struct rose_neigh *rose_neigh; | |
842 | ||
843 | for (rose_neigh = rose_neigh_list; rose_neigh != NULL; rose_neigh = rose_neigh->next) { | |
844 | if (rose_neigh->dev == dev) { | |
845 | rose_del_route_by_neigh(rose_neigh); | |
846 | rose_kill_by_neigh(rose_neigh); | |
847 | } | |
848 | } | |
849 | } | |
850 | ||
851 | /* | |
852 | * Route a frame to an appropriate AX.25 connection. | |
853 | */ | |
854 | int rose_route_frame(struct sk_buff *skb, ax25_cb *ax25) | |
855 | { | |
856 | struct rose_neigh *rose_neigh, *new_neigh; | |
857 | struct rose_route *rose_route; | |
858 | struct rose_facilities_struct facilities; | |
859 | rose_address *src_addr, *dest_addr; | |
860 | struct sock *sk; | |
861 | unsigned short frametype; | |
862 | unsigned int lci, new_lci; | |
863 | unsigned char cause, diagnostic; | |
864 | struct net_device *dev; | |
e0bccd31 | 865 | int res = 0; |
f75268cd | 866 | char buf[11]; |
1da177e4 | 867 | |
e0bccd31 BH |
868 | if (skb->len < ROSE_MIN_LEN) |
869 | return res; | |
1da177e4 LT |
870 | frametype = skb->data[2]; |
871 | lci = ((skb->data[0] << 8) & 0xF00) + ((skb->data[1] << 0) & 0x0FF); | |
e0bccd31 BH |
872 | if (frametype == ROSE_CALL_REQUEST && |
873 | (skb->len <= ROSE_CALL_REQ_FACILITIES_OFF || | |
874 | skb->data[ROSE_CALL_REQ_ADDR_LEN_OFF] != | |
875 | ROSE_CALL_REQ_ADDR_LEN_VAL)) | |
876 | return res; | |
877 | src_addr = (rose_address *)(skb->data + ROSE_CALL_REQ_SRC_ADDR_OFF); | |
878 | dest_addr = (rose_address *)(skb->data + ROSE_CALL_REQ_DEST_ADDR_OFF); | |
1da177e4 | 879 | |
1da177e4 LT |
880 | spin_lock_bh(&rose_neigh_list_lock); |
881 | spin_lock_bh(&rose_route_list_lock); | |
882 | ||
883 | rose_neigh = rose_neigh_list; | |
884 | while (rose_neigh != NULL) { | |
885 | if (ax25cmp(&ax25->dest_addr, &rose_neigh->callsign) == 0 && | |
886 | ax25->ax25_dev->dev == rose_neigh->dev) | |
887 | break; | |
888 | rose_neigh = rose_neigh->next; | |
889 | } | |
890 | ||
891 | if (rose_neigh == NULL) { | |
892 | printk("rose_route : unknown neighbour or device %s\n", | |
f75268cd | 893 | ax2asc(buf, &ax25->dest_addr)); |
1da177e4 LT |
894 | goto out; |
895 | } | |
896 | ||
897 | /* | |
898 | * Obviously the link is working, halt the ftimer. | |
899 | */ | |
900 | rose_stop_ftimer(rose_neigh); | |
901 | ||
902 | /* | |
903 | * LCI of zero is always for us, and its always a restart | |
904 | * frame. | |
905 | */ | |
906 | if (lci == 0) { | |
907 | rose_link_rx_restart(skb, rose_neigh, frametype); | |
908 | goto out; | |
909 | } | |
910 | ||
911 | /* | |
912 | * Find an existing socket. | |
913 | */ | |
914 | if ((sk = rose_find_socket(lci, rose_neigh)) != NULL) { | |
915 | if (frametype == ROSE_CALL_REQUEST) { | |
916 | struct rose_sock *rose = rose_sk(sk); | |
917 | ||
918 | /* Remove an existing unused socket */ | |
919 | rose_clear_queues(sk); | |
920 | rose->cause = ROSE_NETWORK_CONGESTION; | |
921 | rose->diagnostic = 0; | |
922 | rose->neighbour->use--; | |
923 | rose->neighbour = NULL; | |
924 | rose->lci = 0; | |
925 | rose->state = ROSE_STATE_0; | |
926 | sk->sk_state = TCP_CLOSE; | |
927 | sk->sk_err = 0; | |
928 | sk->sk_shutdown |= SEND_SHUTDOWN; | |
929 | if (!sock_flag(sk, SOCK_DEAD)) { | |
930 | sk->sk_state_change(sk); | |
931 | sock_set_flag(sk, SOCK_DEAD); | |
932 | } | |
933 | } | |
934 | else { | |
badff6d0 | 935 | skb_reset_transport_header(skb); |
1da177e4 LT |
936 | res = rose_process_rx_frame(sk, skb); |
937 | goto out; | |
938 | } | |
939 | } | |
940 | ||
941 | /* | |
942 | * Is is a Call Request and is it for us ? | |
943 | */ | |
944 | if (frametype == ROSE_CALL_REQUEST) | |
945 | if ((dev = rose_dev_get(dest_addr)) != NULL) { | |
946 | res = rose_rx_call_request(skb, dev, rose_neigh, lci); | |
947 | dev_put(dev); | |
948 | goto out; | |
949 | } | |
950 | ||
951 | if (!sysctl_rose_routing_control) { | |
952 | rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 0); | |
953 | goto out; | |
954 | } | |
955 | ||
956 | /* | |
957 | * Route it to the next in line if we have an entry for it. | |
958 | */ | |
959 | rose_route = rose_route_list; | |
960 | while (rose_route != NULL) { | |
961 | if (rose_route->lci1 == lci && | |
962 | rose_route->neigh1 == rose_neigh) { | |
963 | if (frametype == ROSE_CALL_REQUEST) { | |
964 | /* F6FBB - Remove an existing unused route */ | |
965 | rose_remove_route(rose_route); | |
966 | break; | |
967 | } else if (rose_route->neigh2 != NULL) { | |
968 | skb->data[0] &= 0xF0; | |
969 | skb->data[0] |= (rose_route->lci2 >> 8) & 0x0F; | |
970 | skb->data[1] = (rose_route->lci2 >> 0) & 0xFF; | |
971 | rose_transmit_link(skb, rose_route->neigh2); | |
972 | if (frametype == ROSE_CLEAR_CONFIRMATION) | |
973 | rose_remove_route(rose_route); | |
974 | res = 1; | |
975 | goto out; | |
976 | } else { | |
977 | if (frametype == ROSE_CLEAR_CONFIRMATION) | |
978 | rose_remove_route(rose_route); | |
979 | goto out; | |
980 | } | |
981 | } | |
982 | if (rose_route->lci2 == lci && | |
983 | rose_route->neigh2 == rose_neigh) { | |
984 | if (frametype == ROSE_CALL_REQUEST) { | |
985 | /* F6FBB - Remove an existing unused route */ | |
986 | rose_remove_route(rose_route); | |
987 | break; | |
988 | } else if (rose_route->neigh1 != NULL) { | |
989 | skb->data[0] &= 0xF0; | |
990 | skb->data[0] |= (rose_route->lci1 >> 8) & 0x0F; | |
991 | skb->data[1] = (rose_route->lci1 >> 0) & 0xFF; | |
992 | rose_transmit_link(skb, rose_route->neigh1); | |
993 | if (frametype == ROSE_CLEAR_CONFIRMATION) | |
994 | rose_remove_route(rose_route); | |
995 | res = 1; | |
996 | goto out; | |
997 | } else { | |
998 | if (frametype == ROSE_CLEAR_CONFIRMATION) | |
999 | rose_remove_route(rose_route); | |
1000 | goto out; | |
1001 | } | |
1002 | } | |
1003 | rose_route = rose_route->next; | |
1004 | } | |
1005 | ||
1006 | /* | |
1007 | * We know that: | |
1008 | * 1. The frame isn't for us, | |
1009 | * 2. It isn't "owned" by any existing route. | |
1010 | */ | |
dc16aaf2 | 1011 | if (frametype != ROSE_CALL_REQUEST) { /* XXX */ |
c1cc1684 | 1012 | res = 0; |
dc16aaf2 DM |
1013 | goto out; |
1014 | } | |
1da177e4 | 1015 | |
1da177e4 LT |
1016 | memset(&facilities, 0x00, sizeof(struct rose_facilities_struct)); |
1017 | ||
e0bccd31 BH |
1018 | if (!rose_parse_facilities(skb->data + ROSE_CALL_REQ_FACILITIES_OFF, |
1019 | skb->len - ROSE_CALL_REQ_FACILITIES_OFF, | |
1020 | &facilities)) { | |
1da177e4 LT |
1021 | rose_transmit_clear_request(rose_neigh, lci, ROSE_INVALID_FACILITY, 76); |
1022 | goto out; | |
1023 | } | |
1024 | ||
1025 | /* | |
1026 | * Check for routing loops. | |
1027 | */ | |
1028 | rose_route = rose_route_list; | |
1029 | while (rose_route != NULL) { | |
1030 | if (rose_route->rand == facilities.rand && | |
1031 | rosecmp(src_addr, &rose_route->src_addr) == 0 && | |
1032 | ax25cmp(&facilities.dest_call, &rose_route->src_call) == 0 && | |
1033 | ax25cmp(&facilities.source_call, &rose_route->dest_call) == 0) { | |
1034 | rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 120); | |
1035 | goto out; | |
1036 | } | |
1037 | rose_route = rose_route->next; | |
1038 | } | |
1039 | ||
fe2c802a | 1040 | if ((new_neigh = rose_get_neigh(dest_addr, &cause, &diagnostic, 1)) == NULL) { |
1da177e4 LT |
1041 | rose_transmit_clear_request(rose_neigh, lci, cause, diagnostic); |
1042 | goto out; | |
1043 | } | |
1044 | ||
1045 | if ((new_lci = rose_new_lci(new_neigh)) == 0) { | |
1046 | rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 71); | |
1047 | goto out; | |
1048 | } | |
1049 | ||
1050 | if ((rose_route = kmalloc(sizeof(*rose_route), GFP_ATOMIC)) == NULL) { | |
1051 | rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 120); | |
1052 | goto out; | |
1053 | } | |
1054 | ||
1055 | rose_route->lci1 = lci; | |
1056 | rose_route->src_addr = *src_addr; | |
1057 | rose_route->dest_addr = *dest_addr; | |
1058 | rose_route->src_call = facilities.dest_call; | |
1059 | rose_route->dest_call = facilities.source_call; | |
1060 | rose_route->rand = facilities.rand; | |
1061 | rose_route->neigh1 = rose_neigh; | |
1062 | rose_route->lci2 = new_lci; | |
1063 | rose_route->neigh2 = new_neigh; | |
1064 | ||
1065 | rose_route->neigh1->use++; | |
1066 | rose_route->neigh2->use++; | |
1067 | ||
1068 | rose_route->next = rose_route_list; | |
1069 | rose_route_list = rose_route; | |
1070 | ||
1071 | skb->data[0] &= 0xF0; | |
1072 | skb->data[0] |= (rose_route->lci2 >> 8) & 0x0F; | |
1073 | skb->data[1] = (rose_route->lci2 >> 0) & 0xFF; | |
1074 | ||
1075 | rose_transmit_link(skb, rose_route->neigh2); | |
1076 | res = 1; | |
1077 | ||
1078 | out: | |
1079 | spin_unlock_bh(&rose_route_list_lock); | |
1080 | spin_unlock_bh(&rose_neigh_list_lock); | |
1da177e4 LT |
1081 | |
1082 | return res; | |
1083 | } | |
1084 | ||
1085 | #ifdef CONFIG_PROC_FS | |
1086 | ||
1087 | static void *rose_node_start(struct seq_file *seq, loff_t *pos) | |
f37f2c62 | 1088 | __acquires(rose_node_list_lock) |
1da177e4 LT |
1089 | { |
1090 | struct rose_node *rose_node; | |
1091 | int i = 1; | |
1092 | ||
f37f2c62 | 1093 | spin_lock_bh(&rose_node_list_lock); |
1da177e4 LT |
1094 | if (*pos == 0) |
1095 | return SEQ_START_TOKEN; | |
1096 | ||
3dcf7c5e | 1097 | for (rose_node = rose_node_list; rose_node && i < *pos; |
1da177e4 LT |
1098 | rose_node = rose_node->next, ++i); |
1099 | ||
1100 | return (i == *pos) ? rose_node : NULL; | |
1101 | } | |
1102 | ||
1103 | static void *rose_node_next(struct seq_file *seq, void *v, loff_t *pos) | |
1104 | { | |
1105 | ++*pos; | |
3dcf7c5e YH |
1106 | |
1107 | return (v == SEQ_START_TOKEN) ? rose_node_list | |
1da177e4 LT |
1108 | : ((struct rose_node *)v)->next; |
1109 | } | |
1110 | ||
1111 | static void rose_node_stop(struct seq_file *seq, void *v) | |
f37f2c62 | 1112 | __releases(rose_node_list_lock) |
1da177e4 | 1113 | { |
f37f2c62 | 1114 | spin_unlock_bh(&rose_node_list_lock); |
1da177e4 LT |
1115 | } |
1116 | ||
1117 | static int rose_node_show(struct seq_file *seq, void *v) | |
1118 | { | |
dcf777f6 | 1119 | char rsbuf[11]; |
1da177e4 LT |
1120 | int i; |
1121 | ||
1122 | if (v == SEQ_START_TOKEN) | |
1123 | seq_puts(seq, "address mask n neigh neigh neigh\n"); | |
1124 | else { | |
1125 | const struct rose_node *rose_node = v; | |
1126 | /* if (rose_node->loopback) { | |
1127 | seq_printf(seq, "%-10s %04d 1 loopback\n", | |
dcf777f6 RB |
1128 | rose2asc(rsbuf, &rose_node->address), |
1129 | rose_node->mask); | |
1da177e4 LT |
1130 | } else { */ |
1131 | seq_printf(seq, "%-10s %04d %d", | |
dcf777f6 RB |
1132 | rose2asc(rsbuf, &rose_node->address), |
1133 | rose_node->mask, | |
1134 | rose_node->count); | |
1da177e4 LT |
1135 | |
1136 | for (i = 0; i < rose_node->count; i++) | |
1137 | seq_printf(seq, " %05d", | |
1138 | rose_node->neighbour[i]->number); | |
1139 | ||
1140 | seq_puts(seq, "\n"); | |
1141 | /* } */ | |
1142 | } | |
1143 | return 0; | |
1144 | } | |
1145 | ||
fddda2b7 | 1146 | const struct seq_operations rose_node_seqops = { |
1da177e4 LT |
1147 | .start = rose_node_start, |
1148 | .next = rose_node_next, | |
1149 | .stop = rose_node_stop, | |
1150 | .show = rose_node_show, | |
1151 | }; | |
1152 | ||
1da177e4 | 1153 | static void *rose_neigh_start(struct seq_file *seq, loff_t *pos) |
95b7d924 | 1154 | __acquires(rose_neigh_list_lock) |
1da177e4 LT |
1155 | { |
1156 | struct rose_neigh *rose_neigh; | |
1157 | int i = 1; | |
1158 | ||
1159 | spin_lock_bh(&rose_neigh_list_lock); | |
1160 | if (*pos == 0) | |
1161 | return SEQ_START_TOKEN; | |
1162 | ||
3dcf7c5e | 1163 | for (rose_neigh = rose_neigh_list; rose_neigh && i < *pos; |
1da177e4 LT |
1164 | rose_neigh = rose_neigh->next, ++i); |
1165 | ||
1166 | return (i == *pos) ? rose_neigh : NULL; | |
1167 | } | |
1168 | ||
1169 | static void *rose_neigh_next(struct seq_file *seq, void *v, loff_t *pos) | |
1170 | { | |
1171 | ++*pos; | |
3dcf7c5e YH |
1172 | |
1173 | return (v == SEQ_START_TOKEN) ? rose_neigh_list | |
1da177e4 LT |
1174 | : ((struct rose_neigh *)v)->next; |
1175 | } | |
1176 | ||
1177 | static void rose_neigh_stop(struct seq_file *seq, void *v) | |
95b7d924 | 1178 | __releases(rose_neigh_list_lock) |
1da177e4 LT |
1179 | { |
1180 | spin_unlock_bh(&rose_neigh_list_lock); | |
1181 | } | |
1182 | ||
1183 | static int rose_neigh_show(struct seq_file *seq, void *v) | |
1184 | { | |
f75268cd | 1185 | char buf[11]; |
1da177e4 LT |
1186 | int i; |
1187 | ||
1188 | if (v == SEQ_START_TOKEN) | |
3dcf7c5e | 1189 | seq_puts(seq, |
1da177e4 LT |
1190 | "addr callsign dev count use mode restart t0 tf digipeaters\n"); |
1191 | else { | |
1192 | struct rose_neigh *rose_neigh = v; | |
1193 | ||
1194 | /* if (!rose_neigh->loopback) { */ | |
1195 | seq_printf(seq, "%05d %-9s %-4s %3d %3d %3s %3s %3lu %3lu", | |
1196 | rose_neigh->number, | |
f75268cd | 1197 | (rose_neigh->loopback) ? "RSLOOP-0" : ax2asc(buf, &rose_neigh->callsign), |
1da177e4 LT |
1198 | rose_neigh->dev ? rose_neigh->dev->name : "???", |
1199 | rose_neigh->count, | |
1200 | rose_neigh->use, | |
1201 | (rose_neigh->dce_mode) ? "DCE" : "DTE", | |
1202 | (rose_neigh->restarted) ? "yes" : "no", | |
1203 | ax25_display_timer(&rose_neigh->t0timer) / HZ, | |
1204 | ax25_display_timer(&rose_neigh->ftimer) / HZ); | |
1205 | ||
1206 | if (rose_neigh->digipeat != NULL) { | |
1207 | for (i = 0; i < rose_neigh->digipeat->ndigi; i++) | |
f75268cd | 1208 | seq_printf(seq, " %s", ax2asc(buf, &rose_neigh->digipeat->calls[i])); |
1da177e4 LT |
1209 | } |
1210 | ||
1211 | seq_puts(seq, "\n"); | |
1212 | } | |
1213 | return 0; | |
1214 | } | |
1215 | ||
1216 | ||
fddda2b7 | 1217 | const struct seq_operations rose_neigh_seqops = { |
1da177e4 LT |
1218 | .start = rose_neigh_start, |
1219 | .next = rose_neigh_next, | |
1220 | .stop = rose_neigh_stop, | |
1221 | .show = rose_neigh_show, | |
1222 | }; | |
1223 | ||
1da177e4 | 1224 | static void *rose_route_start(struct seq_file *seq, loff_t *pos) |
95b7d924 | 1225 | __acquires(rose_route_list_lock) |
1da177e4 LT |
1226 | { |
1227 | struct rose_route *rose_route; | |
1228 | int i = 1; | |
1229 | ||
1230 | spin_lock_bh(&rose_route_list_lock); | |
1231 | if (*pos == 0) | |
1232 | return SEQ_START_TOKEN; | |
1233 | ||
3dcf7c5e | 1234 | for (rose_route = rose_route_list; rose_route && i < *pos; |
1da177e4 LT |
1235 | rose_route = rose_route->next, ++i); |
1236 | ||
1237 | return (i == *pos) ? rose_route : NULL; | |
1238 | } | |
1239 | ||
1240 | static void *rose_route_next(struct seq_file *seq, void *v, loff_t *pos) | |
1241 | { | |
1242 | ++*pos; | |
3dcf7c5e YH |
1243 | |
1244 | return (v == SEQ_START_TOKEN) ? rose_route_list | |
1da177e4 LT |
1245 | : ((struct rose_route *)v)->next; |
1246 | } | |
1247 | ||
1248 | static void rose_route_stop(struct seq_file *seq, void *v) | |
95b7d924 | 1249 | __releases(rose_route_list_lock) |
1da177e4 LT |
1250 | { |
1251 | spin_unlock_bh(&rose_route_list_lock); | |
1252 | } | |
1253 | ||
1254 | static int rose_route_show(struct seq_file *seq, void *v) | |
1255 | { | |
dcf777f6 | 1256 | char buf[11], rsbuf[11]; |
f75268cd | 1257 | |
1da177e4 | 1258 | if (v == SEQ_START_TOKEN) |
3dcf7c5e | 1259 | seq_puts(seq, |
1da177e4 LT |
1260 | "lci address callsign neigh <-> lci address callsign neigh\n"); |
1261 | else { | |
1262 | struct rose_route *rose_route = v; | |
1263 | ||
3dcf7c5e | 1264 | if (rose_route->neigh1) |
1da177e4 LT |
1265 | seq_printf(seq, |
1266 | "%3.3X %-10s %-9s %05d ", | |
1267 | rose_route->lci1, | |
dcf777f6 | 1268 | rose2asc(rsbuf, &rose_route->src_addr), |
f75268cd | 1269 | ax2asc(buf, &rose_route->src_call), |
1da177e4 | 1270 | rose_route->neigh1->number); |
3dcf7c5e YH |
1271 | else |
1272 | seq_puts(seq, | |
1da177e4 LT |
1273 | "000 * * 00000 "); |
1274 | ||
3dcf7c5e | 1275 | if (rose_route->neigh2) |
1da177e4 LT |
1276 | seq_printf(seq, |
1277 | "%3.3X %-10s %-9s %05d\n", | |
dcf777f6 RB |
1278 | rose_route->lci2, |
1279 | rose2asc(rsbuf, &rose_route->dest_addr), | |
1280 | ax2asc(buf, &rose_route->dest_call), | |
1281 | rose_route->neigh2->number); | |
3dcf7c5e | 1282 | else |
1da177e4 LT |
1283 | seq_puts(seq, |
1284 | "000 * * 00000\n"); | |
1285 | } | |
1286 | return 0; | |
1287 | } | |
1288 | ||
fddda2b7 | 1289 | struct seq_operations rose_route_seqops = { |
1da177e4 LT |
1290 | .start = rose_route_start, |
1291 | .next = rose_route_next, | |
1292 | .stop = rose_route_stop, | |
1293 | .show = rose_route_show, | |
1294 | }; | |
1da177e4 LT |
1295 | #endif /* CONFIG_PROC_FS */ |
1296 | ||
1297 | /* | |
1298 | * Release all memory associated with ROSE routing structures. | |
1299 | */ | |
1300 | void __exit rose_rt_free(void) | |
1301 | { | |
1302 | struct rose_neigh *s, *rose_neigh = rose_neigh_list; | |
1303 | struct rose_node *t, *rose_node = rose_node_list; | |
1304 | struct rose_route *u, *rose_route = rose_route_list; | |
1305 | ||
1306 | while (rose_neigh != NULL) { | |
1307 | s = rose_neigh; | |
1308 | rose_neigh = rose_neigh->next; | |
1309 | ||
1310 | rose_remove_neigh(s); | |
1311 | } | |
1312 | ||
1313 | while (rose_node != NULL) { | |
1314 | t = rose_node; | |
1315 | rose_node = rose_node->next; | |
1316 | ||
1317 | rose_remove_node(t); | |
1318 | } | |
1319 | ||
1320 | while (rose_route != NULL) { | |
1321 | u = rose_route; | |
1322 | rose_route = rose_route->next; | |
1323 | ||
1324 | rose_remove_route(u); | |
1325 | } | |
1326 | } |