Reverse memory bytes if arch is little endian. Given the conceptual * simplicity of the Lua build system we prefer check for endianess at runtime. *

Like memtest_fill_random() but uses the two specified values to fill * memory, in an alternated way (v1|v2|v1|v2|...) */

Called when there is a load error in the context of a module. On some * modules this cannot be recovered, but if the module declared capability * to

Return the UNIX time in milliseconds */

Set the object LRU/LFU depending on g_pserver->maxmemory_policy. * The lfu_freq arg is only relevant if policy is MAXMEMORY_FLAG_LFU. * The lru_idle

Try to parse a SCAN cursor stored at object 'o': * if the cursor is valid, store it as unsigned integer into *cursor and * returns C_OK. Otherwise r

Return the limit of percpu auto arena range, i.e. arenas[0...ind_limit). */

Return the limit of percpu auto arena range, i.e. arenas[0...ind_limit). */

This function is called by Redis in order to process a few events from * time to time while blocked into some not interruptible operation. * This al

This function is called every time, in the client structure 'c', there is * more query buffer to process, because we read more data from the socket

This function is used when we want to re-enter the event loop but there * is the risk that the client we are dealing with will be freed in some * wa

Unsubscribe from all the channels. Return the number of channels the * client was subscribed to. */

Unsubscribe from all the patterns. Return the number of patterns the * client was subscribed from. */

Implements LPUSH/RPUSH/LPUSHX/RPUSHX. * 'xx': push if key exists. */

Delete one element represented by 'entry' * * 'entry' stores enough metadata to delete the proper position in * the correct ziplist in the correct

Duplicate the quicklist. * On success a copy of the original quicklist is returned. * * The original quicklist both on success or error is never mo

Like raxIteratorNextStep() but implements an iteration step moving * to the lexicographically previous element. The 'noup' option has a similar * ef

Low level function that walks the tree looking for the string * 's' of 'len' bytes. The function returns the number of characters * of the key that

Allocate a new non compressed node with the specified number of children. * If datafiled is true, the allocation is made large enough to hold the *

Free the stack in case we used heap allocation. */

Produces a dump of the database in RDB format sending it to the specified * Redis I/O channel. On success C_OK is returned, otherwise C_ERR * is ret

Receive info data from child. */

Free the async context. When this function is called from a callback, * control needs to be returned to redisProcessCallbacks() before actual * free

Format a command according to the Redis protocol using an hisds string and * hi_sdscatfmt for the processing of arguments. This function takes the *

Returns repeater that broadcasts the TestEventListener events to all subscribers.

Completely replace the client command vector with the provided one. */

Free a cached master, called when there are no longer the conditions for * a partial resync on reconnection. */

Return the replica replication offset for this instance, that is * the offset for which we already processed the master replication stream. */

Empty the script cache. Should be called every time we are no longer sure * that every replica knows about all the scripts in our set, or when the *

Send a FULLRESYNC reply in the specific case of a full resynchronization, * as a side effect setup the replica for a full sync in different ways: *

Function to reverse bits. Algorithm from: * http://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel */

This is how rewriting of the append only file in background works: * * 1) The user calls BGREWRITEAOF * 2) Redis calls this function, that forks():

Reallocate the sds string so that it has no free space at the end. The * contained string remains not altered, but next concatenation operations * w