* This function initializes the internal state array with a 32-bit * integer seed. * * @param seed a 32-bit integer used as the seed. */

Release the iterator memory */

Search the list for a node matching a given key. * The match is performed using the 'match' method * set with listSetMatchMethod(). If no 'match' me

* This function represents the recursion formula. * @param a a 128-bit part of the interal state array * @param b a 128-bit part of the interal stat

Return the length of the queue, or zero if NULL is passed here. */

Duplicate an sds string. */

Split a line into arguments, where every argument can be in the * following programming-language REPL-alike form: * * foo bar "newline are supporte

Remove the part of the string from left and from right composed just of * contiguous characters found in 'cset', that is a null terminted C string.

Low level logging. To use only for very big messages, otherwise * serverLog() is to prefer. */

Populate the length object and try gluing it to the next chunk. */

Validate a set of job IDs. Return C_OK if all the IDs are valid, * otherwise C_ERR is returned. * * When C_ERR is returned, an error is send to the

* This function represents the recursion formula in AltiVec and BIG ENDIAN. * @param a a 128-bit part of the interal state array * @param b a 128-bi

This function performs just a step of rehashing, and only if there are * no safe iterators bound to our hash table. When we have iterators in the *

sfu: set first unset. */

Concatenate a string representing the state of a client in an human * readable format, into the sds string 's'. */

Like clusterSendJobIDMessage(), but sends the message to the specified set * of nodes (excluding myself if included in the set of nodes). */

Free a cluster link, but does not free the associated node of course. * This function will just make sure that the original node associated * with t

Get the memory warning level: * * 0 - No memory warning. * 1 - Over 75% of maxmemory setting. * 2 - Over 95% of maxmemory setting. * 3 - Over 95%

* Compute the natural log of Gamma(x), accurate to 10 decimal places. * * This implementation is based on: * * Pike, M.C., I.D. Hill (1966) Algo

Compute the smallest power of 2 that is >= x. */

Connect to a Redis instance. On error the field error in the returned * context will be set to the return value of the error function. * When no set

Add the job in the jobs hash table, so that we can use lookupJob() * (by job ID) later. If a node knows about a job, the job must be registered * an

Append the new line to the current configuration state. */

Only the most significant bits of keys passed to rtree_[gs]et() are used. */

Increment the sds length and decrements the left free space at the * end of the string according to 'incr'. Also set the null term * in the new end

Append the specified null termianted C string to the sds string 's'. * * After the call, the passed sds string is no longer valid and all the * ref

Log a fixed message without printf-alike capabilities, in a way that is * safe to call from a signal handler. * * We actually use this only for sig

Delete an element from the skiplist. If the element was found and deleted * 1 is returned, otherwise if the element was not there, 0 is returned. */

Helper function for the redisAppendCommand* family of functions. * * Write a formatted command to the output buffer. When this family * is used, yo

We want the error field to be accessible directly instead of requiring * an indirection to the redisContext struct. */

Helper functions to push/shift callbacks */

Destroy an entire dictionary */

Reset a hash table already initialized with ht_init(). * NOTE: This function should only be called by ht_destroy(). */

Add a long long as integer reply or bulk len / multi bulk count. * Basically this is used to output <prefix><long long><crlf>. */

Wait for milliseconds until the given file descriptor becomes * writable/readable/exception */