dn_table.c File Reference

#include <linux/string.h>
#include <linux/net.h>
#include <linux/socket.h>
#include <linux/slab.h>
#include <linux/sockios.h>
#include <linux/init.h>
#include <linux/skbuff.h>
#include <linux/netlink.h>
#include <linux/rtnetlink.h>
#include <linux/proc_fs.h>
#include <linux/netdevice.h>
#include <linux/timer.h>
#include <linux/spinlock.h>
#include <linux/atomic.h>
#include <asm/uaccess.h>
#include <linux/route.h>
#include <net/neighbour.h>
#include <net/netlink.h>
#include <net/dst.h>
#include <net/flow.h>
#include <net/fib_rules.h>
#include <net/dn.h>
#include <net/dn_route.h>
#include <net/dn_fib.h>
#include <net/dn_neigh.h>
#include <net/dn_dev.h>

Go to the source code of this file.

Data Structures
struct	dn_zone
struct	dn_hash

Macros
#define	DZ_HASHMASK(dz)   ((dz)->dz_hashmask)
#define	DZ_MASK(dz)   ((dz)->dz_mask)
#define	dz_key_0(key)   ((key).datum = 0)
#define	for_nexthops(fi)
#define	endfor_nexthops(fi)   }
#define	DN_MAX_DIVISOR   1024
#define	DN_S_ZOMBIE   1
#define	DN_S_ACCESSED   2
#define	DN_FIB_SCAN(f, fp)   for( ; ((f) = *(fp)) != NULL; (fp) = &(f)->fn_next)
#define	DN_FIB_SCAN_KEY(f, fp, key)   for( ; ((f) = *(fp)) != NULL && dn_key_eq((f)->fn_key, (key)); (fp) = &(f)->fn_next)
#define	RT_TABLE_MIN   1
#define	DN_FIB_TABLE_HASHSZ   256

Functions
int	dn_fib_dump (struct sk_buff *skb, struct netlink_callback *cb)
struct dn_fib_table *	dn_fib_get_table (u32 n, int create)
struct dn_fib_table *	dn_fib_empty_table (void)
void	dn_fib_flush (void)
void __init	dn_fib_table_init (void)
void __exit	dn_fib_table_cleanup (void)

Macro Definition Documentation

#define DN_FIB_SCAN	(		f,
			fp
	)		for( ; ((f) = *(fp)) != NULL; (fp) = &(f)->fn_next)

Definition at line 72 of file dn_table.c.

#define DN_FIB_SCAN_KEY	(		f,
			fp,
			key
	)		for( ; ((f) = *(fp)) != NULL && dn_key_eq((f)->fn_key, (key)); (fp) = &(f)->fn_next)

Definition at line 75 of file dn_table.c.

#define DN_FIB_TABLE_HASHSZ   256

Definition at line 79 of file dn_table.c.

#define DN_MAX_DIVISOR   1024

Definition at line 68 of file dn_table.c.

#define DN_S_ACCESSED   2

Definition at line 70 of file dn_table.c.

#define DN_S_ZOMBIE   1

Definition at line 69 of file dn_table.c.

#define DZ_HASHMASK

(

dz

)

((dz)->dz_hashmask)

Definition at line 49 of file dn_table.c.

#define dz_key_0

(

key

)

((key).datum = 0)

Definition at line 61 of file dn_table.c.

#define DZ_MASK

(

dz

)

((dz)->dz_mask)

Definition at line 52 of file dn_table.c.

#define endfor_nexthops

(

fi

)

}

Definition at line 66 of file dn_table.c.

#define for_nexthops

(

fi

)

Value:

{ int nhsel; const struct dn_fib_nh *nh;\
    for(nhsel = 0, nh = (fi)->fib_nh; nhsel < (fi)->fib_nhs; nh++, nhsel++)

Definition at line 63 of file dn_table.c.

#define RT_TABLE_MIN   1

Definition at line 78 of file dn_table.c.

Function Documentation

int dn_fib_dump	(	struct sk_buff *	skb,
		struct netlink_callback *	cb
	)

Definition at line 480 of file dn_table.c.

struct dn_fib_table* dn_fib_empty_table ( void  )

read

Definition at line 874 of file dn_table.c.

void dn_fib_flush

(

void

)

Definition at line 884 of file dn_table.c.

struct dn_fib_table* dn_fib_get_table ( u32  n, int  create  )

read

Definition at line 828 of file dn_table.c.

void __exit dn_fib_table_cleanup

(

void

)

Definition at line 908 of file dn_table.c.

void __init dn_fib_table_init

(

void

)

Definition at line 900 of file dn_table.c.