ouroboros - Ouroboros main repository

	Commit message (Collapse)	Author	Age	Files	Lines
*	build: Revise the build system	dimitri staessens	2017-08-21	1	-1/+4
\| \| \| \| \| \| \| \| \| \|	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.
*	build: Replace fsf snail mail with contact URL	dimitri staessens	2017-08-13	1	-2/+1
\|
*	lib: Fix bad lock in rib	dimitri staessens	2017-04-20	1	-2/+3
\|
*	lib, ipcpd, irmd: Register hash instead of name	dimitri staessens	2017-04-13	1	-10/+14
\| \| \| \| \| \| \| \| \|	All information passed over the IRMd/IPCP boundary for using IPC services (flow allocation, registration) is now hashed. This effectively fixes the shared namespace between DIFs and the IRMDs. This PR also fixes some API issues (adding const identifiers), shuffles the include headers a bit and some small bugs.
*	lib: Fix list_move on wrong list	Sander Vrijders	2017-03-28	1	-3/+9
\| \| \| \| \| \|	The list move was being done on the whole list of sub events, whereas it should only be done on the first entry. A cleanup handler was also added.
*	lib, ipcpd: Fix bugs in ro sets	Sander Vrijders	2017-03-28	1	-1/+9
\| \| \| \| \|	This fixes several bugs in the ro sets, rib. And it fixes several bugs in the graph and routing component of the normal IPCP.
*	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: Fix bad lock in rib	dimitri staessens	2017-02-10	1	-1/+1
\|
*	lib, ipcp: Correctly init condvars	dimitri staessens	2017-02-09	1	-1/+9
\| \| \| \| \|	The timerwheel and RIB use timedwaits. The condition variables are now correctly initialised to use the configuration defined clock.
*	lib: Retrieve number of children of a RIB node	dimitri staessens	2017-02-03	1	-3/+10
\|
*	lib: Fix insertion order in RIB	dimitri staessens	2017-02-02	1	-8/+13
\| \| \| \| \| \| \| \|	The new element must be added before the larger element (list_add_tail, since it's a circular list). Also fixes a bug and improves the locking in rib_pack (rib must be locked until the subtree is fully packed in the buffer).
*	lib: Add packing and unpacking RIB	dimitri staessens	2017-01-31	1	-29/+252
\| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \|	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/+67
\| \| \| \| \|	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/+1097
	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.