Ouroboros main repository http://133.ip-51-38-114.eu/cgit/ouroboros/atom?h=0.4 2017-02-17T09:53:43+00:00 2017-02-17T09:53:43+00:00 dimitri staessens dimitri.staessens@intec.ugent.be 2017-02-16T18:22:50+00:00 urn:sha1:645cf66af11ac36b81648f2e1eb3b1f5aeb7b544 Moves the definitions of paths in the RIB for the normal IPCP to a header ribconfig.h to avoid repetition. 2017-02-09T22:25:13+00:00 dimitri staessens dimitri.staessens@intec.ugent.be 2017-02-09T22:13:13+00:00 urn:sha1:d3a8f3e1b2db0894568f5002abf35599324afe9e 2017-01-31T19:36:18+00:00 dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-31T18:55:59+00:00 urn:sha1:988355d5bb62405f3bd3fbaade1f26ba4b2c274e 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. 2017-01-29T15:29:51+00:00 dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-29T15:29:51+00:00 urn:sha1:d6321a22f8c957523e7acbf6c57f5730b55ac378 Returns the names of the nodes (not the full paths). The function allocates memory to the children pointer that should be freed. 2017-01-21T08:55:10+00:00 dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-20T11:59:17+00:00 urn:sha1:9c92dd66d5e7fab3a3e243abbad9a20b29891fee 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. 2017-01-16T14:53:17+00:00 dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-16T12:40:57+00:00 urn:sha1:fac7ffe8ea9f42ebcf67c011c944d165cbab3e3b Adds an implementation of B-trees of order k (k children, min fill is k/2, max fill k - 1). Useful to implement indexes for faster lookups. 2017-01-15T11:28:21+00:00 dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-15T11:28:21+00:00 urn:sha1:164f943bb8af62c343a55d2b3f97c20d06fd7592 2017-01-13T19:32:26+00:00 dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-13T19:18:30+00:00 urn:sha1:3ad7ee0c378e528fab7277daa9427eda562f08b4 Test the SHA3 function with known hashes. 2017-01-09T15:09:07+00:00 dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-09T15:09:07+00:00 urn:sha1:7687ba45fca7a7f139d880d39a51c9e741fb25ea Copyright is set to 2016 - 2017. License text on includes and sources in the library are changed to indicate the LGPLv2.1 license. 2016-12-24T12:50:00+00:00 dimitri staessens dimitri.staessens@intec.ugent.be 2016-12-24T00:59:42+00:00 urn:sha1:2fe765020769c8eb06ca410b7e289f37508d5efc This corrects the license statements on all files. Installed headers are LGPLv2.1, the rest of the code is GPLv2.