ouroboros - Ouroboros main repository

	Commit message (Collapse)	Author	Age	Files	Lines
*	build: Update copyright to 20200.16.0	Dimitri Staessens	2020-01-02	1	-1/+1
\| \| \| \| \|	Signed-off-by: Dimitri Staessens <dimitri@ouroboros.rocks> Signed-off-by: Sander Vrijders <sander@ouroboros.rocks>
*	build: Update copyright to 2019	Dimitri Staessens	2019-02-05	1	-1/+1
\| \| \| \| \| \| \|	Updates the copyright notice in all sources to 2019. Signed-off-by: Dimitri Staessens <dimitri.staessens@ugent.be> Signed-off-by: Sander Vrijders <sander.vrijders@ugent.be>
*	lib: Get RIB attributes from component	Dimitri Staessens	2018-02-20	1	-0/+5
\| \| \| \| \| \| \| \| \| \| \| \|	This revises the RIB so it gets the complete file attribute list from the component instead of setting some attributes in the library. This will allow setting read/write access later on in the component itself. The time of last change of lsdb entries in the file system is now set to the time of the last received Link State Update for that entry. Signed-off-by: Dimitri Staessens <dimitri.staessens@ugent.be> Signed-off-by: Sander Vrijders <sander.vrijders@ugent.be>
*	include, src: Update copyright to 2018	Dimitri Staessens	2018-01-09	1	-1/+1
\| \| \| \| \| \| \|	Happy New Year, Ouroboros. Signed-off-by: Dimitri Staessens <dimitri.staessens@ugent.be> Signed-off-by: Sander Vrijders <sander.vrijders@ugent.be>
*	lib: Provide RIB API to export internals via fuse	dimitri staessens	2017-09-18	1	-0/+46
\| \| \| \| \| \| \|	This adds a virtual RIB that is accessible as a filesystem that is accessed through a fuse mountpoint (configurable , default is /tmp/ouroboros). Currently, each IPCP will export its link state database.
*	ipcpd: Revise internals of normal IPCP	dimitri staessens	2017-09-12	1	-77/+0
\| \| \| \| \| \| \| \|	This removes the RIB as a datastructure and CDAP as the protocol between IPCPs. CDAP, the rib and related sources are deprecated. The link-state protocol policy is udpated to use its own protocol based on a simple broadcast strategy along a tree. The neighbors struct is deprecated and moved to the library as a generic notifier component.
*	build: Replace fsf snail mail with contact URL	dimitri staessens	2017-08-13	1	-2/+1
\|
*	Change email addresses to ugent.be	Sander Vrijders	2017-03-03	1	-2/+2
\| \| \| \| \| \| \|	Our mailserver was migrated from intec.ugent.be to the central ugent.be emailserver. This PR updates the header files to reflect this change as well. Some header files were also homogenized if the parameters within the functions were badly aligned.
*	lib: Add packing and unpacking RIB	dimitri staessens	2017-01-31	1	-20/+34
\| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \|	The rib_pack function allows packing a subtree of the RIB for dissemination. The options PACK_HASH_ROOT and PACK_HASH_ALL will add the hashes for the root object of the packed subtree or every object to the packed message respectively. Checking of the hashes is currently only performed at the top level object, verifying the complete operation. The rib_unpack function unpacks a packed message and inserts its contents in the RIB. The option UNPACK_CREATE flags that the unpack operation is allowed to create new objects, else it will only update existing objects. More advanced options could be added in the future. The packed message structure uses Google Protocol Buffers, as defined in ro.proto. It adds tests for these functions to the rib_test.
*	lib: Add function to get children of node in RIB	dimitri staessens	2017-01-29	1	-0/+3
\| \| \| \| \|	Returns the names of the nodes (not the full paths). The function allocates memory to the children pointer that should be freed.
*	lib: Add new version of Resource Information Base	dimitri staessens	2017-01-21	1	-0/+61
	The new RIB is implemented as a tree with doubly linked nodes (parents keep a link to each child, each child keeps a link to its parent). An index is kept in a btree using CRC32 hashes of the path name in the RIB. Nodes keep an SHA3-256 hash value that is unique for the entire subtree. This allows quick checks to see if two RIB subtrees are in sync. The event system for the RIB is based on the event system for flows (fqueue), but implemented completely in dynamic memory using linked lists. An initial test is performed for the RIB. This PR does not modify existing code to use the new RIB.