Like serverLogRaw() but with printf-alike support. This is the function that * is used across the code. The raw version is only used in order to dump

Free an sds string. No operation is performed if 's' is NULL. */

Create a new sds string starting from a null terminated C string. */

Append to the sds string 's' a string obtained using printf-alike format * specifier. * * After the call, the modified sds string is no longer vali

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

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

Append the specified binary-safe string pointed by 't' of 'len' bytes to the * end of the specified sds string 's'. * * After the call, the passed

Free a reply object */

Add a C nul term string as bulk reply */

Return the UNIX time in milliseconds */

Free an sds string. No operation is performed if 's' is NULL. */

Add an element to the target hash table */

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

Remove the specified node from the specified list. * It's up to the caller to free the private value of the node. * * This function can't fail. */

Convert a long long into a string. Returns the number of * characters needed to represent the number. * If the buffer is not big enough to store the

Append the specified binary-safe string pointed by 't' of 'len' bytes to the * end of the specified sds string 's'. * * After the call, the passed

Free a job. Does not automatically unregister it. */

Add a new node to the list, to tail, containing the specified 'value' * pointer as value. * * On error, NULL is returned and no operation is perfor

Return the queue by name, or NULL if it does not exist. */

Create a new hash table */

Create a new list. The created list can be freed with * AlFreeList(), but private value of every node need to be freed * by the user before to call

Lookup a job by ID. */

* Wrapper around malloc_message() that avoids the need for * je_malloc_message(...) throughout the code. */

Calls the two low level functions refreshSingleLine() or * refreshMultiLine() according to the selected mode. */

Set error code. */

Convert a string into a long long. Returns 1 if the string could be parsed * into a (non-overflowing) long long, 0 otherwise. The value will be set t

/ Internal implementation. */

Return the next element of an iterator. * It's valid to remove the currently returned element using * listDelNode(), but not to remove other element

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

Add a C buffer as bulk reply */

Duplicate an sds string. */

Create an iterator in the list private iterator structure */

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

Create a new sds string starting from a null terminated C string. */

Remove job references from the system, without freeing the job itself. * If the job was already unregistered, C_ERR is returned, otherwise * C_OK is

Connect to the server. If force is not zero the connection is performed * even if there is already a connected socket. */

Get last error code. */

Free the whole list. * * This function can't fail. */

Rewrite a numerical (long long range) option. */

Free the result returned by sdssplitlen(), or do nothing if 'tokens' is NULL. */

Convert a string into a long. Returns 1 if the string could be parsed into a * (non-overflowing) long, 0 otherwise. The value will be set to the pars