| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
| |
This fixes several bugs in the ro sets, rib. And it fixes several bugs
in the graph and routing component of the normal IPCP.
|
|
|
|
|
| |
This adds a check to prevent a negative malloc in case the graph
structure is empty.
|
|
|
|
|
| |
The next vertex was not taken at the end of the Dijkstra calculation
loop.
|
|
|
|
|
|
|
| |
This fixes a dumb segfault in the dijkstra calculation. If an entry
can be removed from the table it was set to NULL. However, if the
table is completely empty, the index was -1, resulting in an illegal
access into the table.
|
|
|
|
|
|
| |
This adds routing table calculation to the graph component. The
routing instances can then periodically ask the graph component for
the routing table, and update their PFFs accordingly.
|
|
|
|
| |
This fixes some memleaks as reported by valgrind.
|
|
This adds a graph structure which will be updated by routing when it
is notified about a new RIB event. The routing can then use this graph
as input for calculating the shortest path to a destination.
|