Increases the amount of storage allocated if it is less than a given amount. This will retain any data currently held in the array, but will add

ssl_cipher_apply_rule applies the rule type |rule| to ciphers matching its * parameters in the linked list from |*head_p| to |*tail_p|. It writes the

Generates a random string of data. TODO: Use Hardware RNG if possible

We can assume little-endian. */

<summary> Encode the string `s` in the buffer using UTF-8. </summary> <param name="s">The string to encode.</param> <returns> The offset in the buffer

! \fn ILibDestructPacket(struct packetheader *packet) \brief Frees resources associated with a Packet that was created either by \a ILibCreateEmptyPac

! \fn ILibLifeTime_Remove(void *LifeTimeToken, void *data) \brief Removes a timed callback from an \a ILibLifeTime module \param LifeTimeToken The \a

readHandshake reads the next handshake message from the record layer. c.in.Mutex < L; c.out.Mutex < L.

! \fn ILibGetEntry(void *hashtree, char* key, int keylength) \brief Gets an item from a HashTree \param hashtree The HashTree to operate on \param key

========================================================================= */

feMul calculates h = f * g Can overlap h with f or g. Preconditions: |f| bounded by 1.1*2^26,1.1*2^25,1.1*2^26,1.1*2^25,etc. |g| bounded by 1.1*2^26,

Returns the first non-whitespace character in the string. */

r = p */

Returns a raw pointer to the allocated data. This may be a null pointer if the data hasn't yet been allocated, or if it has been freed by calling

<summary> Finalize a buffer, pointing to the given `root_table`. </summary> <param name="rootTable"> An offset to be added to the buffer. </param>

! \fn ILibAsyncSocket_IsFree(ILibAsyncSocket_SocketModule socketModule) \brief Determines if an ILibAsyncSocket is in use \param socketModule The ILib

! \fn ILibQueue_EnQueue(void *q, void *data) \brief Add an item to the queue \param q The queue to add to \param data The data to add to the queue */

! \fn ILibLinkedList_Remove(void *LinkedList_Node) \brief Removes the given node from a linked list data structure \param LinkedList_Node The linked l

! \fn ILibQueue_PeekQueue(void *q) \brief Peeks at an item from the queue \param q The queue to peek an item from \returns The item from the queue. NU