writeRecord writes a TLS record with the given type and payload to the connection and updates the record layer state. c.out.Mutex <= L.

Returns the current number of elements in the array. */

! \fn ILibParseString(char* buffer, int offset, int length, char* Delimiter, int DelimiterLength) \brief Parses a string into a linked list of tokens.

Multiply two field elements: out = in1 * in2 */

Square a field element: out = in^2 */

Close closes the connection.

! \fn ILibLinkedList_GetNextNode(void *LinkedList_Node) \brief Returns the next node, from the specified linked list node \param LinkedList_Node The c

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

felem_mul sets |out| = |in1| * |in2| * On entry: * in1[i] < 2^109 * in2[i] < 2^109 * On exit: * out[i] < 7 * 2^64 < 2^67 */

feSquare calculates h = f*f. Can overlap h with f. Preconditions: |f| bounded by 1.1*2^26,1.1*2^25,1.1*2^26,1.1*2^25,etc. Postconditions: |h| bounde

Returns the number of strings in the array */

! \fn ILibWebServer_Send_Raw(struct ILibWebServer_Session *session, char *buffer, int bufferSize, int userFree, int done) \brief Send a response on a

felem_square sets |out| = |in|^2 * On entry: * in[i] < 2^109 * On exit: * out[i] < 7 * 2^64 < 2^67. */

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

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

Create an error message in allocated memory and set state->err and state->msg accordingly. Free any previous error message already there. Do n

go:noescape

BN_div computes dv := num / divisor, rounding towards * zero, and sets up rm such that dv*divisor + rm = num holds. * Thus: * dv->neg == n

! \fn ILibQueue_DeQueue(void *q) \brief Removes an item from the queue \param q The queue to pop the item from \returns The item popped off the queue.

go:noescape

felem_shrink converts an felem into a smallfelem. The result isn't quite * minimal as the value may be greater than p. * * On entry: * in[i] < 2