ouroboros/src/ipcpd/unicast/pol/graph.c, branch 0.17.2Ouroboros main repositoryhttp://www.ouroboros.rocks/cgit/ouroboros/atom?h=0.17.22020-02-23T13:37:27Zipcpd: Fix infinite recursion in LFA2020-02-23T13:37:27ZDimitri Staessensdimitri@ouroboros.rocks2020-02-18T16:31:19Zurn:sha1:00a8b8960c027848817050411e4c9be43cb6a427
There were bugs introduced in the LFA algorithm refactor causing
infinite recursion and SEGV. The infinite recursion check was added as
an explicit compiler flag to the build.
Signed-off-by: Dimitri Staessens <dimitri@ouroboros.rocks>
Signed-off-by: Sander Vrijders <sander@ouroboros.rocks>
ipcpd: Fix double free, memleak and malloc check2020-02-16T17:33:21ZDimitri Staessensdimitri@ouroboros.rocks2020-02-16T15:17:20Zurn:sha1:a59b71095a84dcbd7c3684639acf3dd3097bd3f2
Some fixes in the multipath implementation related to memory
management that showed up with the static analyzer.
Signed-off-by: Dimitri Staessens <dimitri@ouroboros.rocks>
Signed-off-by: Sander Vrijders <sander@ouroboros.rocks>
Add equal-cost multipath routing policy2020-02-16T17:32:21ZDimitri Staessensdimitri@ouroboros.rocks2020-02-16T12:42:18Zurn:sha1:af8e7f78af9b13c2cf6615dc9eb6c52c51b2bc2c
This adds an equal-cost multipath routing policy to Ouroboros, based
on Nick Aerts' code. When selected, flows will send packets over all
paths with equal cost (hop count). Path selection is round-robin. It
does not yet take into account flows that are down.
Signed-off-by: Dimitri Staessens <dimitri@ouroboros.rocks>
Signed-off-by: Sander Vrijders <sander@ouroboros.rocks>
ipcpd: Fix uninitialized variable in graph2020-02-16T17:27:26ZDimitri Staessensdimitri@ouroboros.rocks2020-02-16T14:50:03Zurn:sha1:52e44a55d3b12819a79566067ff0361854da5002
During refactor a variable initialization was removed.
Signed-off-by: Dimitri Staessens <dimitri@ouroboros.rocks>
Signed-off-by: Sander Vrijders <sander@ouroboros.rocks>
ipcpd: Fix minor things in graph and link_state2020-02-16T17:24:50ZDimitri Staessensdimitri@ouroboros.rocks2020-02-15T09:07:56Zurn:sha1:8d38af64d1d34bff9b2548df29f3a680cdfbb0c6
The vertex was used before definition in the graph
implementation. Fixed potential data race in link_state
algorithm. Added missing asserts. Removed initialization of variables
where not needed to let compiler warn about uninitialized uses.
Signed-off-by: Dimitri Staessens <dimitri@ouroboros.rocks>
Signed-off-by: Sander Vrijders <sander@ouroboros.rocks>
ipcpd: Refactor graph to self-contain LFA2020-02-16T17:19:11ZDimitri Staessensdimitri@ouroboros.rocks2020-02-12T21:31:16Zurn:sha1:a63edb8e9d3ba5eef03c1bbb454522ea7b369087
The LFA algorithm modifies the output of the simple routing algorithm,
but the output was mixed in the general call. This moves the LFA
subroutine to be self-contained. This makes for a cleaner entry point
when adding more routing algorithms.
Signed-off-by: Dimitri Staessens <dimitri@ouroboros.rocks>
Signed-off-by: Sander Vrijders <sander@ouroboros.rocks>
build: Update copyright to 20202020-01-02T14:07:36ZDimitri Staessensdimitri@ouroboros.rocks2020-01-01T08:48:07Zurn:sha1:435a91165a3c1f8ca715b22ee2c2361d9bd853dd
Signed-off-by: Dimitri Staessens <dimitri@ouroboros.rocks>
Signed-off-by: Sander Vrijders <sander@ouroboros.rocks>
build: Refactor normal to unicast2019-07-29T17:36:45ZDimitri Staessensdimitri@ouroboros.rocks2019-07-25T10:50:46Zurn:sha1:dae15c284248d49079ad5f8a3d8ff30e217f419e
This completes the renaming of the normal IPCP to the unicast IPCP in
the sources, to get everything consistent with the documentation.
Signed-off-by: Dimitri Staessens <dimitri@ouroboros.rocks>
Signed-off-by: Sander Vrijders <sander@ouroboros.rocks>