1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
/* $OpenBSD: rde.h,v 1.22 2010/07/01 19:47:04 bluhm Exp $ */
/*
* Copyright (c) 2004, 2005 Esben Norby <norby@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#ifndef _RDE_H_
#define _RDE_H_
#include <sys/types.h>
#include <sys/time.h>
#include <sys/tree.h>
#include <sys/queue.h>
#include <event.h>
#include <limits.h>
struct v_nexthop {
TAILQ_ENTRY(v_nexthop) entry;
struct vertex *prev;
struct in6_addr nexthop;
unsigned int ifindex;
};
TAILQ_HEAD(v_nexthead, v_nexthop);
struct vertex {
RB_ENTRY(vertex) entry;
TAILQ_ENTRY(vertex) cand;
struct v_nexthead nexthop;
struct event ev;
struct area *area;
struct lsa *lsa;
struct lsa_tree *lsa_tree;
time_t changed;
time_t stamp;
u_int32_t cost;
u_int32_t peerid; /* neighbor unique imsg ID */
u_int32_t ls_id;
u_int32_t adv_rtr;
u_int16_t type;
u_int8_t flooded;
u_int8_t deleted;
u_int8_t self;
};
struct rde_req_entry {
TAILQ_ENTRY(rde_req_entry) entry;
u_int32_t ls_id;
u_int32_t adv_rtr;
u_int8_t type;
};
/* just the info RDE needs */
struct rde_nbr {
LIST_ENTRY(rde_nbr) entry, hash;
struct in6_addr addr;
struct in_addr id;
struct in_addr area_id;
TAILQ_HEAD(, rde_req_entry) req_list;
struct area *area;
struct iface *iface;
u_int32_t peerid; /* unique ID in DB */
unsigned int ifindex;
u_int32_t iface_id; /* id of neighbor's
iface */
int state;
int self;
};
/* expanded and host-byte-order version of a lsa_prefix */
struct rt_prefix {
struct in6_addr prefix;
u_int16_t metric;
u_int8_t prefixlen;
u_int8_t options;
};
struct rt_nexthop {
TAILQ_ENTRY(rt_nexthop) entry;
struct in6_addr nexthop;
struct in_addr adv_rtr;
unsigned int ifindex;
time_t uptime;
u_int8_t connected;
u_int8_t invalid;
};
struct rt_node {
RB_ENTRY(rt_node) entry;
TAILQ_HEAD(,rt_nexthop) nexthop;
struct in6_addr prefix;
struct in_addr area;
u_int32_t cost;
u_int32_t cost2;
u_int32_t ext_tag;
enum path_type p_type;
enum dst_type d_type;
u_int8_t flags;
u_int8_t prefixlen;
u_int8_t invalid;
};
struct abr_rtr {
struct in6_addr addr;
struct in_addr abr_id;
struct in6_addr dst_ip;
struct in_addr area;
u_int16_t metric;
};
extern struct lsa_tree asext_tree;
/* rde.c */
pid_t rde(struct ospfd_conf *, int [2], int [2], int [2]);
int rde_imsg_compose_ospfe(int, u_int32_t, pid_t, void *,
u_int16_t);
u_int32_t rde_router_id(void);
void rde_send_change_kroute(struct rt_node *);
void rde_send_delete_kroute(struct rt_node *);
void rde_nbr_del(struct rde_nbr *);
int rde_nbr_loading(struct area *);
struct rde_nbr *rde_nbr_self(struct area *);
struct rde_nbr *rde_nbr_find(u_int32_t);
void rde_summary_update(struct rt_node *, struct area *);
void orig_intra_area_prefix_lsas(struct area *);
/* rde_lsdb.c */
void lsa_init(struct lsa_tree *);
int lsa_compare(struct vertex *, struct vertex *);
void vertex_free(struct vertex *);
int lsa_newer(struct lsa_hdr *, struct lsa_hdr *);
int lsa_check(struct rde_nbr *, struct lsa *, u_int16_t);
int lsa_self(struct lsa *);
void lsa_flush(struct rde_nbr *, struct lsa *);
void lsa_reflood(struct vertex *, struct lsa*);
int lsa_add(struct rde_nbr *, struct lsa *);
void lsa_del(struct rde_nbr *, struct lsa_hdr *);
void lsa_age(struct vertex *);
struct vertex *lsa_find(struct iface *, u_int16_t, u_int32_t, u_int32_t);
struct vertex *lsa_find_rtr(struct area *, u_int32_t);
struct vertex *lsa_find_rtr_frag(struct area *, u_int32_t, unsigned int);
struct vertex *lsa_find_tree(struct lsa_tree *, u_int16_t, u_int32_t,
u_int32_t);
u_int32_t lsa_find_lsid(struct lsa_tree *, u_int16_t, u_int32_t,
int (*)(struct lsa *, struct lsa *), struct lsa *);
u_int16_t lsa_num_links(struct vertex *);
void lsa_snap(struct rde_nbr *, u_int32_t);
void lsa_dump(struct lsa_tree *, int, pid_t);
void lsa_merge(struct rde_nbr *, struct lsa *, struct vertex *);
void lsa_remove_invalid_sums(struct area *);
/* rde_spf.c */
void spf_calc(struct area *);
void rt_calc(struct vertex *, struct area *, struct ospfd_conf *);
void asext_calc(struct vertex *);
void spf_tree_clr(struct area *);
void cand_list_init(void);
void cand_list_add(struct vertex *);
struct vertex *cand_list_pop(void);
int cand_list_present(struct vertex *);
void cand_list_clr(void);
void spf_timer(int, short, void *);
void start_spf_timer(void);
void stop_spf_timer(struct ospfd_conf *);
void start_spf_holdtimer(struct ospfd_conf *);
void rt_init(void);
int rt_compare(struct rt_node *, struct rt_node *);
struct rt_node *rt_find(struct in6_addr *, u_int8_t, enum dst_type);
int rt_insert(struct rt_node *);
int rt_remove(struct rt_node *);
void rt_clear(void);
void rt_dump(struct in_addr, pid_t, u_int8_t);
struct lsa_rtr_link *get_rtr_link(struct vertex *, unsigned int);
struct lsa_net_link *get_net_link(struct vertex *, unsigned int);
RB_PROTOTYPE(lsa_tree, vertex, entry, lsa_compare)
#endif /* _RDE_H_ */
|
