Create an empty (zero length) sds string. Even in this case the string * always has an implicit null term. */

* base_alloc() guarantees demand-zeroed memory, in order to make multi-page * sparse data structures such as radix tree nodes efficient with respect

* This function generates and returns 32-bit pseudorandom number. * init_gen_rand or init_by_array must be called before this function. * @return 32

Append to the sds string "s" an escaped string representation where * all the non-printable characters (tested with isprint()) are turned into * esc

Append the specified sds 't' to the existing sds 's'. * * After the call, the modified sds string is no longer valid and all the * references must

Create a new sds string with the content specified by the 'init' pointer * and 'initlen'. * If NULL is used for 'init' the string is initialized wit

MurmurHash2, by Austin Appleby * Note - This code makes a few assumptions about how your machine behaves - * 1. We can read a 4-byte value from any

Format a command according to the Redis protocol. This function * takes a format similar to printf: * * %s represents a C null terminated string yo

Rewrite the specified configuration option with the new "line". * It progressively uses lines of the file that were already used for the same * conf

Ask the system to update the time the job will be called again as an * argument of awakeJob() in order to handle delayed tasks for this job. * If 'a

Return the UNIX time in microseconds */

Add a Disque Object as a bulk reply */

Helper function for addReplyCommand() to output flags. */

Build the message header */

Clear & Release the hash table */

Like the above function but automatically convert the result into * a long. On error (missing field) LONG_MIN is returned. */

Rewrite a string option. */

Rewrite a yes/no option. */

Enlarge the free space at the end of the sds string so that the caller * is sure that after calling this function can overwrite up to addlen * bytes

Turn the string into a smaller (or equal) string containing only the * substring specified by the 'start' and 'end' indexes. * * start and end can

Helper function to make the disconnect happen and clean up. */

Node lookup by name */

Queue the job and change its state accordingly. If the job is already * in QUEUED state, or the job has retry set to 0 and the JOB_FLAG_DELIVERED *

* This function generates and returns 64-bit pseudorandom number. * init_gen_rand or init_by_array must be called before this function. * The functi

Return a random time error between -(milliseconds/2) and +(milliseconds/2). * This is useful in order to desynchronize multiple nodes competing for t

Helper function. Trims query buffer to make the function that processes * multi bulk requests idempotent. */

If the skip list is empty, NULL is returned, otherwise the element * at tail is removed and its pointed object returned. */

Unblock a client calling the right function depending on the kind * of operation the client is blocking for. */

Adds an empty object to the reply list that will contain the multi bulk * length, which is not known when this function is called. */

Add a long long as a bulk reply */

* glibc provides a non-standard strerror_r() when _GNU_SOURCE is defined, so * provide a wrapper. */

Add a node to the nodes hash table */

Put stuff into the send buffer. * * It is guaranteed that this function will never have as a side effect * the link to be invalidated, so it is saf

Crete a new queue, register it in the queue hash tables. * On success the pointer to the new queue is returned. If a queue with the * same name alre

Remove a job from the queue. Returns C_OK if the job was there and * is now removed (updating the job state back to ACTIVE), otherwise * C_ERR is re

Return a random entry from the hash table. Useful to * implement randomized algorithms */

Get a decoded version of an encoded object (returned as a new object). * If the object is already raw-encoded just increment the ref count. */