| Commit message (Collapse) | Author | Age | Files | Lines |
... | |
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
This makes the IRMd add/remove worker threads dynamically.
IRMD_TPM_TIMEOUT sets a timer in the threadpool manager for checking
idle threads. Each time this timer expires, it will reduce the
threadpool by one. IRMD_MIN_AV_THREADS is the minimum number of
available worker threads. If the number of active threads goes under
this threshold, the threadpool manager will create threads to get the
number of threads to IRMD_MAX_AV_THREADS, unless IRMD_MAX_THREADS is
reached.
|
| |
|
| |
|
|
|
|
|
|
| |
The flow_alloc_res and flow_alloc_resp calls have been removed. The
flow_alloc and flow_accept calls are now both blocking and take an
additional timeout argument.
|
|
|
|
|
|
| |
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.
|
| |
|
|\ |
|
| |
| |
| |
| |
| |
| | |
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.
|
| |
| |
| |
| |
| | |
This solves some race conditions where packets arrive on a flow before
it is added to a flow_set.
|
| |
| |
| |
| |
| |
| |
| |
| | |
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.
|
| |
| |
| |
| |
| | |
cacep.h was not installed on install, but other applications may want
to use it as well.
|
| |
| |
| |
| |
| |
| |
| | |
This adds the connection manager which allows the different AEs of the
normal IPCP to register with it. An AE can then use the connection
manager to allocate a flow to a neighbor, or to wait for a new
connection from a neighbor.
|
| | |
|
| |
| |
| |
| |
| |
| |
| | |
By removing authentication as part of CACEP, all policies
disappear. CACEP becomes a policy-free connection establishment
protocol between Application Entities. Authentication can later be
added cleanly as a pure policy function when needed.
|
| |
| |
| |
| |
| | |
The AE name should not be passed over the layer boundaries. If an
application has more than one AE it should exchange this in CACEP.
|
| |
| |
| |
| |
| |
| | |
The information passed to CACEP is split between the information about
the connection and the information to be used during the
authentication exchange.
|
| |
| |
| |
| |
| |
| |
| |
| |
| | |
This exchanges a protocol name, a protocol version and concrete syntax
for the protocol upon CACEP. For CDAP, only version 1 and GPB are
supported. No lists for other supported versions or syntaxes are
exchanged (but the proto file supports it). CACEP fails if there is a
mismatch between the protocol names, version and syntax specified by
the communicating parties.
|
|/
|
|
|
|
|
|
|
| |
Revises CACEP policies to stateless library calls. It provides two
policies: an anonymous authentication policy that will generate random
credentials for the peer, and a simple authentication policy that will
return a name for the peer and an address.
Changes the normal IPCP to use the updates API calls.
|
|
|
|
|
| |
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.
|
|
|
|
|
| |
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.
|
|
|
|
|
|
| |
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.
|
|
|
|
|
|
|
|
|
| |
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).
|
|
|
|
|
|
|
|
| |
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.
|
|
|
|
|
|
| |
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 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.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
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.
|
|
|
|
|
| |
Returns the names of the nodes (not the full paths). The function
allocates memory to the children pointer that should be freed.
|
|
|
|
|
|
|
|
|
|
|
|
| |
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.
|
| |
|
|
|
|
| |
The CRC32 implementation will be used to ID objects in the RIB.
|
|\
| |
| |
| | |
Be gam
|
| |
| |
| |
| |
| | |
This allows the selection of a policy for the graph adjacency
manager. Currently we only support constructing a complete graph.
|
| |
| |
| |
| |
| |
| |
| | |
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 adds CACEP to the library, which can be used for authenticating
the other party after flow allocation and for obtaining other relevant
information.
|
| | | |
|
| |/
|/| |
|
| | |
|