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
|
/*
* BIRD -- OSPF
*
* (c) 2000 Ondrej Filip <feela@network.cz>
*
* Can be freely distributed and used under the terms of the GNU GPL.
*/
#include "ospf.h"
/* FIXME next hop calculation
* FIXME sync with BIRD's routing table
*/
void
ospf_rt_spfa(struct ospf_area *oa, struct proto *p)
{
struct top_hash_entry *en, *nx;
slab *sl;
struct spf_n *cn;
u32 i,*rts;
struct ospf_lsa_rt *rt;
struct ospf_lsa_rt_link *rtl;
/*
* First of all, mark all vertices as they are not in SPF
* Maybe I can join this work with Aging of structure
*/
WALK_SLIST(SNODE en, oa->lsal)
{
en->color=OUTSPF;
en->dist=LSINFINITY;
}
init_list(&oa->cand); /* Empty list of candidates */
oa->trcap=0;
sl=sl_new(p->pool,sizeof(struct spf_n));
cn=sl_alloc(sl);
cn->en=oa->rt;
oa->rt->dist=0;
oa->rt->color=CANDIDATE;
add_head(&oa->cand,NODE cn);
while(!EMPTY_LIST(oa->cand))
{
struct top_hash_entry *act,*tmp;
node *n;
struct ospf_lsa_net *net;
n=HEAD(oa->cand);
act=((struct spf_n *)n)->en;
rem_node(n);
sl_free(sl,n); /* Good idea? */
act->color=INSPF;
switch(act->lsa.type)
{
case LSA_T_RT:
rt=(struct ospf_lsa_rt *)act->lsa_body;
if((rt->VEB)&(1>>LSA_RT_V)) oa->trcap=1;
rtl=(struct ospf_lsa_rt_link *)(rt+1);
for(i=0;rt->links;i++)
{
tmp=NULL;
switch((rtl+i)->type)
{
case LSART_STUB:
case LSART_VLNK:
continue;
break;
case LSART_NET:
tmp=ospf_hash_find(oa->gr,rtl->data,rtl->id,LSA_T_RT);
break;
case LSART_PTP:
tmp=ospf_hash_find(oa->gr,rtl->data,rtl->id,LSA_T_NET);
break;
default:
log("Unknown link type in router lsa.\n");
break;
}
add_cand(&oa->cand,tmp,act->dist+rtl->metric,sl);
}
break;
case LSA_T_NET:
net=(struct ospf_lsa_net *)act->lsa_body;
rts=(u32 *)(net+1);
for(i=0;i<(act->lsa.length-sizeof(struct ospf_lsa_header)-
sizeof(struct ospf_lsa_net))/sizeof(u32);i++)
{
tmp=ospf_hash_find(oa->gr, *rts, *rts, LSA_T_RT);
add_cand(&oa->cand,tmp,act->dist,sl);
}
break;
}
}
/* Now calculate routes to stub networks */
WALK_SLIST_DELSAFE(SNODE en, SNODE nx, oa->lsal)
{
if((en->lsa.type==LSA_T_RT)||(en->lsa.type==LSA_T_NET))
{
if(en->dist==LSINFINITY)
{
s_rem_node(SNODE en);
/* FIXME Remove from routing table! */
mb_free(en->lsa_body);
ospf_hash_delete(oa->gr, en);
}
if(en->lsa.type==LSA_T_NET)
{
rt=(struct ospf_lsa_rt *)en->lsa_body;
if((rt->VEB)&(1>>LSA_RT_V)) oa->trcap=1;
rtl=(struct ospf_lsa_rt_link *)(rt+1);
for(i=0;rt->links;i++)
{
if((rtl+i)->type==LSART_STUB)
{
/* Check destination and so on (pg 166) */
}
}
}
}
}
}
void
add_cand(list *l, struct top_hash_entry *en, u16 dist, slab *s)
{
struct spf_n *tmp;
node *prev;
int flag=0;
if(en==NULL) return;
if(en->lsa.age==LSA_MAXAGE) return;
/* FIXME Does it have link back? Test it! */
if(en->color==INSPF) return;
if(dist>en->dist) return;
if(dist==en->dist)
{
//Add Next hop
//And add it to routing table (Multiple path?)
}
else
{
/* Clear next hop */
if(en->color==CANDIDATE)
{
WALK_LIST(tmp,*l)
{
if(tmp->en==en)
{
rem_node(NODE tmp);
flag=1;
break;
}
}
}
if(flag!=1)
{
tmp=sl_alloc(s);
tmp->en=en;
}
en->dist=dist;
en->color=CANDIDATE;
prev=NULL;
WALK_LIST(tmp,*l)
{
if((tmp->en->dist>dist)||
((tmp->en->dist==dist)&&(tmp->en->lsa.type==LSA_T_NET)))
{
if(prev==NULL) add_head(l,NODE tmp);
else insert_node(NODE tmp,prev);
break;
}
}
/* FIXME Some VLINK staff should be here */
/* Routing table add?*/
}
}
|
