Age | Commit message (Collapse) | Author |
|
...if only one of the instances has its LS age field set to MaxAge
The important part is "only one", so check if both LSA are at MaxAge and
in that case return 0 -- the LSAs are identical.
This fixes a super nasty doom loop between two ospfd sending each other
LSA updates at an incredible speed. Tested and OK norby@
|
|
ok claudio@
|
|
DEFAULT_NBR_TMOUT. Makes it easy to see since when a peer is dead.
OK norby@ some time ago
|
|
ok norby@
|
|
- have ospfctl tell us when we are using authentication with 'show interface'
ok claudio@ norby@
|
|
- remove rtr_id from struct iface we don't need to keep a copy of this value
per interface
- replace all references to iface->rtr_id.s_addr with calls to ospfe_rtr_id()
ok claudio@ norby@
|
|
Default to id 1 and mention it in the man page.
From a discussion with msf@ OK norby@
|
|
that are in loopback mode. With this it is possible to use lo1 to hold the
loopback address of the router as done often on ciscos etc.
Problem found and fix tested by jakob@ OK norby@
|
|
routes where not cleared even though the advertising router was no longer
reachable. Same problem has the rt_dump() function that is used for
ospfctl show rib. Tested by me and norby@
OK norby@ deraadt@
|
|
One of the main problems is that the RFC is very unprecise about the process
and so a bit of guessing and "violating" the RFC is needed.
The problem was that on fast restarts ospfd computed wrong DR and BDR
routers. OK norby@ deraadt@
|
|
routing table where most entries used the local interface IP as nexthop. This
bug was found by jakob@ and he verified that it fixes his problems. Additional
tests by me and norby@.
OK norby@ deraadt@
|
|
Report and fix from Micheal Knudsen.
Prep, test and OK claudio@
|
|
|
|
This is still not perfect as on ABRs it is only necessary to
recalculate the area that got changed and not all others too.
More to come but it is a good start. OK norby@
|
|
ones in the candidate list. Be more careful about LS_INFINITY as it is
possible that the cost overflows in the calculation (checking for == is in
some cases wrong). Simplify the code a bit. Tested and OK norby@
|
|
|
|
a {} block. Only drawback is that it is no longer possible to do
"interface em0\n{ ...".
OK henning@ norby@ some time ago
|
|
as-ext routes would select a wrong nexthop if the forwarding router is
directly connected. OK, help and debugging norby@
|
|
setups with /32 loopback networks. OK norby@
|
|
|
|
suffered because of this. Normaly seen because they where not added to the rib
or ended up with a bad nexthop.
This is what you get for stealing code from bgpd :(
OK norby@
|
|
are e.g. created by the PMTU code and are removed after some time.
OK norby@
|
|
timer in IF_STA_WAITING. We are not ready for this because the RFC is totaly
fucked up in that specific area causing many issues on fast reloads.
OK norby@
|
|
SIGTERM is already handled by ev_sigterm.
|
|
and init) are not electable not only neighbors that are in state down.
OK norby@
|
|
OK norby@
|
|
ignores the event. This removes the warning "fsm_if: interface em0, event
WAITTIMER not expected in state DROTHER" in case of a quick startup.
OK norby@
|
|
faster and follows the RFC more closely).
OK norby@
|
|
into one if (old_state != nbr->state) { block.
OK norby@
|
|
networks. Bug report and testing by Stephen Marley.
While there kill an unneeded log_debug().
OK norby@
|
|
the data from the last hello packet.
OK norby@
|
|
|
|
|
|
full, originate a new router LSA.
ok claudio@
|
|
ok claudio@
|
|
jajaja claudio@
|
|
ok claudio@
|
|
ok claudio@
|
|
ok claudio@
|
|
|
|
|
|
ok claudio@
|
|
Found during the development of virtual link support.
Personally I spend 3 hours chasing this, and I didn't find it.
Claudio spend 2 hours and he found it, credit goes to him :-)
It is wise to put the payload you just created onto the wire, instead
of putting some freshly 0'ed bytes....
ok claudio@
|
|
ok claudio@
|
|
ok claudio@
|
|
ok claudio@
|
|
LS_INFINITY. Summary LSA are not touched by the SPF algorithm and so they
got dropped here because the still had a cost of LS_INFINITY.
The calculated routing table starts to make sense now.
OK norby@
|
|
not enough to distinguish between calculated vertexes and those just queued
in the candidate list. So add a additional check if the vertex is on the
candidate list. This fixes a problem Stephen Marley reported some time ago.
OK norby@
|
|
OK norby@
|
|
|