| Commit message (Collapse) | Author | Age | Files | Lines |
|\
| |
| |
| | |
lib: Fix bug in sha3
|
| | |
|
|/
|
|
|
| |
This prevented destruction of a CDAP instance that had a timed out
request.
|
|
|
|
|
| |
Moves the definitions of paths in the RIB for the normal IPCP to a
header ribconfig.h to avoid repetition.
|
| |
|
|
|
|
|
|
|
|
| |
This revises the endian header to let the build time checks of
endianness be performed by the standard libraries. We just check for
the OS that is being used and provide the endian functions from
OpenBSD to everyone. It also updates the SHA3 sources to use this new
header. The byte order header is removed.
|
|
|
|
| |
Also fixes another lock.
|
|
|
|
|
| |
Use labs for absolute value of a long, and defines bswap_64 as the
FreeBSD function bswap64.
|
|
|
|
|
|
| |
This increases the threadpool size for the IPCP main loop. Starvation
was happening due to a lot of back and forth interactions between the
normal IPCPd and the IRMd.
|
| |
|
|
|
|
|
| |
ntohll and ntohl have been renamed ntoh64 and ntoh32, htonll and htonl
have been renamed hton64 and hton32.
|
|
|
|
|
|
|
|
| |
When there is a burst of successive flow allocations for a certain
name, each such request will block a thread in the IRMD for
IRMD_REQ_ARR_TIMEOUT ms to allow the application some time to respond.
This refactors some parts of the IRMd.
|
|
|
|
|
|
|
| |
Doing a directory query before the IPCP is has bootstrapped or is
enrolled will result in an assertion failure as the directory is not
yet ready. This fixes flow allocation over the LLC shim (which
triggers a directory query from the IRMd) with a normal IPCP present.
|
|
|
|
|
|
| |
The enrollment procedure will ask for a timestamp of the IPCP it is
enrolling with. It will (taking into account the RTT of the request)
issue a warning if the offset is larger than RIB_WARN_TIME_OFFSET ms.
|
|
|
|
| |
This facilitates sending arbitrary variables over CDAP.
|
|
|
|
|
| |
The acceptor will not log disconnects with IRMd. Unexpected
disconnects will be reported and handled by management components.
|
|
|
|
|
|
|
|
|
| |
This adds a header for dealing with endianness in ouroboros. It is
extracted from the byte_order header in the library (which now
includes this header). It also exposes the functions ntohl, ntohll,
htonl and htonll, necessary for converting 32 and 64 bit values for
storage and retrieval from the RIB (which should store multi-byte
values in network byte order).
|
|\
| |
| |
| | |
ipcpd: Remove logging if not initialized yet
|
| |
| |
| |
| |
| |
| | |
This removes the logs that would print to stdout if the IPCP fails to
initialize. If the user had asked that logs would be printed to the
syslog this would be unwanted behaviour.
|
|/ |
|
| |
|
|
|
|
|
| |
The timerwheel and RIB use timedwaits. The condition variables are now
correctly initialised to use the configuration defined clock.
|
|
|
|
|
|
| |
On 32-bit systems size_t is different than on 64 bit systems. The
correct way to print a size_t is with %z. uint64_t is printed portably
with the PRIu64 macro.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
FreeBSD defines its own bswap64 in the <sys/endian.h> header, which is
now included correctly.
POSIX requires XSI or RTS extensions to be enabled for the
sa_sigaction field to be visible. Linux doesn't do the check
correctly, but FreeBSD does.
Removes the LOG_MISSING call which was deprecated with the last
revision of the logging system.
|
|
|
|
|
|
|
|
| |
The IPCP will now respond with an ipcp_create_r message when it fails,
informing the IRMd.
Also adds some const qualifiers in the public headers and fixes
some formatting in dev.c.
|
| |
|
|
|
|
|
|
| |
irm_bind has to be called after ipcp_init() since it targets the AP-I
and needs the pid to be registered with the IRMd. Also fixes missing
unbinding of the AP-I.
|
|
|
|
|
|
| |
With the changes in this commit Ouroboros will compile with the
pedantic flag on when the standard is C99. The main problem was the
used of unnamed structs and unions, which is C11.
|
|
|
|
|
|
|
|
|
|
| |
This removes the logfile and outputs log messages to the logging
system. The creation of the logfiles (as well as the ap_init() call)
were moved into ipcp_init() to simplify the IPCP creation and
shutdown.
Fixes #25
Fixes #27
|
|
|
|
|
|
|
|
|
| |
The ipcp-ops header was removed and merged into ipcp.h. The common
components dif_name and ipcp_type have been moved to the main ipcp
struct. After this move, ipcp_data only contained shim information, so
it was renamed to shim_data. The ipcp_init() function checks the type
and will only include the shim_data if the type is not an IPCP_NORMAL.
All ipcps have been adapted to this change in API.
|
|
|
|
|
|
|
|
|
|
|
| |
The pci function will store offsets to avoid having to recalculate
them every time. TTL handling is removed from the fmgr, the TTL is
automatically decreased when deserializing the PCI (or set to 1 if
there is no TTL present so the PDU will be forwarded). The
deserialisation function now takes a pointer to a struct pci as input
to avoid memory allocation and release each time a PDU is
processed. Some checks have been replaced with assert() and return
values replaced with void where it makes sense.
|
|
|
|
|
|
|
|
|
|
| |
This PR updates the normal IPCP to use the new RIB. The old ribmgr is
removed and replaced by a stub that needs to be implemented. All
components (dir, fmgr, frct) were adapted to the new RIB API. A lot
of functionality was moved outside of the ribmgr, such as the
addr_auth, which is now a component of the IPCP. The address is also
stored to the ipcpi struct. The irm tool has an option to set the gam
policy of the rib manager.
|
| |
|
|
|
|
|
|
|
| |
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.
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
| |
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).
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
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.
|
|
|
|
|
|
| |
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.
|
|
|
|
|
| |
Returns the names of the nodes (not the full paths). The function
allocates memory to the children pointer that should be freed.
|
| |
|
| |
|
|
|
|
|
| |
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).
|
|
|
|
|
|
|
|
|
|
|
|
| |
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.
|
| |
|
|
|
|
|
| |
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.
|