2012-11-08 12:25:23 -05:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* * Redistributions of source code must retain the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer.
|
|
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* * Neither the name of Redis nor the names of its contributors may be used
|
|
|
|
* to endorse or promote products derived from this software without
|
|
|
|
* specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
#ifndef __REDIS_H
|
|
|
|
#define __REDIS_H
|
|
|
|
|
|
|
|
#include "fmacros.h"
|
|
|
|
#include "config.h"
|
|
|
|
|
|
|
|
#if defined(__sun)
|
|
|
|
#include "solarisfixes.h"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <time.h>
|
|
|
|
#include <limits.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <errno.h>
|
2010-07-01 15:13:38 -04:00
|
|
|
#include <inttypes.h>
|
2010-07-05 14:14:48 -04:00
|
|
|
#include <pthread.h>
|
2010-12-09 11:10:21 -05:00
|
|
|
#include <syslog.h>
|
2011-03-29 11:51:15 -04:00
|
|
|
#include <netinet/in.h>
|
2011-04-30 11:46:52 -04:00
|
|
|
#include <lua.h>
|
2012-01-20 06:54:15 -05:00
|
|
|
#include <signal.h>
|
2010-06-21 18:07:48 -04:00
|
|
|
|
2011-06-30 07:27:32 -04:00
|
|
|
#include "ae.h" /* Event driven programming library */
|
|
|
|
#include "sds.h" /* Dynamic safe strings */
|
|
|
|
#include "dict.h" /* Hash tables */
|
|
|
|
#include "adlist.h" /* Linked lists */
|
2010-06-21 18:07:48 -04:00
|
|
|
#include "zmalloc.h" /* total memory usage aware version of malloc/free */
|
2011-06-30 07:27:32 -04:00
|
|
|
#include "anet.h" /* Networking the easy way */
|
2010-06-21 18:07:48 -04:00
|
|
|
#include "ziplist.h" /* Compact list data structure */
|
2011-06-30 07:27:32 -04:00
|
|
|
#include "intset.h" /* Compact integer set structure */
|
|
|
|
#include "version.h" /* Version macro */
|
|
|
|
#include "util.h" /* Misc functions useful in many places */
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* Error codes */
|
|
|
|
#define REDIS_OK 0
|
|
|
|
#define REDIS_ERR -1
|
|
|
|
|
|
|
|
/* Static server configuration */
|
2012-12-14 11:10:40 -05:00
|
|
|
#define REDIS_DEFAULT_HZ 10 /* Time interrupt calls/sec. */
|
|
|
|
#define REDIS_MIN_HZ 1
|
|
|
|
#define REDIS_MAX_HZ 500
|
2010-06-21 18:07:48 -04:00
|
|
|
#define REDIS_SERVERPORT 6379 /* TCP port */
|
2011-11-11 11:16:03 -05:00
|
|
|
#define REDIS_MAXIDLETIME 0 /* default client timeout: infinite */
|
2010-06-21 18:07:48 -04:00
|
|
|
#define REDIS_DEFAULT_DBNUM 16
|
|
|
|
#define REDIS_CONFIGLINE_MAX 1024
|
|
|
|
#define REDIS_EXPIRELOOKUPS_PER_CRON 10 /* lookup 10 expires per loop */
|
2012-05-13 10:40:29 -04:00
|
|
|
#define REDIS_EXPIRELOOKUPS_TIME_PERC 25 /* CPU max % for keys collection */
|
2010-06-21 18:07:48 -04:00
|
|
|
#define REDIS_MAX_WRITE_PER_EVENT (1024*64)
|
2012-03-29 13:06:53 -04:00
|
|
|
#define REDIS_SHARED_SELECT_CMDS 10
|
2010-06-21 18:07:48 -04:00
|
|
|
#define REDIS_SHARED_INTEGERS 10000
|
2012-02-04 02:58:37 -05:00
|
|
|
#define REDIS_SHARED_BULKHDR_LEN 32
|
2010-12-09 11:10:21 -05:00
|
|
|
#define REDIS_MAX_LOGMSG_LEN 1024 /* Default maximum length of syslog messages */
|
2011-12-21 05:58:42 -05:00
|
|
|
#define REDIS_AOF_REWRITE_PERC 100
|
|
|
|
#define REDIS_AOF_REWRITE_MIN_SIZE (1024*1024)
|
|
|
|
#define REDIS_AOF_REWRITE_ITEMS_PER_CMD 64
|
2011-06-30 07:27:32 -04:00
|
|
|
#define REDIS_SLOWLOG_LOG_SLOWER_THAN 10000
|
2012-04-21 13:20:03 -04:00
|
|
|
#define REDIS_SLOWLOG_MAX_LEN 128
|
2011-10-31 05:48:41 -04:00
|
|
|
#define REDIS_MAX_CLIENTS 10000
|
2012-06-21 05:50:01 -04:00
|
|
|
#define REDIS_AUTHPASS_MAX_LEN 512
|
2012-08-28 11:20:26 -04:00
|
|
|
#define REDIS_DEFAULT_SLAVE_PRIORITY 100
|
2011-10-31 06:13:28 -04:00
|
|
|
#define REDIS_REPL_TIMEOUT 60
|
|
|
|
#define REDIS_REPL_PING_SLAVE_PERIOD 10
|
2012-03-08 04:08:44 -05:00
|
|
|
#define REDIS_RUN_ID_SIZE 40
|
2012-03-08 10:15:37 -05:00
|
|
|
#define REDIS_OPS_SEC_SAMPLES 16
|
2013-01-30 12:33:16 -05:00
|
|
|
#define REDIS_DEFAULT_REPL_BACKLOG_SIZE (1024*1024) /* 1mb */
|
|
|
|
#define REDIS_DEFAULT_REPL_BACKLOG_TIME_LIMIT (60*60) /* 1 hour */
|
|
|
|
#define REDIS_REPL_BACKLOG_MIN_SIZE (1024*16) /* 16k */
|
2012-03-08 04:08:44 -05:00
|
|
|
|
2011-12-31 09:37:33 -05:00
|
|
|
/* Protocol and I/O related defines */
|
|
|
|
#define REDIS_MAX_QUERYBUF_LEN (1024*1024*1024) /* 1GB max query buffer. */
|
|
|
|
#define REDIS_IOBUF_LEN (1024*16) /* Generic I/O buffer size */
|
|
|
|
#define REDIS_REPLY_CHUNK_BYTES (16*1024) /* 16k output buffer */
|
2011-12-31 10:09:46 -05:00
|
|
|
#define REDIS_INLINE_MAX_SIZE (1024*64) /* Max size of inline reads */
|
2011-12-31 09:37:33 -05:00
|
|
|
#define REDIS_MBULK_BIG_ARG (1024*32)
|
2013-01-30 12:33:16 -05:00
|
|
|
#define REDIS_LONGSTR_SIZE 21 /* Bytes needed for long -> str */
|
2011-10-31 06:13:28 -04:00
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
/* Hash table parameters */
|
|
|
|
#define REDIS_HT_MINFILL 10 /* Minimal hash table fill 10% */
|
|
|
|
|
2011-09-26 09:40:39 -04:00
|
|
|
/* Command flags. Please check the command table defined in the redis.c file
|
|
|
|
* for more information about the meaning of every flag. */
|
|
|
|
#define REDIS_CMD_WRITE 1 /* "w" flag */
|
|
|
|
#define REDIS_CMD_READONLY 2 /* "r" flag */
|
|
|
|
#define REDIS_CMD_DENYOOM 4 /* "m" flag */
|
|
|
|
#define REDIS_CMD_FORCE_REPLICATION 8 /* "f" flag */
|
|
|
|
#define REDIS_CMD_ADMIN 16 /* "a" flag */
|
|
|
|
#define REDIS_CMD_PUBSUB 32 /* "p" flag */
|
2011-09-27 07:45:46 -04:00
|
|
|
#define REDIS_CMD_NOSCRIPT 64 /* "s" flag */
|
|
|
|
#define REDIS_CMD_RANDOM 128 /* "R" flag */
|
2012-01-31 10:09:21 -05:00
|
|
|
#define REDIS_CMD_SORT_FOR_SCRIPT 256 /* "S" flag */
|
2012-07-22 11:13:49 -04:00
|
|
|
#define REDIS_CMD_LOADING 512 /* "l" flag */
|
|
|
|
#define REDIS_CMD_STALE 1024 /* "t" flag */
|
2012-10-16 11:35:50 -04:00
|
|
|
#define REDIS_CMD_SKIP_MONITOR 2048 /* "M" flag */
|
2013-02-20 11:28:35 -05:00
|
|
|
#define REDIS_CMD_ASKING 4096 /* "k" flag */
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* Object types */
|
|
|
|
#define REDIS_STRING 0
|
|
|
|
#define REDIS_LIST 1
|
|
|
|
#define REDIS_SET 2
|
|
|
|
#define REDIS_ZSET 3
|
|
|
|
#define REDIS_HASH 4
|
2011-03-09 07:16:38 -05:00
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
/* Objects encoding. Some kind of objects like Strings and Hashes can be
|
|
|
|
* internally represented in multiple ways. The 'encoding' field of the object
|
|
|
|
* is set to one of this fields for this object. */
|
|
|
|
#define REDIS_ENCODING_RAW 0 /* Raw representation */
|
|
|
|
#define REDIS_ENCODING_INT 1 /* Encoded as integer */
|
|
|
|
#define REDIS_ENCODING_HT 2 /* Encoded as hash table */
|
|
|
|
#define REDIS_ENCODING_ZIPMAP 3 /* Encoded as zipmap */
|
|
|
|
#define REDIS_ENCODING_LINKEDLIST 4 /* Encoded as regular linked list */
|
|
|
|
#define REDIS_ENCODING_ZIPLIST 5 /* Encoded as ziplist */
|
2010-07-02 13:57:12 -04:00
|
|
|
#define REDIS_ENCODING_INTSET 6 /* Encoded as intset */
|
2011-04-06 09:36:10 -04:00
|
|
|
#define REDIS_ENCODING_SKIPLIST 7 /* Encoded as skiplist */
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* Defines related to the dump file format. To store 32 bits lengths for short
|
|
|
|
* keys requires a lot of space, so we check the most significant 2 bits of
|
|
|
|
* the first byte to interpreter the length:
|
|
|
|
*
|
|
|
|
* 00|000000 => if the two MSB are 00 the len is the 6 bits of this byte
|
|
|
|
* 01|000000 00000000 => 01, the len is 14 byes, 6 bits + 8 bits of next byte
|
2013-01-16 12:00:20 -05:00
|
|
|
* 10|000000 [32 bit integer] => if it's 10, a full 32 bit len will follow
|
2010-06-21 18:07:48 -04:00
|
|
|
* 11|000000 this means: specially encoded object will follow. The six bits
|
|
|
|
* number specify the kind of object that follows.
|
|
|
|
* See the REDIS_RDB_ENC_* defines.
|
|
|
|
*
|
2013-01-16 12:00:20 -05:00
|
|
|
* Lengths up to 63 are stored using a single byte, most DB keys, and may
|
2010-06-21 18:07:48 -04:00
|
|
|
* values, will fit inside. */
|
|
|
|
#define REDIS_RDB_6BITLEN 0
|
|
|
|
#define REDIS_RDB_14BITLEN 1
|
|
|
|
#define REDIS_RDB_32BITLEN 2
|
|
|
|
#define REDIS_RDB_ENCVAL 3
|
|
|
|
#define REDIS_RDB_LENERR UINT_MAX
|
|
|
|
|
|
|
|
/* When a length of a string object stored on disk has the first two bits
|
|
|
|
* set, the remaining two bits specify a special encoding for the object
|
|
|
|
* accordingly to the following defines: */
|
|
|
|
#define REDIS_RDB_ENC_INT8 0 /* 8 bit signed integer */
|
|
|
|
#define REDIS_RDB_ENC_INT16 1 /* 16 bit signed integer */
|
|
|
|
#define REDIS_RDB_ENC_INT32 2 /* 32 bit signed integer */
|
|
|
|
#define REDIS_RDB_ENC_LZF 3 /* string compressed with FASTLZ */
|
|
|
|
|
2011-12-21 04:05:32 -05:00
|
|
|
/* AOF states */
|
|
|
|
#define REDIS_AOF_OFF 0 /* AOF is off */
|
|
|
|
#define REDIS_AOF_ON 1 /* AOF is on */
|
|
|
|
#define REDIS_AOF_WAIT_REWRITE 2 /* AOF waits rewrite to start appending */
|
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
/* Client flags */
|
2012-11-15 14:11:05 -05:00
|
|
|
#define REDIS_SLAVE (1<<0) /* This client is a slave server */
|
|
|
|
#define REDIS_MASTER (1<<1) /* This client is a master server */
|
|
|
|
#define REDIS_MONITOR (1<<2) /* This client is a slave monitor, see MONITOR */
|
|
|
|
#define REDIS_MULTI (1<<3) /* This client is in a MULTI context */
|
|
|
|
#define REDIS_BLOCKED (1<<4) /* The client is waiting in a blocking operation */
|
|
|
|
#define REDIS_DIRTY_CAS (1<<5) /* Watched keys modified. EXEC will fail. */
|
|
|
|
#define REDIS_CLOSE_AFTER_REPLY (1<<6) /* Close after writing entire reply. */
|
|
|
|
#define REDIS_UNBLOCKED (1<<7) /* This client was unblocked and is stored in
|
|
|
|
server.unblocked_clients */
|
|
|
|
#define REDIS_LUA_CLIENT (1<<8) /* This is a non connected client used by Lua */
|
|
|
|
#define REDIS_ASKING (1<<9) /* Client issued the ASKING command */
|
|
|
|
#define REDIS_CLOSE_ASAP (1<<10)/* Close this client ASAP */
|
|
|
|
#define REDIS_UNIX_SOCKET (1<<11) /* Client connected via Unix domain socket */
|
|
|
|
#define REDIS_DIRTY_EXEC (1<<12) /* EXEC will fail for errors while queueing */
|
2010-10-15 09:40:25 -04:00
|
|
|
|
|
|
|
/* Client request types */
|
|
|
|
#define REDIS_REQ_INLINE 1
|
|
|
|
#define REDIS_REQ_MULTIBULK 2
|
2010-06-21 18:07:48 -04:00
|
|
|
|
2012-01-17 06:43:01 -05:00
|
|
|
/* Client classes for client limits, currently used only for
|
|
|
|
* the max-client-output-buffer limit implementation. */
|
|
|
|
#define REDIS_CLIENT_LIMIT_CLASS_NORMAL 0
|
|
|
|
#define REDIS_CLIENT_LIMIT_CLASS_SLAVE 1
|
|
|
|
#define REDIS_CLIENT_LIMIT_CLASS_PUBSUB 2
|
2012-01-23 10:12:37 -05:00
|
|
|
#define REDIS_CLIENT_LIMIT_NUM_CLASSES 3
|
2012-01-17 06:43:01 -05:00
|
|
|
|
2012-11-03 06:56:28 -04:00
|
|
|
/* Slave replication state - from the point of view of the slave. */
|
2011-05-19 12:53:06 -04:00
|
|
|
#define REDIS_REPL_NONE 0 /* No active replication */
|
|
|
|
#define REDIS_REPL_CONNECT 1 /* Must connect to master */
|
2011-05-22 06:41:24 -04:00
|
|
|
#define REDIS_REPL_CONNECTING 2 /* Connecting to master */
|
2012-08-31 09:32:57 -04:00
|
|
|
#define REDIS_REPL_RECEIVE_PONG 3 /* Wait for PING reply */
|
|
|
|
#define REDIS_REPL_TRANSFER 4 /* Receiving .rdb from master */
|
|
|
|
#define REDIS_REPL_CONNECTED 5 /* Connected to master */
|
2010-06-21 18:07:48 -04:00
|
|
|
|
2012-11-03 06:56:28 -04:00
|
|
|
/* Slave replication state - from the point of view of the master.
|
|
|
|
* In SEND_BULK and ONLINE state the slave receives new updates
|
2010-06-21 18:07:48 -04:00
|
|
|
* in its output queue. In the WAIT_BGSAVE state instead the server is waiting
|
|
|
|
* to start the next background saving in order to send updates to it. */
|
2012-11-03 06:56:28 -04:00
|
|
|
#define REDIS_REPL_WAIT_BGSAVE_START 6 /* We need to produce a new RDB file. */
|
|
|
|
#define REDIS_REPL_WAIT_BGSAVE_END 7 /* Waiting RDB file creation to finish. */
|
|
|
|
#define REDIS_REPL_SEND_BULK 8 /* Sending RDB file to slave. */
|
|
|
|
#define REDIS_REPL_ONLINE 9 /* RDB file transmitted, sending just updates. */
|
|
|
|
|
|
|
|
/* Synchronous read timeout - slave side */
|
|
|
|
#define REDIS_REPL_SYNCIO_TIMEOUT 5
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* List related stuff */
|
|
|
|
#define REDIS_HEAD 0
|
|
|
|
#define REDIS_TAIL 1
|
|
|
|
|
|
|
|
/* Sort operations */
|
|
|
|
#define REDIS_SORT_GET 0
|
|
|
|
#define REDIS_SORT_ASC 1
|
|
|
|
#define REDIS_SORT_DESC 2
|
|
|
|
#define REDIS_SORTKEY_MAX 1024
|
|
|
|
|
|
|
|
/* Log levels */
|
|
|
|
#define REDIS_DEBUG 0
|
|
|
|
#define REDIS_VERBOSE 1
|
|
|
|
#define REDIS_NOTICE 2
|
|
|
|
#define REDIS_WARNING 3
|
2011-04-13 04:58:21 -04:00
|
|
|
#define REDIS_LOG_RAW (1<<10) /* Modifier to log without timestamp */
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* Anti-warning macro... */
|
|
|
|
#define REDIS_NOTUSED(V) ((void) V)
|
|
|
|
|
|
|
|
#define ZSKIPLIST_MAXLEVEL 32 /* Should be enough for 2^32 elements */
|
|
|
|
#define ZSKIPLIST_P 0.25 /* Skiplist P = 1/4 */
|
|
|
|
|
|
|
|
/* Append only defines */
|
2011-12-21 05:58:42 -05:00
|
|
|
#define AOF_FSYNC_NO 0
|
|
|
|
#define AOF_FSYNC_ALWAYS 1
|
|
|
|
#define AOF_FSYNC_EVERYSEC 2
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* Zip structure related defaults */
|
2012-01-03 01:14:10 -05:00
|
|
|
#define REDIS_HASH_MAX_ZIPLIST_ENTRIES 512
|
|
|
|
#define REDIS_HASH_MAX_ZIPLIST_VALUE 64
|
2010-12-14 12:23:52 -05:00
|
|
|
#define REDIS_LIST_MAX_ZIPLIST_ENTRIES 512
|
|
|
|
#define REDIS_LIST_MAX_ZIPLIST_VALUE 64
|
|
|
|
#define REDIS_SET_MAX_INTSET_ENTRIES 512
|
2011-03-09 08:01:57 -05:00
|
|
|
#define REDIS_ZSET_MAX_ZIPLIST_ENTRIES 128
|
|
|
|
#define REDIS_ZSET_MAX_ZIPLIST_VALUE 64
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* Sets operations codes */
|
|
|
|
#define REDIS_OP_UNION 0
|
|
|
|
#define REDIS_OP_DIFF 1
|
|
|
|
#define REDIS_OP_INTER 2
|
|
|
|
|
2010-10-14 15:22:21 -04:00
|
|
|
/* Redis maxmemory strategies */
|
|
|
|
#define REDIS_MAXMEMORY_VOLATILE_LRU 0
|
|
|
|
#define REDIS_MAXMEMORY_VOLATILE_TTL 1
|
|
|
|
#define REDIS_MAXMEMORY_VOLATILE_RANDOM 2
|
|
|
|
#define REDIS_MAXMEMORY_ALLKEYS_LRU 3
|
|
|
|
#define REDIS_MAXMEMORY_ALLKEYS_RANDOM 4
|
2010-11-08 10:12:16 -05:00
|
|
|
#define REDIS_MAXMEMORY_NO_EVICTION 5
|
2010-10-14 15:22:21 -04:00
|
|
|
|
2011-05-06 11:21:27 -04:00
|
|
|
/* Scripting */
|
2011-10-25 06:10:15 -04:00
|
|
|
#define REDIS_LUA_TIME_LIMIT 5000 /* milliseconds */
|
2011-05-06 11:21:27 -04:00
|
|
|
|
2011-11-10 11:52:02 -05:00
|
|
|
/* Units */
|
|
|
|
#define UNIT_SECONDS 0
|
|
|
|
#define UNIT_MILLISECONDS 1
|
|
|
|
|
2011-11-18 08:10:48 -05:00
|
|
|
/* SHUTDOWN flags */
|
|
|
|
#define REDIS_SHUTDOWN_SAVE 1 /* Force SAVE on SHUTDOWN even if no save
|
|
|
|
points are configured. */
|
|
|
|
#define REDIS_SHUTDOWN_NOSAVE 2 /* Don't SAVE on SHUTDOWN. */
|
|
|
|
|
2012-02-02 10:30:52 -05:00
|
|
|
/* Command call flags, see call() function */
|
|
|
|
#define REDIS_CALL_NONE 0
|
|
|
|
#define REDIS_CALL_SLOWLOG 1
|
|
|
|
#define REDIS_CALL_STATS 2
|
|
|
|
#define REDIS_CALL_PROPAGATE 4
|
|
|
|
#define REDIS_CALL_FULL (REDIS_CALL_SLOWLOG | REDIS_CALL_STATS | REDIS_CALL_PROPAGATE)
|
|
|
|
|
2012-02-28 10:17:00 -05:00
|
|
|
/* Command propagation flags, see propagate() function */
|
|
|
|
#define REDIS_PROPAGATE_NONE 0
|
|
|
|
#define REDIS_PROPAGATE_AOF 1
|
|
|
|
#define REDIS_PROPAGATE_REPL 2
|
|
|
|
|
2013-01-25 07:19:08 -05:00
|
|
|
/* Keyspace changes notification classes. Every class is associated with a
|
|
|
|
* character for configuration purposes. */
|
|
|
|
#define REDIS_NOTIFY_KEYSPACE (1<<0) /* K */
|
|
|
|
#define REDIS_NOTIFY_KEYEVENT (1<<1) /* E */
|
|
|
|
#define REDIS_NOTIFY_GENERIC (1<<2) /* g */
|
|
|
|
#define REDIS_NOTIFY_STRING (1<<3) /* $ */
|
|
|
|
#define REDIS_NOTIFY_LIST (1<<4) /* l */
|
|
|
|
#define REDIS_NOTIFY_SET (1<<5) /* s */
|
|
|
|
#define REDIS_NOTIFY_HASH (1<<6) /* h */
|
|
|
|
#define REDIS_NOTIFY_ZSET (1<<7) /* z */
|
|
|
|
#define REDIS_NOTIFY_EXPIRED (1<<8) /* x */
|
|
|
|
#define REDIS_NOTIFY_EVICTED (1<<9) /* e */
|
|
|
|
#define REDIS_NOTIFY_ALL (REDIS_NOTIFY_GENERIC | REDIS_NOTIFY_STRING | REDIS_NOTIFY_LIST | REDIS_NOTIFY_SET | REDIS_NOTIFY_HASH | REDIS_NOTIFY_ZSET | REDIS_NOTIFY_EXPIRED | REDIS_NOTIFY_EVICTED) /* A */
|
|
|
|
|
2012-07-23 06:54:52 -04:00
|
|
|
/* Using the following macro you can run code inside serverCron() with the
|
|
|
|
* specified period, specified in milliseconds.
|
2012-12-14 11:10:40 -05:00
|
|
|
* The actual resolution depends on server.hz. */
|
|
|
|
#define run_with_period(_ms_) if ((_ms_ <= 1000/server.hz) || !(server.cronloops%((_ms_)/(1000/server.hz))))
|
2012-07-23 06:54:52 -04:00
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
/* We can print the stacktrace, so our assert is defined this way: */
|
2011-10-04 12:05:26 -04:00
|
|
|
#define redisAssertWithInfo(_c,_o,_e) ((_e)?(void)0 : (_redisAssertWithInfo(_c,_o,#_e,__FILE__,__LINE__),_exit(1)))
|
2010-06-21 18:07:48 -04:00
|
|
|
#define redisAssert(_e) ((_e)?(void)0 : (_redisAssert(#_e,__FILE__,__LINE__),_exit(1)))
|
|
|
|
#define redisPanic(_e) _redisPanic(#_e,__FILE__,__LINE__),_exit(1)
|
|
|
|
|
|
|
|
/*-----------------------------------------------------------------------------
|
|
|
|
* Data types
|
|
|
|
*----------------------------------------------------------------------------*/
|
|
|
|
|
|
|
|
/* A redis object, that is a type able to hold a string / list / set */
|
|
|
|
|
|
|
|
/* The actual Redis Object */
|
2010-10-14 07:52:58 -04:00
|
|
|
#define REDIS_LRU_CLOCK_MAX ((1<<21)-1) /* Max value of obj->lru */
|
2010-10-14 15:22:21 -04:00
|
|
|
#define REDIS_LRU_CLOCK_RESOLUTION 10 /* LRU clock resolution in seconds */
|
2010-06-21 18:07:48 -04:00
|
|
|
typedef struct redisObject {
|
|
|
|
unsigned type:4;
|
2011-01-01 15:35:56 -05:00
|
|
|
unsigned notused:2; /* Not used */
|
2010-06-21 18:07:48 -04:00
|
|
|
unsigned encoding:4;
|
|
|
|
unsigned lru:22; /* lru time (relative to server.lruclock) */
|
|
|
|
int refcount;
|
|
|
|
void *ptr;
|
|
|
|
} robj;
|
|
|
|
|
2013-01-16 12:00:20 -05:00
|
|
|
/* Macro used to initialize a Redis object allocated on the stack.
|
2010-06-21 18:07:48 -04:00
|
|
|
* Note that this macro is taken near the structure definition to make sure
|
|
|
|
* we'll update it when the structure is changed, to avoid bugs like
|
|
|
|
* bug #85 introduced exactly in this way. */
|
|
|
|
#define initStaticStringObject(_var,_ptr) do { \
|
|
|
|
_var.refcount = 1; \
|
|
|
|
_var.type = REDIS_STRING; \
|
|
|
|
_var.encoding = REDIS_ENCODING_RAW; \
|
|
|
|
_var.ptr = _ptr; \
|
|
|
|
} while(0);
|
|
|
|
|
|
|
|
typedef struct redisDb {
|
|
|
|
dict *dict; /* The keyspace for this DB */
|
|
|
|
dict *expires; /* Timeout of keys with a timeout set */
|
|
|
|
dict *blocking_keys; /* Keys with clients waiting for data (BLPOP) */
|
A reimplementation of blocking operation internals.
Redis provides support for blocking operations such as BLPOP or BRPOP.
This operations are identical to normal LPOP and RPOP operations as long
as there are elements in the target list, but if the list is empty they
block waiting for new data to arrive to the list.
All the clients blocked waiting for th same list are served in a FIFO
way, so the first that blocked is the first to be served when there is
more data pushed by another client into the list.
The previous implementation of blocking operations was conceived to
serve clients in the context of push operations. For for instance:
1) There is a client "A" blocked on list "foo".
2) The client "B" performs `LPUSH foo somevalue`.
3) The client "A" is served in the context of the "B" LPUSH,
synchronously.
Processing things in a synchronous way was useful as if "A" pushes a
value that is served by "B", from the point of view of the database is a
NOP (no operation) thing, that is, nothing is replicated, nothing is
written in the AOF file, and so forth.
However later we implemented two things:
1) Variadic LPUSH that could add multiple values to a list in the
context of a single call.
2) BRPOPLPUSH that was a version of BRPOP that also provided a "PUSH"
side effect when receiving data.
This forced us to make the synchronous implementation more complex. If
client "B" is waiting for data, and "A" pushes three elemnents in a
single call, we needed to propagate an LPUSH with a missing argument
in the AOF and replication link. We also needed to make sure to
replicate the LPUSH side of BRPOPLPUSH, but only if in turn did not
happened to serve another blocking client into another list ;)
This were complex but with a few of mutually recursive functions
everything worked as expected... until one day we introduced scripting
in Redis.
Scripting + synchronous blocking operations = Issue #614.
Basically you can't "rewrite" a script to have just a partial effect on
the replicas and AOF file if the script happened to serve a few blocked
clients.
The solution to all this problems, implemented by this commit, is to
change the way we serve blocked clients. Instead of serving the blocked
clients synchronously, in the context of the command performing the PUSH
operation, it is now an asynchronous and iterative process:
1) If a key that has clients blocked waiting for data is the subject of
a list push operation, We simply mark keys as "ready" and put it into a
queue.
2) Every command pushing stuff on lists, as a variadic LPUSH, a script,
or whatever it is, is replicated verbatim without any rewriting.
3) Every time a Redis command, a MULTI/EXEC block, or a script,
completed its execution, we run the list of keys ready to serve blocked
clients (as more data arrived), and process this list serving the
blocked clients.
4) As a result of "3" maybe more keys are ready again for other clients
(as a result of BRPOPLPUSH we may have push operations), so we iterate
back to step "3" if it's needed.
The new code has a much simpler semantics, and a simpler to understand
implementation, with the disadvantage of not being able to "optmize out"
a PUSH+BPOP as a No OP.
This commit will be tested with care before the final merge, more tests
will be added likely.
2012-09-04 04:37:49 -04:00
|
|
|
dict *ready_keys; /* Blocked keys that received a PUSH */
|
2010-06-21 18:07:48 -04:00
|
|
|
dict *watched_keys; /* WATCHED keys for MULTI/EXEC CAS */
|
|
|
|
int id;
|
|
|
|
} redisDb;
|
|
|
|
|
|
|
|
/* Client MULTI/EXEC state */
|
|
|
|
typedef struct multiCmd {
|
|
|
|
robj **argv;
|
|
|
|
int argc;
|
|
|
|
struct redisCommand *cmd;
|
|
|
|
} multiCmd;
|
|
|
|
|
|
|
|
typedef struct multiState {
|
|
|
|
multiCmd *commands; /* Array of MULTI commands */
|
|
|
|
int count; /* Total number of MULTI commands */
|
|
|
|
} multiState;
|
|
|
|
|
2010-11-08 17:38:01 -05:00
|
|
|
typedef struct blockingState {
|
2012-12-02 14:36:18 -05:00
|
|
|
dict *keys; /* The keys we are waiting to terminate a blocking
|
2010-11-08 17:38:01 -05:00
|
|
|
* operation such as BLPOP. Otherwise NULL. */
|
|
|
|
time_t timeout; /* Blocking operation timeout. If UNIX current time
|
|
|
|
* is >= timeout then the operation timed out. */
|
|
|
|
robj *target; /* The key that should receive the element,
|
|
|
|
* for BRPOPLPUSH. */
|
|
|
|
} blockingState;
|
|
|
|
|
A reimplementation of blocking operation internals.
Redis provides support for blocking operations such as BLPOP or BRPOP.
This operations are identical to normal LPOP and RPOP operations as long
as there are elements in the target list, but if the list is empty they
block waiting for new data to arrive to the list.
All the clients blocked waiting for th same list are served in a FIFO
way, so the first that blocked is the first to be served when there is
more data pushed by another client into the list.
The previous implementation of blocking operations was conceived to
serve clients in the context of push operations. For for instance:
1) There is a client "A" blocked on list "foo".
2) The client "B" performs `LPUSH foo somevalue`.
3) The client "A" is served in the context of the "B" LPUSH,
synchronously.
Processing things in a synchronous way was useful as if "A" pushes a
value that is served by "B", from the point of view of the database is a
NOP (no operation) thing, that is, nothing is replicated, nothing is
written in the AOF file, and so forth.
However later we implemented two things:
1) Variadic LPUSH that could add multiple values to a list in the
context of a single call.
2) BRPOPLPUSH that was a version of BRPOP that also provided a "PUSH"
side effect when receiving data.
This forced us to make the synchronous implementation more complex. If
client "B" is waiting for data, and "A" pushes three elemnents in a
single call, we needed to propagate an LPUSH with a missing argument
in the AOF and replication link. We also needed to make sure to
replicate the LPUSH side of BRPOPLPUSH, but only if in turn did not
happened to serve another blocking client into another list ;)
This were complex but with a few of mutually recursive functions
everything worked as expected... until one day we introduced scripting
in Redis.
Scripting + synchronous blocking operations = Issue #614.
Basically you can't "rewrite" a script to have just a partial effect on
the replicas and AOF file if the script happened to serve a few blocked
clients.
The solution to all this problems, implemented by this commit, is to
change the way we serve blocked clients. Instead of serving the blocked
clients synchronously, in the context of the command performing the PUSH
operation, it is now an asynchronous and iterative process:
1) If a key that has clients blocked waiting for data is the subject of
a list push operation, We simply mark keys as "ready" and put it into a
queue.
2) Every command pushing stuff on lists, as a variadic LPUSH, a script,
or whatever it is, is replicated verbatim without any rewriting.
3) Every time a Redis command, a MULTI/EXEC block, or a script,
completed its execution, we run the list of keys ready to serve blocked
clients (as more data arrived), and process this list serving the
blocked clients.
4) As a result of "3" maybe more keys are ready again for other clients
(as a result of BRPOPLPUSH we may have push operations), so we iterate
back to step "3" if it's needed.
The new code has a much simpler semantics, and a simpler to understand
implementation, with the disadvantage of not being able to "optmize out"
a PUSH+BPOP as a No OP.
This commit will be tested with care before the final merge, more tests
will be added likely.
2012-09-04 04:37:49 -04:00
|
|
|
/* The following structure represents a node in the server.ready_keys list,
|
|
|
|
* where we accumulate all the keys that had clients blocked with a blocking
|
|
|
|
* operation such as B[LR]POP, but received new data in the context of the
|
|
|
|
* last executed command.
|
|
|
|
*
|
|
|
|
* After the execution of every command or script, we run this list to check
|
|
|
|
* if as a result we should serve data to clients blocked, unblocking them.
|
|
|
|
* Note that server.ready_keys will not have duplicates as there dictionary
|
|
|
|
* also called ready_keys in every structure representing a Redis database,
|
|
|
|
* where we make sure to remember if a given key was already added in the
|
|
|
|
* server.ready_keys list. */
|
|
|
|
typedef struct readyList {
|
|
|
|
redisDb *db;
|
|
|
|
robj *key;
|
|
|
|
} readyList;
|
|
|
|
|
2013-01-16 12:00:20 -05:00
|
|
|
/* With multiplexing we need to take per-client state.
|
2010-06-21 18:07:48 -04:00
|
|
|
* Clients are taken in a liked list. */
|
|
|
|
typedef struct redisClient {
|
|
|
|
int fd;
|
|
|
|
redisDb *db;
|
|
|
|
int dictid;
|
2013-01-11 12:43:28 -05:00
|
|
|
robj *name; /* As set by CLIENT SETNAME */
|
2010-06-21 18:07:48 -04:00
|
|
|
sds querybuf;
|
2012-03-14 10:32:30 -04:00
|
|
|
size_t querybuf_peak; /* Recent (100ms or more) peak of querybuf size */
|
2010-10-15 09:40:25 -04:00
|
|
|
int argc;
|
|
|
|
robj **argv;
|
2011-11-24 08:56:34 -05:00
|
|
|
struct redisCommand *cmd, *lastcmd;
|
2010-10-15 09:40:25 -04:00
|
|
|
int reqtype;
|
|
|
|
int multibulklen; /* number of multi bulk arguments left to read */
|
|
|
|
long bulklen; /* length of bulk argument in multi bulk request */
|
2010-06-21 18:07:48 -04:00
|
|
|
list *reply;
|
2011-12-25 10:32:54 -05:00
|
|
|
unsigned long reply_bytes; /* Tot bytes of objects in reply list */
|
2013-01-30 12:33:16 -05:00
|
|
|
int sentlen; /* Amount of bytes already sent in the current
|
|
|
|
buffer or object being sent. */
|
2012-03-13 08:05:08 -04:00
|
|
|
time_t ctime; /* Client creation time */
|
2010-06-21 18:07:48 -04:00
|
|
|
time_t lastinteraction; /* time of the last interaction, used for timeout */
|
2012-01-23 10:12:37 -05:00
|
|
|
time_t obuf_soft_limit_reached_time;
|
2010-06-21 18:07:48 -04:00
|
|
|
int flags; /* REDIS_SLAVE | REDIS_MONITOR | REDIS_MULTI ... */
|
|
|
|
int authenticated; /* when requirepass is non-NULL */
|
|
|
|
int replstate; /* replication state if this is a slave */
|
|
|
|
int repldbfd; /* replication DB file descriptor */
|
|
|
|
long repldboff; /* replication DB file offset */
|
|
|
|
off_t repldbsize; /* replication DB file size */
|
2013-01-30 12:33:16 -05:00
|
|
|
long long reploff; /* replication offset if this is our master */
|
|
|
|
char replrunid[REDIS_RUN_ID_SIZE+1]; /* master run id if this is a master */
|
2012-06-26 03:47:47 -04:00
|
|
|
int slave_listening_port; /* As configured with: SLAVECONF listening-port */
|
2010-06-21 18:07:48 -04:00
|
|
|
multiState mstate; /* MULTI/EXEC state */
|
2010-11-09 13:06:25 -05:00
|
|
|
blockingState bpop; /* blocking state */
|
2010-06-21 18:07:48 -04:00
|
|
|
list *io_keys; /* Keys this client is waiting to be loaded from the
|
|
|
|
* swap file in order to continue. */
|
|
|
|
list *watched_keys; /* Keys WATCHED for MULTI/EXEC CAS */
|
|
|
|
dict *pubsub_channels; /* channels a client is interested in (SUBSCRIBE) */
|
|
|
|
list *pubsub_patterns; /* patterns a client is interested in (SUBSCRIBE) */
|
2010-08-30 08:44:34 -04:00
|
|
|
|
|
|
|
/* Response buffer */
|
|
|
|
int bufpos;
|
2010-09-16 05:59:53 -04:00
|
|
|
char buf[REDIS_REPLY_CHUNK_BYTES];
|
2010-06-21 18:07:48 -04:00
|
|
|
} redisClient;
|
|
|
|
|
|
|
|
struct saveparam {
|
|
|
|
time_t seconds;
|
|
|
|
int changes;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct sharedObjectsStruct {
|
|
|
|
robj *crlf, *ok, *err, *emptybulk, *czero, *cone, *cnegone, *pong, *space,
|
|
|
|
*colon, *nullbulk, *nullmultibulk, *queued,
|
|
|
|
*emptymultibulk, *wrongtypeerr, *nokeyerr, *syntaxerr, *sameobjecterr,
|
2012-03-07 07:05:46 -05:00
|
|
|
*outofrangeerr, *noscripterr, *loadingerr, *slowscripterr, *bgsaveerr,
|
2013-02-12 10:25:41 -05:00
|
|
|
*masterdownerr, *roslaveerr, *execaborterr, *noautherr,
|
2012-05-02 11:14:45 -04:00
|
|
|
*oomerr, *plus, *messagebulk, *pmessagebulk, *subscribebulk,
|
2012-03-29 13:06:53 -04:00
|
|
|
*unsubscribebulk, *psubscribebulk, *punsubscribebulk, *del, *rpop, *lpop,
|
A reimplementation of blocking operation internals.
Redis provides support for blocking operations such as BLPOP or BRPOP.
This operations are identical to normal LPOP and RPOP operations as long
as there are elements in the target list, but if the list is empty they
block waiting for new data to arrive to the list.
All the clients blocked waiting for th same list are served in a FIFO
way, so the first that blocked is the first to be served when there is
more data pushed by another client into the list.
The previous implementation of blocking operations was conceived to
serve clients in the context of push operations. For for instance:
1) There is a client "A" blocked on list "foo".
2) The client "B" performs `LPUSH foo somevalue`.
3) The client "A" is served in the context of the "B" LPUSH,
synchronously.
Processing things in a synchronous way was useful as if "A" pushes a
value that is served by "B", from the point of view of the database is a
NOP (no operation) thing, that is, nothing is replicated, nothing is
written in the AOF file, and so forth.
However later we implemented two things:
1) Variadic LPUSH that could add multiple values to a list in the
context of a single call.
2) BRPOPLPUSH that was a version of BRPOP that also provided a "PUSH"
side effect when receiving data.
This forced us to make the synchronous implementation more complex. If
client "B" is waiting for data, and "A" pushes three elemnents in a
single call, we needed to propagate an LPUSH with a missing argument
in the AOF and replication link. We also needed to make sure to
replicate the LPUSH side of BRPOPLPUSH, but only if in turn did not
happened to serve another blocking client into another list ;)
This were complex but with a few of mutually recursive functions
everything worked as expected... until one day we introduced scripting
in Redis.
Scripting + synchronous blocking operations = Issue #614.
Basically you can't "rewrite" a script to have just a partial effect on
the replicas and AOF file if the script happened to serve a few blocked
clients.
The solution to all this problems, implemented by this commit, is to
change the way we serve blocked clients. Instead of serving the blocked
clients synchronously, in the context of the command performing the PUSH
operation, it is now an asynchronous and iterative process:
1) If a key that has clients blocked waiting for data is the subject of
a list push operation, We simply mark keys as "ready" and put it into a
queue.
2) Every command pushing stuff on lists, as a variadic LPUSH, a script,
or whatever it is, is replicated verbatim without any rewriting.
3) Every time a Redis command, a MULTI/EXEC block, or a script,
completed its execution, we run the list of keys ready to serve blocked
clients (as more data arrived), and process this list serving the
blocked clients.
4) As a result of "3" maybe more keys are ready again for other clients
(as a result of BRPOPLPUSH we may have push operations), so we iterate
back to step "3" if it's needed.
The new code has a much simpler semantics, and a simpler to understand
implementation, with the disadvantage of not being able to "optmize out"
a PUSH+BPOP as a No OP.
This commit will be tested with care before the final merge, more tests
will be added likely.
2012-09-04 04:37:49 -04:00
|
|
|
*lpush,
|
2012-03-29 13:06:53 -04:00
|
|
|
*select[REDIS_SHARED_SELECT_CMDS],
|
2012-02-04 02:58:37 -05:00
|
|
|
*integers[REDIS_SHARED_INTEGERS],
|
|
|
|
*mbulkhdr[REDIS_SHARED_BULKHDR_LEN], /* "*<value>\r\n" */
|
|
|
|
*bulkhdr[REDIS_SHARED_BULKHDR_LEN]; /* "$<value>\r\n" */
|
2010-06-21 18:07:48 -04:00
|
|
|
};
|
|
|
|
|
2011-04-28 13:00:33 -04:00
|
|
|
/* ZSETs use a specialized version of Skiplists */
|
|
|
|
typedef struct zskiplistNode {
|
|
|
|
robj *obj;
|
|
|
|
double score;
|
|
|
|
struct zskiplistNode *backward;
|
|
|
|
struct zskiplistLevel {
|
|
|
|
struct zskiplistNode *forward;
|
|
|
|
unsigned int span;
|
|
|
|
} level[];
|
|
|
|
} zskiplistNode;
|
|
|
|
|
|
|
|
typedef struct zskiplist {
|
|
|
|
struct zskiplistNode *header, *tail;
|
|
|
|
unsigned long length;
|
|
|
|
int level;
|
|
|
|
} zskiplist;
|
|
|
|
|
|
|
|
typedef struct zset {
|
|
|
|
dict *dict;
|
|
|
|
zskiplist *zsl;
|
|
|
|
} zset;
|
|
|
|
|
2012-01-23 10:12:37 -05:00
|
|
|
typedef struct clientBufferLimitsConfig {
|
2012-01-24 04:43:30 -05:00
|
|
|
unsigned long long hard_limit_bytes;
|
|
|
|
unsigned long long soft_limit_bytes;
|
2012-01-23 10:12:37 -05:00
|
|
|
time_t soft_limit_seconds;
|
|
|
|
} clientBufferLimitsConfig;
|
|
|
|
|
2012-02-28 18:46:50 -05:00
|
|
|
/* The redisOp structure defines a Redis Operation, that is an instance of
|
|
|
|
* a command with an argument vector, database ID, propagation target
|
|
|
|
* (REDIS_PROPAGATE_*), and command pointer.
|
|
|
|
*
|
|
|
|
* Currently only used to additionally propagate more commands to AOF/Replication
|
|
|
|
* after the propagation of the executed command. */
|
|
|
|
typedef struct redisOp {
|
2012-02-28 12:03:08 -05:00
|
|
|
robj **argv;
|
|
|
|
int argc, dbid, target;
|
|
|
|
struct redisCommand *cmd;
|
2012-02-28 18:46:50 -05:00
|
|
|
} redisOp;
|
|
|
|
|
|
|
|
/* Defines an array of Redis operations. There is an API to add to this
|
|
|
|
* structure in a easy way.
|
|
|
|
*
|
|
|
|
* redisOpArrayInit();
|
|
|
|
* redisOpArrayAppend();
|
|
|
|
* redisOpArrayFree();
|
|
|
|
*/
|
|
|
|
typedef struct redisOpArray {
|
|
|
|
redisOp *ops;
|
|
|
|
int numops;
|
|
|
|
} redisOpArray;
|
2012-02-28 12:03:08 -05:00
|
|
|
|
2011-03-29 11:51:15 -04:00
|
|
|
/*-----------------------------------------------------------------------------
|
|
|
|
* Redis cluster data structures
|
|
|
|
*----------------------------------------------------------------------------*/
|
|
|
|
|
2013-02-14 06:49:16 -05:00
|
|
|
#define REDIS_CLUSTER_SLOTS 16384
|
2011-03-29 11:51:15 -04:00
|
|
|
#define REDIS_CLUSTER_OK 0 /* Everything looks ok */
|
|
|
|
#define REDIS_CLUSTER_FAIL 1 /* The cluster can't work */
|
|
|
|
#define REDIS_CLUSTER_NAMELEN 40 /* sha1 hex length */
|
|
|
|
#define REDIS_CLUSTER_PORT_INCR 10000 /* Cluster port = baseport + PORT_INCR */
|
|
|
|
|
|
|
|
struct clusterNode;
|
|
|
|
|
|
|
|
/* clusterLink encapsulates everything needed to talk with a remote node. */
|
|
|
|
typedef struct clusterLink {
|
|
|
|
int fd; /* TCP socket file descriptor */
|
|
|
|
sds sndbuf; /* Packet send buffer */
|
|
|
|
sds rcvbuf; /* Packet reception buffer */
|
|
|
|
struct clusterNode *node; /* Node related to this link if any, or NULL */
|
|
|
|
} clusterLink;
|
|
|
|
|
|
|
|
/* Node flags */
|
|
|
|
#define REDIS_NODE_MASTER 1 /* The node is a master */
|
|
|
|
#define REDIS_NODE_SLAVE 2 /* The node is a slave */
|
|
|
|
#define REDIS_NODE_PFAIL 4 /* Failure? Need acknowledge */
|
|
|
|
#define REDIS_NODE_FAIL 8 /* The node is believed to be malfunctioning */
|
|
|
|
#define REDIS_NODE_MYSELF 16 /* This node is myself */
|
|
|
|
#define REDIS_NODE_HANDSHAKE 32 /* We have still to exchange the first ping */
|
|
|
|
#define REDIS_NODE_NOADDR 64 /* We don't know the address of this node */
|
|
|
|
#define REDIS_NODE_MEET 128 /* Send a MEET message to this node */
|
|
|
|
#define REDIS_NODE_NULL_NAME "\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000"
|
|
|
|
|
2013-02-22 11:43:35 -05:00
|
|
|
/* This structure represent elements of node->fail_reports. */
|
|
|
|
struct clusterNodeFailReport {
|
|
|
|
struct clusterNode *node; /* Node reporting the failure condition. */
|
|
|
|
time_t time; /* Time of the last report from this node. */
|
|
|
|
} typedef clusterNodeFailReport;
|
|
|
|
|
2011-03-29 11:51:15 -04:00
|
|
|
struct clusterNode {
|
|
|
|
char name[REDIS_CLUSTER_NAMELEN]; /* Node name, hex string, sha1-size */
|
|
|
|
int flags; /* REDIS_NODE_... */
|
|
|
|
unsigned char slots[REDIS_CLUSTER_SLOTS/8]; /* slots handled by this node */
|
2013-02-28 09:11:05 -05:00
|
|
|
int numslots; /* Number of slots handled by this node */
|
2011-03-29 11:51:15 -04:00
|
|
|
int numslaves; /* Number of slave nodes, if this is a master */
|
|
|
|
struct clusterNode **slaves; /* pointers to slave nodes */
|
|
|
|
struct clusterNode *slaveof; /* pointer to the master node */
|
|
|
|
time_t ping_sent; /* Unix time we sent latest ping */
|
|
|
|
time_t pong_received; /* Unix time we received the pong */
|
2013-03-05 07:15:05 -05:00
|
|
|
time_t fail_time; /* Unix time when FAIL flag was set */
|
2011-03-29 11:51:15 -04:00
|
|
|
char *configdigest; /* Configuration digest of this node */
|
|
|
|
time_t configdigest_ts; /* Configuration digest timestamp */
|
|
|
|
char ip[16]; /* Latest known IP address of this node */
|
|
|
|
int port; /* Latest known port of this node */
|
|
|
|
clusterLink *link; /* TCP/IP link with this node */
|
2013-02-22 11:43:35 -05:00
|
|
|
list *fail_reports; /* List of nodes signaling this as failing */
|
2011-03-29 11:51:15 -04:00
|
|
|
};
|
|
|
|
typedef struct clusterNode clusterNode;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
clusterNode *myself; /* This node */
|
|
|
|
int state; /* REDIS_CLUSTER_OK, REDIS_CLUSTER_FAIL, ... */
|
2013-02-22 13:18:30 -05:00
|
|
|
int size; /* Num of master nodes with at least one slot */
|
2011-03-29 11:51:15 -04:00
|
|
|
int node_timeout;
|
|
|
|
dict *nodes; /* Hash table of name -> clusterNode structures */
|
|
|
|
clusterNode *migrating_slots_to[REDIS_CLUSTER_SLOTS];
|
|
|
|
clusterNode *importing_slots_from[REDIS_CLUSTER_SLOTS];
|
|
|
|
clusterNode *slots[REDIS_CLUSTER_SLOTS];
|
2011-04-28 13:00:33 -04:00
|
|
|
zskiplist *slots_to_keys;
|
2011-03-29 11:51:15 -04:00
|
|
|
} clusterState;
|
|
|
|
|
|
|
|
/* Redis cluster messages header */
|
|
|
|
|
|
|
|
/* Note that the PING, PONG and MEET messages are actually the same exact
|
2013-01-16 12:00:20 -05:00
|
|
|
* kind of packet. PONG is the reply to ping, in the exact format as a PING,
|
2011-03-29 11:51:15 -04:00
|
|
|
* while MEET is a special PING that forces the receiver to add the sender
|
|
|
|
* as a node (if it is not already in the list). */
|
|
|
|
#define CLUSTERMSG_TYPE_PING 0 /* Ping */
|
|
|
|
#define CLUSTERMSG_TYPE_PONG 1 /* Pong (reply to Ping) */
|
|
|
|
#define CLUSTERMSG_TYPE_MEET 2 /* Meet "let's join" message */
|
|
|
|
#define CLUSTERMSG_TYPE_FAIL 3 /* Mark node xxx as failing */
|
2013-01-16 12:00:20 -05:00
|
|
|
#define CLUSTERMSG_TYPE_PUBLISH 4 /* Pub/Sub Publish propagation */
|
2011-03-29 11:51:15 -04:00
|
|
|
|
|
|
|
/* Initially we don't know our "name", but we'll find it once we connect
|
|
|
|
* to the first node, using the getsockname() function. Then we'll use this
|
|
|
|
* address for all the next messages. */
|
|
|
|
typedef struct {
|
|
|
|
char nodename[REDIS_CLUSTER_NAMELEN];
|
|
|
|
uint32_t ping_sent;
|
|
|
|
uint32_t pong_received;
|
|
|
|
char ip[16]; /* IP address last time it was seen */
|
|
|
|
uint16_t port; /* port last time it was seen */
|
|
|
|
uint16_t flags;
|
|
|
|
uint32_t notused; /* for 64 bit alignment */
|
|
|
|
} clusterMsgDataGossip;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
char nodename[REDIS_CLUSTER_NAMELEN];
|
|
|
|
} clusterMsgDataFail;
|
|
|
|
|
2011-10-07 09:37:34 -04:00
|
|
|
typedef struct {
|
|
|
|
uint32_t channel_len;
|
|
|
|
uint32_t message_len;
|
|
|
|
unsigned char bulk_data[8]; /* defined as 8 just for alignment concerns. */
|
|
|
|
} clusterMsgDataPublish;
|
|
|
|
|
2011-03-29 11:51:15 -04:00
|
|
|
union clusterMsgData {
|
|
|
|
/* PING, MEET and PONG */
|
|
|
|
struct {
|
|
|
|
/* Array of N clusterMsgDataGossip structures */
|
|
|
|
clusterMsgDataGossip gossip[1];
|
|
|
|
} ping;
|
2011-10-07 09:37:34 -04:00
|
|
|
|
2011-03-29 11:51:15 -04:00
|
|
|
/* FAIL */
|
|
|
|
struct {
|
|
|
|
clusterMsgDataFail about;
|
|
|
|
} fail;
|
2011-10-07 09:37:34 -04:00
|
|
|
|
|
|
|
/* PUBLISH */
|
|
|
|
struct {
|
|
|
|
clusterMsgDataPublish msg;
|
|
|
|
} publish;
|
2011-03-29 11:51:15 -04:00
|
|
|
};
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
uint32_t totlen; /* Total length of this message */
|
|
|
|
uint16_t type; /* Message type */
|
|
|
|
uint16_t count; /* Only used for some kind of messages. */
|
|
|
|
char sender[REDIS_CLUSTER_NAMELEN]; /* Name of the sender node */
|
|
|
|
unsigned char myslots[REDIS_CLUSTER_SLOTS/8];
|
|
|
|
char slaveof[REDIS_CLUSTER_NAMELEN];
|
|
|
|
char configdigest[32];
|
|
|
|
uint16_t port; /* Sender TCP base port */
|
|
|
|
unsigned char state; /* Cluster state from the POV of the sender */
|
|
|
|
unsigned char notused[5]; /* Reserved for future use. For alignment. */
|
|
|
|
union clusterMsgData data;
|
|
|
|
} clusterMsg;
|
|
|
|
|
2013-02-15 10:44:39 -05:00
|
|
|
#define CLUSTERMSG_MIN_LEN (sizeof(clusterMsg)-sizeof(union clusterMsgData))
|
|
|
|
|
2011-03-29 11:51:15 -04:00
|
|
|
/*-----------------------------------------------------------------------------
|
|
|
|
* Global server state
|
|
|
|
*----------------------------------------------------------------------------*/
|
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
struct redisServer {
|
2011-01-13 18:19:19 -05:00
|
|
|
/* General */
|
2012-12-14 11:10:40 -05:00
|
|
|
int hz; /* serverCron() calls frequency in hertz */
|
2011-01-13 18:19:19 -05:00
|
|
|
redisDb *db;
|
2013-03-06 10:28:26 -05:00
|
|
|
dict *commands; /* Command table */
|
|
|
|
dict *orig_commands; /* Command table before command renaming. */
|
2011-01-13 18:19:19 -05:00
|
|
|
aeEventLoop *el;
|
2011-12-21 04:05:32 -05:00
|
|
|
unsigned lruclock:22; /* Clock incrementing every minute, for LRU */
|
|
|
|
unsigned lruclock_padding:10;
|
|
|
|
int shutdown_asap; /* SHUTDOWN needed ASAP */
|
|
|
|
int activerehashing; /* Incremental rehash in serverCron() */
|
|
|
|
char *requirepass; /* Pass for AUTH command, or NULL */
|
|
|
|
char *pidfile; /* PID file path */
|
2012-02-02 04:02:40 -05:00
|
|
|
int arch_bits; /* 32 or 64 depending on sizeof(long) */
|
2012-03-07 07:05:46 -05:00
|
|
|
int cronloops; /* Number of times the cron function run */
|
2012-03-08 04:13:12 -05:00
|
|
|
char runid[REDIS_RUN_ID_SIZE+1]; /* ID always different at every exec. */
|
2012-07-23 06:54:52 -04:00
|
|
|
int sentinel_mode; /* True if this instance is a Sentinel. */
|
2011-01-13 18:19:19 -05:00
|
|
|
/* Networking */
|
2011-12-21 04:05:32 -05:00
|
|
|
int port; /* TCP listening port */
|
|
|
|
char *bindaddr; /* Bind address or NULL */
|
|
|
|
char *unixsocket; /* UNIX socket path */
|
|
|
|
mode_t unixsocketperm; /* UNIX socket permission */
|
|
|
|
int ipfd; /* TCP socket file descriptor */
|
|
|
|
int sofd; /* Unix socket file descriptor */
|
2013-01-16 12:00:20 -05:00
|
|
|
int cfd; /* Cluster bus listening socket */
|
2011-12-21 04:05:32 -05:00
|
|
|
list *clients; /* List of active clients */
|
2012-01-23 10:12:37 -05:00
|
|
|
list *clients_to_close; /* Clients to close asynchronously */
|
2011-12-21 04:05:32 -05:00
|
|
|
list *slaves, *monitors; /* List of slaves and MONITORs */
|
2012-01-12 10:02:57 -05:00
|
|
|
redisClient *current_client; /* Current client, only used on crash report */
|
2012-11-11 18:45:10 -05:00
|
|
|
char neterr[ANET_ERR_LEN]; /* Error buffer for anet.c */
|
|
|
|
dict *migrate_cached_sockets;/* MIGRATE cached sockets */
|
2010-11-08 05:52:03 -05:00
|
|
|
/* RDB / AOF loading information */
|
2011-12-21 04:05:32 -05:00
|
|
|
int loading; /* We are loading data from disk if true */
|
2010-11-08 05:52:03 -05:00
|
|
|
off_t loading_total_bytes;
|
|
|
|
off_t loading_loaded_bytes;
|
|
|
|
time_t loading_start_time;
|
2010-11-04 14:59:21 -04:00
|
|
|
/* Fast pointers to often looked up command */
|
A reimplementation of blocking operation internals.
Redis provides support for blocking operations such as BLPOP or BRPOP.
This operations are identical to normal LPOP and RPOP operations as long
as there are elements in the target list, but if the list is empty they
block waiting for new data to arrive to the list.
All the clients blocked waiting for th same list are served in a FIFO
way, so the first that blocked is the first to be served when there is
more data pushed by another client into the list.
The previous implementation of blocking operations was conceived to
serve clients in the context of push operations. For for instance:
1) There is a client "A" blocked on list "foo".
2) The client "B" performs `LPUSH foo somevalue`.
3) The client "A" is served in the context of the "B" LPUSH,
synchronously.
Processing things in a synchronous way was useful as if "A" pushes a
value that is served by "B", from the point of view of the database is a
NOP (no operation) thing, that is, nothing is replicated, nothing is
written in the AOF file, and so forth.
However later we implemented two things:
1) Variadic LPUSH that could add multiple values to a list in the
context of a single call.
2) BRPOPLPUSH that was a version of BRPOP that also provided a "PUSH"
side effect when receiving data.
This forced us to make the synchronous implementation more complex. If
client "B" is waiting for data, and "A" pushes three elemnents in a
single call, we needed to propagate an LPUSH with a missing argument
in the AOF and replication link. We also needed to make sure to
replicate the LPUSH side of BRPOPLPUSH, but only if in turn did not
happened to serve another blocking client into another list ;)
This were complex but with a few of mutually recursive functions
everything worked as expected... until one day we introduced scripting
in Redis.
Scripting + synchronous blocking operations = Issue #614.
Basically you can't "rewrite" a script to have just a partial effect on
the replicas and AOF file if the script happened to serve a few blocked
clients.
The solution to all this problems, implemented by this commit, is to
change the way we serve blocked clients. Instead of serving the blocked
clients synchronously, in the context of the command performing the PUSH
operation, it is now an asynchronous and iterative process:
1) If a key that has clients blocked waiting for data is the subject of
a list push operation, We simply mark keys as "ready" and put it into a
queue.
2) Every command pushing stuff on lists, as a variadic LPUSH, a script,
or whatever it is, is replicated verbatim without any rewriting.
3) Every time a Redis command, a MULTI/EXEC block, or a script,
completed its execution, we run the list of keys ready to serve blocked
clients (as more data arrived), and process this list serving the
blocked clients.
4) As a result of "3" maybe more keys are ready again for other clients
(as a result of BRPOPLPUSH we may have push operations), so we iterate
back to step "3" if it's needed.
The new code has a much simpler semantics, and a simpler to understand
implementation, with the disadvantage of not being able to "optmize out"
a PUSH+BPOP as a No OP.
This commit will be tested with care before the final merge, more tests
will be added likely.
2012-09-04 04:37:49 -04:00
|
|
|
struct redisCommand *delCommand, *multiCommand, *lpushCommand, *lpopCommand,
|
|
|
|
*rpopCommand;
|
2010-06-21 18:07:48 -04:00
|
|
|
/* Fields used only for stats */
|
2011-12-21 04:05:32 -05:00
|
|
|
time_t stat_starttime; /* Server start time */
|
|
|
|
long long stat_numcommands; /* Number of processed commands */
|
|
|
|
long long stat_numconnections; /* Number of connections received */
|
|
|
|
long long stat_expiredkeys; /* Number of expired keys */
|
|
|
|
long long stat_evictedkeys; /* Number of evicted keys (maxmemory) */
|
|
|
|
long long stat_keyspace_hits; /* Number of successful lookups of keys */
|
|
|
|
long long stat_keyspace_misses; /* Number of failed lookups of keys */
|
|
|
|
size_t stat_peak_memory; /* Max used memory record */
|
2013-01-16 12:00:20 -05:00
|
|
|
long long stat_fork_time; /* Time needed to perform latest fork() */
|
2011-12-21 04:05:32 -05:00
|
|
|
long long stat_rejected_conn; /* Clients rejected because of maxclients */
|
2013-02-12 09:24:25 -05:00
|
|
|
long long stat_sync_full; /* Number of full resyncs with slaves. */
|
|
|
|
long long stat_sync_partial_ok; /* Number of accepted PSYNC requests. */
|
|
|
|
long long stat_sync_partial_err;/* Number of unaccepted PSYNC requests. */
|
2011-12-21 04:05:32 -05:00
|
|
|
list *slowlog; /* SLOWLOG list of commands */
|
|
|
|
long long slowlog_entry_id; /* SLOWLOG current entry ID */
|
|
|
|
long long slowlog_log_slower_than; /* SLOWLOG time limit (to get logged) */
|
|
|
|
unsigned long slowlog_max_len; /* SLOWLOG max number of items logged */
|
2012-03-08 10:15:37 -05:00
|
|
|
/* The following two are used to track instantaneous "load" in terms
|
|
|
|
* of operations per second. */
|
|
|
|
long long ops_sec_last_sample_time; /* Timestamp of last sample (in ms) */
|
|
|
|
long long ops_sec_last_sample_ops; /* numcommands in last sample */
|
|
|
|
long long ops_sec_samples[REDIS_OPS_SEC_SAMPLES];
|
|
|
|
int ops_sec_idx;
|
2010-06-21 18:07:48 -04:00
|
|
|
/* Configuration */
|
2011-12-21 04:05:32 -05:00
|
|
|
int verbosity; /* Loglevel in redis.conf */
|
|
|
|
int maxidletime; /* Client timeout in seconds */
|
2013-02-08 10:40:59 -05:00
|
|
|
int tcpkeepalive; /* Set SO_KEEPALIVE if non-zero. */
|
2011-12-21 04:05:32 -05:00
|
|
|
size_t client_max_querybuf_len; /* Limit for client query buffer length */
|
|
|
|
int dbnum; /* Total number of configured DBs */
|
|
|
|
int daemonize; /* True if running as a daemon */
|
2012-01-23 10:12:37 -05:00
|
|
|
clientBufferLimitsConfig client_obuf_limits[REDIS_CLIENT_LIMIT_NUM_CLASSES];
|
2011-12-21 04:05:32 -05:00
|
|
|
/* AOF persistence */
|
|
|
|
int aof_state; /* REDIS_AOF_(ON|OFF|WAIT_REWRITE) */
|
2011-12-21 05:58:42 -05:00
|
|
|
int aof_fsync; /* Kind of fsync() policy */
|
|
|
|
char *aof_filename; /* Name of the AOF file */
|
|
|
|
int aof_no_fsync_on_rewrite; /* Don't fsync if a rewrite is in prog. */
|
|
|
|
int aof_rewrite_perc; /* Rewrite AOF if % growth is > M and... */
|
|
|
|
off_t aof_rewrite_min_size; /* the AOF file is at least N bytes. */
|
|
|
|
off_t aof_rewrite_base_size; /* AOF size on latest startup or rewrite. */
|
|
|
|
off_t aof_current_size; /* AOF current size. */
|
|
|
|
int aof_rewrite_scheduled; /* Rewrite once BGSAVE terminates. */
|
2011-12-21 06:17:02 -05:00
|
|
|
pid_t aof_child_pid; /* PID if rewriting process */
|
Allow an AOF rewrite buffer > 2GB (Fix for issue #504).
During the AOF rewrite process, the parent process needs to accumulate
the new writes in an in-memory buffer: when the child will terminate the
AOF rewriting process this buffer (that ist the difference between the
dataset when the rewrite was started, and the current dataset) is
flushed to the new AOF file.
We used to implement this buffer using an sds.c string, but sds.c has a
2GB limit. Sometimes the dataset can be big enough, the amount of writes
so high, and the rewrite process slow enough that we overflow the 2GB
limit, causing a crash, documented on github by issue #504.
In order to prevent this from happening, this commit introduces a new
system to accumulate writes, implemented by a linked list of blocks of
10 MB each, so that we also avoid paying the reallocation cost.
Note that theoretically modern operating systems may implement realloc()
simply as a remaping of the old pages, thus with very good performances,
see for instance the mremap() syscall on Linux. However this is not
always true, and jemalloc by default avoids doing this because there are
issues with the current implementation of mremap().
For this reason we are using a linked list of blocks instead of a single
block that gets reallocated again and again.
The changes in this commit lacks testing, that will be performed before
merging into the unstable branch. This fix will not enter 2.4 because it
is too invasive. However 2.4 will log a warning when the AOF rewrite
buffer is near to the 2GB limit.
2012-05-22 07:03:41 -04:00
|
|
|
list *aof_rewrite_buf_blocks; /* Hold changes during an AOF rewrite. */
|
2011-12-21 06:17:02 -05:00
|
|
|
sds aof_buf; /* AOF buffer, written before entering the event loop */
|
|
|
|
int aof_fd; /* File descriptor of currently selected AOF file */
|
|
|
|
int aof_selected_db; /* Currently selected DB in AOF */
|
2011-12-21 04:05:32 -05:00
|
|
|
time_t aof_flush_postponed_start; /* UNIX time of postponed AOF flush */
|
2011-12-21 06:17:02 -05:00
|
|
|
time_t aof_last_fsync; /* UNIX time of last fsync() */
|
2012-05-25 06:11:30 -04:00
|
|
|
time_t aof_rewrite_time_last; /* Time used by last AOF rewrite run. */
|
|
|
|
time_t aof_rewrite_time_start; /* Current AOF rewrite start time. */
|
2012-07-16 22:06:53 -04:00
|
|
|
int aof_lastbgrewrite_status; /* REDIS_OK or REDIS_ERR */
|
2012-03-25 05:27:35 -04:00
|
|
|
unsigned long aof_delayed_fsync; /* delayed AOF fsync() counter */
|
2011-12-21 04:05:32 -05:00
|
|
|
/* RDB persistence */
|
|
|
|
long long dirty; /* Changes to DB from the last save */
|
|
|
|
long long dirty_before_bgsave; /* Used to restore dirty on failed BGSAVE */
|
2011-12-21 06:22:13 -05:00
|
|
|
pid_t rdb_child_pid; /* PID of RDB saving child */
|
2011-12-21 04:05:32 -05:00
|
|
|
struct saveparam *saveparams; /* Save points array for RDB */
|
|
|
|
int saveparamslen; /* Number of saving points */
|
2011-12-21 06:22:13 -05:00
|
|
|
char *rdb_filename; /* Name of RDB file */
|
|
|
|
int rdb_compression; /* Use compression in RDB? */
|
2012-04-10 09:47:10 -04:00
|
|
|
int rdb_checksum; /* Use RDB checksum? */
|
2013-01-16 12:00:20 -05:00
|
|
|
time_t lastsave; /* Unix time of last successful save */
|
2012-05-25 06:11:30 -04:00
|
|
|
time_t rdb_save_time_last; /* Time used by last RDB save run. */
|
|
|
|
time_t rdb_save_time_start; /* Current RDB save start time. */
|
2012-03-07 07:05:46 -05:00
|
|
|
int lastbgsave_status; /* REDIS_OK or REDIS_ERR */
|
2012-03-07 12:02:26 -05:00
|
|
|
int stop_writes_on_bgsave_err; /* Don't allow writes if can't BGSAVE */
|
2012-02-28 12:03:08 -05:00
|
|
|
/* Propagation of commands in AOF / replication */
|
2012-02-28 18:46:50 -05:00
|
|
|
redisOpArray also_propagate; /* Additional command to propagate. */
|
2011-01-07 12:15:14 -05:00
|
|
|
/* Logging */
|
2011-12-21 04:05:32 -05:00
|
|
|
char *logfile; /* Path of log file */
|
|
|
|
int syslog_enabled; /* Is syslog enabled? */
|
|
|
|
char *syslog_ident; /* Syslog ident */
|
|
|
|
int syslog_facility; /* Syslog facility */
|
2013-01-30 12:33:16 -05:00
|
|
|
/* Replication (master) */
|
|
|
|
int slaveseldb; /* Last SELECTed DB in replication output */
|
|
|
|
long long master_repl_offset; /* Global replication offset */
|
|
|
|
int repl_ping_slave_period; /* Master pings the slave every N seconds */
|
|
|
|
char *repl_backlog; /* Replication backlog for partial syncs */
|
|
|
|
long long repl_backlog_size; /* Backlog circular buffer size */
|
|
|
|
long long repl_backlog_histlen; /* Backlog actual data length */
|
|
|
|
long long repl_backlog_idx; /* Backlog circular buffer current offset */
|
|
|
|
long long repl_backlog_off; /* Replication offset of first byte in the
|
|
|
|
backlog buffer. */
|
|
|
|
time_t repl_backlog_time_limit; /* Time without slaves after the backlog
|
|
|
|
gets released. */
|
|
|
|
time_t repl_no_slaves_since; /* We have no slaves since that time.
|
|
|
|
Only valid if server.slaves len is 0. */
|
|
|
|
/* Replication (slave) */
|
2011-12-21 04:05:32 -05:00
|
|
|
char *masterauth; /* AUTH with this password with master */
|
|
|
|
char *masterhost; /* Hostname of master */
|
|
|
|
int masterport; /* Port of master */
|
|
|
|
int repl_timeout; /* Timeout after N seconds of master idle */
|
|
|
|
redisClient *master; /* Client that is master for this slave */
|
2013-01-30 12:33:16 -05:00
|
|
|
redisClient *cached_master; /* Cached master to be reused for PSYNC. */
|
2011-12-21 04:05:32 -05:00
|
|
|
int repl_syncio_timeout; /* Timeout for synchronous I/O calls */
|
2011-12-21 06:23:18 -05:00
|
|
|
int repl_state; /* Replication status if the instance is a slave */
|
2012-08-24 13:28:44 -04:00
|
|
|
off_t repl_transfer_size; /* Size of RDB to read from master during sync. */
|
|
|
|
off_t repl_transfer_read; /* Amount of RDB read from master during sync. */
|
|
|
|
off_t repl_transfer_last_fsync_off; /* Offset when we fsync-ed last time. */
|
2011-12-21 04:05:32 -05:00
|
|
|
int repl_transfer_s; /* Slave -> Master SYNC socket */
|
|
|
|
int repl_transfer_fd; /* Slave -> Master SYNC temp file descriptor */
|
|
|
|
char *repl_transfer_tmpfile; /* Slave-> master SYNC temp file name */
|
|
|
|
time_t repl_transfer_lastio; /* Unix time of the latest read, for timeout */
|
2010-11-04 14:59:21 -04:00
|
|
|
int repl_serve_stale_data; /* Serve stale data when link is down? */
|
2012-03-20 12:32:48 -04:00
|
|
|
int repl_slave_ro; /* Slave is read only? */
|
2011-12-21 04:05:32 -05:00
|
|
|
time_t repl_down_since; /* Unix time at which link with master went down */
|
2013-01-31 05:14:15 -05:00
|
|
|
int repl_disable_tcp_nodelay; /* Disable TCP_NODELAY after SYNC? */
|
2012-08-28 11:20:26 -04:00
|
|
|
int slave_priority; /* Reported in INFO and used by Sentinel. */
|
2013-01-30 12:33:16 -05:00
|
|
|
char repl_master_runid[REDIS_RUN_ID_SIZE+1]; /* Master run id for PSYNC. */
|
|
|
|
long long repl_master_initial_offset; /* Master PSYNC offset. */
|
2010-11-04 12:29:53 -04:00
|
|
|
/* Limits */
|
2011-12-21 04:05:32 -05:00
|
|
|
unsigned int maxclients; /* Max number of simultaneous clients */
|
|
|
|
unsigned long long maxmemory; /* Max number of memory bytes to use */
|
2013-01-16 12:00:20 -05:00
|
|
|
int maxmemory_policy; /* Policy for key eviction */
|
2011-12-21 04:05:32 -05:00
|
|
|
int maxmemory_samples; /* Pricision of random sampling */
|
2010-11-04 12:29:53 -04:00
|
|
|
/* Blocked clients */
|
2011-12-21 04:05:32 -05:00
|
|
|
unsigned int bpop_blocked_clients; /* Number of clients blocked by lists */
|
2010-12-29 13:39:42 -05:00
|
|
|
list *unblocked_clients; /* list of clients to unblock before next loop */
|
A reimplementation of blocking operation internals.
Redis provides support for blocking operations such as BLPOP or BRPOP.
This operations are identical to normal LPOP and RPOP operations as long
as there are elements in the target list, but if the list is empty they
block waiting for new data to arrive to the list.
All the clients blocked waiting for th same list are served in a FIFO
way, so the first that blocked is the first to be served when there is
more data pushed by another client into the list.
The previous implementation of blocking operations was conceived to
serve clients in the context of push operations. For for instance:
1) There is a client "A" blocked on list "foo".
2) The client "B" performs `LPUSH foo somevalue`.
3) The client "A" is served in the context of the "B" LPUSH,
synchronously.
Processing things in a synchronous way was useful as if "A" pushes a
value that is served by "B", from the point of view of the database is a
NOP (no operation) thing, that is, nothing is replicated, nothing is
written in the AOF file, and so forth.
However later we implemented two things:
1) Variadic LPUSH that could add multiple values to a list in the
context of a single call.
2) BRPOPLPUSH that was a version of BRPOP that also provided a "PUSH"
side effect when receiving data.
This forced us to make the synchronous implementation more complex. If
client "B" is waiting for data, and "A" pushes three elemnents in a
single call, we needed to propagate an LPUSH with a missing argument
in the AOF and replication link. We also needed to make sure to
replicate the LPUSH side of BRPOPLPUSH, but only if in turn did not
happened to serve another blocking client into another list ;)
This were complex but with a few of mutually recursive functions
everything worked as expected... until one day we introduced scripting
in Redis.
Scripting + synchronous blocking operations = Issue #614.
Basically you can't "rewrite" a script to have just a partial effect on
the replicas and AOF file if the script happened to serve a few blocked
clients.
The solution to all this problems, implemented by this commit, is to
change the way we serve blocked clients. Instead of serving the blocked
clients synchronously, in the context of the command performing the PUSH
operation, it is now an asynchronous and iterative process:
1) If a key that has clients blocked waiting for data is the subject of
a list push operation, We simply mark keys as "ready" and put it into a
queue.
2) Every command pushing stuff on lists, as a variadic LPUSH, a script,
or whatever it is, is replicated verbatim without any rewriting.
3) Every time a Redis command, a MULTI/EXEC block, or a script,
completed its execution, we run the list of keys ready to serve blocked
clients (as more data arrived), and process this list serving the
blocked clients.
4) As a result of "3" maybe more keys are ready again for other clients
(as a result of BRPOPLPUSH we may have push operations), so we iterate
back to step "3" if it's needed.
The new code has a much simpler semantics, and a simpler to understand
implementation, with the disadvantage of not being able to "optmize out"
a PUSH+BPOP as a No OP.
This commit will be tested with care before the final merge, more tests
will be added likely.
2012-09-04 04:37:49 -04:00
|
|
|
list *ready_keys; /* List of readyList structures for BLPOP & co */
|
2010-06-21 18:07:48 -04:00
|
|
|
/* Sort parameters - qsort_r() is only available under BSD so we
|
|
|
|
* have to take this state global, in order to pass it to sortCompare() */
|
|
|
|
int sort_desc;
|
|
|
|
int sort_alpha;
|
|
|
|
int sort_bypattern;
|
2011-12-21 04:05:32 -05:00
|
|
|
/* Zip structure config, see redis.conf for more information */
|
2012-01-03 01:14:10 -05:00
|
|
|
size_t hash_max_ziplist_entries;
|
|
|
|
size_t hash_max_ziplist_value;
|
2010-06-21 18:07:48 -04:00
|
|
|
size_t list_max_ziplist_entries;
|
|
|
|
size_t list_max_ziplist_value;
|
2010-07-02 13:57:12 -04:00
|
|
|
size_t set_max_intset_entries;
|
2011-03-09 08:01:57 -05:00
|
|
|
size_t zset_max_ziplist_entries;
|
|
|
|
size_t zset_max_ziplist_value;
|
2011-12-21 04:05:32 -05:00
|
|
|
time_t unixtime; /* Unix time sampled every second. */
|
2010-06-21 18:07:48 -04:00
|
|
|
/* Pubsub */
|
2011-12-21 04:05:32 -05:00
|
|
|
dict *pubsub_channels; /* Map channels to list of subscribed clients */
|
|
|
|
list *pubsub_patterns; /* A list of pubsub_patterns */
|
2013-01-25 07:19:08 -05:00
|
|
|
int notify_keyspace_events; /* Events to propagate via Pub/Sub. This is an
|
|
|
|
xor of REDIS_NOTIFY... flags. */
|
2011-04-28 13:00:33 -04:00
|
|
|
/* Cluster */
|
2013-02-14 07:20:56 -05:00
|
|
|
int cluster_enabled; /* Is cluster enabled? */
|
|
|
|
char *cluster_configfile; /* Cluster auto-generated config file name. */
|
|
|
|
clusterState *cluster; /* State of the cluster */
|
2011-04-30 11:46:52 -04:00
|
|
|
/* Scripting */
|
2011-07-13 09:38:03 -04:00
|
|
|
lua_State *lua; /* The Lua interpreter. We use just one for all clients */
|
2011-12-21 04:05:32 -05:00
|
|
|
redisClient *lua_client; /* The "fake client" to query Redis from Lua */
|
|
|
|
redisClient *lua_caller; /* The client running EVAL right now, or NULL */
|
|
|
|
dict *lua_scripts; /* A dictionary of SHA1 -> Lua scripts */
|
|
|
|
long long lua_time_limit; /* Script timeout in seconds */
|
|
|
|
long long lua_time_start; /* Start time of script */
|
2011-11-18 08:10:48 -05:00
|
|
|
int lua_write_dirty; /* True if a write command was called during the
|
|
|
|
execution of the current script. */
|
2011-09-27 09:30:31 -04:00
|
|
|
int lua_random_dirty; /* True if a random command was called during the
|
2011-11-18 08:10:48 -05:00
|
|
|
execution of the current script. */
|
2011-10-27 08:49:10 -04:00
|
|
|
int lua_timedout; /* True if we reached the time limit for script
|
|
|
|
execution. */
|
2011-11-18 08:10:48 -05:00
|
|
|
int lua_kill; /* Kill the script if true. */
|
2013-01-16 12:00:20 -05:00
|
|
|
/* Assert & bug reporting */
|
2011-11-24 09:47:26 -05:00
|
|
|
char *assert_failed;
|
|
|
|
char *assert_file;
|
|
|
|
int assert_line;
|
2011-12-21 04:05:32 -05:00
|
|
|
int bug_report_start; /* True if bug report header was already logged. */
|
2012-03-27 05:47:51 -04:00
|
|
|
int watchdog_period; /* Software watchdog period in ms. 0 = off */
|
2010-06-21 18:07:48 -04:00
|
|
|
};
|
|
|
|
|
|
|
|
typedef struct pubsubPattern {
|
|
|
|
redisClient *client;
|
|
|
|
robj *pattern;
|
|
|
|
} pubsubPattern;
|
|
|
|
|
|
|
|
typedef void redisCommandProc(redisClient *c);
|
2011-03-23 13:09:17 -04:00
|
|
|
typedef int *redisGetKeysProc(struct redisCommand *cmd, robj **argv, int argc, int *numkeys, int flags);
|
2010-06-21 18:07:48 -04:00
|
|
|
struct redisCommand {
|
|
|
|
char *name;
|
|
|
|
redisCommandProc *proc;
|
|
|
|
int arity;
|
2013-01-16 12:00:20 -05:00
|
|
|
char *sflags; /* Flags as string representation, one char per flag. */
|
2011-09-26 09:40:39 -04:00
|
|
|
int flags; /* The actual flags, obtained from the 'sflags' field. */
|
2011-03-23 13:09:17 -04:00
|
|
|
/* Use a function to determine keys arguments in a command line.
|
2011-06-25 06:22:03 -04:00
|
|
|
* Used for Redis Cluster redirect. */
|
2011-03-23 13:09:17 -04:00
|
|
|
redisGetKeysProc *getkeys_proc;
|
2010-06-21 18:07:48 -04:00
|
|
|
/* What keys should be loaded in background when calling this command? */
|
2011-03-23 13:09:17 -04:00
|
|
|
int firstkey; /* The first argument that's a key (0 = no keys) */
|
2013-01-16 12:00:20 -05:00
|
|
|
int lastkey; /* The last argument that's a key */
|
2011-03-23 13:09:17 -04:00
|
|
|
int keystep; /* The step between first and last key */
|
2011-01-23 16:14:15 -05:00
|
|
|
long long microseconds, calls;
|
2010-06-21 18:07:48 -04:00
|
|
|
};
|
|
|
|
|
|
|
|
struct redisFunctionSym {
|
|
|
|
char *name;
|
|
|
|
unsigned long pointer;
|
|
|
|
};
|
|
|
|
|
|
|
|
typedef struct _redisSortObject {
|
|
|
|
robj *obj;
|
|
|
|
union {
|
|
|
|
double score;
|
|
|
|
robj *cmpobj;
|
|
|
|
} u;
|
|
|
|
} redisSortObject;
|
|
|
|
|
|
|
|
typedef struct _redisSortOperation {
|
|
|
|
int type;
|
|
|
|
robj *pattern;
|
|
|
|
} redisSortOperation;
|
|
|
|
|
|
|
|
/* Structure to hold list iteration abstraction. */
|
|
|
|
typedef struct {
|
|
|
|
robj *subject;
|
|
|
|
unsigned char encoding;
|
|
|
|
unsigned char direction; /* Iteration direction */
|
|
|
|
unsigned char *zi;
|
|
|
|
listNode *ln;
|
|
|
|
} listTypeIterator;
|
|
|
|
|
|
|
|
/* Structure for an entry while iterating over a list. */
|
|
|
|
typedef struct {
|
|
|
|
listTypeIterator *li;
|
|
|
|
unsigned char *zi; /* Entry in ziplist */
|
|
|
|
listNode *ln; /* Entry in linked list */
|
|
|
|
} listTypeEntry;
|
|
|
|
|
2010-07-02 13:57:12 -04:00
|
|
|
/* Structure to hold set iteration abstraction. */
|
|
|
|
typedef struct {
|
|
|
|
robj *subject;
|
|
|
|
int encoding;
|
|
|
|
int ii; /* intset iterator */
|
|
|
|
dictIterator *di;
|
2010-08-21 05:25:13 -04:00
|
|
|
} setTypeIterator;
|
2010-07-02 13:57:12 -04:00
|
|
|
|
2013-01-16 12:00:20 -05:00
|
|
|
/* Structure to hold hash iteration abstraction. Note that iteration over
|
2010-06-21 18:07:48 -04:00
|
|
|
* hashes involves both fields and values. Because it is possible that
|
|
|
|
* not both are required, store pointers in the iterator to avoid
|
|
|
|
* unnecessary memory allocation for fields/values. */
|
|
|
|
typedef struct {
|
2012-01-03 01:14:10 -05:00
|
|
|
robj *subject;
|
2010-06-21 18:07:48 -04:00
|
|
|
int encoding;
|
2012-01-03 01:14:10 -05:00
|
|
|
|
|
|
|
unsigned char *fptr, *vptr;
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
dictIterator *di;
|
|
|
|
dictEntry *de;
|
|
|
|
} hashTypeIterator;
|
|
|
|
|
|
|
|
#define REDIS_HASH_KEY 1
|
|
|
|
#define REDIS_HASH_VALUE 2
|
|
|
|
|
|
|
|
/*-----------------------------------------------------------------------------
|
|
|
|
* Extern declarations
|
|
|
|
*----------------------------------------------------------------------------*/
|
|
|
|
|
|
|
|
extern struct redisServer server;
|
|
|
|
extern struct sharedObjectsStruct shared;
|
|
|
|
extern dictType setDictType;
|
|
|
|
extern dictType zsetDictType;
|
2011-03-29 11:51:15 -04:00
|
|
|
extern dictType clusterNodesDictType;
|
2011-07-13 09:38:03 -04:00
|
|
|
extern dictType dbDictType;
|
2012-11-22 09:50:00 -05:00
|
|
|
extern dictType shaScriptObjectDictType;
|
2010-06-21 18:07:48 -04:00
|
|
|
extern double R_Zero, R_PosInf, R_NegInf, R_Nan;
|
2012-03-27 12:18:57 -04:00
|
|
|
extern dictType hashDictType;
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/*-----------------------------------------------------------------------------
|
|
|
|
* Functions prototypes
|
|
|
|
*----------------------------------------------------------------------------*/
|
|
|
|
|
2011-02-25 13:11:25 -05:00
|
|
|
/* Utils */
|
|
|
|
long long ustime(void);
|
2011-11-08 18:03:03 -05:00
|
|
|
long long mstime(void);
|
2012-03-08 04:08:44 -05:00
|
|
|
void getRandomHexChars(char *p, unsigned int len);
|
2012-04-09 06:20:47 -04:00
|
|
|
uint64_t crc64(uint64_t crc, const unsigned char *s, uint64_t l);
|
2012-04-07 06:11:23 -04:00
|
|
|
void exitFromChild(int retcode);
|
2013-02-22 13:18:30 -05:00
|
|
|
long popcount(void *s, long count);
|
2013-02-26 05:52:12 -05:00
|
|
|
void redisSetProcTitle(char *title);
|
2011-02-25 13:11:25 -05:00
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
/* networking.c -- Networking and Client related operations */
|
|
|
|
redisClient *createClient(int fd);
|
|
|
|
void closeTimedoutClients(void);
|
|
|
|
void freeClient(redisClient *c);
|
2013-01-30 12:33:16 -05:00
|
|
|
void freeClientAsync(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void resetClient(redisClient *c);
|
|
|
|
void sendReplyToClient(aeEventLoop *el, int fd, void *privdata, int mask);
|
|
|
|
void addReply(redisClient *c, robj *obj);
|
2010-08-30 10:02:06 -04:00
|
|
|
void *addDeferredMultiBulkLength(redisClient *c);
|
|
|
|
void setDeferredMultiBulkLength(redisClient *c, void *node, long length);
|
2010-06-21 18:07:48 -04:00
|
|
|
void addReplySds(redisClient *c, sds s);
|
|
|
|
void processInputBuffer(redisClient *c);
|
2010-10-13 12:34:24 -04:00
|
|
|
void acceptTcpHandler(aeEventLoop *el, int fd, void *privdata, int mask);
|
|
|
|
void acceptUnixHandler(aeEventLoop *el, int fd, void *privdata, int mask);
|
2010-06-21 18:07:48 -04:00
|
|
|
void readQueryFromClient(aeEventLoop *el, int fd, void *privdata, int mask);
|
|
|
|
void addReplyBulk(redisClient *c, robj *obj);
|
|
|
|
void addReplyBulkCString(redisClient *c, char *s);
|
2010-12-07 10:33:13 -05:00
|
|
|
void addReplyBulkCBuffer(redisClient *c, void *p, size_t len);
|
|
|
|
void addReplyBulkLongLong(redisClient *c, long long ll);
|
2010-06-21 18:07:48 -04:00
|
|
|
void acceptHandler(aeEventLoop *el, int fd, void *privdata, int mask);
|
|
|
|
void addReply(redisClient *c, robj *obj);
|
|
|
|
void addReplySds(redisClient *c, sds s);
|
2010-09-02 13:52:24 -04:00
|
|
|
void addReplyError(redisClient *c, char *err);
|
|
|
|
void addReplyStatus(redisClient *c, char *status);
|
2010-06-21 18:07:48 -04:00
|
|
|
void addReplyDouble(redisClient *c, double d);
|
|
|
|
void addReplyLongLong(redisClient *c, long long ll);
|
2010-09-02 06:38:34 -04:00
|
|
|
void addReplyMultiBulkLen(redisClient *c, long length);
|
2011-12-30 13:34:40 -05:00
|
|
|
void copyClientOutputBuffer(redisClient *dst, redisClient *src);
|
2010-06-21 18:07:48 -04:00
|
|
|
void *dupClientReplyValue(void *o);
|
2011-01-14 04:20:02 -05:00
|
|
|
void getClientsMaxBuffers(unsigned long *longest_output_list,
|
|
|
|
unsigned long *biggest_input_buffer);
|
2011-11-21 10:17:51 -05:00
|
|
|
sds getClientInfoString(redisClient *client);
|
2011-11-24 09:04:42 -05:00
|
|
|
sds getAllClientsInfoString(void);
|
2011-06-20 11:07:18 -04:00
|
|
|
void rewriteClientCommandVector(redisClient *c, int argc, ...);
|
2011-07-13 09:38:03 -04:00
|
|
|
void rewriteClientCommandArgument(redisClient *c, int i, robj *newval);
|
2011-12-25 10:32:54 -05:00
|
|
|
unsigned long getClientOutputBufferMemoryUsage(redisClient *c);
|
2012-01-23 10:12:37 -05:00
|
|
|
void freeClientsInAsyncFreeQueue(void);
|
2012-01-24 03:32:39 -05:00
|
|
|
void asyncCloseClientOnOutputBufferLimitReached(redisClient *c);
|
2012-01-24 04:43:30 -05:00
|
|
|
int getClientLimitClassByName(char *name);
|
|
|
|
char *getClientLimitClassName(int class);
|
2012-02-06 10:56:42 -05:00
|
|
|
void flushSlavesOutputBuffers(void);
|
2012-03-29 03:24:02 -04:00
|
|
|
void disconnectSlaves(void);
|
2010-06-21 18:07:48 -04:00
|
|
|
|
2010-09-02 13:52:24 -04:00
|
|
|
#ifdef __GNUC__
|
|
|
|
void addReplyErrorFormat(redisClient *c, const char *fmt, ...)
|
|
|
|
__attribute__((format(printf, 2, 3)));
|
|
|
|
void addReplyStatusFormat(redisClient *c, const char *fmt, ...)
|
|
|
|
__attribute__((format(printf, 2, 3)));
|
|
|
|
#else
|
|
|
|
void addReplyErrorFormat(redisClient *c, const char *fmt, ...);
|
|
|
|
void addReplyStatusFormat(redisClient *c, const char *fmt, ...);
|
|
|
|
#endif
|
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
/* List data type */
|
|
|
|
void listTypeTryConversion(robj *subject, robj *value);
|
|
|
|
void listTypePush(robj *subject, robj *value, int where);
|
|
|
|
robj *listTypePop(robj *subject, int where);
|
|
|
|
unsigned long listTypeLength(robj *subject);
|
2012-01-31 04:35:52 -05:00
|
|
|
listTypeIterator *listTypeInitIterator(robj *subject, long index, unsigned char direction);
|
2010-06-21 18:07:48 -04:00
|
|
|
void listTypeReleaseIterator(listTypeIterator *li);
|
|
|
|
int listTypeNext(listTypeIterator *li, listTypeEntry *entry);
|
|
|
|
robj *listTypeGet(listTypeEntry *entry);
|
|
|
|
void listTypeInsert(listTypeEntry *entry, robj *value, int where);
|
|
|
|
int listTypeEqual(listTypeEntry *entry, robj *o);
|
|
|
|
void listTypeDelete(listTypeEntry *entry);
|
|
|
|
void listTypeConvert(robj *subject, int enc);
|
|
|
|
void unblockClientWaitingData(redisClient *c);
|
A reimplementation of blocking operation internals.
Redis provides support for blocking operations such as BLPOP or BRPOP.
This operations are identical to normal LPOP and RPOP operations as long
as there are elements in the target list, but if the list is empty they
block waiting for new data to arrive to the list.
All the clients blocked waiting for th same list are served in a FIFO
way, so the first that blocked is the first to be served when there is
more data pushed by another client into the list.
The previous implementation of blocking operations was conceived to
serve clients in the context of push operations. For for instance:
1) There is a client "A" blocked on list "foo".
2) The client "B" performs `LPUSH foo somevalue`.
3) The client "A" is served in the context of the "B" LPUSH,
synchronously.
Processing things in a synchronous way was useful as if "A" pushes a
value that is served by "B", from the point of view of the database is a
NOP (no operation) thing, that is, nothing is replicated, nothing is
written in the AOF file, and so forth.
However later we implemented two things:
1) Variadic LPUSH that could add multiple values to a list in the
context of a single call.
2) BRPOPLPUSH that was a version of BRPOP that also provided a "PUSH"
side effect when receiving data.
This forced us to make the synchronous implementation more complex. If
client "B" is waiting for data, and "A" pushes three elemnents in a
single call, we needed to propagate an LPUSH with a missing argument
in the AOF and replication link. We also needed to make sure to
replicate the LPUSH side of BRPOPLPUSH, but only if in turn did not
happened to serve another blocking client into another list ;)
This were complex but with a few of mutually recursive functions
everything worked as expected... until one day we introduced scripting
in Redis.
Scripting + synchronous blocking operations = Issue #614.
Basically you can't "rewrite" a script to have just a partial effect on
the replicas and AOF file if the script happened to serve a few blocked
clients.
The solution to all this problems, implemented by this commit, is to
change the way we serve blocked clients. Instead of serving the blocked
clients synchronously, in the context of the command performing the PUSH
operation, it is now an asynchronous and iterative process:
1) If a key that has clients blocked waiting for data is the subject of
a list push operation, We simply mark keys as "ready" and put it into a
queue.
2) Every command pushing stuff on lists, as a variadic LPUSH, a script,
or whatever it is, is replicated verbatim without any rewriting.
3) Every time a Redis command, a MULTI/EXEC block, or a script,
completed its execution, we run the list of keys ready to serve blocked
clients (as more data arrived), and process this list serving the
blocked clients.
4) As a result of "3" maybe more keys are ready again for other clients
(as a result of BRPOPLPUSH we may have push operations), so we iterate
back to step "3" if it's needed.
The new code has a much simpler semantics, and a simpler to understand
implementation, with the disadvantage of not being able to "optmize out"
a PUSH+BPOP as a No OP.
This commit will be tested with care before the final merge, more tests
will be added likely.
2012-09-04 04:37:49 -04:00
|
|
|
void handleClientsBlockedOnLists(void);
|
2010-06-21 18:07:48 -04:00
|
|
|
void popGenericCommand(redisClient *c, int where);
|
|
|
|
|
|
|
|
/* MULTI/EXEC/WATCH... */
|
|
|
|
void unwatchAllKeys(redisClient *c);
|
|
|
|
void initClientMultiState(redisClient *c);
|
|
|
|
void freeClientMultiState(redisClient *c);
|
2011-07-08 06:59:30 -04:00
|
|
|
void queueMultiCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void touchWatchedKey(redisDb *db, robj *key);
|
|
|
|
void touchWatchedKeysOnFlush(int dbid);
|
2012-03-20 12:32:48 -04:00
|
|
|
void discardTransaction(redisClient *c);
|
2012-11-15 14:11:05 -05:00
|
|
|
void flagTransaction(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* Redis object implementation */
|
2013-01-24 05:27:10 -05:00
|
|
|
void decrRefCount(robj *o);
|
|
|
|
void decrRefCountVoid(void *o);
|
2010-06-21 18:07:48 -04:00
|
|
|
void incrRefCount(robj *o);
|
2011-07-13 09:38:03 -04:00
|
|
|
robj *resetRefCount(robj *obj);
|
2010-06-21 18:07:48 -04:00
|
|
|
void freeStringObject(robj *o);
|
|
|
|
void freeListObject(robj *o);
|
|
|
|
void freeSetObject(robj *o);
|
|
|
|
void freeZsetObject(robj *o);
|
|
|
|
void freeHashObject(robj *o);
|
|
|
|
robj *createObject(int type, void *ptr);
|
|
|
|
robj *createStringObject(char *ptr, size_t len);
|
|
|
|
robj *dupStringObject(robj *o);
|
2011-04-27 07:24:52 -04:00
|
|
|
int isObjectRepresentableAsLongLong(robj *o, long long *llongval);
|
2010-06-21 18:07:48 -04:00
|
|
|
robj *tryObjectEncoding(robj *o);
|
|
|
|
robj *getDecodedObject(robj *o);
|
|
|
|
size_t stringObjectLen(robj *o);
|
|
|
|
robj *createStringObjectFromLongLong(long long value);
|
2011-11-12 13:27:35 -05:00
|
|
|
robj *createStringObjectFromLongDouble(long double value);
|
2010-06-21 18:07:48 -04:00
|
|
|
robj *createListObject(void);
|
|
|
|
robj *createZiplistObject(void);
|
|
|
|
robj *createSetObject(void);
|
2010-07-02 13:57:12 -04:00
|
|
|
robj *createIntsetObject(void);
|
2010-06-21 18:07:48 -04:00
|
|
|
robj *createHashObject(void);
|
|
|
|
robj *createZsetObject(void);
|
2011-03-08 10:08:52 -05:00
|
|
|
robj *createZsetZiplistObject(void);
|
2010-06-21 18:07:48 -04:00
|
|
|
int getLongFromObjectOrReply(redisClient *c, robj *o, long *target, const char *msg);
|
|
|
|
int checkType(redisClient *c, robj *o, int type);
|
|
|
|
int getLongLongFromObjectOrReply(redisClient *c, robj *o, long long *target, const char *msg);
|
|
|
|
int getDoubleFromObjectOrReply(redisClient *c, robj *o, double *target, const char *msg);
|
|
|
|
int getLongLongFromObject(robj *o, long long *target);
|
2011-11-12 13:27:35 -05:00
|
|
|
int getLongDoubleFromObject(robj *o, long double *target);
|
|
|
|
int getLongDoubleFromObjectOrReply(redisClient *c, robj *o, long double *target, const char *msg);
|
2010-06-21 18:07:48 -04:00
|
|
|
char *strEncoding(int encoding);
|
|
|
|
int compareStringObjects(robj *a, robj *b);
|
|
|
|
int equalStringObjects(robj *a, robj *b);
|
2010-10-14 07:52:58 -04:00
|
|
|
unsigned long estimateObjectIdleTime(robj *o);
|
2010-06-21 18:07:48 -04:00
|
|
|
|
2010-10-24 10:22:52 -04:00
|
|
|
/* Synchronous I/O with timeout */
|
2012-03-31 05:21:45 -04:00
|
|
|
ssize_t syncWrite(int fd, char *ptr, ssize_t size, long long timeout);
|
|
|
|
ssize_t syncRead(int fd, char *ptr, ssize_t size, long long timeout);
|
|
|
|
ssize_t syncReadLine(int fd, char *ptr, ssize_t size, long long timeout);
|
2010-10-24 10:22:52 -04:00
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
/* Replication */
|
|
|
|
void replicationFeedSlaves(list *slaves, int dictid, robj **argv, int argc);
|
2012-03-07 06:12:15 -05:00
|
|
|
void replicationFeedMonitors(redisClient *c, list *monitors, int dictid, robj **argv, int argc);
|
2010-06-21 18:07:48 -04:00
|
|
|
void updateSlavesWaitingBgsave(int bgsaveerr);
|
2010-11-04 12:29:53 -04:00
|
|
|
void replicationCron(void);
|
2013-01-30 12:33:16 -05:00
|
|
|
void replicationHandleMasterDisconnection(void);
|
|
|
|
void replicationCacheMaster(redisClient *c);
|
|
|
|
void resizeReplicationBacklog(long long newsize);
|
2013-03-04 07:22:21 -05:00
|
|
|
void replicationSetMaster(char *ip, int port);
|
|
|
|
void replicationUnsetMaster(void);
|
2010-06-21 18:07:48 -04:00
|
|
|
|
2010-11-08 05:52:03 -05:00
|
|
|
/* Generic persistence functions */
|
|
|
|
void startLoading(FILE *fp);
|
|
|
|
void loadingProgress(off_t pos);
|
|
|
|
void stopLoading(void);
|
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
/* RDB persistence */
|
2011-05-13 11:31:00 -04:00
|
|
|
#include "rdb.h"
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* AOF persistence */
|
2011-09-16 06:36:17 -04:00
|
|
|
void flushAppendOnlyFile(int force);
|
2010-06-21 18:07:48 -04:00
|
|
|
void feedAppendOnlyFile(struct redisCommand *cmd, int dictid, robj **argv, int argc);
|
|
|
|
void aofRemoveTempFile(pid_t childpid);
|
|
|
|
int rewriteAppendOnlyFileBackground(void);
|
|
|
|
int loadAppendOnlyFile(char *filename);
|
|
|
|
void stopAppendOnly(void);
|
|
|
|
int startAppendOnly(void);
|
2011-01-07 12:15:14 -05:00
|
|
|
void backgroundRewriteDoneHandler(int exitcode, int bysignal);
|
Allow an AOF rewrite buffer > 2GB (Fix for issue #504).
During the AOF rewrite process, the parent process needs to accumulate
the new writes in an in-memory buffer: when the child will terminate the
AOF rewriting process this buffer (that ist the difference between the
dataset when the rewrite was started, and the current dataset) is
flushed to the new AOF file.
We used to implement this buffer using an sds.c string, but sds.c has a
2GB limit. Sometimes the dataset can be big enough, the amount of writes
so high, and the rewrite process slow enough that we overflow the 2GB
limit, causing a crash, documented on github by issue #504.
In order to prevent this from happening, this commit introduces a new
system to accumulate writes, implemented by a linked list of blocks of
10 MB each, so that we also avoid paying the reallocation cost.
Note that theoretically modern operating systems may implement realloc()
simply as a remaping of the old pages, thus with very good performances,
see for instance the mremap() syscall on Linux. However this is not
always true, and jemalloc by default avoids doing this because there are
issues with the current implementation of mremap().
For this reason we are using a linked list of blocks instead of a single
block that gets reallocated again and again.
The changes in this commit lacks testing, that will be performed before
merging into the unstable branch. This fix will not enter 2.4 because it
is too invasive. However 2.4 will log a warning when the AOF rewrite
buffer is near to the 2GB limit.
2012-05-22 07:03:41 -04:00
|
|
|
void aofRewriteBufferReset(void);
|
|
|
|
unsigned long aofRewriteBufferSize(void);
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* Sorted sets data type */
|
2011-04-28 13:00:33 -04:00
|
|
|
|
|
|
|
/* Struct to hold a inclusive/exclusive range spec. */
|
|
|
|
typedef struct {
|
|
|
|
double min, max;
|
|
|
|
int minex, maxex; /* are min or max exclusive? */
|
|
|
|
} zrangespec;
|
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
zskiplist *zslCreate(void);
|
|
|
|
void zslFree(zskiplist *zsl);
|
2010-08-03 14:49:53 -04:00
|
|
|
zskiplistNode *zslInsert(zskiplist *zsl, double score, robj *obj);
|
2011-03-11 11:06:07 -05:00
|
|
|
unsigned char *zzlInsert(unsigned char *zl, robj *ele, double score);
|
2011-04-28 13:00:33 -04:00
|
|
|
int zslDelete(zskiplist *zsl, double score, robj *obj);
|
|
|
|
zskiplistNode *zslFirstInRange(zskiplist *zsl, zrangespec range);
|
2013-02-25 06:37:50 -05:00
|
|
|
zskiplistNode *zslLastInRange(zskiplist *zsl, zrangespec range);
|
2011-03-14 08:30:06 -04:00
|
|
|
double zzlGetScore(unsigned char *sptr);
|
|
|
|
void zzlNext(unsigned char *zl, unsigned char **eptr, unsigned char **sptr);
|
|
|
|
void zzlPrev(unsigned char *zl, unsigned char **eptr, unsigned char **sptr);
|
2011-03-10 11:50:13 -05:00
|
|
|
unsigned int zsetLength(robj *zobj);
|
|
|
|
void zsetConvert(robj *zobj, int encoding);
|
2013-02-25 06:37:50 -05:00
|
|
|
unsigned long zslGetRank(zskiplist *zsl, double score, robj *o);
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* Core functions */
|
2012-02-04 08:05:54 -05:00
|
|
|
int freeMemoryIfNeeded(void);
|
2010-06-21 18:07:48 -04:00
|
|
|
int processCommand(redisClient *c);
|
2011-03-06 11:49:22 -05:00
|
|
|
void setupSignalHandlers(void);
|
2010-11-03 06:23:59 -04:00
|
|
|
struct redisCommand *lookupCommand(sds name);
|
|
|
|
struct redisCommand *lookupCommandByCString(char *s);
|
2013-03-06 10:28:26 -05:00
|
|
|
struct redisCommand *lookupCommandOrOriginal(sds name);
|
2012-02-02 10:30:52 -05:00
|
|
|
void call(redisClient *c, int flags);
|
2012-02-28 10:20:41 -05:00
|
|
|
void propagate(struct redisCommand *cmd, int dbid, robj **argv, int argc, int flags);
|
2012-02-28 12:03:08 -05:00
|
|
|
void alsoPropagate(struct redisCommand *cmd, int dbid, robj **argv, int argc, int target);
|
2010-06-21 18:07:48 -04:00
|
|
|
int prepareForShutdown();
|
2013-02-27 06:27:15 -05:00
|
|
|
#ifdef __GNUC__
|
|
|
|
void redisLog(int level, const char *fmt, ...)
|
|
|
|
__attribute__((format(printf, 2, 3)));
|
|
|
|
#else
|
2010-06-21 18:07:48 -04:00
|
|
|
void redisLog(int level, const char *fmt, ...);
|
2013-02-27 06:27:15 -05:00
|
|
|
#endif
|
2011-05-16 12:32:03 -04:00
|
|
|
void redisLogRaw(int level, const char *msg);
|
2012-03-28 07:45:39 -04:00
|
|
|
void redisLogFromHandler(int level, const char *msg);
|
2010-06-21 18:07:48 -04:00
|
|
|
void usage();
|
|
|
|
void updateDictResizePolicy(void);
|
|
|
|
int htNeedsResize(dict *dict);
|
|
|
|
void oom(const char *msg);
|
2010-11-03 06:23:59 -04:00
|
|
|
void populateCommandTable(void);
|
2011-01-24 04:56:06 -05:00
|
|
|
void resetCommandTableStats(void);
|
2010-06-21 18:07:48 -04:00
|
|
|
|
2010-07-02 13:57:12 -04:00
|
|
|
/* Set data type */
|
|
|
|
robj *setTypeCreate(robj *value);
|
|
|
|
int setTypeAdd(robj *subject, robj *value);
|
|
|
|
int setTypeRemove(robj *subject, robj *value);
|
|
|
|
int setTypeIsMember(robj *subject, robj *value);
|
2010-08-21 05:25:13 -04:00
|
|
|
setTypeIterator *setTypeInitIterator(robj *subject);
|
|
|
|
void setTypeReleaseIterator(setTypeIterator *si);
|
2010-12-09 15:11:56 -05:00
|
|
|
int setTypeNext(setTypeIterator *si, robj **objele, int64_t *llele);
|
|
|
|
robj *setTypeNextObject(setTypeIterator *si);
|
2010-12-10 09:47:01 -05:00
|
|
|
int setTypeRandomElement(robj *setobj, robj **objele, int64_t *llele);
|
2010-07-02 13:57:12 -04:00
|
|
|
unsigned long setTypeSize(robj *subject);
|
|
|
|
void setTypeConvert(robj *subject, int enc);
|
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
/* Hash data type */
|
2012-01-03 01:14:10 -05:00
|
|
|
void hashTypeConvert(robj *o, int enc);
|
2010-06-21 18:07:48 -04:00
|
|
|
void hashTypeTryConversion(robj *subject, robj **argv, int start, int end);
|
|
|
|
void hashTypeTryObjectEncoding(robj *subject, robj **o1, robj **o2);
|
2010-12-10 09:17:55 -05:00
|
|
|
robj *hashTypeGetObject(robj *o, robj *key);
|
2010-06-21 18:07:48 -04:00
|
|
|
int hashTypeExists(robj *o, robj *key);
|
|
|
|
int hashTypeSet(robj *o, robj *key, robj *value);
|
|
|
|
int hashTypeDelete(robj *o, robj *key);
|
|
|
|
unsigned long hashTypeLength(robj *o);
|
|
|
|
hashTypeIterator *hashTypeInitIterator(robj *subject);
|
|
|
|
void hashTypeReleaseIterator(hashTypeIterator *hi);
|
|
|
|
int hashTypeNext(hashTypeIterator *hi);
|
2012-01-03 01:14:10 -05:00
|
|
|
void hashTypeCurrentFromZiplist(hashTypeIterator *hi, int what,
|
|
|
|
unsigned char **vstr,
|
|
|
|
unsigned int *vlen,
|
|
|
|
long long *vll);
|
|
|
|
void hashTypeCurrentFromHashTable(hashTypeIterator *hi, int what, robj **dst);
|
2010-12-14 06:10:51 -05:00
|
|
|
robj *hashTypeCurrentObject(hashTypeIterator *hi, int what);
|
2010-06-21 18:07:48 -04:00
|
|
|
robj *hashTypeLookupWriteOrCreate(redisClient *c, robj *key);
|
|
|
|
|
|
|
|
/* Pub / Sub */
|
|
|
|
int pubsubUnsubscribeAllChannels(redisClient *c, int notify);
|
|
|
|
int pubsubUnsubscribeAllPatterns(redisClient *c, int notify);
|
|
|
|
void freePubsubPattern(void *p);
|
|
|
|
int listMatchPubsubPattern(void *a, void *b);
|
2011-10-07 10:34:16 -04:00
|
|
|
int pubsubPublishMessage(robj *channel, robj *message);
|
2013-01-25 07:19:08 -05:00
|
|
|
|
|
|
|
/* Keyspace events notification */
|
|
|
|
void notifyKeyspaceEvent(int type, char *event, robj *key, int dbid);
|
|
|
|
int keyspaceEventsStringToFlags(char *classes);
|
|
|
|
sds keyspaceEventsFlagsToString(int flags);
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* Configuration */
|
2011-12-01 07:44:53 -05:00
|
|
|
void loadServerConfig(char *filename, char *options);
|
2010-06-21 18:07:48 -04:00
|
|
|
void appendServerSaveParams(time_t seconds, int changes);
|
|
|
|
void resetServerSaveParams();
|
|
|
|
|
|
|
|
/* db.c -- Keyspace access API */
|
|
|
|
int removeExpire(redisDb *db, robj *key);
|
2010-08-02 12:13:39 -04:00
|
|
|
void propagateExpire(redisDb *db, robj *key);
|
2010-06-21 18:07:48 -04:00
|
|
|
int expireIfNeeded(redisDb *db, robj *key);
|
2011-11-09 10:51:19 -05:00
|
|
|
long long getExpire(redisDb *db, robj *key);
|
|
|
|
void setExpire(redisDb *db, robj *key, long long when);
|
2010-06-21 18:07:48 -04:00
|
|
|
robj *lookupKey(redisDb *db, robj *key);
|
|
|
|
robj *lookupKeyRead(redisDb *db, robj *key);
|
|
|
|
robj *lookupKeyWrite(redisDb *db, robj *key);
|
|
|
|
robj *lookupKeyReadOrReply(redisClient *c, robj *key, robj *reply);
|
|
|
|
robj *lookupKeyWriteOrReply(redisClient *c, robj *key, robj *reply);
|
2011-06-14 09:34:27 -04:00
|
|
|
void dbAdd(redisDb *db, robj *key, robj *val);
|
|
|
|
void dbOverwrite(redisDb *db, robj *key, robj *val);
|
|
|
|
void setKey(redisDb *db, robj *key, robj *val);
|
2010-06-21 18:07:48 -04:00
|
|
|
int dbExists(redisDb *db, robj *key);
|
|
|
|
robj *dbRandomKey(redisDb *db);
|
|
|
|
int dbDelete(redisDb *db, robj *key);
|
|
|
|
long long emptyDb();
|
|
|
|
int selectDb(redisClient *c, int id);
|
2010-12-29 13:39:42 -05:00
|
|
|
void signalModifiedKey(redisDb *db, robj *key);
|
|
|
|
void signalFlushedDb(int dbid);
|
2013-02-25 05:24:42 -05:00
|
|
|
unsigned int getKeysInSlot(unsigned int hashslot, robj **keys, unsigned int count);
|
|
|
|
unsigned int countKeysInSlot(unsigned int hashslot);
|
2013-02-25 05:20:17 -05:00
|
|
|
int verifyClusterConfigWithData(void);
|
2010-06-21 18:07:48 -04:00
|
|
|
|
2011-03-23 13:09:17 -04:00
|
|
|
/* API to get key arguments from commands */
|
|
|
|
#define REDIS_GETKEYS_ALL 0
|
|
|
|
#define REDIS_GETKEYS_PRELOAD 1
|
|
|
|
int *getKeysFromCommand(struct redisCommand *cmd, robj **argv, int argc, int *numkeys, int flags);
|
|
|
|
void getKeysFreeResult(int *result);
|
|
|
|
int *noPreloadGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags);
|
|
|
|
int *renameGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags);
|
|
|
|
int *zunionInterGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags);
|
|
|
|
|
2011-03-29 11:51:15 -04:00
|
|
|
/* Cluster */
|
|
|
|
void clusterInit(void);
|
|
|
|
unsigned short crc16(const char *buf, int len);
|
|
|
|
unsigned int keyHashSlot(char *key, int keylen);
|
|
|
|
clusterNode *createClusterNode(char *nodename, int flags);
|
|
|
|
int clusterAddNode(clusterNode *node);
|
|
|
|
void clusterCron(void);
|
2011-05-05 05:13:21 -04:00
|
|
|
clusterNode *getNodeByQuery(redisClient *c, struct redisCommand *cmd, robj **argv, int argc, int *hashslot, int *ask);
|
2011-10-07 09:37:34 -04:00
|
|
|
void clusterPropagatePublish(robj *channel, robj *message);
|
2012-11-11 18:45:10 -05:00
|
|
|
void migrateCloseTimedoutSockets(void);
|
2011-03-29 11:51:15 -04:00
|
|
|
|
2012-07-23 06:54:52 -04:00
|
|
|
/* Sentinel */
|
|
|
|
void initSentinelConfig(void);
|
|
|
|
void initSentinel(void);
|
|
|
|
void sentinelTimer(void);
|
|
|
|
char *sentinelHandleConfiguration(char **argv, int argc);
|
|
|
|
|
2011-04-30 11:46:52 -04:00
|
|
|
/* Scripting */
|
|
|
|
void scriptingInit(void);
|
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
/* Git SHA1 */
|
|
|
|
char *redisGitSHA1(void);
|
|
|
|
char *redisGitDirty(void);
|
2012-11-29 08:20:08 -05:00
|
|
|
uint64_t redisBuildId(void);
|
2010-06-21 18:07:48 -04:00
|
|
|
|
|
|
|
/* Commands prototypes */
|
|
|
|
void authCommand(redisClient *c);
|
|
|
|
void pingCommand(redisClient *c);
|
|
|
|
void echoCommand(redisClient *c);
|
|
|
|
void setCommand(redisClient *c);
|
|
|
|
void setnxCommand(redisClient *c);
|
|
|
|
void setexCommand(redisClient *c);
|
2011-11-10 11:52:02 -05:00
|
|
|
void psetexCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void getCommand(redisClient *c);
|
|
|
|
void delCommand(redisClient *c);
|
|
|
|
void existsCommand(redisClient *c);
|
2010-12-09 10:39:33 -05:00
|
|
|
void setbitCommand(redisClient *c);
|
|
|
|
void getbitCommand(redisClient *c);
|
2010-12-14 08:20:51 -05:00
|
|
|
void setrangeCommand(redisClient *c);
|
2010-12-14 09:10:58 -05:00
|
|
|
void getrangeCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void incrCommand(redisClient *c);
|
|
|
|
void decrCommand(redisClient *c);
|
|
|
|
void incrbyCommand(redisClient *c);
|
|
|
|
void decrbyCommand(redisClient *c);
|
2011-11-12 13:27:35 -05:00
|
|
|
void incrbyfloatCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void selectCommand(redisClient *c);
|
|
|
|
void randomkeyCommand(redisClient *c);
|
|
|
|
void keysCommand(redisClient *c);
|
|
|
|
void dbsizeCommand(redisClient *c);
|
|
|
|
void lastsaveCommand(redisClient *c);
|
|
|
|
void saveCommand(redisClient *c);
|
|
|
|
void bgsaveCommand(redisClient *c);
|
|
|
|
void bgrewriteaofCommand(redisClient *c);
|
|
|
|
void shutdownCommand(redisClient *c);
|
|
|
|
void moveCommand(redisClient *c);
|
|
|
|
void renameCommand(redisClient *c);
|
|
|
|
void renamenxCommand(redisClient *c);
|
|
|
|
void lpushCommand(redisClient *c);
|
|
|
|
void rpushCommand(redisClient *c);
|
|
|
|
void lpushxCommand(redisClient *c);
|
|
|
|
void rpushxCommand(redisClient *c);
|
|
|
|
void linsertCommand(redisClient *c);
|
|
|
|
void lpopCommand(redisClient *c);
|
|
|
|
void rpopCommand(redisClient *c);
|
|
|
|
void llenCommand(redisClient *c);
|
|
|
|
void lindexCommand(redisClient *c);
|
|
|
|
void lrangeCommand(redisClient *c);
|
|
|
|
void ltrimCommand(redisClient *c);
|
|
|
|
void typeCommand(redisClient *c);
|
|
|
|
void lsetCommand(redisClient *c);
|
|
|
|
void saddCommand(redisClient *c);
|
|
|
|
void sremCommand(redisClient *c);
|
|
|
|
void smoveCommand(redisClient *c);
|
|
|
|
void sismemberCommand(redisClient *c);
|
|
|
|
void scardCommand(redisClient *c);
|
|
|
|
void spopCommand(redisClient *c);
|
|
|
|
void srandmemberCommand(redisClient *c);
|
|
|
|
void sinterCommand(redisClient *c);
|
|
|
|
void sinterstoreCommand(redisClient *c);
|
|
|
|
void sunionCommand(redisClient *c);
|
|
|
|
void sunionstoreCommand(redisClient *c);
|
|
|
|
void sdiffCommand(redisClient *c);
|
|
|
|
void sdiffstoreCommand(redisClient *c);
|
|
|
|
void syncCommand(redisClient *c);
|
|
|
|
void flushdbCommand(redisClient *c);
|
|
|
|
void flushallCommand(redisClient *c);
|
|
|
|
void sortCommand(redisClient *c);
|
|
|
|
void lremCommand(redisClient *c);
|
2010-11-08 08:43:21 -05:00
|
|
|
void rpoplpushCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void infoCommand(redisClient *c);
|
|
|
|
void mgetCommand(redisClient *c);
|
|
|
|
void monitorCommand(redisClient *c);
|
|
|
|
void expireCommand(redisClient *c);
|
|
|
|
void expireatCommand(redisClient *c);
|
2011-11-10 11:52:02 -05:00
|
|
|
void pexpireCommand(redisClient *c);
|
|
|
|
void pexpireatCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void getsetCommand(redisClient *c);
|
|
|
|
void ttlCommand(redisClient *c);
|
2011-11-10 11:52:02 -05:00
|
|
|
void pttlCommand(redisClient *c);
|
2010-08-03 08:19:20 -04:00
|
|
|
void persistCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void slaveofCommand(redisClient *c);
|
|
|
|
void debugCommand(redisClient *c);
|
|
|
|
void msetCommand(redisClient *c);
|
|
|
|
void msetnxCommand(redisClient *c);
|
|
|
|
void zaddCommand(redisClient *c);
|
|
|
|
void zincrbyCommand(redisClient *c);
|
|
|
|
void zrangeCommand(redisClient *c);
|
|
|
|
void zrangebyscoreCommand(redisClient *c);
|
2010-09-16 08:35:25 -04:00
|
|
|
void zrevrangebyscoreCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void zcountCommand(redisClient *c);
|
|
|
|
void zrevrangeCommand(redisClient *c);
|
|
|
|
void zcardCommand(redisClient *c);
|
|
|
|
void zremCommand(redisClient *c);
|
|
|
|
void zscoreCommand(redisClient *c);
|
|
|
|
void zremrangebyscoreCommand(redisClient *c);
|
|
|
|
void multiCommand(redisClient *c);
|
|
|
|
void execCommand(redisClient *c);
|
|
|
|
void discardCommand(redisClient *c);
|
|
|
|
void blpopCommand(redisClient *c);
|
|
|
|
void brpopCommand(redisClient *c);
|
2010-11-08 13:25:59 -05:00
|
|
|
void brpoplpushCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void appendCommand(redisClient *c);
|
2010-07-27 04:09:26 -04:00
|
|
|
void strlenCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void zrankCommand(redisClient *c);
|
|
|
|
void zrevrankCommand(redisClient *c);
|
|
|
|
void hsetCommand(redisClient *c);
|
|
|
|
void hsetnxCommand(redisClient *c);
|
|
|
|
void hgetCommand(redisClient *c);
|
|
|
|
void hmsetCommand(redisClient *c);
|
|
|
|
void hmgetCommand(redisClient *c);
|
|
|
|
void hdelCommand(redisClient *c);
|
|
|
|
void hlenCommand(redisClient *c);
|
|
|
|
void zremrangebyrankCommand(redisClient *c);
|
|
|
|
void zunionstoreCommand(redisClient *c);
|
|
|
|
void zinterstoreCommand(redisClient *c);
|
|
|
|
void hkeysCommand(redisClient *c);
|
|
|
|
void hvalsCommand(redisClient *c);
|
|
|
|
void hgetallCommand(redisClient *c);
|
|
|
|
void hexistsCommand(redisClient *c);
|
|
|
|
void configCommand(redisClient *c);
|
|
|
|
void hincrbyCommand(redisClient *c);
|
2011-11-15 09:09:39 -05:00
|
|
|
void hincrbyfloatCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
void subscribeCommand(redisClient *c);
|
|
|
|
void unsubscribeCommand(redisClient *c);
|
|
|
|
void psubscribeCommand(redisClient *c);
|
|
|
|
void punsubscribeCommand(redisClient *c);
|
|
|
|
void publishCommand(redisClient *c);
|
|
|
|
void watchCommand(redisClient *c);
|
|
|
|
void unwatchCommand(redisClient *c);
|
2011-03-29 11:51:15 -04:00
|
|
|
void clusterCommand(redisClient *c);
|
|
|
|
void restoreCommand(redisClient *c);
|
|
|
|
void migrateCommand(redisClient *c);
|
2011-10-17 11:35:23 -04:00
|
|
|
void askingCommand(redisClient *c);
|
2011-04-01 12:59:28 -04:00
|
|
|
void dumpCommand(redisClient *c);
|
2011-04-06 06:19:45 -04:00
|
|
|
void objectCommand(redisClient *c);
|
2011-04-21 09:38:02 -04:00
|
|
|
void clientCommand(redisClient *c);
|
2011-04-30 11:46:52 -04:00
|
|
|
void evalCommand(redisClient *c);
|
2011-05-13 16:02:38 -04:00
|
|
|
void evalShaCommand(redisClient *c);
|
2011-10-24 16:47:00 -04:00
|
|
|
void scriptCommand(redisClient *c);
|
2012-03-07 04:38:01 -05:00
|
|
|
void timeCommand(redisClient *c);
|
New commands: BITOP and BITCOUNT.
The motivation for this new commands is to be search in the usage of
Redis for real time statistics. See the article "Fast real time metrics
using Redis".
http://blog.getspool.com/2011/11/29/fast-easy-realtime-metrics-using-redis-bitmaps/
In general Redis strings when used as bitmaps using the SETBIT/GETBIT
command provide a very space-efficient and fast way to store statistics.
For instance in a web application with users, every user can be
associated with a key that shows every day in which the user visited the
web service. This information can be really valuable to extract user
behaviour information.
With Redis bitmaps doing this is very simple just saying that a given
day is 0 (the data the service was put online) and all the next days are
1, 2, 3, and so forth. So with SETBIT it is possible to set the bit
corresponding to the current day every time the user visits the site.
It is possible to take the count of the bit sets on the run, this is
extremely easy using a Lua script. However a fast bit count native
operation can be useful, especially if it can operate on ranges, or when
the string is small like in the case of days (even if you consider many
years it is still extremely little data).
For this reason BITOP was introduced. The command counts the number of
bits set to 1 in a string, with optional range:
BITCOUNT key [start end]
The start/end parameters are similar to GETRANGE. If omitted the whole
string is tested.
Population counting is more useful when bit-level operations like AND,
OR and XOR are avaialble. For instance I can test multiple users to see
the number of days three users visited the site at the same time. To do
this we can take the AND of all the bitmaps, and then count the set bits.
For this reason the BITOP command was introduced:
BITOP [AND|OR|XOR|NOT] dest_key src_key1 src_key2 src_key3 ... src_keyN
In the special case of NOT (that inverts the bits) only one source key
can be passed.
The judicious use of BITCOUNT and BITOP combined can lead to interesting
use cases with very space efficient representation of data.
The implementation provided is still not tested and optimized for speed,
next commits will introduce unit tests. Later the implementation will be
profiled to see if it is possible to gain an important amount of speed
without making the code much more complex.
2012-05-16 10:23:09 -04:00
|
|
|
void bitopCommand(redisClient *c);
|
|
|
|
void bitcountCommand(redisClient *c);
|
2012-06-26 03:47:47 -04:00
|
|
|
void replconfCommand(redisClient *c);
|
2010-06-21 18:07:48 -04:00
|
|
|
|
2010-07-27 03:36:42 -04:00
|
|
|
#if defined(__GNUC__)
|
|
|
|
void *calloc(size_t count, size_t size) __attribute__ ((deprecated));
|
|
|
|
void free(void *ptr) __attribute__ ((deprecated));
|
|
|
|
void *malloc(size_t size) __attribute__ ((deprecated));
|
|
|
|
void *realloc(void *ptr, size_t size) __attribute__ ((deprecated));
|
|
|
|
#endif
|
|
|
|
|
2011-10-04 11:22:29 -04:00
|
|
|
/* Debugging stuff */
|
2011-10-04 12:05:26 -04:00
|
|
|
void _redisAssertWithInfo(redisClient *c, robj *o, char *estr, char *file, int line);
|
2011-10-04 11:22:29 -04:00
|
|
|
void _redisAssert(char *estr, char *file, int line);
|
|
|
|
void _redisPanic(char *msg, char *file, int line);
|
2011-11-24 09:47:26 -05:00
|
|
|
void bugReportStart(void);
|
2012-01-12 10:02:57 -05:00
|
|
|
void redisLogObjectDebugInfo(robj *o);
|
2012-01-20 06:20:45 -05:00
|
|
|
void sigsegvHandler(int sig, siginfo_t *info, void *secret);
|
|
|
|
sds genRedisInfoString(char *section);
|
2012-03-27 05:47:51 -04:00
|
|
|
void enableWatchdog(int period);
|
|
|
|
void disableWatchdog(void);
|
|
|
|
void watchdogScheduleSignal(int period);
|
2012-06-11 17:44:34 -04:00
|
|
|
void redisLogHexDump(int level, char *descr, void *value, size_t len);
|
2012-07-23 06:54:52 -04:00
|
|
|
|
|
|
|
#define redisDebug(fmt, ...) \
|
|
|
|
printf("DEBUG %s:%d > " fmt "\n", __FILE__, __LINE__, __VA_ARGS__)
|
|
|
|
#define redisDebugMark() \
|
|
|
|
printf("-- MARK %s:%d --\n", __FILE__, __LINE__)
|
|
|
|
|
2010-06-21 18:07:48 -04:00
|
|
|
#endif
|