summaryrefslogtreecommitdiff
path: root/src/lib
Commit message (Collapse)AuthorAgeFilesLines
...
* lib: Revise list_move operationSander Vrijders2017-03-281-8/+4
| | | | | This revises the list_move operation, which was giving weird behaviour.
* lib, ipcpd: Fix bugs in ro setsSander Vrijders2017-03-281-1/+9
| | | | | This fixes several bugs in the ro sets, rib. And it fixes several bugs in the graph and routing component of the normal IPCP.
* lib: Fix invoke_ids and failure handling in CDAPdimitri staessens2017-03-251-41/+18
| | | | | When something fails, the successfully sent CDAP messages should be reported back. Invoke_ids were not correctly released.
* ipcpd: normal: Fill in forwarding tableSander Vrijders2017-03-242-14/+14
| | | | | | 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.
* lib: Fix memleaks in cdapdimitri staessens2017-03-221-8/+23
|
* Merge branch 'be' of bitbucket.org:ouroboros-rina/ouroboros into beSander Vrijders2017-03-2144-921/+498
|\
| * lib: Add queued SDUs when adding fd to flow_setdimitri staessens2017-03-212-0/+26
| | | | | | | | | | This solves some race conditions where packets arrive on a flow before it is added to a flow_set.
| * lib: Fix CDAP with multiple fdsdimitri staessens2017-03-141-14/+51
| |
| * lib: Fix typo in cdapdimitri staessens2017-03-031-2/+2
| |
| * lib: Manage multiple flows with a single CDAP instancedimitri staessens2017-03-034-125/+242
| | | | | | | | | | | | | | | | 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.
| * Change email addresses to ugent.beSander Vrijders2017-03-0329-37/+59
| | | | | | | | | | | | | | 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.
| * build: Format CMakeLists.txt filesSander Vrijders2017-03-032-19/+19
| | | | | | | | The CMakeLists files are now properly indented.
| * ipcpd: normal: Add connection managerSander Vrijders2017-03-022-0/+4
| | | | | | | | | | | | | | 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.
| * lib: Split CACEP into request/response protocoldimitri staessens2017-02-281-26/+6
| |
| * lib: Split authentication from CACEPdimitri staessens2017-02-2711-707/+101
| | | | | | | | | | | | | | 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.
| * lib: Remove application entity nameSander Vrijders2017-02-243-42/+20
| | | | | | | | | | 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.
| * Revise CACEP APIdimitri staessens2017-02-245-65/+84
| | | | | | | | | | | | The information passed to CACEP is split between the information about the connection and the information to be used during the authentication exchange.
* | Merge branch 'testing' into beSander Vrijders2017-03-211-2/+0
|\ \ | |/ |/|
| * irmd: Fix timeouts in reg_entrydimitri staessens2017-03-211-2/+0
| | | | | | | | | | This fixes bad timedwaits for the state of the reg_entry. Also slightly revised timedwaits throughout the prototype.
* | lib: Clean up memory management in cacep policiesdimitri staessens2017-02-212-4/+15
| |
* | lib: Exchange protocol info during CACEPdimitri staessens2017-02-219-13/+372
| | | | | | | | | | | | | | | | | | 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.
* | lib: Revise CACEPdimitri staessens2017-02-207-139/+327
| | | | | | | | | | | | | | | | | | 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.
* | Merged in dstaesse/ouroboros/be-sha3 (pull request #380)dimitri staessens2017-02-181-4/+6
|\ \ | | | | | | | | | lib: Fix bug in sha3
| * | lib: Fix bug in sha3dimitri staessens2017-02-181-4/+6
| |/
* / lib: Set cdap_req state to REQ_NULL after timeoutdimitri staessens2017-02-181-12/+20
|/ | | | | This prevented destruction of a CDAP instance that had a timed out request.
* ipcpd: Move RIB configuration to common headerdimitri staessens2017-02-171-0/+2
| | | | | Moves the definitions of paths in the RIB for the normal IPCP to a header ribconfig.h to avoid repetition.
* lib: Revise endian header and SHA3Sander Vrijders2017-02-162-140/+39
| | | | | | | | 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.
* cdap: Take void * for send operationsdimitri staessens2017-02-101-11/+15
| | | | This facilitates sending arbitrary variables over CDAP.
* ipcpd: Silent shutdown of normaldimitri staessens2017-02-101-0/+5
| | | | | The acceptor will not log disconnects with IRMd. Unexpected disconnects will be reported and handled by management components.
* include: Add header for endiannessdimitri staessens2017-02-101-88/+1
| | | | | | | | | 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).
* lib: Fix bad lock in ribdimitri staessens2017-02-101-1/+1
|
* lib, ipcp: Correctly init condvarsdimitri staessens2017-02-091-1/+9
| | | | | The timerwheel and RIB use timedwaits. The condition variables are now correctly initialised to use the configuration defined clock.
* lib: Fix bug in rib_testdimitri staessens2017-02-091-1/+1
|
* lib, tools, ipcpd: Fix compilation on FreeBSDdimitri staessens2017-02-091-2/+6
| | | | | | | | | | | | 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.
* ipcpd, lib: Report IPCP creation failuredimitri staessens2017-02-093-73/+127
| | | | | | | | 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.
* lib, ipcpd: Comply to pedantic C99Sander Vrijders2017-02-081-1/+4
| | | | | | 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.
* lib: Log to the logging systemdimitri staessens2017-02-083-19/+12
| | | | | | | | | | 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
* ipcpd: Revise PCI manipulation in normaldimitri staessens2017-02-071-14/+6
| | | | | | | | | | | 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.
* ipcpd, lib: Revise normal IPCPdimitri staessens2017-02-062-10/+10
| | | | | | | | | | 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.
* lib: Fix memleak in cacepdimitri staessens2017-02-061-0/+1
|
* lib: Handle receiving CDAP reply before waitdimitri staessens2017-02-041-1/+9
| | | | | | 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.
* lib: Retrieve number of children of a RIB nodedimitri staessens2017-02-031-3/+10
|
* lib: Fix insertion order in RIBdimitri staessens2017-02-021-8/+13
| | | | | | | | 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 RIBdimitri staessens2017-01-314-30/+325
| | | | | | | | | | | | | | | | | | | 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.
* lib: Add function to get children of node in RIBdimitri staessens2017-01-292-0/+91
| | | | | Returns the names of the nodes (not the full paths). The function allocates memory to the children pointer that should be freed.
* lib: Fix reading from non-blocking flowsdimitri staessens2017-01-241-4/+3
| | | | | 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).
* lib: Add new version of Resource Information Basedimitri staessens2017-01-214-0/+1321
| | | | | | | | | | | | 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.
* lib: Add move operation for listsdimitri staessens2017-01-201-0/+11
| | | | | Allows moving the elements of one linked list to another. Re-initializes the source list.
* lib: Fix return value and typo in fqueuedimitri staessens2017-01-201-1/+1
|
* lib: Add B-tree implementationdimitri staessens2017-01-165-0/+609
| | | | | 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.
generated by cgit v1.2.3 (git 2.39.1) at 2024-11-05 08:04:12 +0000