summaryrefslogtreecommitdiff
path: root/src/ipcpd/normal/graph.c
Commit message (Collapse)AuthorAgeFilesLines
* ipcpd: normal: Fix negative mallocSander Vrijders2017-03-241-0/+11
| | | | | This adds a check to prevent a negative malloc in case the graph structure is empty.
* ipcpd: normal: Fix while loopSander Vrijders2017-03-241-0/+7
| | | | | The next vertex was not taken at the end of the Dijkstra calculation loop.
* ipcpd: normal: Fix segfault in dijkstra calculationSander Vrijders2017-03-241-1/+2
| | | | | | | 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.
* ipcpd: normal: Add routing table calculationSander Vrijders2017-03-231-6/+231
| | | | | | 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.
* ipcpd: normal: Fix memory leaksSander Vrijders2017-03-221-0/+2
| | | | This fixes some memleaks as reported by valgrind.
* ipcpd: normal: Add graph structureSander Vrijders2017-03-141-0/+277
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.