| Commit message (Collapse) | Author | Age | Files | Lines |
... | |
| |
| |
| |
| |
| |
| |
| | |
If an IPCP SEGVs abruptly, the sanitizer in the IRMd would also cause
a SEGV because of looping over a registry linked list inside another
safe loop over the same list. A function is added to the registry to
avoid this.
|
| |
| |
| |
| |
| |
| | |
In extreme cases, the response to a CDAP request can arrive before the
AE doing the request has called cdap_request_wait. This PR handles it
by waiting for the state to move away from INIT before responding.
|
|\|
| |
| |
| | |
irmd: Fix memleak in registry
|
| | |
|
| | |
|
|\|
| |
| |
| | |
lib: Retrieve number of children of a RIB node
|
| | |
|
|\|
| |
| |
| | |
lib: Fix insertion order in RIB
|
| |
| |
| |
| |
| |
| |
| |
| | |
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
|
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
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.
|
|\|
| |
| |
| | |
irmd: Fix memleak attempting double bootstrap
|
| |
| |
| |
| |
| |
| | |
When trying to double bootstrap, the entry name was strdup'd before
the bootstrap leaking the previous name. Now it bootstraps first and
sets the name after a successful bootstrap only.
|
|\|
| |
| |
| | |
lib: Add function to get children of node in RIB
|
| |
| |
| |
| |
| | |
Returns the names of the nodes (not the full paths). The function
allocates memory to the children pointer that should be freed.
|
|\|
| |
| |
| | |
ipcpd: Fix unused parameter in local IPCP
|
| | |
|
|\|
| |
| |
| | |
ipcpd: Don't strdup() the dif_name in main loop
|
|/ |
|
|\
| |
| |
| | |
lib: Fix reading non-blocking flows
|
|/
|
|
|
| |
The -EAGAIN from a failed non-blocking flow read would trigger the
assertion. This snuck in somehow (we need some unit tests for dev.c).
|
|\
| |
| |
| | |
Be rib
|
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
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.
|
| |
| |
| |
| |
| | |
Allows moving the elements of one linked list to
another. Re-initializes the source list.
|
|/ |
|
|\
| |
| |
| | |
lib: Add B-tree implementation
|
|/
|
|
|
| |
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.
|
|\
| |
| |
| | |
lib: Add test for crc32 function
|
|/ |
|
|\
| |
| |
| | |
lib: Move CRC32 implementation to library
|
|/
|
|
| |
The CRC32 implementation will be used to ID objects in the RIB.
|
|\
| |
| |
| | |
lib: Add test for SHA-3 function
|
| |
| |
| |
| |
| |
| |
| |
| | |
Sometimes the timerwheel test could fail because of scheduler timings
(an issue more apparent in Virtual Machines). When the first check
fails, the test will wait for another complete round of the
timerwheel. The maximum number of slots in the test is reduced to
reduce the test time.
|
|/
|
|
| |
Test the SHA3 function with known hashes.
|
|\
| |
| |
| | |
Be gam
|
| |
| |
| |
| |
| | |
This allows the selection of a policy for the graph adjacency
manager. Currently we only support constructing a complete graph.
|
| |
| |
| |
| |
| | |
After a previous commit the API of the linked list was changed. This
updates the files that were not yet merged upstream.
|
| |
| |
| |
| |
| |
| |
| | |
Since Python 3.6, the headers are no longer C89 compliant, since they
introduced C++ style comments. This sets the compiler flag to std99
instead of std89 to allow wrapping of headers. It also adds a missing
header to the wrapping file.
|
| |\ |
|
| | |
| | |
| | |
| | |
| | | |
This commit adds the graph adjacency manager to the normal IPCP, which
sets up N-1 flows to other members.
|
| | |
| | |
| | |
| | |
| | |
| | | |
This adds CACEP to the library, which can be used for authenticating
the other party after flow allocation and for obtaining other relevant
information.
|
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
This allows IPCPs to bind a name, so that they can announce their name
to neighbors which can then allocate a flow to them. Registering of
the name happens by an administrator. It also moves the irmd_api to
common ground, since it is used by all IPCPs.
|
|\ \ \
| | | |
| | | |
| | | | |
lib: Add SHA3 hash function
|
|/ / /
| | |
| | |
| | |
| | |
| | | |
Adds an SHA-3 hash implementation that will be used in the rib,
adapted and redistributed from the RHASH project
(https://github.com/rhash/RHash)
|
|\ \ \
| | | |
| | | |
| | | | |
logs: Comply with C99 standard for variadic macros
|
|/ / / |
|
|\ \ \
| |_|/
|/| |
| | | |
include: Fix typo in list.h
|
|/ / |
|
|\ \
| |/
|/|
| | |
Updates to list and fixes LGPL license for library
|
| | |
|