3 * This module is free software; you can redistribute it and/or
4 * modify it under the terms of the GNU General Public License
5 * as published by the Free Software Foundation; either version
6 * 2 of the License, or (at your option) any later version.
9 * 03-01-2007 Added forwarding for x.25 Andrew Hendry
11 #include <linux/if_arp.h>
12 #include <linux/init.h>
13 #include <linux/slab.h>
16 LIST_HEAD(x25_forward_list
);
17 DEFINE_RWLOCK(x25_forward_list_lock
);
19 int x25_forward_call(struct x25_address
*dest_addr
, struct x25_neigh
*from
,
20 struct sk_buff
*skb
, int lci
)
23 struct x25_neigh
*neigh_new
= NULL
;
24 struct list_head
*entry
;
25 struct x25_forward
*x25_frwd
, *new_frwd
;
30 if ((rt
= x25_get_route(dest_addr
)) == NULL
)
33 if ((neigh_new
= x25_get_neigh(rt
->dev
)) == NULL
) {
34 /* This shouldnt happen, if it occurs somehow
35 * do something sensible
40 /* Avoid a loop. This is the normal exit path for a
41 * system with only one x.25 iface and default route
43 if (rt
->dev
== from
->dev
) {
47 /* Remote end sending a call request on an already
48 * established LCI? It shouldnt happen, just in case..
50 read_lock_bh(&x25_forward_list_lock
);
51 list_for_each(entry
, &x25_forward_list
) {
52 x25_frwd
= list_entry(entry
, struct x25_forward
, node
);
53 if (x25_frwd
->lci
== lci
) {
54 printk(KERN_WARNING
"X.25: call request for lci which is already registered!, transmitting but not registering new pair\n");
58 read_unlock_bh(&x25_forward_list_lock
);
60 /* Save the forwarding details for future traffic */
62 if ((new_frwd
= kmalloc(sizeof(struct x25_forward
),
63 GFP_ATOMIC
)) == NULL
){
68 new_frwd
->dev1
= rt
->dev
;
69 new_frwd
->dev2
= from
->dev
;
70 write_lock_bh(&x25_forward_list_lock
);
71 list_add(&new_frwd
->node
, &x25_forward_list
);
72 write_unlock_bh(&x25_forward_list_lock
);
75 /* Forward the call request */
76 if ( (skbn
= skb_clone(skb
, GFP_ATOMIC
)) == NULL
){
79 x25_transmit_link(skbn
, neigh_new
);
84 x25_neigh_put(neigh_new
);
94 int x25_forward_data(int lci
, struct x25_neigh
*from
, struct sk_buff
*skb
) {
96 struct x25_forward
*frwd
;
97 struct list_head
*entry
;
98 struct net_device
*peer
= NULL
;
100 struct sk_buff
*skbn
;
103 read_lock_bh(&x25_forward_list_lock
);
104 list_for_each(entry
, &x25_forward_list
) {
105 frwd
= list_entry(entry
, struct x25_forward
, node
);
106 if (frwd
->lci
== lci
) {
107 /* The call is established, either side can send */
108 if (from
->dev
== frwd
->dev1
) {
116 read_unlock_bh(&x25_forward_list_lock
);
118 if ( (nb
= x25_get_neigh(peer
)) == NULL
)
121 if ( (skbn
= pskb_copy(skb
, GFP_ATOMIC
)) == NULL
){
125 x25_transmit_link(skbn
, nb
);
134 void x25_clear_forward_by_lci(unsigned int lci
)
136 struct x25_forward
*fwd
;
137 struct list_head
*entry
, *tmp
;
139 write_lock_bh(&x25_forward_list_lock
);
141 list_for_each_safe(entry
, tmp
, &x25_forward_list
) {
142 fwd
= list_entry(entry
, struct x25_forward
, node
);
143 if (fwd
->lci
== lci
) {
144 list_del(&fwd
->node
);
148 write_unlock_bh(&x25_forward_list_lock
);
152 void x25_clear_forward_by_dev(struct net_device
*dev
)
154 struct x25_forward
*fwd
;
155 struct list_head
*entry
, *tmp
;
157 write_lock_bh(&x25_forward_list_lock
);
159 list_for_each_safe(entry
, tmp
, &x25_forward_list
) {
160 fwd
= list_entry(entry
, struct x25_forward
, node
);
161 if ((fwd
->dev1
== dev
) || (fwd
->dev2
== dev
)){
162 list_del(&fwd
->node
);
166 write_unlock_bh(&x25_forward_list_lock
);
This page took 0.032839 seconds and 5 git commands to generate.