ouroboros - Ouroboros main repository

	Commit message (Collapse)	Author	Age	Files	Lines
*	ipcpd: normal: Fix wrong update to index	Sander Vrijders	2017-03-28	1	-2/+2
\| \| \| \| \|	The index j in the function that transforms the list of predecessors to a routing table was incremented at the wrong time.
*	ipcpd: normal: Remove graph_add_edge operation	Sander Vrijders	2017-03-28	1	-56/+30
\| \| \| \| \| \|	This removes the graph_add_edge operation of the graph component. The routing component now only listens to RO_MODIFY events, and updates the graph accordingly.
*	lib, ipcpd: Fix bugs in ro sets	Sander Vrijders	2017-03-28	1	-6/+8
\| \| \| \| \|	This fixes several bugs in the ro sets, rib. And it fixes several bugs in the graph and routing component of the normal IPCP.
*	ipcpd: normal: Fix negative malloc	Sander Vrijders	2017-03-24	1	-0/+11
\| \| \| \| \|	This adds a check to prevent a negative malloc in case the graph structure is empty.
*	ipcpd: normal: Fix while loop	Sander Vrijders	2017-03-24	1	-0/+7
\| \| \| \| \|	The next vertex was not taken at the end of the Dijkstra calculation loop.
*	ipcpd: normal: Fix segfault in dijkstra calculation	Sander Vrijders	2017-03-24	1	-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 calculation	Sander Vrijders	2017-03-23	1	-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 leaks	Sander Vrijders	2017-03-22	1	-0/+2
\| \| \| \|	This fixes some memleaks as reported by valgrind.
*	ipcpd: normal: Add graph structure	Sander Vrijders	2017-03-14	1	-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.