Ouroboros main repository http://133.ip-51-38-114.eu/cgit/ouroboros/atom?h=0.7 2017-10-14T11:19:10+00:00 2017-10-14T11:19:10+00:00 dimitri staessens dimitri.staessens@ugent.be 2017-10-12T00:15:39+00:00 urn:sha1:bedd1d4eadde9ab64f924c69eba716b015599e67 This commit deprecates ouroboros_init and ouroboros_fini and adds them as a constructor or destructor, causing these function to be run automatically when a program that links to the library calls and exits main(). For this to fully work, the library had to be split so that we can avoid the irmd calling these functions (the IRMd has to create the shm structures on which these calls depend). The library is split in 3 parts: libouroboros-dev, libouroboros-irm and libouroboros-common. The latter is linked to the other two so that including libouroboros-dev or libouroboros-irm will also link libouroboros-common. 2017-10-07T08:11:00+00:00 dimitri staessens dimitri.staessens@ugent.be 2017-10-07T08:06:22+00:00 urn:sha1:15ccd8ac0d1a7bfab2db3929200f3926c1e05db2 This adds a cleanup handler to ensure the lock is released in the event that the thread is cancelled during a write. An alternative solution could be to make the flow write in a non-blocking way (only the blocking write contains an execution path that has a cancellation point). Fixes #55 2017-09-29T13:12:36+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-09-27T15:24:59+00:00 urn:sha1:39c7f82f4714f8515860d1c0e2726bff29e22944 This will let the link state policy react to flow up and down events by notifying the PFFs of the routing instances of this event so they can take an appropriate action. 2017-09-29T13:12:36+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-09-27T13:33:39+00:00 urn:sha1:e3dba5812b1422a79e6e77ce9f923bade5a480e4 This adds the Loop-Free Alternates (LFA) policy. In case a link goes down a LFA may be selected to route the SDUs on without causing loops instead of the main hop that just went down. 2017-09-26T13:27:19+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-09-25T15:36:18+00:00 urn:sha1:5d01c511fc1c31fdeee6bb515be0ca300854ba21 This adds a refcount to the graph edges so that it is only included in the calculation if both sides announced it. 2017-09-25T13:55:47+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-09-25T13:31:20+00:00 urn:sha1:0847da715c82d49b01758d88ecca496eba2c8d34 This keeps the index in the vertex struct so that is more easily available during Dijkstra. 2017-09-25T13:12:43+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-09-25T13:12:43+00:00 urn:sha1:3074adc1615517150568d396d629175932a08a52 This simplifies the Dijkstra implementation by immediately setting the correct next hop during Dijkstra instead of looping through the list of predecessors afterwards. 2017-09-25T12:54:16+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-09-25T12:51:23+00:00 urn:sha1:52bf8c03179fe63724cb632e7f38f8867b564c26 This simplifies several internal graph functions by passing an array of bools instead of an array of vertices. 2017-09-25T12:26:26+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-09-25T12:26:26+00:00 urn:sha1:e245a809296dad1ea22956f015751cc172a44ad2 This returns a list as routing table instead of a pointer to a pointer to a pointer, which simplifies the looping through the routing table and makes it more extensible for future additions. 2017-09-21T16:11:17+00:00 dimitri staessens dimitri.staessens@ugent.be 2017-09-21T16:11:17+00:00 urn:sha1:20c88510ff304106a637326894e48c98eedd7498