| Age | Commit message (Collapse) | Author |
|---|
|
ok claudio@
|
|
This makes it possible to have ospfd(8) parse a configuration file and
display the parsed result.
ok claudio@
|
|
ok claudio@
|
|
up and running. This makes redistribution of carp(4)-ed networks magically
work. OK norby@
|
|
ospfctl show rib detail.
ok claudio@
|
|
to ospfctl.
Show detailed information about the LSAs in the Link State Database.
ok claudio@
|
|
router LSA. To do that correctly we need to track the number of active
neighbors for each area. If the routers ABR status changes all router LSA
need to be updated via orig_rtr_lsa_all().
OK norby@
|
|
|
|
With "redistribute (static|connected|default|none)" it is possible to
tell ospfd which external routes should be announced.
Connected routes will be announced only if there is no corresponding
interface configured, in that case the prefix is not external.
Adding and removing of announced prefixes are done automaticaly.
OK norby@
|
|
OK norby@
|
|
ok and input claudio@
|
|
From Jason Ackley (thanks).
ok claudio@
|
|
"ospfctl show fib interface".
OK henning@ norby@
|
|
OK henning@
|
|
by using an in_addr_t as return type. It simplyfies also the usage as in most
cases the mask is used with a struct in_addr address which is also network
byte order. Add prototypes of prefixlen2mask() and mask2prefixlen() to
ospfd.h as it is used or will be used at different places.
OK norby@
|
|
|
|
|
|
ok claudio@
|
|
OK norby@ deraadt@
|
|
ok claudio@ henning@
|
|
ok henning@
|
|
ok claudio@
|
|
by using the kif/kroute info while allocating interfaces.
|
|
Calculate Shortest Path Tree for each area known in the link state
database.
The Shortest Path Tree is used as input for route table calculation.
Route tabled is calculated and the result is inserted into the kernel
route table.
ok claudio@
|
|
ospfd. While there clean up some other no longer needed stuff.
OK norby@
|
|
ok claudio@
|
|
packets comming from the net are looped through the RDE and may get
delayed because of this. The result is that the neighbor FSM ends in
state FULL instead of LOADING and so the LSDB is not correctly
synchronized. Issue found by norby@ OK norby@
|
|
for 0. Action 0 was IF_ACT_STRT and that's why if_act_start() got called
multiple times. The inappropriate hack from the previous commit is no
longer needed.
|
|
called afterwards as it may realloc() the buffer and so the returned
pointer is bogus. Needed by the upcomming originate LSA code.
OK henning@
|
|
|
|
|
|
hit. This makes it possible to alloc a buffer based on the max packet size
and filling it up slowly till the packet is finished or *sigh* an overflow
is detected. While doing that switch most sizes from ssize_t to the unsigned
size_t as this makes more sense. The ssize_t -> size_t change is mostly from
henning@
|
|
do with this software, just happend to be my only valid email address at
the time.
|
|
started by Esben Norby some time ago by using the imsg/three process framework
of bgpd. He implemented the basic concept plus the ospf finite state machines.
Later I joined and helped him cleanup, debug and extend his work.
Right now it is not particularly useful, major parts are still missing but is
imported to allow more people to work on it.
status:
The basic protocol works for broadcast networks and the LS database is
synchronized and updated. It is not possible to be DR or BDR on a network
and other interface types like point-to-point are not yet supported.
The shortest path tree is not calculated and so no routing information is
exchanged with the kernel FIB.
Not yet connected to the builds.
OK henning@
|
