2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* NET3: Token ring device handling subroutines
|
2007-02-09 15:24:24 +01:00
|
|
|
*
|
2005-04-17 00:20:36 +02:00
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* Fixes: 3 Feb 97 Paul Norton <pnorton@cts.com> Minor routing fixes.
|
|
|
|
* Added rif table to /proc/net/tr_rif and rif timeout to
|
|
|
|
* /proc/sys/net/token-ring/rif_timeout.
|
|
|
|
* 22 Jun 98 Paul Norton <p.norton@computer.org> Rearranged
|
|
|
|
* tr_header and tr_type_trans to handle passing IPX SNAP and
|
|
|
|
* 802.2 through the correct layers. Eliminated tr_reformat.
|
2007-02-09 15:24:24 +01:00
|
|
|
*
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/jiffies.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/socket.h>
|
|
|
|
#include <linux/in.h>
|
|
|
|
#include <linux/inet.h>
|
|
|
|
#include <linux/netdevice.h>
|
|
|
|
#include <linux/trdevice.h>
|
|
|
|
#include <linux/skbuff.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/timer.h>
|
|
|
|
#include <linux/net.h>
|
|
|
|
#include <linux/proc_fs.h>
|
|
|
|
#include <linux/seq_file.h>
|
|
|
|
#include <linux/init.h>
|
2008-01-25 02:04:49 +01:00
|
|
|
#include <linux/sysctl.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 09:04:11 +01:00
|
|
|
#include <linux/slab.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
#include <net/arp.h>
|
2007-09-12 12:01:34 +02:00
|
|
|
#include <net/net_namespace.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
static void tr_add_rif_info(struct trh_hdr *trh, struct net_device *dev);
|
|
|
|
static void rif_check_expire(unsigned long dummy);
|
|
|
|
|
|
|
|
#define TR_SR_DEBUG 0
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Each RIF entry we learn is kept this way
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-05-26 21:59:42 +02:00
|
|
|
struct rif_cache {
|
2005-04-17 00:20:36 +02:00
|
|
|
unsigned char addr[TR_ALEN];
|
|
|
|
int iface;
|
2005-05-26 21:59:05 +02:00
|
|
|
__be16 rcf;
|
|
|
|
__be16 rseg[8];
|
2005-05-26 21:59:42 +02:00
|
|
|
struct rif_cache *next;
|
2005-04-17 00:20:36 +02:00
|
|
|
unsigned long last_used;
|
|
|
|
unsigned char local_ring;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define RIF_TABLE_SIZE 32
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We hash the RIF cache 32 ways. We do after all have to look it
|
|
|
|
* up a lot.
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-05-26 21:59:42 +02:00
|
|
|
static struct rif_cache *rif_table[RIF_TABLE_SIZE];
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
static DEFINE_SPINLOCK(rif_lock);
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Garbage disposal timer.
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
static struct timer_list rif_timer;
|
|
|
|
|
2008-02-01 02:16:32 +01:00
|
|
|
static int sysctl_tr_rif_timeout = 60*10*HZ;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
static inline unsigned long rif_hash(const unsigned char *addr)
|
|
|
|
{
|
|
|
|
unsigned long x;
|
|
|
|
|
|
|
|
x = addr[0];
|
|
|
|
x = (x << 2) ^ addr[1];
|
|
|
|
x = (x << 2) ^ addr[2];
|
|
|
|
x = (x << 2) ^ addr[3];
|
|
|
|
x = (x << 2) ^ addr[4];
|
|
|
|
x = (x << 2) ^ addr[5];
|
|
|
|
|
|
|
|
x ^= x >> 8;
|
|
|
|
|
|
|
|
return x & (RIF_TABLE_SIZE - 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Put the headers on a token ring packet. Token ring source routing
|
|
|
|
* makes this a little more exciting than on ethernet.
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
static int tr_header(struct sk_buff *skb, struct net_device *dev,
|
|
|
|
unsigned short type,
|
2012-04-15 07:58:06 +02:00
|
|
|
const void *daddr, const void *saddr, unsigned int len)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct trh_hdr *trh;
|
|
|
|
int hdr_len;
|
|
|
|
|
2007-02-09 15:24:24 +01:00
|
|
|
/*
|
|
|
|
* Add the 802.2 SNAP header if IP as the IPv4/IPv6 code calls
|
2005-04-17 00:20:36 +02:00
|
|
|
* dev->hard_header directly.
|
|
|
|
*/
|
|
|
|
if (type == ETH_P_IP || type == ETH_P_IPV6 || type == ETH_P_ARP)
|
|
|
|
{
|
|
|
|
struct trllc *trllc;
|
|
|
|
|
|
|
|
hdr_len = sizeof(struct trh_hdr) + sizeof(struct trllc);
|
|
|
|
trh = (struct trh_hdr *)skb_push(skb, hdr_len);
|
|
|
|
trllc = (struct trllc *)(trh+1);
|
|
|
|
trllc->dsap = trllc->ssap = EXTENDED_SAP;
|
|
|
|
trllc->llc = UI_CMD;
|
|
|
|
trllc->protid[0] = trllc->protid[1] = trllc->protid[2] = 0x00;
|
|
|
|
trllc->ethertype = htons(type);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
hdr_len = sizeof(struct trh_hdr);
|
2007-02-09 15:24:24 +01:00
|
|
|
trh = (struct trh_hdr *)skb_push(skb, hdr_len);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
trh->ac=AC;
|
|
|
|
trh->fc=LLC_FRAME;
|
|
|
|
|
|
|
|
if(saddr)
|
|
|
|
memcpy(trh->saddr,saddr,dev->addr_len);
|
|
|
|
else
|
|
|
|
memcpy(trh->saddr,dev->dev_addr,dev->addr_len);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Build the destination and then source route the frame
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
|
|
|
|
if(daddr)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
memcpy(trh->daddr,daddr,dev->addr_len);
|
2007-10-09 10:40:57 +02:00
|
|
|
tr_source_route(skb, trh, dev);
|
2010-09-22 22:43:57 +02:00
|
|
|
return hdr_len;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return -hdr_len;
|
|
|
|
}
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* A neighbour discovery of some species (eg arp) has completed. We
|
|
|
|
* can now send the packet.
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
|
|
|
|
static int tr_rebuild_header(struct sk_buff *skb)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct trh_hdr *trh=(struct trh_hdr *)skb->data;
|
|
|
|
struct trllc *trllc=(struct trllc *)(skb->data+sizeof(struct trh_hdr));
|
|
|
|
struct net_device *dev = skb->dev;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* FIXME: We don't yet support IPv6 over token rings
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if(trllc->ethertype != htons(ETH_P_IP)) {
|
2006-09-27 06:23:16 +02:00
|
|
|
printk("tr_rebuild_header: Don't know how to resolve type %04X addresses ?\n", ntohs(trllc->ethertype));
|
2005-04-17 00:20:36 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_INET
|
|
|
|
if(arp_find(trh->daddr, skb)) {
|
|
|
|
return 1;
|
|
|
|
}
|
2007-02-09 15:24:24 +01:00
|
|
|
else
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
tr_source_route(skb,trh,dev);
|
2005-04-17 00:20:36 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Some of this is a bit hackish. We intercept RIF information
|
|
|
|
* used for source routing. We also grab IP directly and don't feed
|
|
|
|
* it via SNAP.
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2006-09-27 06:23:16 +02:00
|
|
|
__be16 tr_type_trans(struct sk_buff *skb, struct net_device *dev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
|
2007-03-19 23:27:07 +01:00
|
|
|
struct trh_hdr *trh;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct trllc *trllc;
|
2012-04-15 07:58:06 +02:00
|
|
|
unsigned int riflen=0;
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2007-03-19 23:29:16 +01:00
|
|
|
skb->dev = dev;
|
2007-03-19 23:30:44 +01:00
|
|
|
skb_reset_mac_header(skb);
|
2007-03-19 23:27:07 +01:00
|
|
|
trh = tr_hdr(skb);
|
2007-02-09 15:24:24 +01:00
|
|
|
|
|
|
|
if(trh->saddr[0] & TR_RII)
|
2005-04-17 00:20:36 +02:00
|
|
|
riflen = (ntohs(trh->rcf) & TR_RCF_LEN_MASK) >> 8;
|
|
|
|
|
|
|
|
trllc = (struct trllc *)(skb->data+sizeof(struct trh_hdr)-TR_MAXRIFLEN+riflen);
|
|
|
|
|
|
|
|
skb_pull(skb,sizeof(struct trh_hdr)-TR_MAXRIFLEN+riflen);
|
|
|
|
|
2007-02-09 15:24:24 +01:00
|
|
|
if(*trh->daddr & 0x80)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2007-02-09 15:24:24 +01:00
|
|
|
if(!memcmp(trh->daddr,dev->broadcast,TR_ALEN))
|
2005-04-17 00:20:36 +02:00
|
|
|
skb->pkt_type=PACKET_BROADCAST;
|
|
|
|
else
|
|
|
|
skb->pkt_type=PACKET_MULTICAST;
|
|
|
|
}
|
|
|
|
else if ( (trh->daddr[0] & 0x01) && (trh->daddr[1] & 0x00) && (trh->daddr[2] & 0x5E))
|
|
|
|
{
|
|
|
|
skb->pkt_type=PACKET_MULTICAST;
|
|
|
|
}
|
2007-02-09 15:24:24 +01:00
|
|
|
else if(dev->flags & IFF_PROMISC)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
if(memcmp(trh->daddr, dev->dev_addr, TR_ALEN))
|
|
|
|
skb->pkt_type=PACKET_OTHERHOST;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((skb->pkt_type != PACKET_BROADCAST) &&
|
|
|
|
(skb->pkt_type != PACKET_MULTICAST))
|
2007-02-09 15:24:24 +01:00
|
|
|
tr_add_rif_info(trh,dev) ;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
2007-02-09 15:24:24 +01:00
|
|
|
* Strip the SNAP header from ARP packets since we don't
|
2005-04-17 00:20:36 +02:00
|
|
|
* pass them through to the 802.2/SNAP layers.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (trllc->dsap == EXTENDED_SAP &&
|
2006-09-27 06:23:16 +02:00
|
|
|
(trllc->ethertype == htons(ETH_P_IP) ||
|
|
|
|
trllc->ethertype == htons(ETH_P_IPV6) ||
|
|
|
|
trllc->ethertype == htons(ETH_P_ARP)))
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
skb_pull(skb, sizeof(struct trllc));
|
|
|
|
return trllc->ethertype;
|
|
|
|
}
|
|
|
|
|
2006-09-27 06:23:16 +02:00
|
|
|
return htons(ETH_P_TR_802_2);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2007-02-09 15:24:24 +01:00
|
|
|
* We try to do source routing...
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
|
2007-10-09 10:40:57 +02:00
|
|
|
void tr_source_route(struct sk_buff *skb,struct trh_hdr *trh,
|
|
|
|
struct net_device *dev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int slack;
|
|
|
|
unsigned int hash;
|
2005-05-26 21:59:42 +02:00
|
|
|
struct rif_cache *entry;
|
2005-04-17 00:20:36 +02:00
|
|
|
unsigned char *olddata;
|
2005-08-18 23:04:51 +02:00
|
|
|
unsigned long flags;
|
2007-02-09 15:24:24 +01:00
|
|
|
static const unsigned char mcast_func_addr[]
|
2005-04-17 00:20:36 +02:00
|
|
|
= {0xC0,0x00,0x00,0x04,0x00,0x00};
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-08-18 23:04:51 +02:00
|
|
|
spin_lock_irqsave(&rif_lock, flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
2007-02-09 15:24:24 +01:00
|
|
|
* Broadcasts are single route as stated in RFC 1042
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
if( (!memcmp(&(trh->daddr[0]),&(dev->broadcast[0]),TR_ALEN)) ||
|
|
|
|
(!memcmp(&(trh->daddr[0]),&(mcast_func_addr[0]), TR_ALEN)) )
|
|
|
|
{
|
2007-02-09 15:24:24 +01:00
|
|
|
trh->rcf=htons((((sizeof(trh->rcf)) << 8) & TR_RCF_LEN_MASK)
|
2005-04-17 00:20:36 +02:00
|
|
|
| TR_RCF_FRAME2K | TR_RCF_LIMITED_BROADCAST);
|
|
|
|
trh->saddr[0]|=TR_RII;
|
|
|
|
}
|
2007-02-09 15:24:24 +01:00
|
|
|
else
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
hash = rif_hash(trh->daddr);
|
|
|
|
/*
|
|
|
|
* Walk the hash table and look for an entry
|
|
|
|
*/
|
|
|
|
for(entry=rif_table[hash];entry && memcmp(&(entry->addr[0]),&(trh->daddr[0]),TR_ALEN);entry=entry->next);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we found an entry we can route the frame.
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
if(entry)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
#if TR_SR_DEBUG
|
2008-10-27 23:59:26 +01:00
|
|
|
printk("source routing for %pM\n", trh->daddr);
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
|
|
|
if(!entry->local_ring && (ntohs(entry->rcf) & TR_RCF_LEN_MASK) >> 8)
|
|
|
|
{
|
|
|
|
trh->rcf=entry->rcf;
|
|
|
|
memcpy(&trh->rseg[0],&entry->rseg[0],8*sizeof(unsigned short));
|
2007-02-09 15:24:24 +01:00
|
|
|
trh->rcf^=htons(TR_RCF_DIR_BIT);
|
2005-04-17 00:20:36 +02:00
|
|
|
trh->rcf&=htons(0x1fff); /* Issam Chehab <ichehab@madge1.demon.co.uk> */
|
|
|
|
|
|
|
|
trh->saddr[0]|=TR_RII;
|
|
|
|
#if TR_SR_DEBUG
|
|
|
|
printk("entry found with rcf %04x\n", entry->rcf);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
printk("entry found but without rcf length, local=%02x\n", entry->local_ring);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
entry->last_used=jiffies;
|
|
|
|
}
|
2007-02-09 15:24:24 +01:00
|
|
|
else
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Without the information we simply have to shout
|
|
|
|
* on the wire. The replies should rapidly clean this
|
|
|
|
* situation up.
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
trh->rcf=htons((((sizeof(trh->rcf)) << 8) & TR_RCF_LEN_MASK)
|
2005-04-17 00:20:36 +02:00
|
|
|
| TR_RCF_FRAME2K | TR_RCF_LIMITED_BROADCAST);
|
|
|
|
trh->saddr[0]|=TR_RII;
|
|
|
|
#if TR_SR_DEBUG
|
|
|
|
printk("no entry in rif table found - broadcasting frame\n");
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Compress the RIF here so we don't have to do it in the driver(s) */
|
|
|
|
if (!(trh->saddr[0] & 0x80))
|
|
|
|
slack = 18;
|
2007-02-09 15:24:24 +01:00
|
|
|
else
|
2005-04-17 00:20:36 +02:00
|
|
|
slack = 18 - ((ntohs(trh->rcf) & TR_RCF_LEN_MASK)>>8);
|
|
|
|
olddata = skb->data;
|
2005-08-18 23:04:51 +02:00
|
|
|
spin_unlock_irqrestore(&rif_lock, flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
skb_pull(skb, slack);
|
|
|
|
memmove(skb->data, olddata, sizeof(struct trh_hdr) - slack);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We have learned some new RIF information for our source
|
|
|
|
* routing.
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
static void tr_add_rif_info(struct trh_hdr *trh, struct net_device *dev)
|
|
|
|
{
|
|
|
|
unsigned int hash, rii_p = 0;
|
2005-08-18 23:04:51 +02:00
|
|
|
unsigned long flags;
|
2005-05-26 21:59:42 +02:00
|
|
|
struct rif_cache *entry;
|
2005-10-23 10:31:45 +02:00
|
|
|
unsigned char saddr0;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2005-08-18 23:04:51 +02:00
|
|
|
spin_lock_irqsave(&rif_lock, flags);
|
2005-10-23 10:31:45 +02:00
|
|
|
saddr0 = trh->saddr[0];
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Firstly see if the entry exists
|
|
|
|
*/
|
|
|
|
|
2007-02-09 15:24:24 +01:00
|
|
|
if(trh->saddr[0] & TR_RII)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
trh->saddr[0]&=0x7f;
|
|
|
|
if (((ntohs(trh->rcf) & TR_RCF_LEN_MASK) >> 8) > 2)
|
|
|
|
{
|
|
|
|
rii_p = 1;
|
2007-02-09 15:24:24 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
hash = rif_hash(trh->saddr);
|
|
|
|
for(entry=rif_table[hash];entry && memcmp(&(entry->addr[0]),&(trh->saddr[0]),TR_ALEN);entry=entry->next);
|
|
|
|
|
2007-02-09 15:24:24 +01:00
|
|
|
if(entry==NULL)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
#if TR_SR_DEBUG
|
2008-10-27 23:59:26 +01:00
|
|
|
printk("adding rif_entry: addr:%pM rcf:%04X\n",
|
|
|
|
trh->saddr, ntohs(trh->rcf));
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
|
|
|
/*
|
|
|
|
* Allocate our new entry. A failure to allocate loses
|
|
|
|
* use the information. This is harmless.
|
|
|
|
*
|
|
|
|
* FIXME: We ought to keep some kind of cache size
|
|
|
|
* limiting and adjust the timers to suit.
|
|
|
|
*/
|
2005-05-26 21:59:42 +02:00
|
|
|
entry=kmalloc(sizeof(struct rif_cache),GFP_ATOMIC);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-02-09 15:24:24 +01:00
|
|
|
if(!entry)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
printk(KERN_DEBUG "tr.c: Couldn't malloc rif cache entry !\n");
|
2005-08-18 23:04:51 +02:00
|
|
|
spin_unlock_irqrestore(&rif_lock, flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
memcpy(&(entry->addr[0]),&(trh->saddr[0]),TR_ALEN);
|
|
|
|
entry->iface = dev->ifindex;
|
|
|
|
entry->next=rif_table[hash];
|
|
|
|
entry->last_used=jiffies;
|
|
|
|
rif_table[hash]=entry;
|
|
|
|
|
|
|
|
if (rii_p)
|
|
|
|
{
|
|
|
|
entry->rcf = trh->rcf & htons((unsigned short)~TR_RCF_BROADCAST_MASK);
|
|
|
|
memcpy(&(entry->rseg[0]),&(trh->rseg[0]),8*sizeof(unsigned short));
|
|
|
|
entry->local_ring = 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
entry->local_ring = 1;
|
|
|
|
}
|
2007-02-09 15:24:24 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
else /* Y. Tahara added */
|
2007-02-09 15:24:24 +01:00
|
|
|
{
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Update existing entries
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
if (!entry->local_ring)
|
2005-04-17 00:20:36 +02:00
|
|
|
if (entry->rcf != (trh->rcf & htons((unsigned short)~TR_RCF_BROADCAST_MASK)) &&
|
|
|
|
!(trh->rcf & htons(TR_RCF_BROADCAST_MASK)))
|
|
|
|
{
|
|
|
|
#if TR_SR_DEBUG
|
2008-10-27 23:59:26 +01:00
|
|
|
printk("updating rif_entry: addr:%pM rcf:%04X\n",
|
|
|
|
trh->saddr, ntohs(trh->rcf));
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
|
|
|
entry->rcf = trh->rcf & htons((unsigned short)~TR_RCF_BROADCAST_MASK);
|
2007-02-09 15:24:24 +01:00
|
|
|
memcpy(&(entry->rseg[0]),&(trh->rseg[0]),8*sizeof(unsigned short));
|
|
|
|
}
|
|
|
|
entry->last_used=jiffies;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2005-10-23 10:31:45 +02:00
|
|
|
trh->saddr[0]=saddr0; /* put the routing indicator back for tcpdump */
|
2005-08-18 23:04:51 +02:00
|
|
|
spin_unlock_irqrestore(&rif_lock, flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Scan the cache with a timer and see what we need to throw out.
|
|
|
|
*/
|
|
|
|
|
2007-02-09 15:24:24 +01:00
|
|
|
static void rif_check_expire(unsigned long dummy)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int i;
|
2005-08-18 23:04:51 +02:00
|
|
|
unsigned long flags, next_interval = jiffies + sysctl_tr_rif_timeout/2;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2005-08-18 23:04:51 +02:00
|
|
|
spin_lock_irqsave(&rif_lock, flags);
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
for(i =0; i < RIF_TABLE_SIZE; i++) {
|
2005-05-26 21:59:42 +02:00
|
|
|
struct rif_cache *entry, **pentry;
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
pentry = rif_table+i;
|
|
|
|
while((entry=*pentry) != NULL) {
|
|
|
|
unsigned long expires
|
|
|
|
= entry->last_used + sysctl_tr_rif_timeout;
|
|
|
|
|
|
|
|
if (time_before_eq(expires, jiffies)) {
|
|
|
|
*pentry = entry->next;
|
|
|
|
kfree(entry);
|
|
|
|
} else {
|
|
|
|
pentry = &entry->next;
|
|
|
|
|
|
|
|
if (time_before(expires, next_interval))
|
|
|
|
next_interval = expires;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-08-18 23:04:51 +02:00
|
|
|
spin_unlock_irqrestore(&rif_lock, flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
mod_timer(&rif_timer, next_interval);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Generate the /proc/net information for the token ring RIF
|
|
|
|
* routing.
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
#ifdef CONFIG_PROC_FS
|
|
|
|
|
2005-05-26 21:59:42 +02:00
|
|
|
static struct rif_cache *rif_get_idx(loff_t pos)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int i;
|
2005-05-26 21:59:42 +02:00
|
|
|
struct rif_cache *entry;
|
2005-04-17 00:20:36 +02:00
|
|
|
loff_t off = 0;
|
|
|
|
|
2007-02-09 15:24:24 +01:00
|
|
|
for(i = 0; i < RIF_TABLE_SIZE; i++)
|
2005-04-17 00:20:36 +02:00
|
|
|
for(entry = rif_table[i]; entry; entry = entry->next) {
|
|
|
|
if (off == pos)
|
|
|
|
return entry;
|
|
|
|
++off;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *rif_seq_start(struct seq_file *seq, loff_t *pos)
|
2009-02-25 11:31:24 +01:00
|
|
|
__acquires(&rif_lock)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2005-08-18 23:04:51 +02:00
|
|
|
spin_lock_irq(&rif_lock);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
return *pos ? rif_get_idx(*pos - 1) : SEQ_START_TOKEN;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *rif_seq_next(struct seq_file *seq, void *v, loff_t *pos)
|
|
|
|
{
|
|
|
|
int i;
|
2005-05-26 21:59:42 +02:00
|
|
|
struct rif_cache *ent = v;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
++*pos;
|
|
|
|
|
|
|
|
if (v == SEQ_START_TOKEN) {
|
|
|
|
i = -1;
|
|
|
|
goto scan;
|
|
|
|
}
|
|
|
|
|
2007-02-09 15:24:24 +01:00
|
|
|
if (ent->next)
|
2005-04-17 00:20:36 +02:00
|
|
|
return ent->next;
|
|
|
|
|
|
|
|
i = rif_hash(ent->addr);
|
|
|
|
scan:
|
|
|
|
while (++i < RIF_TABLE_SIZE) {
|
|
|
|
if ((ent = rif_table[i]) != NULL)
|
|
|
|
return ent;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void rif_seq_stop(struct seq_file *seq, void *v)
|
2009-02-25 11:31:24 +01:00
|
|
|
__releases(&rif_lock)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2005-08-18 23:04:51 +02:00
|
|
|
spin_unlock_irq(&rif_lock);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static int rif_seq_show(struct seq_file *seq, void *v)
|
|
|
|
{
|
|
|
|
int j, rcf_len, segment, brdgnmb;
|
2005-05-26 21:59:42 +02:00
|
|
|
struct rif_cache *entry = v;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (v == SEQ_START_TOKEN)
|
|
|
|
seq_puts(seq,
|
|
|
|
"if TR address TTL rcf routing segments\n");
|
|
|
|
else {
|
2007-09-17 20:56:21 +02:00
|
|
|
struct net_device *dev = dev_get_by_index(&init_net, entry->iface);
|
2005-04-17 00:20:36 +02:00
|
|
|
long ttl = (long) (entry->last_used + sysctl_tr_rif_timeout)
|
|
|
|
- (long) jiffies;
|
|
|
|
|
2008-10-27 23:59:26 +01:00
|
|
|
seq_printf(seq, "%s %pM %7li ",
|
2005-04-17 00:20:36 +02:00
|
|
|
dev?dev->name:"?",
|
2008-10-27 23:59:26 +01:00
|
|
|
entry->addr,
|
2005-04-17 00:20:36 +02:00
|
|
|
ttl/HZ);
|
|
|
|
|
|
|
|
if (entry->local_ring)
|
2007-02-09 15:24:24 +01:00
|
|
|
seq_puts(seq, "local\n");
|
2005-04-17 00:20:36 +02:00
|
|
|
else {
|
|
|
|
|
|
|
|
seq_printf(seq, "%04X", ntohs(entry->rcf));
|
2007-02-09 15:24:24 +01:00
|
|
|
rcf_len = ((ntohs(entry->rcf) & TR_RCF_LEN_MASK)>>8)-2;
|
2005-04-17 00:20:36 +02:00
|
|
|
if (rcf_len)
|
2007-02-09 15:24:24 +01:00
|
|
|
rcf_len >>= 1;
|
2005-04-17 00:20:36 +02:00
|
|
|
for(j = 1; j < rcf_len; j++) {
|
|
|
|
if(j==1) {
|
|
|
|
segment=ntohs(entry->rseg[j-1])>>4;
|
|
|
|
seq_printf(seq," %03X",segment);
|
2007-04-21 02:09:22 +02:00
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
segment=ntohs(entry->rseg[j])>>4;
|
|
|
|
brdgnmb=ntohs(entry->rseg[j-1])&0x00f;
|
|
|
|
seq_printf(seq,"-%01X-%03X",brdgnmb,segment);
|
|
|
|
}
|
|
|
|
seq_putc(seq, '\n');
|
|
|
|
}
|
2009-04-08 23:27:28 +02:00
|
|
|
|
|
|
|
if (dev)
|
|
|
|
dev_put(dev);
|
2007-02-09 15:24:24 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-07-11 08:07:31 +02:00
|
|
|
static const struct seq_operations rif_seq_ops = {
|
2005-04-17 00:20:36 +02:00
|
|
|
.start = rif_seq_start,
|
|
|
|
.next = rif_seq_next,
|
|
|
|
.stop = rif_seq_stop,
|
|
|
|
.show = rif_seq_show,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int rif_seq_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
return seq_open(file, &rif_seq_ops);
|
|
|
|
}
|
|
|
|
|
2007-02-12 09:55:35 +01:00
|
|
|
static const struct file_operations rif_seq_fops = {
|
2005-04-17 00:20:36 +02:00
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.open = rif_seq_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = seq_release,
|
|
|
|
};
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2007-10-09 10:40:57 +02:00
|
|
|
static const struct header_ops tr_header_ops = {
|
|
|
|
.create = tr_header,
|
|
|
|
.rebuild= tr_rebuild_header,
|
|
|
|
};
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
static void tr_setup(struct net_device *dev)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Configure and register
|
|
|
|
*/
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2007-10-09 10:40:57 +02:00
|
|
|
dev->header_ops = &tr_header_ops;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
dev->type = ARPHRD_IEEE802_TR;
|
|
|
|
dev->hard_header_len = TR_HLEN;
|
|
|
|
dev->mtu = 2000;
|
|
|
|
dev->addr_len = TR_ALEN;
|
|
|
|
dev->tx_queue_len = 100; /* Long queues on tr */
|
2007-02-09 15:24:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
memset(dev->broadcast,0xFF, TR_ALEN);
|
|
|
|
|
|
|
|
/* New-style flags. */
|
|
|
|
dev->flags = IFF_BROADCAST | IFF_MULTICAST ;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* alloc_trdev - Register token ring device
|
|
|
|
* @sizeof_priv: Size of additional driver-private structure to be allocated
|
|
|
|
* for this token ring device
|
|
|
|
*
|
|
|
|
* Fill in the fields of the device structure with token ring-generic values.
|
|
|
|
*
|
|
|
|
* Constructs a new net device, complete with a private data area of
|
|
|
|
* size @sizeof_priv. A 32-byte (not bit) alignment is enforced for
|
|
|
|
* this private data area.
|
|
|
|
*/
|
|
|
|
struct net_device *alloc_trdev(int sizeof_priv)
|
|
|
|
{
|
|
|
|
return alloc_netdev(sizeof_priv, "tr%d", tr_setup);
|
|
|
|
}
|
|
|
|
|
2008-01-25 02:04:49 +01:00
|
|
|
#ifdef CONFIG_SYSCTL
|
|
|
|
static struct ctl_table tr_table[] = {
|
|
|
|
{
|
|
|
|
.procname = "rif_timeout",
|
|
|
|
.data = &sysctl_tr_rif_timeout,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec
|
2008-01-25 02:04:49 +01:00
|
|
|
},
|
2009-11-05 22:32:03 +01:00
|
|
|
{ },
|
2008-01-25 02:04:49 +01:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Called during bootup. We don't actually have to initialise
|
|
|
|
* too much for this.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static int __init rif_init(void)
|
|
|
|
{
|
2008-01-14 07:32:49 +01:00
|
|
|
rif_timer.expires = jiffies + sysctl_tr_rif_timeout;
|
2008-01-24 06:20:07 +01:00
|
|
|
setup_timer(&rif_timer, rif_check_expire, 0);
|
2005-04-17 00:20:36 +02:00
|
|
|
add_timer(&rif_timer);
|
2008-01-25 02:04:49 +01:00
|
|
|
#ifdef CONFIG_SYSCTL
|
2012-04-19 15:44:49 +02:00
|
|
|
register_net_sysctl(&init_net, "net/token-ring", tr_table);
|
2008-01-25 02:04:49 +01:00
|
|
|
#endif
|
2007-09-12 12:01:34 +02:00
|
|
|
proc_net_fops_create(&init_net, "tr_rif", S_IRUGO, &rif_seq_fops);
|
2005-04-17 00:20:36 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
module_init(rif_init);
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(tr_type_trans);
|
|
|
|
EXPORT_SYMBOL(alloc_trdev);
|
2009-03-04 08:48:50 +01:00
|
|
|
|
|
|
|
MODULE_LICENSE("GPL");
|