| Commit message (Collapse) | Author | Age | Files | Lines |
... | |
|/
|
|
|
|
|
| |
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: Increase update timeout in fmgr
|
| |
| |
| |
| | |
This works around a possible bug in glibc 2.25.
|
|\ \
| | |
| | |
| | | |
ipcpd: normal: Add routing table calculation
|
|/ /
| |
| |
| |
| |
| | |
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: Add memset of conn_info
|
|/ /
| |
| |
| |
| | |
This initializes conn_info in the ribmgr and fmgr before it is passed
to cacep.
|
|\|
| |
| |
| | |
lib: Fix memleaks in cdap
|
| | |
|
|\|
| |
| |
| | |
Be fixes
|
| | |
|
| | |
|
|/ |
|
|\
| |
| |
| | |
ipcpd: normal: Initialize qosspec
|
| |
| |
| |
| | |
This fixes some memleaks as reported by valgrind.
|
|/
|
|
|
| |
The QoS spec was not being initialized before being added to the graph
structure, resulting in an error when compiled with clang.
|
|\
| |
| |
| | |
irmd: Fix some missing locks
|
| | |
|
|\ \
| | |
| | |
| | | |
irmd: Fix clock used for timedwait
|
|/ / |
|
|\ \
| | |
| | |
| | | |
ipcpd: normal: Several bugfixes
|
|/ /
| |
| |
| | |
These solve several bugfixes in the normal.
|
|\ \
| |/
|/| |
|
| |\
| | |
| | |
| | | |
ipcpd: local: Handle failed flow allocation
|
| |/
| |
| |
| |
| |
| | |
When the flow_req_arr returned a negative error, it was not handled
correctly in the local IPCP, and an access was made into a table with
a negative integer. This handles it correctly.
|
|\ \
| | |
| | |
| | | |
ipcpd: normal: Split fmgr init into init and start
|
| | |
| | |
| | |
| | |
| | |
| | | |
This split the initialization of the flow manager into an init part
and a start part. This avoids the usage of data structures that have
not been properly initialized yet.
|
|\ \ \ |
|
| |\ \ \
| | | | |
| | | | |
| | | | | |
lib: Add queued SDUs when adding fd to flow_set
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
This solves some race conditions where packets arrive on a flow before
it is added to a flow_set.
|
| |\| | |
| | |/ /
| |/| |
| | | | |
ipcpd: Fill qosspec in complete gam policy
|
| |/ /
| | |
| | |
| | |
| | | |
The temporary cube parameter must be initialized if a qosspec is
passed to avoid uninitialized values for the qoscube in the prototype.
|
| |\ \
| | | |
| | | |
| | | | |
ipcpd: Fix cleanup of connmgr
|
| | | |
| | | |
| | | |
| | | |
| | | | |
This lessens the likelyhood that the CDAP SDU thread is not yet active
when a new connection starts sending CDAP messages.
|
| | | |
| | | |
| | | |
| | | | |
Fixed trying to double lock and cleanup order in main.
|
| |\ \ \
| | | | |
| | | | |
| | | | | |
Be graph
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
This lets the routing component listen to RIB events. It listens to
/fsdb which is populated with FSOs. The graph that is kept within the
routing component is updated depending on the event that was received.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
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.
|
| |\ \ \ \
| | |/ / /
| |/| / /
| | |/ / |
Be fixes
|
| | | | |
|
| |/ / |
|
| |\ \
| | | |
| | | |
| | | | |
ipcpd: normal: Add Flow State Objects to RIB
|
| |/ /
| | |
| | |
| | |
| | |
| | |
| | | |
This makes the routing component create a Flow State Database
(FSDB). An FSDB contains Flow State Objects (FSOs). An FSO is created
when a neighbor is added, it is deleted when a neighbor is removed and
its QoS is updated when a neighbor's QoS changes.
|
| |\ \
| | | |
| | | |
| | | | |
lib: Fix typo in cdap
|
| |/ / |
|
| |\ \
| | | |
| | | |
| | | | |
lib: Manage multiple flows with a single CDAP instance
|
| |/ /
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
You can now add multiple flows to a CDAP instance. This will simplify
sending messages to different peers (e.g. for syncing the RIB). A
request will now return an array of keys terminated by
CDAP_KEY_INVALID. Removes the enum from the CDAP proto file to just
take the opcode as an integer.
|
| |\ \
| | | |
| | | |
| | | | |
Be cdap flow
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
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.
|
| | | |
| | | |
| | | |
| | | | |
The CMakeLists files are now properly indented.
|