| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
|
|
|
|
| |
There was a missing free in case the address was not found in the
routing table when trying to add an LFA for a certain address.
Signed-off-by: Sander Vrijders <[email protected]>
Signed-off-by: Dimitri Staessens <[email protected]>
|
| |
|
|
|
|
|
| |
Happy New Year, Ouroboros.
Signed-off-by: Dimitri Staessens <[email protected]>
Signed-off-by: Sander Vrijders <[email protected]>
|
| |
|
|
|
|
|
|
|
|
|
| |
This refactors ouroboros to use "program" instead of "application
process" and "process" instead of "application process instance" to
align with current naming in current Operating Systems courses instead
of the ISO nomenclature adopted by RINA. This change permeates through
the entire implementation. Also contains some minor other refactors.
Signed-off-by: Dimitri Staessens <[email protected]>
Signed-off-by: Sander Vrijders <[email protected]>
|
| |
|
|
|
|
|
|
|
|
| |
The *dist pointer was not reset on failure, causing the caller to try
to free an unmalloced or already freed pointer.
Reported-by: Nick Aerts <[email protected]>
Tested-by: Nick Aerts <[email protected]>
Signed-off-by: Dimitri Staessens <[email protected]>
Signed-off-by: Sander Vrijders <[email protected]>
|
| |
|
|
|
|
| |
This adds the Loop-Free Alternates (LFA) policy. In case a link goes
down a LFA may be selected to route the SDUs on without causing loops
instead of the main hop that just went down.
|
| |
|
|
|
| |
This adds a refcount to the graph edges so that it is only included in
the calculation if both sides announced it.
|
| |
|
|
|
| |
This keeps the index in the vertex struct so that is more easily
available during Dijkstra.
|
| |
|
|
|
|
| |
This simplifies the Dijkstra implementation by immediately setting the
correct next hop during Dijkstra instead of looping through the list
of predecessors afterwards.
|
| |
|
|
|
| |
This simplifies several internal graph functions by passing an array
of bools instead of an array of vertices.
|
| |
|
|
|
|
| |
This returns a list as routing table instead of a pointer to a pointer
to a pointer, which simplifies the looping through the routing table
and makes it more extensible for future additions.
|
| |
|
|
| |
This fixes several bugs as reported by the clang static analyzer.
|
| |
|
|
|
|
|
|
|
|
| |
This revises the build system to have configuration per system
component. System settings can now be set using cmake.
The standard compliance defines were removed from configuration header
and are set in the sources where needed. Also some small code
refactors, such as moving the data for shims out of the ipcp structure
to the respective shims were performed.
|
| | |
|
|
|
This makes the routing component into a policy since different
approaches may exist to do this, depending on how high the rank of the
DIF is.
|
