diff options
Diffstat (limited to 'net/802')
| -rw-r--r-- | net/802/tr.c | 26 |
1 files changed, 13 insertions, 13 deletions
diff --git a/net/802/tr.c b/net/802/tr.c index 85293ccf7efc..a755e880f4ba 100644 --- a/net/802/tr.c +++ b/net/802/tr.c | |||
| @@ -47,12 +47,12 @@ static void rif_check_expire(unsigned long dummy); | |||
| 47 | * Each RIF entry we learn is kept this way | 47 | * Each RIF entry we learn is kept this way |
| 48 | */ | 48 | */ |
| 49 | 49 | ||
| 50 | struct rif_cache_s { | 50 | struct rif_cache { |
| 51 | unsigned char addr[TR_ALEN]; | 51 | unsigned char addr[TR_ALEN]; |
| 52 | int iface; | 52 | int iface; |
| 53 | __u16 rcf; | 53 | __be16 rcf; |
| 54 | __u16 rseg[8]; | 54 | __be16 rseg[8]; |
| 55 | struct rif_cache_s *next; | 55 | struct rif_cache *next; |
| 56 | unsigned long last_used; | 56 | unsigned long last_used; |
| 57 | unsigned char local_ring; | 57 | unsigned char local_ring; |
| 58 | }; | 58 | }; |
| @@ -64,7 +64,7 @@ struct rif_cache_s { | |||
| 64 | * up a lot. | 64 | * up a lot. |
| 65 | */ | 65 | */ |
| 66 | 66 | ||
| 67 | static struct rif_cache_s *rif_table[RIF_TABLE_SIZE]; | 67 | static struct rif_cache *rif_table[RIF_TABLE_SIZE]; |
| 68 | 68 | ||
| 69 | static DEFINE_SPINLOCK(rif_lock); | 69 | static DEFINE_SPINLOCK(rif_lock); |
| 70 | 70 | ||
| @@ -249,7 +249,7 @@ void tr_source_route(struct sk_buff *skb,struct trh_hdr *trh,struct net_device * | |||
| 249 | { | 249 | { |
| 250 | int slack; | 250 | int slack; |
| 251 | unsigned int hash; | 251 | unsigned int hash; |
| 252 | struct rif_cache_s *entry; | 252 | struct rif_cache *entry; |
| 253 | unsigned char *olddata; | 253 | unsigned char *olddata; |
| 254 | static const unsigned char mcast_func_addr[] | 254 | static const unsigned char mcast_func_addr[] |
| 255 | = {0xC0,0x00,0x00,0x04,0x00,0x00}; | 255 | = {0xC0,0x00,0x00,0x04,0x00,0x00}; |
| @@ -337,7 +337,7 @@ printk("source routing for %02X:%02X:%02X:%02X:%02X:%02X\n",trh->daddr[0], | |||
| 337 | static void tr_add_rif_info(struct trh_hdr *trh, struct net_device *dev) | 337 | static void tr_add_rif_info(struct trh_hdr *trh, struct net_device *dev) |
| 338 | { | 338 | { |
| 339 | unsigned int hash, rii_p = 0; | 339 | unsigned int hash, rii_p = 0; |
| 340 | struct rif_cache_s *entry; | 340 | struct rif_cache *entry; |
| 341 | 341 | ||
| 342 | 342 | ||
| 343 | spin_lock_bh(&rif_lock); | 343 | spin_lock_bh(&rif_lock); |
| @@ -373,7 +373,7 @@ printk("adding rif_entry: addr:%02X:%02X:%02X:%02X:%02X:%02X rcf:%04X\n", | |||
| 373 | * FIXME: We ought to keep some kind of cache size | 373 | * FIXME: We ought to keep some kind of cache size |
| 374 | * limiting and adjust the timers to suit. | 374 | * limiting and adjust the timers to suit. |
| 375 | */ | 375 | */ |
| 376 | entry=kmalloc(sizeof(struct rif_cache_s),GFP_ATOMIC); | 376 | entry=kmalloc(sizeof(struct rif_cache),GFP_ATOMIC); |
| 377 | 377 | ||
| 378 | if(!entry) | 378 | if(!entry) |
| 379 | { | 379 | { |
| @@ -435,7 +435,7 @@ static void rif_check_expire(unsigned long dummy) | |||
| 435 | spin_lock_bh(&rif_lock); | 435 | spin_lock_bh(&rif_lock); |
| 436 | 436 | ||
| 437 | for(i =0; i < RIF_TABLE_SIZE; i++) { | 437 | for(i =0; i < RIF_TABLE_SIZE; i++) { |
| 438 | struct rif_cache_s *entry, **pentry; | 438 | struct rif_cache *entry, **pentry; |
| 439 | 439 | ||
| 440 | pentry = rif_table+i; | 440 | pentry = rif_table+i; |
| 441 | while((entry=*pentry) != NULL) { | 441 | while((entry=*pentry) != NULL) { |
| @@ -467,10 +467,10 @@ static void rif_check_expire(unsigned long dummy) | |||
| 467 | 467 | ||
| 468 | #ifdef CONFIG_PROC_FS | 468 | #ifdef CONFIG_PROC_FS |
| 469 | 469 | ||
| 470 | static struct rif_cache_s *rif_get_idx(loff_t pos) | 470 | static struct rif_cache *rif_get_idx(loff_t pos) |
| 471 | { | 471 | { |
| 472 | int i; | 472 | int i; |
| 473 | struct rif_cache_s *entry; | 473 | struct rif_cache *entry; |
| 474 | loff_t off = 0; | 474 | loff_t off = 0; |
| 475 | 475 | ||
| 476 | for(i = 0; i < RIF_TABLE_SIZE; i++) | 476 | for(i = 0; i < RIF_TABLE_SIZE; i++) |
| @@ -493,7 +493,7 @@ static void *rif_seq_start(struct seq_file *seq, loff_t *pos) | |||
| 493 | static void *rif_seq_next(struct seq_file *seq, void *v, loff_t *pos) | 493 | static void *rif_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
| 494 | { | 494 | { |
| 495 | int i; | 495 | int i; |
| 496 | struct rif_cache_s *ent = v; | 496 | struct rif_cache *ent = v; |
| 497 | 497 | ||
| 498 | ++*pos; | 498 | ++*pos; |
| 499 | 499 | ||
| @@ -522,7 +522,7 @@ static void rif_seq_stop(struct seq_file *seq, void *v) | |||
| 522 | static int rif_seq_show(struct seq_file *seq, void *v) | 522 | static int rif_seq_show(struct seq_file *seq, void *v) |
| 523 | { | 523 | { |
| 524 | int j, rcf_len, segment, brdgnmb; | 524 | int j, rcf_len, segment, brdgnmb; |
| 525 | struct rif_cache_s *entry = v; | 525 | struct rif_cache *entry = v; |
| 526 | 526 | ||
| 527 | if (v == SEQ_START_TOKEN) | 527 | if (v == SEQ_START_TOKEN) |
| 528 | seq_puts(seq, | 528 | seq_puts(seq, |
