bird/proto/ospf/topology.h

74 lines
2.3 KiB
C
Raw Normal View History

/*
* BIRD -- OSPF
*
* (c) 1999--2004 Ondrej Filip <feela@network.cz>
*
* Can be freely distributed and used under the terms of the GNU GPL.
*/
#ifndef _BIRD_OSPF_TOPOLOGY_H_
#define _BIRD_OSPF_TOPOLOGY_H_
2004-06-06 16:55:33 +08:00
struct top_hash_entry
{ /* Index for fast mapping (type,rtrid,LSid)->vertex */
2000-08-19 00:36:54 +08:00
snode n;
2004-06-06 16:55:33 +08:00
node cn; /* For adding into list of candidates
* in intra-area routing table
* calculation
*/
struct top_hash_entry *next; /* Next in hash chain */
struct ospf_lsa_header lsa;
struct ospf_area *oa;
void *lsa_body;
2004-06-06 16:55:33 +08:00
bird_clock_t inst_t; /* Time of installation into DB */
ip_addr nh; /* Next hop */
ip_addr lb; /* Link back */
struct ospf_iface *nhi; /* Next hop interface */
u32 dist; /* Distance from the root */
2000-06-08 07:48:33 +08:00
u16 ini_age;
u8 color;
#define OUTSPF 0
#define CANDIDATE 1
#define INSPF 2
u8 padding;
2000-02-09 06:13:12 +08:00
};
2004-06-06 16:55:33 +08:00
struct top_graph
{
pool *pool; /* Pool we allocate from */
slab *hash_slab; /* Slab for hash entries */
struct top_hash_entry **hash_table; /* Hashing (modelled a`la fib) */
unsigned int hash_size;
unsigned int hash_order;
unsigned int hash_mask;
unsigned int hash_entries;
unsigned int hash_entries_min, hash_entries_max;
};
2004-06-07 02:45:08 +08:00
struct top_graph *ospf_top_new(pool *);
void ospf_top_free(struct top_graph *);
2000-06-06 10:27:08 +08:00
void ospf_top_dump(struct top_graph *, struct proto *);
struct top_hash_entry *ospf_hash_find_header(struct top_graph *f, u32 areaid,
2004-06-06 16:55:33 +08:00
struct ospf_lsa_header *h);
struct top_hash_entry *ospf_hash_get_header(struct top_graph *f, struct ospf_area *oa,
2004-06-06 16:55:33 +08:00
struct ospf_lsa_header *h);
struct top_hash_entry *ospf_hash_find(struct top_graph *, u32 areaid, u32 lsa, u32 rtr,
2004-06-06 16:55:33 +08:00
u32 type);
struct top_hash_entry *ospf_hash_get(struct top_graph *, struct ospf_area *oa, u32 lsa, u32 rtr,
2004-06-06 16:55:33 +08:00
u32 type);
void ospf_hash_delete(struct top_graph *, struct top_hash_entry *);
void originate_rt_lsa(struct ospf_area *oa);
void originate_net_lsa(struct ospf_iface *ifa);
int can_flush_lsa(struct proto_ospf *po);
int max_ext_lsa(unsigned pxlen);
2004-06-06 16:55:33 +08:00
void originate_ext_lsa(net * n, rte * e, struct proto_ospf *po,
struct ea_list *attrs);
void check_sum_lsa(struct proto_ospf *po, ort *nf, int);
void originate_sum_lsa(struct ospf_area *oa, struct fib_node *fn, int type, int metric);
void flush_sum_lsa(struct ospf_area *oa, struct fib_node *fn, int type);
#endif /* _BIRD_OSPF_TOPOLOGY_H_ */