| Commit message (Collapse) | Author | Age | Files | Lines |
... | |
|
|
|
|
| |
The index j in the function that transforms the list of predecessors
to a routing table was incremented at the wrong time.
|
|
|
|
|
|
| |
This adds fixes the locking of the PFF which was externalized, but not
yet correctly updated within the PFF component itself and within the
flow manager.
|
|
|
|
|
|
| |
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.
|
|
|
|
|
|
| |
This removes the graph_add_edge operation of the graph component. The
routing component now only listens to RO_MODIFY events, and updates
the graph accordingly.
|
|
|
|
|
| |
This revises the list_move operation, which was giving weird
behaviour.
|
|
|
|
|
| |
This fixes several bugs in the ro sets, rib. And it fixes several bugs
in the graph and routing component of the normal IPCP.
|
| |
|
|
|
|
|
| |
The flow manager should clean up the buffer after the call to frct
create instance has either failed or succeeded.
|
| |
|
|
|
|
|
| |
When something fails, the successfully sent CDAP messages should be
reported back. Invoke_ids were not correctly released.
|
| |
|
|
|
|
|
|
| |
The routing now takes the results of the routing table to fill in the
forwarding table, by going through the neighbors and filling in the
right fd.
|
|
|
|
|
| |
This fixes a bad free. The table was only freed if it was NULL,
instead of the other way around.
|
|
|
|
|
| |
This adds a check to prevent a negative malloc in case the graph
structure is empty.
|
|
|
|
|
| |
The next vertex was not taken at the end of the Dijkstra calculation
loop.
|
|
|
|
|
|
|
| |
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.
|
| |
| |
| |
| |
| |
| | |
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.
|
|/
|
|
|
| |
This initializes conn_info in the ribmgr and fmgr before it is passed
to cacep.
|
| |
|
| |
|
| |
|
|
|
|
| |
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
|
| | |
|
| | |
|
| |
| |
| |
| | |
These solve several bugfixes in the normal.
|
|\ \
| |/
|/| |
|
| |
| |
| |
| |
| |
| | |
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.
|
|\ \ \ |
|
| | | |
| | | |
| | | |
| | | |
| | | | |
This solves some race conditions where packets arrive on a flow before
it is added to a flow_set.
|
| |/ /
| | |
| | |
| | |
| | | |
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.
|
| | | | |
|
| |/ / |
|
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
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.
|
| | | |
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
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.
|
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
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.
|
| | |
| | |
| | |
| | | |
This removes the CDAP flow class, which is no longer needed.
|