mirror of
https://codeberg.org/redict/redict.git
synced 2025-01-22 08:08:53 -05:00
6357 lines
207 KiB
C
6357 lines
207 KiB
C
/*
|
|
* Copyright (c) 2006-2009, 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.
|
|
*/
|
|
|
|
#define REDIS_VERSION "1.1.93"
|
|
|
|
#include "fmacros.h"
|
|
#include "config.h"
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <time.h>
|
|
#include <unistd.h>
|
|
#define __USE_POSIX199309
|
|
#include <signal.h>
|
|
|
|
#ifdef HAVE_BACKTRACE
|
|
#include <execinfo.h>
|
|
#include <ucontext.h>
|
|
#endif /* HAVE_BACKTRACE */
|
|
|
|
#include <sys/wait.h>
|
|
#include <errno.h>
|
|
#include <assert.h>
|
|
#include <ctype.h>
|
|
#include <stdarg.h>
|
|
#include <inttypes.h>
|
|
#include <arpa/inet.h>
|
|
#include <sys/stat.h>
|
|
#include <fcntl.h>
|
|
#include <sys/time.h>
|
|
#include <sys/resource.h>
|
|
#include <sys/uio.h>
|
|
#include <limits.h>
|
|
#include <math.h>
|
|
|
|
#if defined(__sun)
|
|
#include "solarisfixes.h"
|
|
#endif
|
|
|
|
#include "redis.h"
|
|
#include "ae.h" /* Event driven programming library */
|
|
#include "sds.h" /* Dynamic safe strings */
|
|
#include "anet.h" /* Networking the easy way */
|
|
#include "dict.h" /* Hash tables */
|
|
#include "adlist.h" /* Linked lists */
|
|
#include "zmalloc.h" /* total memory usage aware version of malloc/free */
|
|
#include "lzf.h" /* LZF compression library */
|
|
#include "pqsort.h" /* Partial qsort for SORT+LIMIT */
|
|
|
|
/* Error codes */
|
|
#define REDIS_OK 0
|
|
#define REDIS_ERR -1
|
|
|
|
/* Static server configuration */
|
|
#define REDIS_SERVERPORT 6379 /* TCP port */
|
|
#define REDIS_MAXIDLETIME (60*5) /* default client timeout */
|
|
#define REDIS_IOBUF_LEN 1024
|
|
#define REDIS_LOADBUF_LEN 1024
|
|
#define REDIS_STATIC_ARGS 4
|
|
#define REDIS_DEFAULT_DBNUM 16
|
|
#define REDIS_CONFIGLINE_MAX 1024
|
|
#define REDIS_OBJFREELIST_MAX 1000000 /* Max number of objects to cache */
|
|
#define REDIS_MAX_SYNC_TIME 60 /* Slave can't take more to sync */
|
|
#define REDIS_EXPIRELOOKUPS_PER_CRON 100 /* try to expire 100 keys/second */
|
|
#define REDIS_MAX_WRITE_PER_EVENT (1024*64)
|
|
#define REDIS_REQUEST_MAX_SIZE (1024*1024*256) /* max bytes in inline command */
|
|
|
|
/* If more then REDIS_WRITEV_THRESHOLD write packets are pending use writev */
|
|
#define REDIS_WRITEV_THRESHOLD 3
|
|
/* Max number of iovecs used for each writev call */
|
|
#define REDIS_WRITEV_IOVEC_COUNT 256
|
|
|
|
/* Hash table parameters */
|
|
#define REDIS_HT_MINFILL 10 /* Minimal hash table fill 10% */
|
|
|
|
/* Command flags */
|
|
#define REDIS_CMD_BULK 1 /* Bulk write command */
|
|
#define REDIS_CMD_INLINE 2 /* Inline command */
|
|
/* REDIS_CMD_DENYOOM reserves a longer comment: all the commands marked with
|
|
this flags will return an error when the 'maxmemory' option is set in the
|
|
config file and the server is using more than maxmemory bytes of memory.
|
|
In short this commands are denied on low memory conditions. */
|
|
#define REDIS_CMD_DENYOOM 4
|
|
|
|
/* Object types */
|
|
#define REDIS_STRING 0
|
|
#define REDIS_LIST 1
|
|
#define REDIS_SET 2
|
|
#define REDIS_ZSET 3
|
|
#define REDIS_HASH 4
|
|
|
|
/* Objects encoding */
|
|
#define REDIS_ENCODING_RAW 0 /* Raw representation */
|
|
#define REDIS_ENCODING_INT 1 /* Encoded as integer */
|
|
|
|
/* Object types only used for dumping to disk */
|
|
#define REDIS_EXPIRETIME 253
|
|
#define REDIS_SELECTDB 254
|
|
#define REDIS_EOF 255
|
|
|
|
/* 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
|
|
* 10|000000 [32 bit integer] => if it's 01, a full 32 bit len will follow
|
|
* 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.
|
|
*
|
|
* Lenghts up to 63 are stored using a single byte, most DB keys, and may
|
|
* 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 */
|
|
|
|
/* Client flags */
|
|
#define REDIS_CLOSE 1 /* This client connection should be closed ASAP */
|
|
#define REDIS_SLAVE 2 /* This client is a slave server */
|
|
#define REDIS_MASTER 4 /* This client is a master server */
|
|
#define REDIS_MONITOR 8 /* This client is a slave monitor, see MONITOR */
|
|
|
|
/* Slave replication state - slave side */
|
|
#define REDIS_REPL_NONE 0 /* No active replication */
|
|
#define REDIS_REPL_CONNECT 1 /* Must connect to master */
|
|
#define REDIS_REPL_CONNECTED 2 /* Connected to master */
|
|
|
|
/* Slave replication state - from the point of view of master
|
|
* Note that in SEND_BULK and ONLINE state the slave receives new updates
|
|
* 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. */
|
|
#define REDIS_REPL_WAIT_BGSAVE_START 3 /* master waits bgsave to start feeding it */
|
|
#define REDIS_REPL_WAIT_BGSAVE_END 4 /* master waits bgsave to start bulk DB transmission */
|
|
#define REDIS_REPL_SEND_BULK 5 /* master is sending the bulk DB */
|
|
#define REDIS_REPL_ONLINE 6 /* bulk DB already transmitted, receive updates */
|
|
|
|
/* 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_NOTICE 1
|
|
#define REDIS_WARNING 2
|
|
|
|
/* 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 */
|
|
#define APPENDFSYNC_NO 0
|
|
#define APPENDFSYNC_ALWAYS 1
|
|
#define APPENDFSYNC_EVERYSEC 2
|
|
|
|
/* We can print the stacktrace, so our assert is defined this way: */
|
|
#define redisAssert(_e) ((_e)?(void)0 : (_redisAssert(#_e),exit(1)))
|
|
static void _redisAssert(char *estr);
|
|
|
|
/*================================= Data types ============================== */
|
|
|
|
/* A redis object, that is a type able to hold a string / list / set */
|
|
typedef struct redisObject {
|
|
void *ptr;
|
|
unsigned char type;
|
|
unsigned char encoding;
|
|
unsigned char notused[2];
|
|
int refcount;
|
|
} robj;
|
|
|
|
/* Macro used to initalize a Redis object allocated on the stack.
|
|
* 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;
|
|
dict *expires;
|
|
int id;
|
|
} redisDb;
|
|
|
|
/* With multiplexing we need to take per-clinet state.
|
|
* Clients are taken in a liked list. */
|
|
typedef struct redisClient {
|
|
int fd;
|
|
redisDb *db;
|
|
int dictid;
|
|
sds querybuf;
|
|
robj **argv, **mbargv;
|
|
int argc, mbargc;
|
|
int bulklen; /* bulk read len. -1 if not in bulk read mode */
|
|
int multibulk; /* multi bulk command format active */
|
|
list *reply;
|
|
int sentlen;
|
|
time_t lastinteraction; /* time of the last interaction, used for timeout */
|
|
int flags; /* REDIS_CLOSE | REDIS_SLAVE | REDIS_MONITOR */
|
|
int slaveseldb; /* slave selected db, if this client is a slave */
|
|
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 */
|
|
} redisClient;
|
|
|
|
struct saveparam {
|
|
time_t seconds;
|
|
int changes;
|
|
};
|
|
|
|
/* Global server state structure */
|
|
struct redisServer {
|
|
int port;
|
|
int fd;
|
|
redisDb *db;
|
|
dict *sharingpool;
|
|
unsigned int sharingpoolsize;
|
|
long long dirty; /* changes to DB from the last save */
|
|
list *clients;
|
|
list *slaves, *monitors;
|
|
char neterr[ANET_ERR_LEN];
|
|
aeEventLoop *el;
|
|
int cronloops; /* number of times the cron function run */
|
|
list *objfreelist; /* A list of freed objects to avoid malloc() */
|
|
time_t lastsave; /* Unix time of last save succeeede */
|
|
size_t usedmemory; /* Used memory in megabytes */
|
|
/* Fields used only for stats */
|
|
time_t stat_starttime; /* server start time */
|
|
long long stat_numcommands; /* number of processed commands */
|
|
long long stat_numconnections; /* number of connections received */
|
|
/* Configuration */
|
|
int verbosity;
|
|
int glueoutputbuf;
|
|
int maxidletime;
|
|
int dbnum;
|
|
int daemonize;
|
|
int appendonly;
|
|
int appendfsync;
|
|
time_t lastfsync;
|
|
int appendfd;
|
|
int appendseldb;
|
|
char *pidfile;
|
|
pid_t bgsavechildpid;
|
|
pid_t bgrewritechildpid;
|
|
sds bgrewritebuf; /* buffer taken by parent during oppend only rewrite */
|
|
struct saveparam *saveparams;
|
|
int saveparamslen;
|
|
char *logfile;
|
|
char *bindaddr;
|
|
char *dbfilename;
|
|
char *appendfilename;
|
|
char *requirepass;
|
|
int shareobjects;
|
|
/* Replication related */
|
|
int isslave;
|
|
char *masterauth;
|
|
char *masterhost;
|
|
int masterport;
|
|
redisClient *master; /* client that is master for this slave */
|
|
int replstate;
|
|
unsigned int maxclients;
|
|
unsigned long maxmemory;
|
|
/* 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;
|
|
};
|
|
|
|
typedef void redisCommandProc(redisClient *c);
|
|
struct redisCommand {
|
|
char *name;
|
|
redisCommandProc *proc;
|
|
int arity;
|
|
int flags;
|
|
};
|
|
|
|
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;
|
|
|
|
/* ZSETs use a specialized version of Skiplists */
|
|
|
|
typedef struct zskiplistNode {
|
|
struct zskiplistNode **forward;
|
|
struct zskiplistNode *backward;
|
|
double score;
|
|
robj *obj;
|
|
} zskiplistNode;
|
|
|
|
typedef struct zskiplist {
|
|
struct zskiplistNode *header, *tail;
|
|
unsigned long length;
|
|
int level;
|
|
} zskiplist;
|
|
|
|
typedef struct zset {
|
|
dict *dict;
|
|
zskiplist *zsl;
|
|
} zset;
|
|
|
|
/* Our shared "common" objects */
|
|
|
|
struct sharedObjectsStruct {
|
|
robj *crlf, *ok, *err, *emptybulk, *czero, *cone, *pong, *space,
|
|
*colon, *nullbulk, *nullmultibulk,
|
|
*emptymultibulk, *wrongtypeerr, *nokeyerr, *syntaxerr, *sameobjecterr,
|
|
*outofrangeerr, *plus,
|
|
*select0, *select1, *select2, *select3, *select4,
|
|
*select5, *select6, *select7, *select8, *select9;
|
|
} shared;
|
|
|
|
/* Global vars that are actally used as constants. The following double
|
|
* values are used for double on-disk serialization, and are initialized
|
|
* at runtime to avoid strange compiler optimizations. */
|
|
|
|
static double R_Zero, R_PosInf, R_NegInf, R_Nan;
|
|
|
|
/*================================ Prototypes =============================== */
|
|
|
|
static void freeStringObject(robj *o);
|
|
static void freeListObject(robj *o);
|
|
static void freeSetObject(robj *o);
|
|
static void decrRefCount(void *o);
|
|
static robj *createObject(int type, void *ptr);
|
|
static void freeClient(redisClient *c);
|
|
static int rdbLoad(char *filename);
|
|
static void addReply(redisClient *c, robj *obj);
|
|
static void addReplySds(redisClient *c, sds s);
|
|
static void incrRefCount(robj *o);
|
|
static int rdbSaveBackground(char *filename);
|
|
static robj *createStringObject(char *ptr, size_t len);
|
|
static void replicationFeedSlaves(list *slaves, struct redisCommand *cmd, int dictid, robj **argv, int argc);
|
|
static void feedAppendOnlyFile(struct redisCommand *cmd, int dictid, robj **argv, int argc);
|
|
static int syncWithMaster(void);
|
|
static robj *tryObjectSharing(robj *o);
|
|
static int tryObjectEncoding(robj *o);
|
|
static robj *getDecodedObject(robj *o);
|
|
static int removeExpire(redisDb *db, robj *key);
|
|
static int expireIfNeeded(redisDb *db, robj *key);
|
|
static int deleteIfVolatile(redisDb *db, robj *key);
|
|
static int deleteKey(redisDb *db, robj *key);
|
|
static time_t getExpire(redisDb *db, robj *key);
|
|
static int setExpire(redisDb *db, robj *key, time_t when);
|
|
static void updateSlavesWaitingBgsave(int bgsaveerr);
|
|
static void freeMemoryIfNeeded(void);
|
|
static int processCommand(redisClient *c);
|
|
static void setupSigSegvAction(void);
|
|
static void rdbRemoveTempFile(pid_t childpid);
|
|
static void aofRemoveTempFile(pid_t childpid);
|
|
static size_t stringObjectLen(robj *o);
|
|
static void processInputBuffer(redisClient *c);
|
|
static zskiplist *zslCreate(void);
|
|
static void zslFree(zskiplist *zsl);
|
|
static void zslInsert(zskiplist *zsl, double score, robj *obj);
|
|
static void sendReplyToClientWritev(aeEventLoop *el, int fd, void *privdata, int mask);
|
|
|
|
static void authCommand(redisClient *c);
|
|
static void pingCommand(redisClient *c);
|
|
static void echoCommand(redisClient *c);
|
|
static void setCommand(redisClient *c);
|
|
static void setnxCommand(redisClient *c);
|
|
static void getCommand(redisClient *c);
|
|
static void delCommand(redisClient *c);
|
|
static void existsCommand(redisClient *c);
|
|
static void incrCommand(redisClient *c);
|
|
static void decrCommand(redisClient *c);
|
|
static void incrbyCommand(redisClient *c);
|
|
static void decrbyCommand(redisClient *c);
|
|
static void selectCommand(redisClient *c);
|
|
static void randomkeyCommand(redisClient *c);
|
|
static void keysCommand(redisClient *c);
|
|
static void dbsizeCommand(redisClient *c);
|
|
static void lastsaveCommand(redisClient *c);
|
|
static void saveCommand(redisClient *c);
|
|
static void bgsaveCommand(redisClient *c);
|
|
static void bgrewriteaofCommand(redisClient *c);
|
|
static void shutdownCommand(redisClient *c);
|
|
static void moveCommand(redisClient *c);
|
|
static void renameCommand(redisClient *c);
|
|
static void renamenxCommand(redisClient *c);
|
|
static void lpushCommand(redisClient *c);
|
|
static void rpushCommand(redisClient *c);
|
|
static void lpopCommand(redisClient *c);
|
|
static void rpopCommand(redisClient *c);
|
|
static void llenCommand(redisClient *c);
|
|
static void lindexCommand(redisClient *c);
|
|
static void lrangeCommand(redisClient *c);
|
|
static void ltrimCommand(redisClient *c);
|
|
static void typeCommand(redisClient *c);
|
|
static void lsetCommand(redisClient *c);
|
|
static void saddCommand(redisClient *c);
|
|
static void sremCommand(redisClient *c);
|
|
static void smoveCommand(redisClient *c);
|
|
static void sismemberCommand(redisClient *c);
|
|
static void scardCommand(redisClient *c);
|
|
static void spopCommand(redisClient *c);
|
|
static void srandmemberCommand(redisClient *c);
|
|
static void sinterCommand(redisClient *c);
|
|
static void sinterstoreCommand(redisClient *c);
|
|
static void sunionCommand(redisClient *c);
|
|
static void sunionstoreCommand(redisClient *c);
|
|
static void sdiffCommand(redisClient *c);
|
|
static void sdiffstoreCommand(redisClient *c);
|
|
static void syncCommand(redisClient *c);
|
|
static void flushdbCommand(redisClient *c);
|
|
static void flushallCommand(redisClient *c);
|
|
static void sortCommand(redisClient *c);
|
|
static void lremCommand(redisClient *c);
|
|
static void rpoplpushcommand(redisClient *c);
|
|
static void infoCommand(redisClient *c);
|
|
static void mgetCommand(redisClient *c);
|
|
static void monitorCommand(redisClient *c);
|
|
static void expireCommand(redisClient *c);
|
|
static void expireatCommand(redisClient *c);
|
|
static void getsetCommand(redisClient *c);
|
|
static void ttlCommand(redisClient *c);
|
|
static void slaveofCommand(redisClient *c);
|
|
static void debugCommand(redisClient *c);
|
|
static void msetCommand(redisClient *c);
|
|
static void msetnxCommand(redisClient *c);
|
|
static void zaddCommand(redisClient *c);
|
|
static void zincrbyCommand(redisClient *c);
|
|
static void zrangeCommand(redisClient *c);
|
|
static void zrangebyscoreCommand(redisClient *c);
|
|
static void zrevrangeCommand(redisClient *c);
|
|
static void zcardCommand(redisClient *c);
|
|
static void zremCommand(redisClient *c);
|
|
static void zscoreCommand(redisClient *c);
|
|
static void zremrangebyscoreCommand(redisClient *c);
|
|
|
|
/*================================= Globals ================================= */
|
|
|
|
/* Global vars */
|
|
static struct redisServer server; /* server global state */
|
|
static struct redisCommand cmdTable[] = {
|
|
{"get",getCommand,2,REDIS_CMD_INLINE},
|
|
{"set",setCommand,3,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"setnx",setnxCommand,3,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"del",delCommand,-2,REDIS_CMD_INLINE},
|
|
{"exists",existsCommand,2,REDIS_CMD_INLINE},
|
|
{"incr",incrCommand,2,REDIS_CMD_INLINE|REDIS_CMD_DENYOOM},
|
|
{"decr",decrCommand,2,REDIS_CMD_INLINE|REDIS_CMD_DENYOOM},
|
|
{"mget",mgetCommand,-2,REDIS_CMD_INLINE},
|
|
{"rpush",rpushCommand,3,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"lpush",lpushCommand,3,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"rpop",rpopCommand,2,REDIS_CMD_INLINE},
|
|
{"lpop",lpopCommand,2,REDIS_CMD_INLINE},
|
|
{"llen",llenCommand,2,REDIS_CMD_INLINE},
|
|
{"lindex",lindexCommand,3,REDIS_CMD_INLINE},
|
|
{"lset",lsetCommand,4,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"lrange",lrangeCommand,4,REDIS_CMD_INLINE},
|
|
{"ltrim",ltrimCommand,4,REDIS_CMD_INLINE},
|
|
{"lrem",lremCommand,4,REDIS_CMD_BULK},
|
|
{"rpoplpush",rpoplpushcommand,3,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"sadd",saddCommand,3,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"srem",sremCommand,3,REDIS_CMD_BULK},
|
|
{"smove",smoveCommand,4,REDIS_CMD_BULK},
|
|
{"sismember",sismemberCommand,3,REDIS_CMD_BULK},
|
|
{"scard",scardCommand,2,REDIS_CMD_INLINE},
|
|
{"spop",spopCommand,2,REDIS_CMD_INLINE},
|
|
{"srandmember",srandmemberCommand,2,REDIS_CMD_INLINE},
|
|
{"sinter",sinterCommand,-2,REDIS_CMD_INLINE|REDIS_CMD_DENYOOM},
|
|
{"sinterstore",sinterstoreCommand,-3,REDIS_CMD_INLINE|REDIS_CMD_DENYOOM},
|
|
{"sunion",sunionCommand,-2,REDIS_CMD_INLINE|REDIS_CMD_DENYOOM},
|
|
{"sunionstore",sunionstoreCommand,-3,REDIS_CMD_INLINE|REDIS_CMD_DENYOOM},
|
|
{"sdiff",sdiffCommand,-2,REDIS_CMD_INLINE|REDIS_CMD_DENYOOM},
|
|
{"sdiffstore",sdiffstoreCommand,-3,REDIS_CMD_INLINE|REDIS_CMD_DENYOOM},
|
|
{"smembers",sinterCommand,2,REDIS_CMD_INLINE},
|
|
{"zadd",zaddCommand,4,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"zincrby",zincrbyCommand,4,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"zrem",zremCommand,3,REDIS_CMD_BULK},
|
|
{"zremrangebyscore",zremrangebyscoreCommand,4,REDIS_CMD_INLINE},
|
|
{"zrange",zrangeCommand,4,REDIS_CMD_INLINE},
|
|
{"zrangebyscore",zrangebyscoreCommand,-4,REDIS_CMD_INLINE},
|
|
{"zrevrange",zrevrangeCommand,4,REDIS_CMD_INLINE},
|
|
{"zcard",zcardCommand,2,REDIS_CMD_INLINE},
|
|
{"zscore",zscoreCommand,3,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"incrby",incrbyCommand,3,REDIS_CMD_INLINE|REDIS_CMD_DENYOOM},
|
|
{"decrby",decrbyCommand,3,REDIS_CMD_INLINE|REDIS_CMD_DENYOOM},
|
|
{"getset",getsetCommand,3,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"mset",msetCommand,-3,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"msetnx",msetnxCommand,-3,REDIS_CMD_BULK|REDIS_CMD_DENYOOM},
|
|
{"randomkey",randomkeyCommand,1,REDIS_CMD_INLINE},
|
|
{"select",selectCommand,2,REDIS_CMD_INLINE},
|
|
{"move",moveCommand,3,REDIS_CMD_INLINE},
|
|
{"rename",renameCommand,3,REDIS_CMD_INLINE},
|
|
{"renamenx",renamenxCommand,3,REDIS_CMD_INLINE},
|
|
{"expire",expireCommand,3,REDIS_CMD_INLINE},
|
|
{"expireat",expireatCommand,3,REDIS_CMD_INLINE},
|
|
{"keys",keysCommand,2,REDIS_CMD_INLINE},
|
|
{"dbsize",dbsizeCommand,1,REDIS_CMD_INLINE},
|
|
{"auth",authCommand,2,REDIS_CMD_INLINE},
|
|
{"ping",pingCommand,1,REDIS_CMD_INLINE},
|
|
{"echo",echoCommand,2,REDIS_CMD_BULK},
|
|
{"save",saveCommand,1,REDIS_CMD_INLINE},
|
|
{"bgsave",bgsaveCommand,1,REDIS_CMD_INLINE},
|
|
{"bgrewriteaof",bgrewriteaofCommand,1,REDIS_CMD_INLINE},
|
|
{"shutdown",shutdownCommand,1,REDIS_CMD_INLINE},
|
|
{"lastsave",lastsaveCommand,1,REDIS_CMD_INLINE},
|
|
{"type",typeCommand,2,REDIS_CMD_INLINE},
|
|
{"sync",syncCommand,1,REDIS_CMD_INLINE},
|
|
{"flushdb",flushdbCommand,1,REDIS_CMD_INLINE},
|
|
{"flushall",flushallCommand,1,REDIS_CMD_INLINE},
|
|
{"sort",sortCommand,-2,REDIS_CMD_INLINE|REDIS_CMD_DENYOOM},
|
|
{"info",infoCommand,1,REDIS_CMD_INLINE},
|
|
{"monitor",monitorCommand,1,REDIS_CMD_INLINE},
|
|
{"ttl",ttlCommand,2,REDIS_CMD_INLINE},
|
|
{"slaveof",slaveofCommand,3,REDIS_CMD_INLINE},
|
|
{"debug",debugCommand,-2,REDIS_CMD_INLINE},
|
|
{NULL,NULL,0,0}
|
|
};
|
|
|
|
/*============================ Utility functions ============================ */
|
|
|
|
/* Glob-style pattern matching. */
|
|
int stringmatchlen(const char *pattern, int patternLen,
|
|
const char *string, int stringLen, int nocase)
|
|
{
|
|
while(patternLen) {
|
|
switch(pattern[0]) {
|
|
case '*':
|
|
while (pattern[1] == '*') {
|
|
pattern++;
|
|
patternLen--;
|
|
}
|
|
if (patternLen == 1)
|
|
return 1; /* match */
|
|
while(stringLen) {
|
|
if (stringmatchlen(pattern+1, patternLen-1,
|
|
string, stringLen, nocase))
|
|
return 1; /* match */
|
|
string++;
|
|
stringLen--;
|
|
}
|
|
return 0; /* no match */
|
|
break;
|
|
case '?':
|
|
if (stringLen == 0)
|
|
return 0; /* no match */
|
|
string++;
|
|
stringLen--;
|
|
break;
|
|
case '[':
|
|
{
|
|
int not, match;
|
|
|
|
pattern++;
|
|
patternLen--;
|
|
not = pattern[0] == '^';
|
|
if (not) {
|
|
pattern++;
|
|
patternLen--;
|
|
}
|
|
match = 0;
|
|
while(1) {
|
|
if (pattern[0] == '\\') {
|
|
pattern++;
|
|
patternLen--;
|
|
if (pattern[0] == string[0])
|
|
match = 1;
|
|
} else if (pattern[0] == ']') {
|
|
break;
|
|
} else if (patternLen == 0) {
|
|
pattern--;
|
|
patternLen++;
|
|
break;
|
|
} else if (pattern[1] == '-' && patternLen >= 3) {
|
|
int start = pattern[0];
|
|
int end = pattern[2];
|
|
int c = string[0];
|
|
if (start > end) {
|
|
int t = start;
|
|
start = end;
|
|
end = t;
|
|
}
|
|
if (nocase) {
|
|
start = tolower(start);
|
|
end = tolower(end);
|
|
c = tolower(c);
|
|
}
|
|
pattern += 2;
|
|
patternLen -= 2;
|
|
if (c >= start && c <= end)
|
|
match = 1;
|
|
} else {
|
|
if (!nocase) {
|
|
if (pattern[0] == string[0])
|
|
match = 1;
|
|
} else {
|
|
if (tolower((int)pattern[0]) == tolower((int)string[0]))
|
|
match = 1;
|
|
}
|
|
}
|
|
pattern++;
|
|
patternLen--;
|
|
}
|
|
if (not)
|
|
match = !match;
|
|
if (!match)
|
|
return 0; /* no match */
|
|
string++;
|
|
stringLen--;
|
|
break;
|
|
}
|
|
case '\\':
|
|
if (patternLen >= 2) {
|
|
pattern++;
|
|
patternLen--;
|
|
}
|
|
/* fall through */
|
|
default:
|
|
if (!nocase) {
|
|
if (pattern[0] != string[0])
|
|
return 0; /* no match */
|
|
} else {
|
|
if (tolower((int)pattern[0]) != tolower((int)string[0]))
|
|
return 0; /* no match */
|
|
}
|
|
string++;
|
|
stringLen--;
|
|
break;
|
|
}
|
|
pattern++;
|
|
patternLen--;
|
|
if (stringLen == 0) {
|
|
while(*pattern == '*') {
|
|
pattern++;
|
|
patternLen--;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
if (patternLen == 0 && stringLen == 0)
|
|
return 1;
|
|
return 0;
|
|
}
|
|
|
|
static void redisLog(int level, const char *fmt, ...) {
|
|
va_list ap;
|
|
FILE *fp;
|
|
|
|
fp = (server.logfile == NULL) ? stdout : fopen(server.logfile,"a");
|
|
if (!fp) return;
|
|
|
|
va_start(ap, fmt);
|
|
if (level >= server.verbosity) {
|
|
char *c = ".-*";
|
|
char buf[64];
|
|
time_t now;
|
|
|
|
now = time(NULL);
|
|
strftime(buf,64,"%d %b %H:%M:%S",localtime(&now));
|
|
fprintf(fp,"%s %c ",buf,c[level]);
|
|
vfprintf(fp, fmt, ap);
|
|
fprintf(fp,"\n");
|
|
fflush(fp);
|
|
}
|
|
va_end(ap);
|
|
|
|
if (server.logfile) fclose(fp);
|
|
}
|
|
|
|
/*====================== Hash table type implementation ==================== */
|
|
|
|
/* This is an hash table type that uses the SDS dynamic strings libary as
|
|
* keys and radis objects as values (objects can hold SDS strings,
|
|
* lists, sets). */
|
|
|
|
static void dictVanillaFree(void *privdata, void *val)
|
|
{
|
|
DICT_NOTUSED(privdata);
|
|
zfree(val);
|
|
}
|
|
|
|
static int sdsDictKeyCompare(void *privdata, const void *key1,
|
|
const void *key2)
|
|
{
|
|
int l1,l2;
|
|
DICT_NOTUSED(privdata);
|
|
|
|
l1 = sdslen((sds)key1);
|
|
l2 = sdslen((sds)key2);
|
|
if (l1 != l2) return 0;
|
|
return memcmp(key1, key2, l1) == 0;
|
|
}
|
|
|
|
static void dictRedisObjectDestructor(void *privdata, void *val)
|
|
{
|
|
DICT_NOTUSED(privdata);
|
|
|
|
decrRefCount(val);
|
|
}
|
|
|
|
static int dictObjKeyCompare(void *privdata, const void *key1,
|
|
const void *key2)
|
|
{
|
|
const robj *o1 = key1, *o2 = key2;
|
|
return sdsDictKeyCompare(privdata,o1->ptr,o2->ptr);
|
|
}
|
|
|
|
static unsigned int dictObjHash(const void *key) {
|
|
const robj *o = key;
|
|
return dictGenHashFunction(o->ptr, sdslen((sds)o->ptr));
|
|
}
|
|
|
|
static int dictEncObjKeyCompare(void *privdata, const void *key1,
|
|
const void *key2)
|
|
{
|
|
robj *o1 = (robj*) key1, *o2 = (robj*) key2;
|
|
int cmp;
|
|
|
|
o1 = getDecodedObject(o1);
|
|
o2 = getDecodedObject(o2);
|
|
cmp = sdsDictKeyCompare(privdata,o1->ptr,o2->ptr);
|
|
decrRefCount(o1);
|
|
decrRefCount(o2);
|
|
return cmp;
|
|
}
|
|
|
|
static unsigned int dictEncObjHash(const void *key) {
|
|
robj *o = (robj*) key;
|
|
|
|
o = getDecodedObject(o);
|
|
unsigned int hash = dictGenHashFunction(o->ptr, sdslen((sds)o->ptr));
|
|
decrRefCount(o);
|
|
return hash;
|
|
}
|
|
|
|
static dictType setDictType = {
|
|
dictEncObjHash, /* hash function */
|
|
NULL, /* key dup */
|
|
NULL, /* val dup */
|
|
dictEncObjKeyCompare, /* key compare */
|
|
dictRedisObjectDestructor, /* key destructor */
|
|
NULL /* val destructor */
|
|
};
|
|
|
|
static dictType zsetDictType = {
|
|
dictEncObjHash, /* hash function */
|
|
NULL, /* key dup */
|
|
NULL, /* val dup */
|
|
dictEncObjKeyCompare, /* key compare */
|
|
dictRedisObjectDestructor, /* key destructor */
|
|
dictVanillaFree /* val destructor of malloc(sizeof(double)) */
|
|
};
|
|
|
|
static dictType hashDictType = {
|
|
dictObjHash, /* hash function */
|
|
NULL, /* key dup */
|
|
NULL, /* val dup */
|
|
dictObjKeyCompare, /* key compare */
|
|
dictRedisObjectDestructor, /* key destructor */
|
|
dictRedisObjectDestructor /* val destructor */
|
|
};
|
|
|
|
/* ========================= Random utility functions ======================= */
|
|
|
|
/* Redis generally does not try to recover from out of memory conditions
|
|
* when allocating objects or strings, it is not clear if it will be possible
|
|
* to report this condition to the client since the networking layer itself
|
|
* is based on heap allocation for send buffers, so we simply abort.
|
|
* At least the code will be simpler to read... */
|
|
static void oom(const char *msg) {
|
|
redisLog(REDIS_WARNING, "%s: Out of memory\n",msg);
|
|
sleep(1);
|
|
abort();
|
|
}
|
|
|
|
/* ====================== Redis server networking stuff ===================== */
|
|
static void closeTimedoutClients(void) {
|
|
redisClient *c;
|
|
listNode *ln;
|
|
time_t now = time(NULL);
|
|
|
|
listRewind(server.clients);
|
|
while ((ln = listYield(server.clients)) != NULL) {
|
|
c = listNodeValue(ln);
|
|
if (!(c->flags & REDIS_SLAVE) && /* no timeout for slaves */
|
|
!(c->flags & REDIS_MASTER) && /* no timeout for masters */
|
|
(now - c->lastinteraction > server.maxidletime)) {
|
|
redisLog(REDIS_DEBUG,"Closing idle client");
|
|
freeClient(c);
|
|
}
|
|
}
|
|
}
|
|
|
|
static int htNeedsResize(dict *dict) {
|
|
long long size, used;
|
|
|
|
size = dictSlots(dict);
|
|
used = dictSize(dict);
|
|
return (size && used && size > DICT_HT_INITIAL_SIZE &&
|
|
(used*100/size < REDIS_HT_MINFILL));
|
|
}
|
|
|
|
/* If the percentage of used slots in the HT reaches REDIS_HT_MINFILL
|
|
* we resize the hash table to save memory */
|
|
static void tryResizeHashTables(void) {
|
|
int j;
|
|
|
|
for (j = 0; j < server.dbnum; j++) {
|
|
if (htNeedsResize(server.db[j].dict)) {
|
|
redisLog(REDIS_DEBUG,"The hash table %d is too sparse, resize it...",j);
|
|
dictResize(server.db[j].dict);
|
|
redisLog(REDIS_DEBUG,"Hash table %d resized.",j);
|
|
}
|
|
if (htNeedsResize(server.db[j].expires))
|
|
dictResize(server.db[j].expires);
|
|
}
|
|
}
|
|
|
|
/* A background saving child (BGSAVE) terminated its work. Handle this. */
|
|
void backgroundSaveDoneHandler(int statloc) {
|
|
int exitcode = WEXITSTATUS(statloc);
|
|
int bysignal = WIFSIGNALED(statloc);
|
|
|
|
if (!bysignal && exitcode == 0) {
|
|
redisLog(REDIS_NOTICE,
|
|
"Background saving terminated with success");
|
|
server.dirty = 0;
|
|
server.lastsave = time(NULL);
|
|
} else if (!bysignal && exitcode != 0) {
|
|
redisLog(REDIS_WARNING, "Background saving error");
|
|
} else {
|
|
redisLog(REDIS_WARNING,
|
|
"Background saving terminated by signal");
|
|
rdbRemoveTempFile(server.bgsavechildpid);
|
|
}
|
|
server.bgsavechildpid = -1;
|
|
/* Possibly there are slaves waiting for a BGSAVE in order to be served
|
|
* (the first stage of SYNC is a bulk transfer of dump.rdb) */
|
|
updateSlavesWaitingBgsave(exitcode == 0 ? REDIS_OK : REDIS_ERR);
|
|
}
|
|
|
|
/* A background append only file rewriting (BGREWRITEAOF) terminated its work.
|
|
* Handle this. */
|
|
void backgroundRewriteDoneHandler(int statloc) {
|
|
int exitcode = WEXITSTATUS(statloc);
|
|
int bysignal = WIFSIGNALED(statloc);
|
|
|
|
if (!bysignal && exitcode == 0) {
|
|
int fd;
|
|
char tmpfile[256];
|
|
|
|
redisLog(REDIS_NOTICE,
|
|
"Background append only file rewriting terminated with success");
|
|
/* Now it's time to flush the differences accumulated by the parent */
|
|
snprintf(tmpfile,256,"temp-rewriteaof-bg-%d.aof", (int) server.bgrewritechildpid);
|
|
fd = open(tmpfile,O_WRONLY|O_APPEND);
|
|
if (fd == -1) {
|
|
redisLog(REDIS_WARNING, "Not able to open the temp append only file produced by the child: %s", strerror(errno));
|
|
goto cleanup;
|
|
}
|
|
/* Flush our data... */
|
|
if (write(fd,server.bgrewritebuf,sdslen(server.bgrewritebuf)) !=
|
|
(signed) sdslen(server.bgrewritebuf)) {
|
|
redisLog(REDIS_WARNING, "Error or short write trying to flush the parent diff of the append log file in the child temp file: %s", strerror(errno));
|
|
close(fd);
|
|
goto cleanup;
|
|
}
|
|
redisLog(REDIS_NOTICE,"Parent diff flushed into the new append log file with success (%lu bytes)",sdslen(server.bgrewritebuf));
|
|
/* Now our work is to rename the temp file into the stable file. And
|
|
* switch the file descriptor used by the server for append only. */
|
|
if (rename(tmpfile,server.appendfilename) == -1) {
|
|
redisLog(REDIS_WARNING,"Can't rename the temp append only file into the stable one: %s", strerror(errno));
|
|
close(fd);
|
|
goto cleanup;
|
|
}
|
|
/* Mission completed... almost */
|
|
redisLog(REDIS_NOTICE,"Append only file successfully rewritten.");
|
|
if (server.appendfd != -1) {
|
|
/* If append only is actually enabled... */
|
|
close(server.appendfd);
|
|
server.appendfd = fd;
|
|
fsync(fd);
|
|
server.appendseldb = -1; /* Make sure it will issue SELECT */
|
|
redisLog(REDIS_NOTICE,"The new append only file was selected for future appends.");
|
|
} else {
|
|
/* If append only is disabled we just generate a dump in this
|
|
* format. Why not? */
|
|
close(fd);
|
|
}
|
|
} else if (!bysignal && exitcode != 0) {
|
|
redisLog(REDIS_WARNING, "Background append only file rewriting error");
|
|
} else {
|
|
redisLog(REDIS_WARNING,
|
|
"Background append only file rewriting terminated by signal");
|
|
}
|
|
cleanup:
|
|
sdsfree(server.bgrewritebuf);
|
|
server.bgrewritebuf = sdsempty();
|
|
aofRemoveTempFile(server.bgrewritechildpid);
|
|
server.bgrewritechildpid = -1;
|
|
}
|
|
|
|
static int serverCron(struct aeEventLoop *eventLoop, long long id, void *clientData) {
|
|
int j, loops = server.cronloops++;
|
|
REDIS_NOTUSED(eventLoop);
|
|
REDIS_NOTUSED(id);
|
|
REDIS_NOTUSED(clientData);
|
|
|
|
/* Update the global state with the amount of used memory */
|
|
server.usedmemory = zmalloc_used_memory();
|
|
|
|
/* Show some info about non-empty databases */
|
|
for (j = 0; j < server.dbnum; j++) {
|
|
long long size, used, vkeys;
|
|
|
|
size = dictSlots(server.db[j].dict);
|
|
used = dictSize(server.db[j].dict);
|
|
vkeys = dictSize(server.db[j].expires);
|
|
if (!(loops % 5) && (used || vkeys)) {
|
|
redisLog(REDIS_DEBUG,"DB %d: %lld keys (%lld volatile) in %lld slots HT.",j,used,vkeys,size);
|
|
/* dictPrintStats(server.dict); */
|
|
}
|
|
}
|
|
|
|
/* We don't want to resize the hash tables while a bacground saving
|
|
* is in progress: the saving child is created using fork() that is
|
|
* implemented with a copy-on-write semantic in most modern systems, so
|
|
* if we resize the HT while there is the saving child at work actually
|
|
* a lot of memory movements in the parent will cause a lot of pages
|
|
* copied. */
|
|
if (server.bgsavechildpid == -1) tryResizeHashTables();
|
|
|
|
/* Show information about connected clients */
|
|
if (!(loops % 5)) {
|
|
redisLog(REDIS_DEBUG,"%d clients connected (%d slaves), %zu bytes in use, %d shared objects",
|
|
listLength(server.clients)-listLength(server.slaves),
|
|
listLength(server.slaves),
|
|
server.usedmemory,
|
|
dictSize(server.sharingpool));
|
|
}
|
|
|
|
/* Close connections of timedout clients */
|
|
if (server.maxidletime && !(loops % 10))
|
|
closeTimedoutClients();
|
|
|
|
/* Check if a background saving or AOF rewrite in progress terminated */
|
|
if (server.bgsavechildpid != -1 || server.bgrewritechildpid != -1) {
|
|
int statloc;
|
|
pid_t pid;
|
|
|
|
if ((pid = wait3(&statloc,WNOHANG,NULL)) != 0) {
|
|
if (pid == server.bgsavechildpid) {
|
|
backgroundSaveDoneHandler(statloc);
|
|
} else {
|
|
backgroundRewriteDoneHandler(statloc);
|
|
}
|
|
}
|
|
} else {
|
|
/* If there is not a background saving in progress check if
|
|
* we have to save now */
|
|
time_t now = time(NULL);
|
|
for (j = 0; j < server.saveparamslen; j++) {
|
|
struct saveparam *sp = server.saveparams+j;
|
|
|
|
if (server.dirty >= sp->changes &&
|
|
now-server.lastsave > sp->seconds) {
|
|
redisLog(REDIS_NOTICE,"%d changes in %d seconds. Saving...",
|
|
sp->changes, sp->seconds);
|
|
rdbSaveBackground(server.dbfilename);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Try to expire a few timed out keys. The algorithm used is adaptive and
|
|
* will use few CPU cycles if there are few expiring keys, otherwise
|
|
* it will get more aggressive to avoid that too much memory is used by
|
|
* keys that can be removed from the keyspace. */
|
|
for (j = 0; j < server.dbnum; j++) {
|
|
int expired;
|
|
redisDb *db = server.db+j;
|
|
|
|
/* Continue to expire if at the end of the cycle more than 25%
|
|
* of the keys were expired. */
|
|
do {
|
|
int num = dictSize(db->expires);
|
|
time_t now = time(NULL);
|
|
|
|
expired = 0;
|
|
if (num > REDIS_EXPIRELOOKUPS_PER_CRON)
|
|
num = REDIS_EXPIRELOOKUPS_PER_CRON;
|
|
while (num--) {
|
|
dictEntry *de;
|
|
time_t t;
|
|
|
|
if ((de = dictGetRandomKey(db->expires)) == NULL) break;
|
|
t = (time_t) dictGetEntryVal(de);
|
|
if (now > t) {
|
|
deleteKey(db,dictGetEntryKey(de));
|
|
expired++;
|
|
}
|
|
}
|
|
} while (expired > REDIS_EXPIRELOOKUPS_PER_CRON/4);
|
|
}
|
|
|
|
/* Check if we should connect to a MASTER */
|
|
if (server.replstate == REDIS_REPL_CONNECT) {
|
|
redisLog(REDIS_NOTICE,"Connecting to MASTER...");
|
|
if (syncWithMaster() == REDIS_OK) {
|
|
redisLog(REDIS_NOTICE,"MASTER <-> SLAVE sync succeeded");
|
|
}
|
|
}
|
|
return 1000;
|
|
}
|
|
|
|
static void createSharedObjects(void) {
|
|
shared.crlf = createObject(REDIS_STRING,sdsnew("\r\n"));
|
|
shared.ok = createObject(REDIS_STRING,sdsnew("+OK\r\n"));
|
|
shared.err = createObject(REDIS_STRING,sdsnew("-ERR\r\n"));
|
|
shared.emptybulk = createObject(REDIS_STRING,sdsnew("$0\r\n\r\n"));
|
|
shared.czero = createObject(REDIS_STRING,sdsnew(":0\r\n"));
|
|
shared.cone = createObject(REDIS_STRING,sdsnew(":1\r\n"));
|
|
shared.nullbulk = createObject(REDIS_STRING,sdsnew("$-1\r\n"));
|
|
shared.nullmultibulk = createObject(REDIS_STRING,sdsnew("*-1\r\n"));
|
|
shared.emptymultibulk = createObject(REDIS_STRING,sdsnew("*0\r\n"));
|
|
/* no such key */
|
|
shared.pong = createObject(REDIS_STRING,sdsnew("+PONG\r\n"));
|
|
shared.wrongtypeerr = createObject(REDIS_STRING,sdsnew(
|
|
"-ERR Operation against a key holding the wrong kind of value\r\n"));
|
|
shared.nokeyerr = createObject(REDIS_STRING,sdsnew(
|
|
"-ERR no such key\r\n"));
|
|
shared.syntaxerr = createObject(REDIS_STRING,sdsnew(
|
|
"-ERR syntax error\r\n"));
|
|
shared.sameobjecterr = createObject(REDIS_STRING,sdsnew(
|
|
"-ERR source and destination objects are the same\r\n"));
|
|
shared.outofrangeerr = createObject(REDIS_STRING,sdsnew(
|
|
"-ERR index out of range\r\n"));
|
|
shared.space = createObject(REDIS_STRING,sdsnew(" "));
|
|
shared.colon = createObject(REDIS_STRING,sdsnew(":"));
|
|
shared.plus = createObject(REDIS_STRING,sdsnew("+"));
|
|
shared.select0 = createStringObject("select 0\r\n",10);
|
|
shared.select1 = createStringObject("select 1\r\n",10);
|
|
shared.select2 = createStringObject("select 2\r\n",10);
|
|
shared.select3 = createStringObject("select 3\r\n",10);
|
|
shared.select4 = createStringObject("select 4\r\n",10);
|
|
shared.select5 = createStringObject("select 5\r\n",10);
|
|
shared.select6 = createStringObject("select 6\r\n",10);
|
|
shared.select7 = createStringObject("select 7\r\n",10);
|
|
shared.select8 = createStringObject("select 8\r\n",10);
|
|
shared.select9 = createStringObject("select 9\r\n",10);
|
|
}
|
|
|
|
static void appendServerSaveParams(time_t seconds, int changes) {
|
|
server.saveparams = zrealloc(server.saveparams,sizeof(struct saveparam)*(server.saveparamslen+1));
|
|
server.saveparams[server.saveparamslen].seconds = seconds;
|
|
server.saveparams[server.saveparamslen].changes = changes;
|
|
server.saveparamslen++;
|
|
}
|
|
|
|
static void resetServerSaveParams() {
|
|
zfree(server.saveparams);
|
|
server.saveparams = NULL;
|
|
server.saveparamslen = 0;
|
|
}
|
|
|
|
static void initServerConfig() {
|
|
server.dbnum = REDIS_DEFAULT_DBNUM;
|
|
server.port = REDIS_SERVERPORT;
|
|
server.verbosity = REDIS_DEBUG;
|
|
server.maxidletime = REDIS_MAXIDLETIME;
|
|
server.saveparams = NULL;
|
|
server.logfile = NULL; /* NULL = log on standard output */
|
|
server.bindaddr = NULL;
|
|
server.glueoutputbuf = 1;
|
|
server.daemonize = 0;
|
|
server.appendonly = 0;
|
|
server.appendfsync = APPENDFSYNC_ALWAYS;
|
|
server.lastfsync = time(NULL);
|
|
server.appendfd = -1;
|
|
server.appendseldb = -1; /* Make sure the first time will not match */
|
|
server.pidfile = "/var/run/redis.pid";
|
|
server.dbfilename = "dump.rdb";
|
|
server.appendfilename = "appendonly.aof";
|
|
server.requirepass = NULL;
|
|
server.shareobjects = 0;
|
|
server.sharingpoolsize = 1024;
|
|
server.maxclients = 0;
|
|
server.maxmemory = 0;
|
|
resetServerSaveParams();
|
|
|
|
appendServerSaveParams(60*60,1); /* save after 1 hour and 1 change */
|
|
appendServerSaveParams(300,100); /* save after 5 minutes and 100 changes */
|
|
appendServerSaveParams(60,10000); /* save after 1 minute and 10000 changes */
|
|
/* Replication related */
|
|
server.isslave = 0;
|
|
server.masterauth = NULL;
|
|
server.masterhost = NULL;
|
|
server.masterport = 6379;
|
|
server.master = NULL;
|
|
server.replstate = REDIS_REPL_NONE;
|
|
|
|
/* Double constants initialization */
|
|
R_Zero = 0.0;
|
|
R_PosInf = 1.0/R_Zero;
|
|
R_NegInf = -1.0/R_Zero;
|
|
R_Nan = R_Zero/R_Zero;
|
|
}
|
|
|
|
static void initServer() {
|
|
int j;
|
|
|
|
signal(SIGHUP, SIG_IGN);
|
|
signal(SIGPIPE, SIG_IGN);
|
|
setupSigSegvAction();
|
|
|
|
server.clients = listCreate();
|
|
server.slaves = listCreate();
|
|
server.monitors = listCreate();
|
|
server.objfreelist = listCreate();
|
|
createSharedObjects();
|
|
server.el = aeCreateEventLoop();
|
|
server.db = zmalloc(sizeof(redisDb)*server.dbnum);
|
|
server.sharingpool = dictCreate(&setDictType,NULL);
|
|
server.fd = anetTcpServer(server.neterr, server.port, server.bindaddr);
|
|
if (server.fd == -1) {
|
|
redisLog(REDIS_WARNING, "Opening TCP port: %s", server.neterr);
|
|
exit(1);
|
|
}
|
|
for (j = 0; j < server.dbnum; j++) {
|
|
server.db[j].dict = dictCreate(&hashDictType,NULL);
|
|
server.db[j].expires = dictCreate(&setDictType,NULL);
|
|
server.db[j].id = j;
|
|
}
|
|
server.cronloops = 0;
|
|
server.bgsavechildpid = -1;
|
|
server.bgrewritechildpid = -1;
|
|
server.bgrewritebuf = sdsempty();
|
|
server.lastsave = time(NULL);
|
|
server.dirty = 0;
|
|
server.usedmemory = 0;
|
|
server.stat_numcommands = 0;
|
|
server.stat_numconnections = 0;
|
|
server.stat_starttime = time(NULL);
|
|
aeCreateTimeEvent(server.el, 1, serverCron, NULL, NULL);
|
|
|
|
if (server.appendonly) {
|
|
server.appendfd = open(server.appendfilename,O_WRONLY|O_APPEND|O_CREAT,0644);
|
|
if (server.appendfd == -1) {
|
|
redisLog(REDIS_WARNING, "Can't open the append-only file: %s",
|
|
strerror(errno));
|
|
exit(1);
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Empty the whole database */
|
|
static long long emptyDb() {
|
|
int j;
|
|
long long removed = 0;
|
|
|
|
for (j = 0; j < server.dbnum; j++) {
|
|
removed += dictSize(server.db[j].dict);
|
|
dictEmpty(server.db[j].dict);
|
|
dictEmpty(server.db[j].expires);
|
|
}
|
|
return removed;
|
|
}
|
|
|
|
static int yesnotoi(char *s) {
|
|
if (!strcasecmp(s,"yes")) return 1;
|
|
else if (!strcasecmp(s,"no")) return 0;
|
|
else return -1;
|
|
}
|
|
|
|
/* I agree, this is a very rudimental way to load a configuration...
|
|
will improve later if the config gets more complex */
|
|
static void loadServerConfig(char *filename) {
|
|
FILE *fp;
|
|
char buf[REDIS_CONFIGLINE_MAX+1], *err = NULL;
|
|
int linenum = 0;
|
|
sds line = NULL;
|
|
|
|
if (filename[0] == '-' && filename[1] == '\0')
|
|
fp = stdin;
|
|
else {
|
|
if ((fp = fopen(filename,"r")) == NULL) {
|
|
redisLog(REDIS_WARNING,"Fatal error, can't open config file");
|
|
exit(1);
|
|
}
|
|
}
|
|
|
|
while(fgets(buf,REDIS_CONFIGLINE_MAX+1,fp) != NULL) {
|
|
sds *argv;
|
|
int argc, j;
|
|
|
|
linenum++;
|
|
line = sdsnew(buf);
|
|
line = sdstrim(line," \t\r\n");
|
|
|
|
/* Skip comments and blank lines*/
|
|
if (line[0] == '#' || line[0] == '\0') {
|
|
sdsfree(line);
|
|
continue;
|
|
}
|
|
|
|
/* Split into arguments */
|
|
argv = sdssplitlen(line,sdslen(line)," ",1,&argc);
|
|
sdstolower(argv[0]);
|
|
|
|
/* Execute config directives */
|
|
if (!strcasecmp(argv[0],"timeout") && argc == 2) {
|
|
server.maxidletime = atoi(argv[1]);
|
|
if (server.maxidletime < 0) {
|
|
err = "Invalid timeout value"; goto loaderr;
|
|
}
|
|
} else if (!strcasecmp(argv[0],"port") && argc == 2) {
|
|
server.port = atoi(argv[1]);
|
|
if (server.port < 1 || server.port > 65535) {
|
|
err = "Invalid port"; goto loaderr;
|
|
}
|
|
} else if (!strcasecmp(argv[0],"bind") && argc == 2) {
|
|
server.bindaddr = zstrdup(argv[1]);
|
|
} else if (!strcasecmp(argv[0],"save") && argc == 3) {
|
|
int seconds = atoi(argv[1]);
|
|
int changes = atoi(argv[2]);
|
|
if (seconds < 1 || changes < 0) {
|
|
err = "Invalid save parameters"; goto loaderr;
|
|
}
|
|
appendServerSaveParams(seconds,changes);
|
|
} else if (!strcasecmp(argv[0],"dir") && argc == 2) {
|
|
if (chdir(argv[1]) == -1) {
|
|
redisLog(REDIS_WARNING,"Can't chdir to '%s': %s",
|
|
argv[1], strerror(errno));
|
|
exit(1);
|
|
}
|
|
} else if (!strcasecmp(argv[0],"loglevel") && argc == 2) {
|
|
if (!strcasecmp(argv[1],"debug")) server.verbosity = REDIS_DEBUG;
|
|
else if (!strcasecmp(argv[1],"notice")) server.verbosity = REDIS_NOTICE;
|
|
else if (!strcasecmp(argv[1],"warning")) server.verbosity = REDIS_WARNING;
|
|
else {
|
|
err = "Invalid log level. Must be one of debug, notice, warning";
|
|
goto loaderr;
|
|
}
|
|
} else if (!strcasecmp(argv[0],"logfile") && argc == 2) {
|
|
FILE *logfp;
|
|
|
|
server.logfile = zstrdup(argv[1]);
|
|
if (!strcasecmp(server.logfile,"stdout")) {
|
|
zfree(server.logfile);
|
|
server.logfile = NULL;
|
|
}
|
|
if (server.logfile) {
|
|
/* Test if we are able to open the file. The server will not
|
|
* be able to abort just for this problem later... */
|
|
logfp = fopen(server.logfile,"a");
|
|
if (logfp == NULL) {
|
|
err = sdscatprintf(sdsempty(),
|
|
"Can't open the log file: %s", strerror(errno));
|
|
goto loaderr;
|
|
}
|
|
fclose(logfp);
|
|
}
|
|
} else if (!strcasecmp(argv[0],"databases") && argc == 2) {
|
|
server.dbnum = atoi(argv[1]);
|
|
if (server.dbnum < 1) {
|
|
err = "Invalid number of databases"; goto loaderr;
|
|
}
|
|
} else if (!strcasecmp(argv[0],"maxclients") && argc == 2) {
|
|
server.maxclients = atoi(argv[1]);
|
|
} else if (!strcasecmp(argv[0],"maxmemory") && argc == 2) {
|
|
server.maxmemory = strtoll(argv[1], NULL, 10);
|
|
} else if (!strcasecmp(argv[0],"slaveof") && argc == 3) {
|
|
server.masterhost = sdsnew(argv[1]);
|
|
server.masterport = atoi(argv[2]);
|
|
server.replstate = REDIS_REPL_CONNECT;
|
|
} else if (!strcasecmp(argv[0],"masterauth") && argc == 2) {
|
|
server.masterauth = zstrdup(argv[1]);
|
|
} else if (!strcasecmp(argv[0],"glueoutputbuf") && argc == 2) {
|
|
if ((server.glueoutputbuf = yesnotoi(argv[1])) == -1) {
|
|
err = "argument must be 'yes' or 'no'"; goto loaderr;
|
|
}
|
|
} else if (!strcasecmp(argv[0],"shareobjects") && argc == 2) {
|
|
if ((server.shareobjects = yesnotoi(argv[1])) == -1) {
|
|
err = "argument must be 'yes' or 'no'"; goto loaderr;
|
|
}
|
|
} else if (!strcasecmp(argv[0],"shareobjectspoolsize") && argc == 2) {
|
|
server.sharingpoolsize = atoi(argv[1]);
|
|
if (server.sharingpoolsize < 1) {
|
|
err = "invalid object sharing pool size"; goto loaderr;
|
|
}
|
|
} else if (!strcasecmp(argv[0],"daemonize") && argc == 2) {
|
|
if ((server.daemonize = yesnotoi(argv[1])) == -1) {
|
|
err = "argument must be 'yes' or 'no'"; goto loaderr;
|
|
}
|
|
} else if (!strcasecmp(argv[0],"appendonly") && argc == 2) {
|
|
if ((server.appendonly = yesnotoi(argv[1])) == -1) {
|
|
err = "argument must be 'yes' or 'no'"; goto loaderr;
|
|
}
|
|
} else if (!strcasecmp(argv[0],"appendfsync") && argc == 2) {
|
|
if (!strcasecmp(argv[1],"no")) {
|
|
server.appendfsync = APPENDFSYNC_NO;
|
|
} else if (!strcasecmp(argv[1],"always")) {
|
|
server.appendfsync = APPENDFSYNC_ALWAYS;
|
|
} else if (!strcasecmp(argv[1],"everysec")) {
|
|
server.appendfsync = APPENDFSYNC_EVERYSEC;
|
|
} else {
|
|
err = "argument must be 'no', 'always' or 'everysec'";
|
|
goto loaderr;
|
|
}
|
|
} else if (!strcasecmp(argv[0],"requirepass") && argc == 2) {
|
|
server.requirepass = zstrdup(argv[1]);
|
|
} else if (!strcasecmp(argv[0],"pidfile") && argc == 2) {
|
|
server.pidfile = zstrdup(argv[1]);
|
|
} else if (!strcasecmp(argv[0],"dbfilename") && argc == 2) {
|
|
server.dbfilename = zstrdup(argv[1]);
|
|
} else {
|
|
err = "Bad directive or wrong number of arguments"; goto loaderr;
|
|
}
|
|
for (j = 0; j < argc; j++)
|
|
sdsfree(argv[j]);
|
|
zfree(argv);
|
|
sdsfree(line);
|
|
}
|
|
if (fp != stdin) fclose(fp);
|
|
return;
|
|
|
|
loaderr:
|
|
fprintf(stderr, "\n*** FATAL CONFIG FILE ERROR ***\n");
|
|
fprintf(stderr, "Reading the configuration file, at line %d\n", linenum);
|
|
fprintf(stderr, ">>> '%s'\n", line);
|
|
fprintf(stderr, "%s\n", err);
|
|
exit(1);
|
|
}
|
|
|
|
static void freeClientArgv(redisClient *c) {
|
|
int j;
|
|
|
|
for (j = 0; j < c->argc; j++)
|
|
decrRefCount(c->argv[j]);
|
|
for (j = 0; j < c->mbargc; j++)
|
|
decrRefCount(c->mbargv[j]);
|
|
c->argc = 0;
|
|
c->mbargc = 0;
|
|
}
|
|
|
|
static void freeClient(redisClient *c) {
|
|
listNode *ln;
|
|
|
|
aeDeleteFileEvent(server.el,c->fd,AE_READABLE);
|
|
aeDeleteFileEvent(server.el,c->fd,AE_WRITABLE);
|
|
sdsfree(c->querybuf);
|
|
listRelease(c->reply);
|
|
freeClientArgv(c);
|
|
close(c->fd);
|
|
ln = listSearchKey(server.clients,c);
|
|
redisAssert(ln != NULL);
|
|
listDelNode(server.clients,ln);
|
|
if (c->flags & REDIS_SLAVE) {
|
|
if (c->replstate == REDIS_REPL_SEND_BULK && c->repldbfd != -1)
|
|
close(c->repldbfd);
|
|
list *l = (c->flags & REDIS_MONITOR) ? server.monitors : server.slaves;
|
|
ln = listSearchKey(l,c);
|
|
redisAssert(ln != NULL);
|
|
listDelNode(l,ln);
|
|
}
|
|
if (c->flags & REDIS_MASTER) {
|
|
server.master = NULL;
|
|
server.replstate = REDIS_REPL_CONNECT;
|
|
}
|
|
zfree(c->argv);
|
|
zfree(c->mbargv);
|
|
zfree(c);
|
|
}
|
|
|
|
#define GLUEREPLY_UP_TO (1024)
|
|
static void glueReplyBuffersIfNeeded(redisClient *c) {
|
|
int copylen = 0;
|
|
char buf[GLUEREPLY_UP_TO];
|
|
listNode *ln;
|
|
robj *o;
|
|
|
|
listRewind(c->reply);
|
|
while((ln = listYield(c->reply))) {
|
|
int objlen;
|
|
|
|
o = ln->value;
|
|
objlen = sdslen(o->ptr);
|
|
if (copylen + objlen <= GLUEREPLY_UP_TO) {
|
|
memcpy(buf+copylen,o->ptr,objlen);
|
|
copylen += objlen;
|
|
listDelNode(c->reply,ln);
|
|
} else {
|
|
if (copylen == 0) return;
|
|
break;
|
|
}
|
|
}
|
|
/* Now the output buffer is empty, add the new single element */
|
|
o = createObject(REDIS_STRING,sdsnewlen(buf,copylen));
|
|
listAddNodeHead(c->reply,o);
|
|
}
|
|
|
|
static void sendReplyToClient(aeEventLoop *el, int fd, void *privdata, int mask) {
|
|
redisClient *c = privdata;
|
|
int nwritten = 0, totwritten = 0, objlen;
|
|
robj *o;
|
|
REDIS_NOTUSED(el);
|
|
REDIS_NOTUSED(mask);
|
|
|
|
/* Use writev() if we have enough buffers to send */
|
|
if (!server.glueoutputbuf &&
|
|
listLength(c->reply) > REDIS_WRITEV_THRESHOLD &&
|
|
!(c->flags & REDIS_MASTER))
|
|
{
|
|
sendReplyToClientWritev(el, fd, privdata, mask);
|
|
return;
|
|
}
|
|
|
|
while(listLength(c->reply)) {
|
|
if (server.glueoutputbuf && listLength(c->reply) > 1)
|
|
glueReplyBuffersIfNeeded(c);
|
|
|
|
o = listNodeValue(listFirst(c->reply));
|
|
objlen = sdslen(o->ptr);
|
|
|
|
if (objlen == 0) {
|
|
listDelNode(c->reply,listFirst(c->reply));
|
|
continue;
|
|
}
|
|
|
|
if (c->flags & REDIS_MASTER) {
|
|
/* Don't reply to a master */
|
|
nwritten = objlen - c->sentlen;
|
|
} else {
|
|
nwritten = write(fd, ((char*)o->ptr)+c->sentlen, objlen - c->sentlen);
|
|
if (nwritten <= 0) break;
|
|
}
|
|
c->sentlen += nwritten;
|
|
totwritten += nwritten;
|
|
/* If we fully sent the object on head go to the next one */
|
|
if (c->sentlen == objlen) {
|
|
listDelNode(c->reply,listFirst(c->reply));
|
|
c->sentlen = 0;
|
|
}
|
|
/* Note that we avoid to send more thank REDIS_MAX_WRITE_PER_EVENT
|
|
* bytes, in a single threaded server it's a good idea to serve
|
|
* other clients as well, even if a very large request comes from
|
|
* super fast link that is always able to accept data (in real world
|
|
* scenario think about 'KEYS *' against the loopback interfae) */
|
|
if (totwritten > REDIS_MAX_WRITE_PER_EVENT) break;
|
|
}
|
|
if (nwritten == -1) {
|
|
if (errno == EAGAIN) {
|
|
nwritten = 0;
|
|
} else {
|
|
redisLog(REDIS_DEBUG,
|
|
"Error writing to client: %s", strerror(errno));
|
|
freeClient(c);
|
|
return;
|
|
}
|
|
}
|
|
if (totwritten > 0) c->lastinteraction = time(NULL);
|
|
if (listLength(c->reply) == 0) {
|
|
c->sentlen = 0;
|
|
aeDeleteFileEvent(server.el,c->fd,AE_WRITABLE);
|
|
}
|
|
}
|
|
|
|
static void sendReplyToClientWritev(aeEventLoop *el, int fd, void *privdata, int mask)
|
|
{
|
|
redisClient *c = privdata;
|
|
int nwritten = 0, totwritten = 0, objlen, willwrite;
|
|
robj *o;
|
|
struct iovec iov[REDIS_WRITEV_IOVEC_COUNT];
|
|
int offset, ion = 0;
|
|
REDIS_NOTUSED(el);
|
|
REDIS_NOTUSED(mask);
|
|
|
|
listNode *node;
|
|
while (listLength(c->reply)) {
|
|
offset = c->sentlen;
|
|
ion = 0;
|
|
willwrite = 0;
|
|
|
|
/* fill-in the iov[] array */
|
|
for(node = listFirst(c->reply); node; node = listNextNode(node)) {
|
|
o = listNodeValue(node);
|
|
objlen = sdslen(o->ptr);
|
|
|
|
if (totwritten + objlen - offset > REDIS_MAX_WRITE_PER_EVENT)
|
|
break;
|
|
|
|
if(ion == REDIS_WRITEV_IOVEC_COUNT)
|
|
break; /* no more iovecs */
|
|
|
|
iov[ion].iov_base = ((char*)o->ptr) + offset;
|
|
iov[ion].iov_len = objlen - offset;
|
|
willwrite += objlen - offset;
|
|
offset = 0; /* just for the first item */
|
|
ion++;
|
|
}
|
|
|
|
if(willwrite == 0)
|
|
break;
|
|
|
|
/* write all collected blocks at once */
|
|
if((nwritten = writev(fd, iov, ion)) < 0) {
|
|
if (errno != EAGAIN) {
|
|
redisLog(REDIS_DEBUG,
|
|
"Error writing to client: %s", strerror(errno));
|
|
freeClient(c);
|
|
return;
|
|
}
|
|
break;
|
|
}
|
|
|
|
totwritten += nwritten;
|
|
offset = c->sentlen;
|
|
|
|
/* remove written robjs from c->reply */
|
|
while (nwritten && listLength(c->reply)) {
|
|
o = listNodeValue(listFirst(c->reply));
|
|
objlen = sdslen(o->ptr);
|
|
|
|
if(nwritten >= objlen - offset) {
|
|
listDelNode(c->reply, listFirst(c->reply));
|
|
nwritten -= objlen - offset;
|
|
c->sentlen = 0;
|
|
} else {
|
|
/* partial write */
|
|
c->sentlen += nwritten;
|
|
break;
|
|
}
|
|
offset = 0;
|
|
}
|
|
}
|
|
|
|
if (totwritten > 0)
|
|
c->lastinteraction = time(NULL);
|
|
|
|
if (listLength(c->reply) == 0) {
|
|
c->sentlen = 0;
|
|
aeDeleteFileEvent(server.el,c->fd,AE_WRITABLE);
|
|
}
|
|
}
|
|
|
|
static struct redisCommand *lookupCommand(char *name) {
|
|
int j = 0;
|
|
while(cmdTable[j].name != NULL) {
|
|
if (!strcasecmp(name,cmdTable[j].name)) return &cmdTable[j];
|
|
j++;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
/* resetClient prepare the client to process the next command */
|
|
static void resetClient(redisClient *c) {
|
|
freeClientArgv(c);
|
|
c->bulklen = -1;
|
|
c->multibulk = 0;
|
|
}
|
|
|
|
/* If this function gets called we already read a whole
|
|
* command, argments are in the client argv/argc fields.
|
|
* processCommand() execute the command or prepare the
|
|
* server for a bulk read from the client.
|
|
*
|
|
* If 1 is returned the client is still alive and valid and
|
|
* and other operations can be performed by the caller. Otherwise
|
|
* if 0 is returned the client was destroied (i.e. after QUIT). */
|
|
static int processCommand(redisClient *c) {
|
|
struct redisCommand *cmd;
|
|
long long dirty;
|
|
|
|
/* Free some memory if needed (maxmemory setting) */
|
|
if (server.maxmemory) freeMemoryIfNeeded();
|
|
|
|
/* Handle the multi bulk command type. This is an alternative protocol
|
|
* supported by Redis in order to receive commands that are composed of
|
|
* multiple binary-safe "bulk" arguments. The latency of processing is
|
|
* a bit higher but this allows things like multi-sets, so if this
|
|
* protocol is used only for MSET and similar commands this is a big win. */
|
|
if (c->multibulk == 0 && c->argc == 1 && ((char*)(c->argv[0]->ptr))[0] == '*') {
|
|
c->multibulk = atoi(((char*)c->argv[0]->ptr)+1);
|
|
if (c->multibulk <= 0) {
|
|
resetClient(c);
|
|
return 1;
|
|
} else {
|
|
decrRefCount(c->argv[c->argc-1]);
|
|
c->argc--;
|
|
return 1;
|
|
}
|
|
} else if (c->multibulk) {
|
|
if (c->bulklen == -1) {
|
|
if (((char*)c->argv[0]->ptr)[0] != '$') {
|
|
addReplySds(c,sdsnew("-ERR multi bulk protocol error\r\n"));
|
|
resetClient(c);
|
|
return 1;
|
|
} else {
|
|
int bulklen = atoi(((char*)c->argv[0]->ptr)+1);
|
|
decrRefCount(c->argv[0]);
|
|
if (bulklen < 0 || bulklen > 1024*1024*1024) {
|
|
c->argc--;
|
|
addReplySds(c,sdsnew("-ERR invalid bulk write count\r\n"));
|
|
resetClient(c);
|
|
return 1;
|
|
}
|
|
c->argc--;
|
|
c->bulklen = bulklen+2; /* add two bytes for CR+LF */
|
|
return 1;
|
|
}
|
|
} else {
|
|
c->mbargv = zrealloc(c->mbargv,(sizeof(robj*))*(c->mbargc+1));
|
|
c->mbargv[c->mbargc] = c->argv[0];
|
|
c->mbargc++;
|
|
c->argc--;
|
|
c->multibulk--;
|
|
if (c->multibulk == 0) {
|
|
robj **auxargv;
|
|
int auxargc;
|
|
|
|
/* Here we need to swap the multi-bulk argc/argv with the
|
|
* normal argc/argv of the client structure. */
|
|
auxargv = c->argv;
|
|
c->argv = c->mbargv;
|
|
c->mbargv = auxargv;
|
|
|
|
auxargc = c->argc;
|
|
c->argc = c->mbargc;
|
|
c->mbargc = auxargc;
|
|
|
|
/* We need to set bulklen to something different than -1
|
|
* in order for the code below to process the command without
|
|
* to try to read the last argument of a bulk command as
|
|
* a special argument. */
|
|
c->bulklen = 0;
|
|
/* continue below and process the command */
|
|
} else {
|
|
c->bulklen = -1;
|
|
return 1;
|
|
}
|
|
}
|
|
}
|
|
/* -- end of multi bulk commands processing -- */
|
|
|
|
/* The QUIT command is handled as a special case. Normal command
|
|
* procs are unable to close the client connection safely */
|
|
if (!strcasecmp(c->argv[0]->ptr,"quit")) {
|
|
freeClient(c);
|
|
return 0;
|
|
}
|
|
cmd = lookupCommand(c->argv[0]->ptr);
|
|
if (!cmd) {
|
|
addReplySds(c,sdsnew("-ERR unknown command\r\n"));
|
|
resetClient(c);
|
|
return 1;
|
|
} else if ((cmd->arity > 0 && cmd->arity != c->argc) ||
|
|
(c->argc < -cmd->arity)) {
|
|
addReplySds(c,
|
|
sdscatprintf(sdsempty(),
|
|
"-ERR wrong number of arguments for '%s' command\r\n",
|
|
cmd->name));
|
|
resetClient(c);
|
|
return 1;
|
|
} else if (server.maxmemory && cmd->flags & REDIS_CMD_DENYOOM && zmalloc_used_memory() > server.maxmemory) {
|
|
addReplySds(c,sdsnew("-ERR command not allowed when used memory > 'maxmemory'\r\n"));
|
|
resetClient(c);
|
|
return 1;
|
|
} else if (cmd->flags & REDIS_CMD_BULK && c->bulklen == -1) {
|
|
int bulklen = atoi(c->argv[c->argc-1]->ptr);
|
|
|
|
decrRefCount(c->argv[c->argc-1]);
|
|
if (bulklen < 0 || bulklen > 1024*1024*1024) {
|
|
c->argc--;
|
|
addReplySds(c,sdsnew("-ERR invalid bulk write count\r\n"));
|
|
resetClient(c);
|
|
return 1;
|
|
}
|
|
c->argc--;
|
|
c->bulklen = bulklen+2; /* add two bytes for CR+LF */
|
|
/* It is possible that the bulk read is already in the
|
|
* buffer. Check this condition and handle it accordingly.
|
|
* This is just a fast path, alternative to call processInputBuffer().
|
|
* It's a good idea since the code is small and this condition
|
|
* happens most of the times. */
|
|
if ((signed)sdslen(c->querybuf) >= c->bulklen) {
|
|
c->argv[c->argc] = createStringObject(c->querybuf,c->bulklen-2);
|
|
c->argc++;
|
|
c->querybuf = sdsrange(c->querybuf,c->bulklen,-1);
|
|
} else {
|
|
return 1;
|
|
}
|
|
}
|
|
/* Let's try to share objects on the command arguments vector */
|
|
if (server.shareobjects) {
|
|
int j;
|
|
for(j = 1; j < c->argc; j++)
|
|
c->argv[j] = tryObjectSharing(c->argv[j]);
|
|
}
|
|
/* Let's try to encode the bulk object to save space. */
|
|
if (cmd->flags & REDIS_CMD_BULK)
|
|
tryObjectEncoding(c->argv[c->argc-1]);
|
|
|
|
/* Check if the user is authenticated */
|
|
if (server.requirepass && !c->authenticated && cmd->proc != authCommand) {
|
|
addReplySds(c,sdsnew("-ERR operation not permitted\r\n"));
|
|
resetClient(c);
|
|
return 1;
|
|
}
|
|
|
|
/* Exec the command */
|
|
dirty = server.dirty;
|
|
cmd->proc(c);
|
|
if (server.appendonly && server.dirty-dirty)
|
|
feedAppendOnlyFile(cmd,c->db->id,c->argv,c->argc);
|
|
if (server.dirty-dirty && listLength(server.slaves))
|
|
replicationFeedSlaves(server.slaves,cmd,c->db->id,c->argv,c->argc);
|
|
if (listLength(server.monitors))
|
|
replicationFeedSlaves(server.monitors,cmd,c->db->id,c->argv,c->argc);
|
|
server.stat_numcommands++;
|
|
|
|
/* Prepare the client for the next command */
|
|
if (c->flags & REDIS_CLOSE) {
|
|
freeClient(c);
|
|
return 0;
|
|
}
|
|
resetClient(c);
|
|
return 1;
|
|
}
|
|
|
|
static void replicationFeedSlaves(list *slaves, struct redisCommand *cmd, int dictid, robj **argv, int argc) {
|
|
listNode *ln;
|
|
int outc = 0, j;
|
|
robj **outv;
|
|
/* (args*2)+1 is enough room for args, spaces, newlines */
|
|
robj *static_outv[REDIS_STATIC_ARGS*2+1];
|
|
|
|
if (argc <= REDIS_STATIC_ARGS) {
|
|
outv = static_outv;
|
|
} else {
|
|
outv = zmalloc(sizeof(robj*)*(argc*2+1));
|
|
}
|
|
|
|
for (j = 0; j < argc; j++) {
|
|
if (j != 0) outv[outc++] = shared.space;
|
|
if ((cmd->flags & REDIS_CMD_BULK) && j == argc-1) {
|
|
robj *lenobj;
|
|
|
|
lenobj = createObject(REDIS_STRING,
|
|
sdscatprintf(sdsempty(),"%lu\r\n",
|
|
(unsigned long) stringObjectLen(argv[j])));
|
|
lenobj->refcount = 0;
|
|
outv[outc++] = lenobj;
|
|
}
|
|
outv[outc++] = argv[j];
|
|
}
|
|
outv[outc++] = shared.crlf;
|
|
|
|
/* Increment all the refcounts at start and decrement at end in order to
|
|
* be sure to free objects if there is no slave in a replication state
|
|
* able to be feed with commands */
|
|
for (j = 0; j < outc; j++) incrRefCount(outv[j]);
|
|
listRewind(slaves);
|
|
while((ln = listYield(slaves))) {
|
|
redisClient *slave = ln->value;
|
|
|
|
/* Don't feed slaves that are still waiting for BGSAVE to start */
|
|
if (slave->replstate == REDIS_REPL_WAIT_BGSAVE_START) continue;
|
|
|
|
/* Feed all the other slaves, MONITORs and so on */
|
|
if (slave->slaveseldb != dictid) {
|
|
robj *selectcmd;
|
|
|
|
switch(dictid) {
|
|
case 0: selectcmd = shared.select0; break;
|
|
case 1: selectcmd = shared.select1; break;
|
|
case 2: selectcmd = shared.select2; break;
|
|
case 3: selectcmd = shared.select3; break;
|
|
case 4: selectcmd = shared.select4; break;
|
|
case 5: selectcmd = shared.select5; break;
|
|
case 6: selectcmd = shared.select6; break;
|
|
case 7: selectcmd = shared.select7; break;
|
|
case 8: selectcmd = shared.select8; break;
|
|
case 9: selectcmd = shared.select9; break;
|
|
default:
|
|
selectcmd = createObject(REDIS_STRING,
|
|
sdscatprintf(sdsempty(),"select %d\r\n",dictid));
|
|
selectcmd->refcount = 0;
|
|
break;
|
|
}
|
|
addReply(slave,selectcmd);
|
|
slave->slaveseldb = dictid;
|
|
}
|
|
for (j = 0; j < outc; j++) addReply(slave,outv[j]);
|
|
}
|
|
for (j = 0; j < outc; j++) decrRefCount(outv[j]);
|
|
if (outv != static_outv) zfree(outv);
|
|
}
|
|
|
|
static void processInputBuffer(redisClient *c) {
|
|
again:
|
|
if (c->bulklen == -1) {
|
|
/* Read the first line of the query */
|
|
char *p = strchr(c->querybuf,'\n');
|
|
size_t querylen;
|
|
|
|
if (p) {
|
|
sds query, *argv;
|
|
int argc, j;
|
|
|
|
query = c->querybuf;
|
|
c->querybuf = sdsempty();
|
|
querylen = 1+(p-(query));
|
|
if (sdslen(query) > querylen) {
|
|
/* leave data after the first line of the query in the buffer */
|
|
c->querybuf = sdscatlen(c->querybuf,query+querylen,sdslen(query)-querylen);
|
|
}
|
|
*p = '\0'; /* remove "\n" */
|
|
if (*(p-1) == '\r') *(p-1) = '\0'; /* and "\r" if any */
|
|
sdsupdatelen(query);
|
|
|
|
/* Now we can split the query in arguments */
|
|
argv = sdssplitlen(query,sdslen(query)," ",1,&argc);
|
|
sdsfree(query);
|
|
|
|
if (c->argv) zfree(c->argv);
|
|
c->argv = zmalloc(sizeof(robj*)*argc);
|
|
|
|
for (j = 0; j < argc; j++) {
|
|
if (sdslen(argv[j])) {
|
|
c->argv[c->argc] = createObject(REDIS_STRING,argv[j]);
|
|
c->argc++;
|
|
} else {
|
|
sdsfree(argv[j]);
|
|
}
|
|
}
|
|
zfree(argv);
|
|
if (c->argc) {
|
|
/* Execute the command. If the client is still valid
|
|
* after processCommand() return and there is something
|
|
* on the query buffer try to process the next command. */
|
|
if (processCommand(c) && sdslen(c->querybuf)) goto again;
|
|
} else {
|
|
/* Nothing to process, argc == 0. Just process the query
|
|
* buffer if it's not empty or return to the caller */
|
|
if (sdslen(c->querybuf)) goto again;
|
|
}
|
|
return;
|
|
} else if (sdslen(c->querybuf) >= REDIS_REQUEST_MAX_SIZE) {
|
|
redisLog(REDIS_DEBUG, "Client protocol error");
|
|
freeClient(c);
|
|
return;
|
|
}
|
|
} else {
|
|
/* Bulk read handling. Note that if we are at this point
|
|
the client already sent a command terminated with a newline,
|
|
we are reading the bulk data that is actually the last
|
|
argument of the command. */
|
|
int qbl = sdslen(c->querybuf);
|
|
|
|
if (c->bulklen <= qbl) {
|
|
/* Copy everything but the final CRLF as final argument */
|
|
c->argv[c->argc] = createStringObject(c->querybuf,c->bulklen-2);
|
|
c->argc++;
|
|
c->querybuf = sdsrange(c->querybuf,c->bulklen,-1);
|
|
/* Process the command. If the client is still valid after
|
|
* the processing and there is more data in the buffer
|
|
* try to parse it. */
|
|
if (processCommand(c) && sdslen(c->querybuf)) goto again;
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
static void readQueryFromClient(aeEventLoop *el, int fd, void *privdata, int mask) {
|
|
redisClient *c = (redisClient*) privdata;
|
|
char buf[REDIS_IOBUF_LEN];
|
|
int nread;
|
|
REDIS_NOTUSED(el);
|
|
REDIS_NOTUSED(mask);
|
|
|
|
nread = read(fd, buf, REDIS_IOBUF_LEN);
|
|
if (nread == -1) {
|
|
if (errno == EAGAIN) {
|
|
nread = 0;
|
|
} else {
|
|
redisLog(REDIS_DEBUG, "Reading from client: %s",strerror(errno));
|
|
freeClient(c);
|
|
return;
|
|
}
|
|
} else if (nread == 0) {
|
|
redisLog(REDIS_DEBUG, "Client closed connection");
|
|
freeClient(c);
|
|
return;
|
|
}
|
|
if (nread) {
|
|
c->querybuf = sdscatlen(c->querybuf, buf, nread);
|
|
c->lastinteraction = time(NULL);
|
|
} else {
|
|
return;
|
|
}
|
|
processInputBuffer(c);
|
|
}
|
|
|
|
static int selectDb(redisClient *c, int id) {
|
|
if (id < 0 || id >= server.dbnum)
|
|
return REDIS_ERR;
|
|
c->db = &server.db[id];
|
|
return REDIS_OK;
|
|
}
|
|
|
|
static void *dupClientReplyValue(void *o) {
|
|
incrRefCount((robj*)o);
|
|
return 0;
|
|
}
|
|
|
|
static redisClient *createClient(int fd) {
|
|
redisClient *c = zmalloc(sizeof(*c));
|
|
|
|
anetNonBlock(NULL,fd);
|
|
anetTcpNoDelay(NULL,fd);
|
|
if (!c) return NULL;
|
|
selectDb(c,0);
|
|
c->fd = fd;
|
|
c->querybuf = sdsempty();
|
|
c->argc = 0;
|
|
c->argv = NULL;
|
|
c->bulklen = -1;
|
|
c->multibulk = 0;
|
|
c->mbargc = 0;
|
|
c->mbargv = NULL;
|
|
c->sentlen = 0;
|
|
c->flags = 0;
|
|
c->lastinteraction = time(NULL);
|
|
c->authenticated = 0;
|
|
c->replstate = REDIS_REPL_NONE;
|
|
c->reply = listCreate();
|
|
listSetFreeMethod(c->reply,decrRefCount);
|
|
listSetDupMethod(c->reply,dupClientReplyValue);
|
|
if (aeCreateFileEvent(server.el, c->fd, AE_READABLE,
|
|
readQueryFromClient, c) == AE_ERR) {
|
|
freeClient(c);
|
|
return NULL;
|
|
}
|
|
listAddNodeTail(server.clients,c);
|
|
return c;
|
|
}
|
|
|
|
static void addReply(redisClient *c, robj *obj) {
|
|
if (listLength(c->reply) == 0 &&
|
|
(c->replstate == REDIS_REPL_NONE ||
|
|
c->replstate == REDIS_REPL_ONLINE) &&
|
|
aeCreateFileEvent(server.el, c->fd, AE_WRITABLE,
|
|
sendReplyToClient, c) == AE_ERR) return;
|
|
listAddNodeTail(c->reply,getDecodedObject(obj));
|
|
}
|
|
|
|
static void addReplySds(redisClient *c, sds s) {
|
|
robj *o = createObject(REDIS_STRING,s);
|
|
addReply(c,o);
|
|
decrRefCount(o);
|
|
}
|
|
|
|
static void addReplyDouble(redisClient *c, double d) {
|
|
char buf[128];
|
|
|
|
snprintf(buf,sizeof(buf),"%.17g",d);
|
|
addReplySds(c,sdscatprintf(sdsempty(),"$%lu\r\n%s\r\n",
|
|
(unsigned long) strlen(buf),buf));
|
|
}
|
|
|
|
static void addReplyBulkLen(redisClient *c, robj *obj) {
|
|
size_t len;
|
|
|
|
if (obj->encoding == REDIS_ENCODING_RAW) {
|
|
len = sdslen(obj->ptr);
|
|
} else {
|
|
long n = (long)obj->ptr;
|
|
|
|
/* Compute how many bytes will take this integer as a radix 10 string */
|
|
len = 1;
|
|
if (n < 0) {
|
|
len++;
|
|
n = -n;
|
|
}
|
|
while((n = n/10) != 0) {
|
|
len++;
|
|
}
|
|
}
|
|
addReplySds(c,sdscatprintf(sdsempty(),"$%lu\r\n",(unsigned long)len));
|
|
}
|
|
|
|
static void acceptHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
|
|
int cport, cfd;
|
|
char cip[128];
|
|
redisClient *c;
|
|
REDIS_NOTUSED(el);
|
|
REDIS_NOTUSED(mask);
|
|
REDIS_NOTUSED(privdata);
|
|
|
|
cfd = anetAccept(server.neterr, fd, cip, &cport);
|
|
if (cfd == AE_ERR) {
|
|
redisLog(REDIS_DEBUG,"Accepting client connection: %s", server.neterr);
|
|
return;
|
|
}
|
|
redisLog(REDIS_DEBUG,"Accepted %s:%d", cip, cport);
|
|
if ((c = createClient(cfd)) == NULL) {
|
|
redisLog(REDIS_WARNING,"Error allocating resoures for the client");
|
|
close(cfd); /* May be already closed, just ingore errors */
|
|
return;
|
|
}
|
|
/* If maxclient directive is set and this is one client more... close the
|
|
* connection. Note that we create the client instead to check before
|
|
* for this condition, since now the socket is already set in nonblocking
|
|
* mode and we can send an error for free using the Kernel I/O */
|
|
if (server.maxclients && listLength(server.clients) > server.maxclients) {
|
|
char *err = "-ERR max number of clients reached\r\n";
|
|
|
|
/* That's a best effort error message, don't check write errors */
|
|
if (write(c->fd,err,strlen(err)) == -1) {
|
|
/* Nothing to do, Just to avoid the warning... */
|
|
}
|
|
freeClient(c);
|
|
return;
|
|
}
|
|
server.stat_numconnections++;
|
|
}
|
|
|
|
/* ======================= Redis objects implementation ===================== */
|
|
|
|
static robj *createObject(int type, void *ptr) {
|
|
robj *o;
|
|
|
|
if (listLength(server.objfreelist)) {
|
|
listNode *head = listFirst(server.objfreelist);
|
|
o = listNodeValue(head);
|
|
listDelNode(server.objfreelist,head);
|
|
} else {
|
|
o = zmalloc(sizeof(*o));
|
|
}
|
|
o->type = type;
|
|
o->encoding = REDIS_ENCODING_RAW;
|
|
o->ptr = ptr;
|
|
o->refcount = 1;
|
|
return o;
|
|
}
|
|
|
|
static robj *createStringObject(char *ptr, size_t len) {
|
|
return createObject(REDIS_STRING,sdsnewlen(ptr,len));
|
|
}
|
|
|
|
static robj *createListObject(void) {
|
|
list *l = listCreate();
|
|
|
|
listSetFreeMethod(l,decrRefCount);
|
|
return createObject(REDIS_LIST,l);
|
|
}
|
|
|
|
static robj *createSetObject(void) {
|
|
dict *d = dictCreate(&setDictType,NULL);
|
|
return createObject(REDIS_SET,d);
|
|
}
|
|
|
|
static robj *createZsetObject(void) {
|
|
zset *zs = zmalloc(sizeof(*zs));
|
|
|
|
zs->dict = dictCreate(&zsetDictType,NULL);
|
|
zs->zsl = zslCreate();
|
|
return createObject(REDIS_ZSET,zs);
|
|
}
|
|
|
|
static void freeStringObject(robj *o) {
|
|
if (o->encoding == REDIS_ENCODING_RAW) {
|
|
sdsfree(o->ptr);
|
|
}
|
|
}
|
|
|
|
static void freeListObject(robj *o) {
|
|
listRelease((list*) o->ptr);
|
|
}
|
|
|
|
static void freeSetObject(robj *o) {
|
|
dictRelease((dict*) o->ptr);
|
|
}
|
|
|
|
static void freeZsetObject(robj *o) {
|
|
zset *zs = o->ptr;
|
|
|
|
dictRelease(zs->dict);
|
|
zslFree(zs->zsl);
|
|
zfree(zs);
|
|
}
|
|
|
|
static void freeHashObject(robj *o) {
|
|
dictRelease((dict*) o->ptr);
|
|
}
|
|
|
|
static void incrRefCount(robj *o) {
|
|
o->refcount++;
|
|
#ifdef DEBUG_REFCOUNT
|
|
if (o->type == REDIS_STRING)
|
|
printf("Increment '%s'(%p), now is: %d\n",o->ptr,o,o->refcount);
|
|
#endif
|
|
}
|
|
|
|
static void decrRefCount(void *obj) {
|
|
robj *o = obj;
|
|
|
|
#ifdef DEBUG_REFCOUNT
|
|
if (o->type == REDIS_STRING)
|
|
printf("Decrement '%s'(%p), now is: %d\n",o->ptr,o,o->refcount-1);
|
|
#endif
|
|
if (--(o->refcount) == 0) {
|
|
switch(o->type) {
|
|
case REDIS_STRING: freeStringObject(o); break;
|
|
case REDIS_LIST: freeListObject(o); break;
|
|
case REDIS_SET: freeSetObject(o); break;
|
|
case REDIS_ZSET: freeZsetObject(o); break;
|
|
case REDIS_HASH: freeHashObject(o); break;
|
|
default: redisAssert(0 != 0); break;
|
|
}
|
|
if (listLength(server.objfreelist) > REDIS_OBJFREELIST_MAX ||
|
|
!listAddNodeHead(server.objfreelist,o))
|
|
zfree(o);
|
|
}
|
|
}
|
|
|
|
static robj *lookupKey(redisDb *db, robj *key) {
|
|
dictEntry *de = dictFind(db->dict,key);
|
|
return de ? dictGetEntryVal(de) : NULL;
|
|
}
|
|
|
|
static robj *lookupKeyRead(redisDb *db, robj *key) {
|
|
expireIfNeeded(db,key);
|
|
return lookupKey(db,key);
|
|
}
|
|
|
|
static robj *lookupKeyWrite(redisDb *db, robj *key) {
|
|
deleteIfVolatile(db,key);
|
|
return lookupKey(db,key);
|
|
}
|
|
|
|
static int deleteKey(redisDb *db, robj *key) {
|
|
int retval;
|
|
|
|
/* We need to protect key from destruction: after the first dictDelete()
|
|
* it may happen that 'key' is no longer valid if we don't increment
|
|
* it's count. This may happen when we get the object reference directly
|
|
* from the hash table with dictRandomKey() or dict iterators */
|
|
incrRefCount(key);
|
|
if (dictSize(db->expires)) dictDelete(db->expires,key);
|
|
retval = dictDelete(db->dict,key);
|
|
decrRefCount(key);
|
|
|
|
return retval == DICT_OK;
|
|
}
|
|
|
|
/* Try to share an object against the shared objects pool */
|
|
static robj *tryObjectSharing(robj *o) {
|
|
struct dictEntry *de;
|
|
unsigned long c;
|
|
|
|
if (o == NULL || server.shareobjects == 0) return o;
|
|
|
|
redisAssert(o->type == REDIS_STRING);
|
|
de = dictFind(server.sharingpool,o);
|
|
if (de) {
|
|
robj *shared = dictGetEntryKey(de);
|
|
|
|
c = ((unsigned long) dictGetEntryVal(de))+1;
|
|
dictGetEntryVal(de) = (void*) c;
|
|
incrRefCount(shared);
|
|
decrRefCount(o);
|
|
return shared;
|
|
} else {
|
|
/* Here we are using a stream algorihtm: Every time an object is
|
|
* shared we increment its count, everytime there is a miss we
|
|
* recrement the counter of a random object. If this object reaches
|
|
* zero we remove the object and put the current object instead. */
|
|
if (dictSize(server.sharingpool) >=
|
|
server.sharingpoolsize) {
|
|
de = dictGetRandomKey(server.sharingpool);
|
|
redisAssert(de != NULL);
|
|
c = ((unsigned long) dictGetEntryVal(de))-1;
|
|
dictGetEntryVal(de) = (void*) c;
|
|
if (c == 0) {
|
|
dictDelete(server.sharingpool,de->key);
|
|
}
|
|
} else {
|
|
c = 0; /* If the pool is empty we want to add this object */
|
|
}
|
|
if (c == 0) {
|
|
int retval;
|
|
|
|
retval = dictAdd(server.sharingpool,o,(void*)1);
|
|
redisAssert(retval == DICT_OK);
|
|
incrRefCount(o);
|
|
}
|
|
return o;
|
|
}
|
|
}
|
|
|
|
/* Check if the nul-terminated string 's' can be represented by a long
|
|
* (that is, is a number that fits into long without any other space or
|
|
* character before or after the digits).
|
|
*
|
|
* If so, the function returns REDIS_OK and *longval is set to the value
|
|
* of the number. Otherwise REDIS_ERR is returned */
|
|
static int isStringRepresentableAsLong(sds s, long *longval) {
|
|
char buf[32], *endptr;
|
|
long value;
|
|
int slen;
|
|
|
|
value = strtol(s, &endptr, 10);
|
|
if (endptr[0] != '\0') return REDIS_ERR;
|
|
slen = snprintf(buf,32,"%ld",value);
|
|
|
|
/* If the number converted back into a string is not identical
|
|
* then it's not possible to encode the string as integer */
|
|
if (sdslen(s) != (unsigned)slen || memcmp(buf,s,slen)) return REDIS_ERR;
|
|
if (longval) *longval = value;
|
|
return REDIS_OK;
|
|
}
|
|
|
|
/* Try to encode a string object in order to save space */
|
|
static int tryObjectEncoding(robj *o) {
|
|
long value;
|
|
sds s = o->ptr;
|
|
|
|
if (o->encoding != REDIS_ENCODING_RAW)
|
|
return REDIS_ERR; /* Already encoded */
|
|
|
|
/* It's not save to encode shared objects: shared objects can be shared
|
|
* everywhere in the "object space" of Redis. Encoded objects can only
|
|
* appear as "values" (and not, for instance, as keys) */
|
|
if (o->refcount > 1) return REDIS_ERR;
|
|
|
|
/* Currently we try to encode only strings */
|
|
redisAssert(o->type == REDIS_STRING);
|
|
|
|
/* Check if we can represent this string as a long integer */
|
|
if (isStringRepresentableAsLong(s,&value) == REDIS_ERR) return REDIS_ERR;
|
|
|
|
/* Ok, this object can be encoded */
|
|
o->encoding = REDIS_ENCODING_INT;
|
|
sdsfree(o->ptr);
|
|
o->ptr = (void*) value;
|
|
return REDIS_OK;
|
|
}
|
|
|
|
/* Get a decoded version of an encoded object (returned as a new object).
|
|
* If the object is already raw-encoded just increment the ref count. */
|
|
static robj *getDecodedObject(robj *o) {
|
|
robj *dec;
|
|
|
|
if (o->encoding == REDIS_ENCODING_RAW) {
|
|
incrRefCount(o);
|
|
return o;
|
|
}
|
|
if (o->type == REDIS_STRING && o->encoding == REDIS_ENCODING_INT) {
|
|
char buf[32];
|
|
|
|
snprintf(buf,32,"%ld",(long)o->ptr);
|
|
dec = createStringObject(buf,strlen(buf));
|
|
return dec;
|
|
} else {
|
|
redisAssert(1 != 1);
|
|
}
|
|
}
|
|
|
|
/* Compare two string objects via strcmp() or alike.
|
|
* Note that the objects may be integer-encoded. In such a case we
|
|
* use snprintf() to get a string representation of the numbers on the stack
|
|
* and compare the strings, it's much faster than calling getDecodedObject().
|
|
*
|
|
* Important note: if objects are not integer encoded, but binary-safe strings,
|
|
* sdscmp() from sds.c will apply memcmp() so this function ca be considered
|
|
* binary safe. */
|
|
static int compareStringObjects(robj *a, robj *b) {
|
|
redisAssert(a->type == REDIS_STRING && b->type == REDIS_STRING);
|
|
char bufa[128], bufb[128], *astr, *bstr;
|
|
int bothsds = 1;
|
|
|
|
if (a == b) return 0;
|
|
if (a->encoding != REDIS_ENCODING_RAW) {
|
|
snprintf(bufa,sizeof(bufa),"%ld",(long) a->ptr);
|
|
astr = bufa;
|
|
bothsds = 0;
|
|
} else {
|
|
astr = a->ptr;
|
|
}
|
|
if (b->encoding != REDIS_ENCODING_RAW) {
|
|
snprintf(bufb,sizeof(bufb),"%ld",(long) b->ptr);
|
|
bstr = bufb;
|
|
bothsds = 0;
|
|
} else {
|
|
bstr = b->ptr;
|
|
}
|
|
return bothsds ? sdscmp(astr,bstr) : strcmp(astr,bstr);
|
|
}
|
|
|
|
static size_t stringObjectLen(robj *o) {
|
|
redisAssert(o->type == REDIS_STRING);
|
|
if (o->encoding == REDIS_ENCODING_RAW) {
|
|
return sdslen(o->ptr);
|
|
} else {
|
|
char buf[32];
|
|
|
|
return snprintf(buf,32,"%ld",(long)o->ptr);
|
|
}
|
|
}
|
|
|
|
/*============================ DB saving/loading ============================ */
|
|
|
|
static int rdbSaveType(FILE *fp, unsigned char type) {
|
|
if (fwrite(&type,1,1,fp) == 0) return -1;
|
|
return 0;
|
|
}
|
|
|
|
static int rdbSaveTime(FILE *fp, time_t t) {
|
|
int32_t t32 = (int32_t) t;
|
|
if (fwrite(&t32,4,1,fp) == 0) return -1;
|
|
return 0;
|
|
}
|
|
|
|
/* check rdbLoadLen() comments for more info */
|
|
static int rdbSaveLen(FILE *fp, uint32_t len) {
|
|
unsigned char buf[2];
|
|
|
|
if (len < (1<<6)) {
|
|
/* Save a 6 bit len */
|
|
buf[0] = (len&0xFF)|(REDIS_RDB_6BITLEN<<6);
|
|
if (fwrite(buf,1,1,fp) == 0) return -1;
|
|
} else if (len < (1<<14)) {
|
|
/* Save a 14 bit len */
|
|
buf[0] = ((len>>8)&0xFF)|(REDIS_RDB_14BITLEN<<6);
|
|
buf[1] = len&0xFF;
|
|
if (fwrite(buf,2,1,fp) == 0) return -1;
|
|
} else {
|
|
/* Save a 32 bit len */
|
|
buf[0] = (REDIS_RDB_32BITLEN<<6);
|
|
if (fwrite(buf,1,1,fp) == 0) return -1;
|
|
len = htonl(len);
|
|
if (fwrite(&len,4,1,fp) == 0) return -1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/* String objects in the form "2391" "-100" without any space and with a
|
|
* range of values that can fit in an 8, 16 or 32 bit signed value can be
|
|
* encoded as integers to save space */
|
|
static int rdbTryIntegerEncoding(sds s, unsigned char *enc) {
|
|
long long value;
|
|
char *endptr, buf[32];
|
|
|
|
/* Check if it's possible to encode this value as a number */
|
|
value = strtoll(s, &endptr, 10);
|
|
if (endptr[0] != '\0') return 0;
|
|
snprintf(buf,32,"%lld",value);
|
|
|
|
/* If the number converted back into a string is not identical
|
|
* then it's not possible to encode the string as integer */
|
|
if (strlen(buf) != sdslen(s) || memcmp(buf,s,sdslen(s))) return 0;
|
|
|
|
/* Finally check if it fits in our ranges */
|
|
if (value >= -(1<<7) && value <= (1<<7)-1) {
|
|
enc[0] = (REDIS_RDB_ENCVAL<<6)|REDIS_RDB_ENC_INT8;
|
|
enc[1] = value&0xFF;
|
|
return 2;
|
|
} else if (value >= -(1<<15) && value <= (1<<15)-1) {
|
|
enc[0] = (REDIS_RDB_ENCVAL<<6)|REDIS_RDB_ENC_INT16;
|
|
enc[1] = value&0xFF;
|
|
enc[2] = (value>>8)&0xFF;
|
|
return 3;
|
|
} else if (value >= -((long long)1<<31) && value <= ((long long)1<<31)-1) {
|
|
enc[0] = (REDIS_RDB_ENCVAL<<6)|REDIS_RDB_ENC_INT32;
|
|
enc[1] = value&0xFF;
|
|
enc[2] = (value>>8)&0xFF;
|
|
enc[3] = (value>>16)&0xFF;
|
|
enc[4] = (value>>24)&0xFF;
|
|
return 5;
|
|
} else {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
static int rdbSaveLzfStringObject(FILE *fp, robj *obj) {
|
|
unsigned int comprlen, outlen;
|
|
unsigned char byte;
|
|
void *out;
|
|
|
|
/* We require at least four bytes compression for this to be worth it */
|
|
outlen = sdslen(obj->ptr)-4;
|
|
if (outlen <= 0) return 0;
|
|
if ((out = zmalloc(outlen+1)) == NULL) return 0;
|
|
comprlen = lzf_compress(obj->ptr, sdslen(obj->ptr), out, outlen);
|
|
if (comprlen == 0) {
|
|
zfree(out);
|
|
return 0;
|
|
}
|
|
/* Data compressed! Let's save it on disk */
|
|
byte = (REDIS_RDB_ENCVAL<<6)|REDIS_RDB_ENC_LZF;
|
|
if (fwrite(&byte,1,1,fp) == 0) goto writeerr;
|
|
if (rdbSaveLen(fp,comprlen) == -1) goto writeerr;
|
|
if (rdbSaveLen(fp,sdslen(obj->ptr)) == -1) goto writeerr;
|
|
if (fwrite(out,comprlen,1,fp) == 0) goto writeerr;
|
|
zfree(out);
|
|
return comprlen;
|
|
|
|
writeerr:
|
|
zfree(out);
|
|
return -1;
|
|
}
|
|
|
|
/* Save a string objet as [len][data] on disk. If the object is a string
|
|
* representation of an integer value we try to safe it in a special form */
|
|
static int rdbSaveStringObjectRaw(FILE *fp, robj *obj) {
|
|
size_t len;
|
|
int enclen;
|
|
|
|
len = sdslen(obj->ptr);
|
|
|
|
/* Try integer encoding */
|
|
if (len <= 11) {
|
|
unsigned char buf[5];
|
|
if ((enclen = rdbTryIntegerEncoding(obj->ptr,buf)) > 0) {
|
|
if (fwrite(buf,enclen,1,fp) == 0) return -1;
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
/* Try LZF compression - under 20 bytes it's unable to compress even
|
|
* aaaaaaaaaaaaaaaaaa so skip it */
|
|
if (len > 20) {
|
|
int retval;
|
|
|
|
retval = rdbSaveLzfStringObject(fp,obj);
|
|
if (retval == -1) return -1;
|
|
if (retval > 0) return 0;
|
|
/* retval == 0 means data can't be compressed, save the old way */
|
|
}
|
|
|
|
/* Store verbatim */
|
|
if (rdbSaveLen(fp,len) == -1) return -1;
|
|
if (len && fwrite(obj->ptr,len,1,fp) == 0) return -1;
|
|
return 0;
|
|
}
|
|
|
|
/* Like rdbSaveStringObjectRaw() but handle encoded objects */
|
|
static int rdbSaveStringObject(FILE *fp, robj *obj) {
|
|
int retval;
|
|
|
|
obj = getDecodedObject(obj);
|
|
retval = rdbSaveStringObjectRaw(fp,obj);
|
|
decrRefCount(obj);
|
|
return retval;
|
|
}
|
|
|
|
/* Save a double value. Doubles are saved as strings prefixed by an unsigned
|
|
* 8 bit integer specifing the length of the representation.
|
|
* This 8 bit integer has special values in order to specify the following
|
|
* conditions:
|
|
* 253: not a number
|
|
* 254: + inf
|
|
* 255: - inf
|
|
*/
|
|
static int rdbSaveDoubleValue(FILE *fp, double val) {
|
|
unsigned char buf[128];
|
|
int len;
|
|
|
|
if (isnan(val)) {
|
|
buf[0] = 253;
|
|
len = 1;
|
|
} else if (!isfinite(val)) {
|
|
len = 1;
|
|
buf[0] = (val < 0) ? 255 : 254;
|
|
} else {
|
|
snprintf((char*)buf+1,sizeof(buf)-1,"%.17g",val);
|
|
buf[0] = strlen((char*)buf+1);
|
|
len = buf[0]+1;
|
|
}
|
|
if (fwrite(buf,len,1,fp) == 0) return -1;
|
|
return 0;
|
|
}
|
|
|
|
/* Save the DB on disk. Return REDIS_ERR on error, REDIS_OK on success */
|
|
static int rdbSave(char *filename) {
|
|
dictIterator *di = NULL;
|
|
dictEntry *de;
|
|
FILE *fp;
|
|
char tmpfile[256];
|
|
int j;
|
|
time_t now = time(NULL);
|
|
|
|
snprintf(tmpfile,256,"temp-%d.rdb", (int) getpid());
|
|
fp = fopen(tmpfile,"w");
|
|
if (!fp) {
|
|
redisLog(REDIS_WARNING, "Failed saving the DB: %s", strerror(errno));
|
|
return REDIS_ERR;
|
|
}
|
|
if (fwrite("REDIS0001",9,1,fp) == 0) goto werr;
|
|
for (j = 0; j < server.dbnum; j++) {
|
|
redisDb *db = server.db+j;
|
|
dict *d = db->dict;
|
|
if (dictSize(d) == 0) continue;
|
|
di = dictGetIterator(d);
|
|
if (!di) {
|
|
fclose(fp);
|
|
return REDIS_ERR;
|
|
}
|
|
|
|
/* Write the SELECT DB opcode */
|
|
if (rdbSaveType(fp,REDIS_SELECTDB) == -1) goto werr;
|
|
if (rdbSaveLen(fp,j) == -1) goto werr;
|
|
|
|
/* Iterate this DB writing every entry */
|
|
while((de = dictNext(di)) != NULL) {
|
|
robj *key = dictGetEntryKey(de);
|
|
robj *o = dictGetEntryVal(de);
|
|
time_t expiretime = getExpire(db,key);
|
|
|
|
/* Save the expire time */
|
|
if (expiretime != -1) {
|
|
/* If this key is already expired skip it */
|
|
if (expiretime < now) continue;
|
|
if (rdbSaveType(fp,REDIS_EXPIRETIME) == -1) goto werr;
|
|
if (rdbSaveTime(fp,expiretime) == -1) goto werr;
|
|
}
|
|
/* Save the key and associated value */
|
|
if (rdbSaveType(fp,o->type) == -1) goto werr;
|
|
if (rdbSaveStringObject(fp,key) == -1) goto werr;
|
|
if (o->type == REDIS_STRING) {
|
|
/* Save a string value */
|
|
if (rdbSaveStringObject(fp,o) == -1) goto werr;
|
|
} else if (o->type == REDIS_LIST) {
|
|
/* Save a list value */
|
|
list *list = o->ptr;
|
|
listNode *ln;
|
|
|
|
listRewind(list);
|
|
if (rdbSaveLen(fp,listLength(list)) == -1) goto werr;
|
|
while((ln = listYield(list))) {
|
|
robj *eleobj = listNodeValue(ln);
|
|
|
|
if (rdbSaveStringObject(fp,eleobj) == -1) goto werr;
|
|
}
|
|
} else if (o->type == REDIS_SET) {
|
|
/* Save a set value */
|
|
dict *set = o->ptr;
|
|
dictIterator *di = dictGetIterator(set);
|
|
dictEntry *de;
|
|
|
|
if (rdbSaveLen(fp,dictSize(set)) == -1) goto werr;
|
|
while((de = dictNext(di)) != NULL) {
|
|
robj *eleobj = dictGetEntryKey(de);
|
|
|
|
if (rdbSaveStringObject(fp,eleobj) == -1) goto werr;
|
|
}
|
|
dictReleaseIterator(di);
|
|
} else if (o->type == REDIS_ZSET) {
|
|
/* Save a set value */
|
|
zset *zs = o->ptr;
|
|
dictIterator *di = dictGetIterator(zs->dict);
|
|
dictEntry *de;
|
|
|
|
if (rdbSaveLen(fp,dictSize(zs->dict)) == -1) goto werr;
|
|
while((de = dictNext(di)) != NULL) {
|
|
robj *eleobj = dictGetEntryKey(de);
|
|
double *score = dictGetEntryVal(de);
|
|
|
|
if (rdbSaveStringObject(fp,eleobj) == -1) goto werr;
|
|
if (rdbSaveDoubleValue(fp,*score) == -1) goto werr;
|
|
}
|
|
dictReleaseIterator(di);
|
|
} else {
|
|
redisAssert(0 != 0);
|
|
}
|
|
}
|
|
dictReleaseIterator(di);
|
|
}
|
|
/* EOF opcode */
|
|
if (rdbSaveType(fp,REDIS_EOF) == -1) goto werr;
|
|
|
|
/* Make sure data will not remain on the OS's output buffers */
|
|
fflush(fp);
|
|
fsync(fileno(fp));
|
|
fclose(fp);
|
|
|
|
/* Use RENAME to make sure the DB file is changed atomically only
|
|
* if the generate DB file is ok. */
|
|
if (rename(tmpfile,filename) == -1) {
|
|
redisLog(REDIS_WARNING,"Error moving temp DB file on the final destination: %s", strerror(errno));
|
|
unlink(tmpfile);
|
|
return REDIS_ERR;
|
|
}
|
|
redisLog(REDIS_NOTICE,"DB saved on disk");
|
|
server.dirty = 0;
|
|
server.lastsave = time(NULL);
|
|
return REDIS_OK;
|
|
|
|
werr:
|
|
fclose(fp);
|
|
unlink(tmpfile);
|
|
redisLog(REDIS_WARNING,"Write error saving DB on disk: %s", strerror(errno));
|
|
if (di) dictReleaseIterator(di);
|
|
return REDIS_ERR;
|
|
}
|
|
|
|
static int rdbSaveBackground(char *filename) {
|
|
pid_t childpid;
|
|
|
|
if (server.bgsavechildpid != -1) return REDIS_ERR;
|
|
if ((childpid = fork()) == 0) {
|
|
/* Child */
|
|
close(server.fd);
|
|
if (rdbSave(filename) == REDIS_OK) {
|
|
exit(0);
|
|
} else {
|
|
exit(1);
|
|
}
|
|
} else {
|
|
/* Parent */
|
|
if (childpid == -1) {
|
|
redisLog(REDIS_WARNING,"Can't save in background: fork: %s",
|
|
strerror(errno));
|
|
return REDIS_ERR;
|
|
}
|
|
redisLog(REDIS_NOTICE,"Background saving started by pid %d",childpid);
|
|
server.bgsavechildpid = childpid;
|
|
return REDIS_OK;
|
|
}
|
|
return REDIS_OK; /* unreached */
|
|
}
|
|
|
|
static void rdbRemoveTempFile(pid_t childpid) {
|
|
char tmpfile[256];
|
|
|
|
snprintf(tmpfile,256,"temp-%d.rdb", (int) childpid);
|
|
unlink(tmpfile);
|
|
}
|
|
|
|
static int rdbLoadType(FILE *fp) {
|
|
unsigned char type;
|
|
if (fread(&type,1,1,fp) == 0) return -1;
|
|
return type;
|
|
}
|
|
|
|
static time_t rdbLoadTime(FILE *fp) {
|
|
int32_t t32;
|
|
if (fread(&t32,4,1,fp) == 0) return -1;
|
|
return (time_t) t32;
|
|
}
|
|
|
|
/* Load an encoded length from the DB, see the REDIS_RDB_* defines on the top
|
|
* of this file for a description of how this are stored on disk.
|
|
*
|
|
* isencoded is set to 1 if the readed length is not actually a length but
|
|
* an "encoding type", check the above comments for more info */
|
|
static uint32_t rdbLoadLen(FILE *fp, int rdbver, int *isencoded) {
|
|
unsigned char buf[2];
|
|
uint32_t len;
|
|
|
|
if (isencoded) *isencoded = 0;
|
|
if (rdbver == 0) {
|
|
if (fread(&len,4,1,fp) == 0) return REDIS_RDB_LENERR;
|
|
return ntohl(len);
|
|
} else {
|
|
int type;
|
|
|
|
if (fread(buf,1,1,fp) == 0) return REDIS_RDB_LENERR;
|
|
type = (buf[0]&0xC0)>>6;
|
|
if (type == REDIS_RDB_6BITLEN) {
|
|
/* Read a 6 bit len */
|
|
return buf[0]&0x3F;
|
|
} else if (type == REDIS_RDB_ENCVAL) {
|
|
/* Read a 6 bit len encoding type */
|
|
if (isencoded) *isencoded = 1;
|
|
return buf[0]&0x3F;
|
|
} else if (type == REDIS_RDB_14BITLEN) {
|
|
/* Read a 14 bit len */
|
|
if (fread(buf+1,1,1,fp) == 0) return REDIS_RDB_LENERR;
|
|
return ((buf[0]&0x3F)<<8)|buf[1];
|
|
} else {
|
|
/* Read a 32 bit len */
|
|
if (fread(&len,4,1,fp) == 0) return REDIS_RDB_LENERR;
|
|
return ntohl(len);
|
|
}
|
|
}
|
|
}
|
|
|
|
static robj *rdbLoadIntegerObject(FILE *fp, int enctype) {
|
|
unsigned char enc[4];
|
|
long long val;
|
|
|
|
if (enctype == REDIS_RDB_ENC_INT8) {
|
|
if (fread(enc,1,1,fp) == 0) return NULL;
|
|
val = (signed char)enc[0];
|
|
} else if (enctype == REDIS_RDB_ENC_INT16) {
|
|
uint16_t v;
|
|
if (fread(enc,2,1,fp) == 0) return NULL;
|
|
v = enc[0]|(enc[1]<<8);
|
|
val = (int16_t)v;
|
|
} else if (enctype == REDIS_RDB_ENC_INT32) {
|
|
uint32_t v;
|
|
if (fread(enc,4,1,fp) == 0) return NULL;
|
|
v = enc[0]|(enc[1]<<8)|(enc[2]<<16)|(enc[3]<<24);
|
|
val = (int32_t)v;
|
|
} else {
|
|
val = 0; /* anti-warning */
|
|
redisAssert(0!=0);
|
|
}
|
|
return createObject(REDIS_STRING,sdscatprintf(sdsempty(),"%lld",val));
|
|
}
|
|
|
|
static robj *rdbLoadLzfStringObject(FILE*fp, int rdbver) {
|
|
unsigned int len, clen;
|
|
unsigned char *c = NULL;
|
|
sds val = NULL;
|
|
|
|
if ((clen = rdbLoadLen(fp,rdbver,NULL)) == REDIS_RDB_LENERR) return NULL;
|
|
if ((len = rdbLoadLen(fp,rdbver,NULL)) == REDIS_RDB_LENERR) return NULL;
|
|
if ((c = zmalloc(clen)) == NULL) goto err;
|
|
if ((val = sdsnewlen(NULL,len)) == NULL) goto err;
|
|
if (fread(c,clen,1,fp) == 0) goto err;
|
|
if (lzf_decompress(c,clen,val,len) == 0) goto err;
|
|
zfree(c);
|
|
return createObject(REDIS_STRING,val);
|
|
err:
|
|
zfree(c);
|
|
sdsfree(val);
|
|
return NULL;
|
|
}
|
|
|
|
static robj *rdbLoadStringObject(FILE*fp, int rdbver) {
|
|
int isencoded;
|
|
uint32_t len;
|
|
sds val;
|
|
|
|
len = rdbLoadLen(fp,rdbver,&isencoded);
|
|
if (isencoded) {
|
|
switch(len) {
|
|
case REDIS_RDB_ENC_INT8:
|
|
case REDIS_RDB_ENC_INT16:
|
|
case REDIS_RDB_ENC_INT32:
|
|
return tryObjectSharing(rdbLoadIntegerObject(fp,len));
|
|
case REDIS_RDB_ENC_LZF:
|
|
return tryObjectSharing(rdbLoadLzfStringObject(fp,rdbver));
|
|
default:
|
|
redisAssert(0!=0);
|
|
}
|
|
}
|
|
|
|
if (len == REDIS_RDB_LENERR) return NULL;
|
|
val = sdsnewlen(NULL,len);
|
|
if (len && fread(val,len,1,fp) == 0) {
|
|
sdsfree(val);
|
|
return NULL;
|
|
}
|
|
return tryObjectSharing(createObject(REDIS_STRING,val));
|
|
}
|
|
|
|
/* For information about double serialization check rdbSaveDoubleValue() */
|
|
static int rdbLoadDoubleValue(FILE *fp, double *val) {
|
|
char buf[128];
|
|
unsigned char len;
|
|
|
|
if (fread(&len,1,1,fp) == 0) return -1;
|
|
switch(len) {
|
|
case 255: *val = R_NegInf; return 0;
|
|
case 254: *val = R_PosInf; return 0;
|
|
case 253: *val = R_Nan; return 0;
|
|
default:
|
|
if (fread(buf,len,1,fp) == 0) return -1;
|
|
buf[len] = '\0';
|
|
sscanf(buf, "%lg", val);
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
static int rdbLoad(char *filename) {
|
|
FILE *fp;
|
|
robj *keyobj = NULL;
|
|
uint32_t dbid;
|
|
int type, retval, rdbver;
|
|
dict *d = server.db[0].dict;
|
|
redisDb *db = server.db+0;
|
|
char buf[1024];
|
|
time_t expiretime = -1, now = time(NULL);
|
|
|
|
fp = fopen(filename,"r");
|
|
if (!fp) return REDIS_ERR;
|
|
if (fread(buf,9,1,fp) == 0) goto eoferr;
|
|
buf[9] = '\0';
|
|
if (memcmp(buf,"REDIS",5) != 0) {
|
|
fclose(fp);
|
|
redisLog(REDIS_WARNING,"Wrong signature trying to load DB from file");
|
|
return REDIS_ERR;
|
|
}
|
|
rdbver = atoi(buf+5);
|
|
if (rdbver > 1) {
|
|
fclose(fp);
|
|
redisLog(REDIS_WARNING,"Can't handle RDB format version %d",rdbver);
|
|
return REDIS_ERR;
|
|
}
|
|
while(1) {
|
|
robj *o;
|
|
|
|
/* Read type. */
|
|
if ((type = rdbLoadType(fp)) == -1) goto eoferr;
|
|
if (type == REDIS_EXPIRETIME) {
|
|
if ((expiretime = rdbLoadTime(fp)) == -1) goto eoferr;
|
|
/* We read the time so we need to read the object type again */
|
|
if ((type = rdbLoadType(fp)) == -1) goto eoferr;
|
|
}
|
|
if (type == REDIS_EOF) break;
|
|
/* Handle SELECT DB opcode as a special case */
|
|
if (type == REDIS_SELECTDB) {
|
|
if ((dbid = rdbLoadLen(fp,rdbver,NULL)) == REDIS_RDB_LENERR)
|
|
goto eoferr;
|
|
if (dbid >= (unsigned)server.dbnum) {
|
|
redisLog(REDIS_WARNING,"FATAL: Data file was created with a Redis server configured to handle more than %d databases. Exiting\n", server.dbnum);
|
|
exit(1);
|
|
}
|
|
db = server.db+dbid;
|
|
d = db->dict;
|
|
continue;
|
|
}
|
|
/* Read key */
|
|
if ((keyobj = rdbLoadStringObject(fp,rdbver)) == NULL) goto eoferr;
|
|
|
|
if (type == REDIS_STRING) {
|
|
/* Read string value */
|
|
if ((o = rdbLoadStringObject(fp,rdbver)) == NULL) goto eoferr;
|
|
tryObjectEncoding(o);
|
|
} else if (type == REDIS_LIST || type == REDIS_SET) {
|
|
/* Read list/set value */
|
|
uint32_t listlen;
|
|
|
|
if ((listlen = rdbLoadLen(fp,rdbver,NULL)) == REDIS_RDB_LENERR)
|
|
goto eoferr;
|
|
o = (type == REDIS_LIST) ? createListObject() : createSetObject();
|
|
/* Load every single element of the list/set */
|
|
while(listlen--) {
|
|
robj *ele;
|
|
|
|
if ((ele = rdbLoadStringObject(fp,rdbver)) == NULL) goto eoferr;
|
|
tryObjectEncoding(ele);
|
|
if (type == REDIS_LIST) {
|
|
listAddNodeTail((list*)o->ptr,ele);
|
|
} else {
|
|
dictAdd((dict*)o->ptr,ele,NULL);
|
|
}
|
|
}
|
|
} else if (type == REDIS_ZSET) {
|
|
/* Read list/set value */
|
|
uint32_t zsetlen;
|
|
zset *zs;
|
|
|
|
if ((zsetlen = rdbLoadLen(fp,rdbver,NULL)) == REDIS_RDB_LENERR)
|
|
goto eoferr;
|
|
o = createZsetObject();
|
|
zs = o->ptr;
|
|
/* Load every single element of the list/set */
|
|
while(zsetlen--) {
|
|
robj *ele;
|
|
double *score = zmalloc(sizeof(double));
|
|
|
|
if ((ele = rdbLoadStringObject(fp,rdbver)) == NULL) goto eoferr;
|
|
tryObjectEncoding(ele);
|
|
if (rdbLoadDoubleValue(fp,score) == -1) goto eoferr;
|
|
dictAdd(zs->dict,ele,score);
|
|
zslInsert(zs->zsl,*score,ele);
|
|
incrRefCount(ele); /* added to skiplist */
|
|
}
|
|
} else {
|
|
redisAssert(0 != 0);
|
|
}
|
|
/* Add the new object in the hash table */
|
|
retval = dictAdd(d,keyobj,o);
|
|
if (retval == DICT_ERR) {
|
|
redisLog(REDIS_WARNING,"Loading DB, duplicated key (%s) found! Unrecoverable error, exiting now.", keyobj->ptr);
|
|
exit(1);
|
|
}
|
|
/* Set the expire time if needed */
|
|
if (expiretime != -1) {
|
|
setExpire(db,keyobj,expiretime);
|
|
/* Delete this key if already expired */
|
|
if (expiretime < now) deleteKey(db,keyobj);
|
|
expiretime = -1;
|
|
}
|
|
keyobj = o = NULL;
|
|
}
|
|
fclose(fp);
|
|
return REDIS_OK;
|
|
|
|
eoferr: /* unexpected end of file is handled here with a fatal exit */
|
|
if (keyobj) decrRefCount(keyobj);
|
|
redisLog(REDIS_WARNING,"Short read or OOM loading DB. Unrecoverable error, aborting now.");
|
|
exit(1);
|
|
return REDIS_ERR; /* Just to avoid warning */
|
|
}
|
|
|
|
/*================================== Commands =============================== */
|
|
|
|
static void authCommand(redisClient *c) {
|
|
if (!server.requirepass || !strcmp(c->argv[1]->ptr, server.requirepass)) {
|
|
c->authenticated = 1;
|
|
addReply(c,shared.ok);
|
|
} else {
|
|
c->authenticated = 0;
|
|
addReplySds(c,sdscatprintf(sdsempty(),"-ERR invalid password\r\n"));
|
|
}
|
|
}
|
|
|
|
static void pingCommand(redisClient *c) {
|
|
addReply(c,shared.pong);
|
|
}
|
|
|
|
static void echoCommand(redisClient *c) {
|
|
addReplyBulkLen(c,c->argv[1]);
|
|
addReply(c,c->argv[1]);
|
|
addReply(c,shared.crlf);
|
|
}
|
|
|
|
/*=================================== Strings =============================== */
|
|
|
|
static void setGenericCommand(redisClient *c, int nx) {
|
|
int retval;
|
|
|
|
if (nx) deleteIfVolatile(c->db,c->argv[1]);
|
|
retval = dictAdd(c->db->dict,c->argv[1],c->argv[2]);
|
|
if (retval == DICT_ERR) {
|
|
if (!nx) {
|
|
dictReplace(c->db->dict,c->argv[1],c->argv[2]);
|
|
incrRefCount(c->argv[2]);
|
|
} else {
|
|
addReply(c,shared.czero);
|
|
return;
|
|
}
|
|
} else {
|
|
incrRefCount(c->argv[1]);
|
|
incrRefCount(c->argv[2]);
|
|
}
|
|
server.dirty++;
|
|
removeExpire(c->db,c->argv[1]);
|
|
addReply(c, nx ? shared.cone : shared.ok);
|
|
}
|
|
|
|
static void setCommand(redisClient *c) {
|
|
setGenericCommand(c,0);
|
|
}
|
|
|
|
static void setnxCommand(redisClient *c) {
|
|
setGenericCommand(c,1);
|
|
}
|
|
|
|
static void getCommand(redisClient *c) {
|
|
robj *o = lookupKeyRead(c->db,c->argv[1]);
|
|
|
|
if (o == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
if (o->type != REDIS_STRING) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
addReplyBulkLen(c,o);
|
|
addReply(c,o);
|
|
addReply(c,shared.crlf);
|
|
}
|
|
}
|
|
}
|
|
|
|
static void getsetCommand(redisClient *c) {
|
|
getCommand(c);
|
|
if (dictAdd(c->db->dict,c->argv[1],c->argv[2]) == DICT_ERR) {
|
|
dictReplace(c->db->dict,c->argv[1],c->argv[2]);
|
|
} else {
|
|
incrRefCount(c->argv[1]);
|
|
}
|
|
incrRefCount(c->argv[2]);
|
|
server.dirty++;
|
|
removeExpire(c->db,c->argv[1]);
|
|
}
|
|
|
|
static void mgetCommand(redisClient *c) {
|
|
int j;
|
|
|
|
addReplySds(c,sdscatprintf(sdsempty(),"*%d\r\n",c->argc-1));
|
|
for (j = 1; j < c->argc; j++) {
|
|
robj *o = lookupKeyRead(c->db,c->argv[j]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
if (o->type != REDIS_STRING) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
addReplyBulkLen(c,o);
|
|
addReply(c,o);
|
|
addReply(c,shared.crlf);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static void msetGenericCommand(redisClient *c, int nx) {
|
|
int j, busykeys = 0;
|
|
|
|
if ((c->argc % 2) == 0) {
|
|
addReplySds(c,sdsnew("-ERR wrong number of arguments for MSET\r\n"));
|
|
return;
|
|
}
|
|
/* Handle the NX flag. The MSETNX semantic is to return zero and don't
|
|
* set nothing at all if at least one already key exists. */
|
|
if (nx) {
|
|
for (j = 1; j < c->argc; j += 2) {
|
|
if (lookupKeyWrite(c->db,c->argv[j]) != NULL) {
|
|
busykeys++;
|
|
}
|
|
}
|
|
}
|
|
if (busykeys) {
|
|
addReply(c, shared.czero);
|
|
return;
|
|
}
|
|
|
|
for (j = 1; j < c->argc; j += 2) {
|
|
int retval;
|
|
|
|
tryObjectEncoding(c->argv[j+1]);
|
|
retval = dictAdd(c->db->dict,c->argv[j],c->argv[j+1]);
|
|
if (retval == DICT_ERR) {
|
|
dictReplace(c->db->dict,c->argv[j],c->argv[j+1]);
|
|
incrRefCount(c->argv[j+1]);
|
|
} else {
|
|
incrRefCount(c->argv[j]);
|
|
incrRefCount(c->argv[j+1]);
|
|
}
|
|
removeExpire(c->db,c->argv[j]);
|
|
}
|
|
server.dirty += (c->argc-1)/2;
|
|
addReply(c, nx ? shared.cone : shared.ok);
|
|
}
|
|
|
|
static void msetCommand(redisClient *c) {
|
|
msetGenericCommand(c,0);
|
|
}
|
|
|
|
static void msetnxCommand(redisClient *c) {
|
|
msetGenericCommand(c,1);
|
|
}
|
|
|
|
static void incrDecrCommand(redisClient *c, long long incr) {
|
|
long long value;
|
|
int retval;
|
|
robj *o;
|
|
|
|
o = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
value = 0;
|
|
} else {
|
|
if (o->type != REDIS_STRING) {
|
|
value = 0;
|
|
} else {
|
|
char *eptr;
|
|
|
|
if (o->encoding == REDIS_ENCODING_RAW)
|
|
value = strtoll(o->ptr, &eptr, 10);
|
|
else if (o->encoding == REDIS_ENCODING_INT)
|
|
value = (long)o->ptr;
|
|
else
|
|
redisAssert(1 != 1);
|
|
}
|
|
}
|
|
|
|
value += incr;
|
|
o = createObject(REDIS_STRING,sdscatprintf(sdsempty(),"%lld",value));
|
|
tryObjectEncoding(o);
|
|
retval = dictAdd(c->db->dict,c->argv[1],o);
|
|
if (retval == DICT_ERR) {
|
|
dictReplace(c->db->dict,c->argv[1],o);
|
|
removeExpire(c->db,c->argv[1]);
|
|
} else {
|
|
incrRefCount(c->argv[1]);
|
|
}
|
|
server.dirty++;
|
|
addReply(c,shared.colon);
|
|
addReply(c,o);
|
|
addReply(c,shared.crlf);
|
|
}
|
|
|
|
static void incrCommand(redisClient *c) {
|
|
incrDecrCommand(c,1);
|
|
}
|
|
|
|
static void decrCommand(redisClient *c) {
|
|
incrDecrCommand(c,-1);
|
|
}
|
|
|
|
static void incrbyCommand(redisClient *c) {
|
|
long long incr = strtoll(c->argv[2]->ptr, NULL, 10);
|
|
incrDecrCommand(c,incr);
|
|
}
|
|
|
|
static void decrbyCommand(redisClient *c) {
|
|
long long incr = strtoll(c->argv[2]->ptr, NULL, 10);
|
|
incrDecrCommand(c,-incr);
|
|
}
|
|
|
|
/* ========================= Type agnostic commands ========================= */
|
|
|
|
static void delCommand(redisClient *c) {
|
|
int deleted = 0, j;
|
|
|
|
for (j = 1; j < c->argc; j++) {
|
|
if (deleteKey(c->db,c->argv[j])) {
|
|
server.dirty++;
|
|
deleted++;
|
|
}
|
|
}
|
|
switch(deleted) {
|
|
case 0:
|
|
addReply(c,shared.czero);
|
|
break;
|
|
case 1:
|
|
addReply(c,shared.cone);
|
|
break;
|
|
default:
|
|
addReplySds(c,sdscatprintf(sdsempty(),":%d\r\n",deleted));
|
|
break;
|
|
}
|
|
}
|
|
|
|
static void existsCommand(redisClient *c) {
|
|
addReply(c,lookupKeyRead(c->db,c->argv[1]) ? shared.cone : shared.czero);
|
|
}
|
|
|
|
static void selectCommand(redisClient *c) {
|
|
int id = atoi(c->argv[1]->ptr);
|
|
|
|
if (selectDb(c,id) == REDIS_ERR) {
|
|
addReplySds(c,sdsnew("-ERR invalid DB index\r\n"));
|
|
} else {
|
|
addReply(c,shared.ok);
|
|
}
|
|
}
|
|
|
|
static void randomkeyCommand(redisClient *c) {
|
|
dictEntry *de;
|
|
|
|
while(1) {
|
|
de = dictGetRandomKey(c->db->dict);
|
|
if (!de || expireIfNeeded(c->db,dictGetEntryKey(de)) == 0) break;
|
|
}
|
|
if (de == NULL) {
|
|
addReply(c,shared.plus);
|
|
addReply(c,shared.crlf);
|
|
} else {
|
|
addReply(c,shared.plus);
|
|
addReply(c,dictGetEntryKey(de));
|
|
addReply(c,shared.crlf);
|
|
}
|
|
}
|
|
|
|
static void keysCommand(redisClient *c) {
|
|
dictIterator *di;
|
|
dictEntry *de;
|
|
sds pattern = c->argv[1]->ptr;
|
|
int plen = sdslen(pattern);
|
|
unsigned long numkeys = 0, keyslen = 0;
|
|
robj *lenobj = createObject(REDIS_STRING,NULL);
|
|
|
|
di = dictGetIterator(c->db->dict);
|
|
addReply(c,lenobj);
|
|
decrRefCount(lenobj);
|
|
while((de = dictNext(di)) != NULL) {
|
|
robj *keyobj = dictGetEntryKey(de);
|
|
|
|
sds key = keyobj->ptr;
|
|
if ((pattern[0] == '*' && pattern[1] == '\0') ||
|
|
stringmatchlen(pattern,plen,key,sdslen(key),0)) {
|
|
if (expireIfNeeded(c->db,keyobj) == 0) {
|
|
if (numkeys != 0)
|
|
addReply(c,shared.space);
|
|
addReply(c,keyobj);
|
|
numkeys++;
|
|
keyslen += sdslen(key);
|
|
}
|
|
}
|
|
}
|
|
dictReleaseIterator(di);
|
|
lenobj->ptr = sdscatprintf(sdsempty(),"$%lu\r\n",keyslen+(numkeys ? (numkeys-1) : 0));
|
|
addReply(c,shared.crlf);
|
|
}
|
|
|
|
static void dbsizeCommand(redisClient *c) {
|
|
addReplySds(c,
|
|
sdscatprintf(sdsempty(),":%lu\r\n",dictSize(c->db->dict)));
|
|
}
|
|
|
|
static void lastsaveCommand(redisClient *c) {
|
|
addReplySds(c,
|
|
sdscatprintf(sdsempty(),":%lu\r\n",server.lastsave));
|
|
}
|
|
|
|
static void typeCommand(redisClient *c) {
|
|
robj *o;
|
|
char *type;
|
|
|
|
o = lookupKeyRead(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
type = "+none";
|
|
} else {
|
|
switch(o->type) {
|
|
case REDIS_STRING: type = "+string"; break;
|
|
case REDIS_LIST: type = "+list"; break;
|
|
case REDIS_SET: type = "+set"; break;
|
|
case REDIS_ZSET: type = "+zset"; break;
|
|
default: type = "unknown"; break;
|
|
}
|
|
}
|
|
addReplySds(c,sdsnew(type));
|
|
addReply(c,shared.crlf);
|
|
}
|
|
|
|
static void saveCommand(redisClient *c) {
|
|
if (server.bgsavechildpid != -1) {
|
|
addReplySds(c,sdsnew("-ERR background save in progress\r\n"));
|
|
return;
|
|
}
|
|
if (rdbSave(server.dbfilename) == REDIS_OK) {
|
|
addReply(c,shared.ok);
|
|
} else {
|
|
addReply(c,shared.err);
|
|
}
|
|
}
|
|
|
|
static void bgsaveCommand(redisClient *c) {
|
|
if (server.bgsavechildpid != -1) {
|
|
addReplySds(c,sdsnew("-ERR background save already in progress\r\n"));
|
|
return;
|
|
}
|
|
if (rdbSaveBackground(server.dbfilename) == REDIS_OK) {
|
|
char *status = "+Background saving started\r\n";
|
|
addReplySds(c,sdsnew(status));
|
|
} else {
|
|
addReply(c,shared.err);
|
|
}
|
|
}
|
|
|
|
static void shutdownCommand(redisClient *c) {
|
|
redisLog(REDIS_WARNING,"User requested shutdown, saving DB...");
|
|
/* Kill the saving child if there is a background saving in progress.
|
|
We want to avoid race conditions, for instance our saving child may
|
|
overwrite the synchronous saving did by SHUTDOWN. */
|
|
if (server.bgsavechildpid != -1) {
|
|
redisLog(REDIS_WARNING,"There is a live saving child. Killing it!");
|
|
kill(server.bgsavechildpid,SIGKILL);
|
|
rdbRemoveTempFile(server.bgsavechildpid);
|
|
}
|
|
/* SYNC SAVE */
|
|
if (rdbSave(server.dbfilename) == REDIS_OK) {
|
|
if (server.daemonize)
|
|
unlink(server.pidfile);
|
|
redisLog(REDIS_WARNING,"%zu bytes used at exit",zmalloc_used_memory());
|
|
redisLog(REDIS_WARNING,"Server exit now, bye bye...");
|
|
exit(1);
|
|
} else {
|
|
/* Ooops.. error saving! The best we can do is to continue operating.
|
|
* Note that if there was a background saving process, in the next
|
|
* cron() Redis will be notified that the background saving aborted,
|
|
* handling special stuff like slaves pending for synchronization... */
|
|
redisLog(REDIS_WARNING,"Error trying to save the DB, can't exit");
|
|
addReplySds(c,sdsnew("-ERR can't quit, problems saving the DB\r\n"));
|
|
}
|
|
}
|
|
|
|
static void renameGenericCommand(redisClient *c, int nx) {
|
|
robj *o;
|
|
|
|
/* To use the same key as src and dst is probably an error */
|
|
if (sdscmp(c->argv[1]->ptr,c->argv[2]->ptr) == 0) {
|
|
addReply(c,shared.sameobjecterr);
|
|
return;
|
|
}
|
|
|
|
o = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.nokeyerr);
|
|
return;
|
|
}
|
|
incrRefCount(o);
|
|
deleteIfVolatile(c->db,c->argv[2]);
|
|
if (dictAdd(c->db->dict,c->argv[2],o) == DICT_ERR) {
|
|
if (nx) {
|
|
decrRefCount(o);
|
|
addReply(c,shared.czero);
|
|
return;
|
|
}
|
|
dictReplace(c->db->dict,c->argv[2],o);
|
|
} else {
|
|
incrRefCount(c->argv[2]);
|
|
}
|
|
deleteKey(c->db,c->argv[1]);
|
|
server.dirty++;
|
|
addReply(c,nx ? shared.cone : shared.ok);
|
|
}
|
|
|
|
static void renameCommand(redisClient *c) {
|
|
renameGenericCommand(c,0);
|
|
}
|
|
|
|
static void renamenxCommand(redisClient *c) {
|
|
renameGenericCommand(c,1);
|
|
}
|
|
|
|
static void moveCommand(redisClient *c) {
|
|
robj *o;
|
|
redisDb *src, *dst;
|
|
int srcid;
|
|
|
|
/* Obtain source and target DB pointers */
|
|
src = c->db;
|
|
srcid = c->db->id;
|
|
if (selectDb(c,atoi(c->argv[2]->ptr)) == REDIS_ERR) {
|
|
addReply(c,shared.outofrangeerr);
|
|
return;
|
|
}
|
|
dst = c->db;
|
|
selectDb(c,srcid); /* Back to the source DB */
|
|
|
|
/* If the user is moving using as target the same
|
|
* DB as the source DB it is probably an error. */
|
|
if (src == dst) {
|
|
addReply(c,shared.sameobjecterr);
|
|
return;
|
|
}
|
|
|
|
/* Check if the element exists and get a reference */
|
|
o = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (!o) {
|
|
addReply(c,shared.czero);
|
|
return;
|
|
}
|
|
|
|
/* Try to add the element to the target DB */
|
|
deleteIfVolatile(dst,c->argv[1]);
|
|
if (dictAdd(dst->dict,c->argv[1],o) == DICT_ERR) {
|
|
addReply(c,shared.czero);
|
|
return;
|
|
}
|
|
incrRefCount(c->argv[1]);
|
|
incrRefCount(o);
|
|
|
|
/* OK! key moved, free the entry in the source DB */
|
|
deleteKey(src,c->argv[1]);
|
|
server.dirty++;
|
|
addReply(c,shared.cone);
|
|
}
|
|
|
|
/* =================================== Lists ================================ */
|
|
static void pushGenericCommand(redisClient *c, int where) {
|
|
robj *lobj;
|
|
list *list;
|
|
|
|
lobj = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (lobj == NULL) {
|
|
lobj = createListObject();
|
|
list = lobj->ptr;
|
|
if (where == REDIS_HEAD) {
|
|
listAddNodeHead(list,c->argv[2]);
|
|
} else {
|
|
listAddNodeTail(list,c->argv[2]);
|
|
}
|
|
dictAdd(c->db->dict,c->argv[1],lobj);
|
|
incrRefCount(c->argv[1]);
|
|
incrRefCount(c->argv[2]);
|
|
} else {
|
|
if (lobj->type != REDIS_LIST) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
list = lobj->ptr;
|
|
if (where == REDIS_HEAD) {
|
|
listAddNodeHead(list,c->argv[2]);
|
|
} else {
|
|
listAddNodeTail(list,c->argv[2]);
|
|
}
|
|
incrRefCount(c->argv[2]);
|
|
}
|
|
server.dirty++;
|
|
addReply(c,shared.ok);
|
|
}
|
|
|
|
static void lpushCommand(redisClient *c) {
|
|
pushGenericCommand(c,REDIS_HEAD);
|
|
}
|
|
|
|
static void rpushCommand(redisClient *c) {
|
|
pushGenericCommand(c,REDIS_TAIL);
|
|
}
|
|
|
|
static void llenCommand(redisClient *c) {
|
|
robj *o;
|
|
list *l;
|
|
|
|
o = lookupKeyRead(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.czero);
|
|
return;
|
|
} else {
|
|
if (o->type != REDIS_LIST) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
l = o->ptr;
|
|
addReplySds(c,sdscatprintf(sdsempty(),":%d\r\n",listLength(l)));
|
|
}
|
|
}
|
|
}
|
|
|
|
static void lindexCommand(redisClient *c) {
|
|
robj *o;
|
|
int index = atoi(c->argv[2]->ptr);
|
|
|
|
o = lookupKeyRead(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
if (o->type != REDIS_LIST) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
list *list = o->ptr;
|
|
listNode *ln;
|
|
|
|
ln = listIndex(list, index);
|
|
if (ln == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
robj *ele = listNodeValue(ln);
|
|
addReplyBulkLen(c,ele);
|
|
addReply(c,ele);
|
|
addReply(c,shared.crlf);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static void lsetCommand(redisClient *c) {
|
|
robj *o;
|
|
int index = atoi(c->argv[2]->ptr);
|
|
|
|
o = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.nokeyerr);
|
|
} else {
|
|
if (o->type != REDIS_LIST) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
list *list = o->ptr;
|
|
listNode *ln;
|
|
|
|
ln = listIndex(list, index);
|
|
if (ln == NULL) {
|
|
addReply(c,shared.outofrangeerr);
|
|
} else {
|
|
robj *ele = listNodeValue(ln);
|
|
|
|
decrRefCount(ele);
|
|
listNodeValue(ln) = c->argv[3];
|
|
incrRefCount(c->argv[3]);
|
|
addReply(c,shared.ok);
|
|
server.dirty++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static void popGenericCommand(redisClient *c, int where) {
|
|
robj *o;
|
|
|
|
o = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
if (o->type != REDIS_LIST) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
list *list = o->ptr;
|
|
listNode *ln;
|
|
|
|
if (where == REDIS_HEAD)
|
|
ln = listFirst(list);
|
|
else
|
|
ln = listLast(list);
|
|
|
|
if (ln == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
robj *ele = listNodeValue(ln);
|
|
addReplyBulkLen(c,ele);
|
|
addReply(c,ele);
|
|
addReply(c,shared.crlf);
|
|
listDelNode(list,ln);
|
|
server.dirty++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static void lpopCommand(redisClient *c) {
|
|
popGenericCommand(c,REDIS_HEAD);
|
|
}
|
|
|
|
static void rpopCommand(redisClient *c) {
|
|
popGenericCommand(c,REDIS_TAIL);
|
|
}
|
|
|
|
static void lrangeCommand(redisClient *c) {
|
|
robj *o;
|
|
int start = atoi(c->argv[2]->ptr);
|
|
int end = atoi(c->argv[3]->ptr);
|
|
|
|
o = lookupKeyRead(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.nullmultibulk);
|
|
} else {
|
|
if (o->type != REDIS_LIST) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
list *list = o->ptr;
|
|
listNode *ln;
|
|
int llen = listLength(list);
|
|
int rangelen, j;
|
|
robj *ele;
|
|
|
|
/* convert negative indexes */
|
|
if (start < 0) start = llen+start;
|
|
if (end < 0) end = llen+end;
|
|
if (start < 0) start = 0;
|
|
if (end < 0) end = 0;
|
|
|
|
/* indexes sanity checks */
|
|
if (start > end || start >= llen) {
|
|
/* Out of range start or start > end result in empty list */
|
|
addReply(c,shared.emptymultibulk);
|
|
return;
|
|
}
|
|
if (end >= llen) end = llen-1;
|
|
rangelen = (end-start)+1;
|
|
|
|
/* Return the result in form of a multi-bulk reply */
|
|
ln = listIndex(list, start);
|
|
addReplySds(c,sdscatprintf(sdsempty(),"*%d\r\n",rangelen));
|
|
for (j = 0; j < rangelen; j++) {
|
|
ele = listNodeValue(ln);
|
|
addReplyBulkLen(c,ele);
|
|
addReply(c,ele);
|
|
addReply(c,shared.crlf);
|
|
ln = ln->next;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static void ltrimCommand(redisClient *c) {
|
|
robj *o;
|
|
int start = atoi(c->argv[2]->ptr);
|
|
int end = atoi(c->argv[3]->ptr);
|
|
|
|
o = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.nokeyerr);
|
|
} else {
|
|
if (o->type != REDIS_LIST) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
list *list = o->ptr;
|
|
listNode *ln;
|
|
int llen = listLength(list);
|
|
int j, ltrim, rtrim;
|
|
|
|
/* convert negative indexes */
|
|
if (start < 0) start = llen+start;
|
|
if (end < 0) end = llen+end;
|
|
if (start < 0) start = 0;
|
|
if (end < 0) end = 0;
|
|
|
|
/* indexes sanity checks */
|
|
if (start > end || start >= llen) {
|
|
/* Out of range start or start > end result in empty list */
|
|
ltrim = llen;
|
|
rtrim = 0;
|
|
} else {
|
|
if (end >= llen) end = llen-1;
|
|
ltrim = start;
|
|
rtrim = llen-end-1;
|
|
}
|
|
|
|
/* Remove list elements to perform the trim */
|
|
for (j = 0; j < ltrim; j++) {
|
|
ln = listFirst(list);
|
|
listDelNode(list,ln);
|
|
}
|
|
for (j = 0; j < rtrim; j++) {
|
|
ln = listLast(list);
|
|
listDelNode(list,ln);
|
|
}
|
|
server.dirty++;
|
|
addReply(c,shared.ok);
|
|
}
|
|
}
|
|
}
|
|
|
|
static void lremCommand(redisClient *c) {
|
|
robj *o;
|
|
|
|
o = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.czero);
|
|
} else {
|
|
if (o->type != REDIS_LIST) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
list *list = o->ptr;
|
|
listNode *ln, *next;
|
|
int toremove = atoi(c->argv[2]->ptr);
|
|
int removed = 0;
|
|
int fromtail = 0;
|
|
|
|
if (toremove < 0) {
|
|
toremove = -toremove;
|
|
fromtail = 1;
|
|
}
|
|
ln = fromtail ? list->tail : list->head;
|
|
while (ln) {
|
|
robj *ele = listNodeValue(ln);
|
|
|
|
next = fromtail ? ln->prev : ln->next;
|
|
if (compareStringObjects(ele,c->argv[3]) == 0) {
|
|
listDelNode(list,ln);
|
|
server.dirty++;
|
|
removed++;
|
|
if (toremove && removed == toremove) break;
|
|
}
|
|
ln = next;
|
|
}
|
|
addReplySds(c,sdscatprintf(sdsempty(),":%d\r\n",removed));
|
|
}
|
|
}
|
|
}
|
|
|
|
/* This is the semantic of this command:
|
|
* RPOPLPUSH srclist dstlist:
|
|
* IF LLEN(srclist) > 0
|
|
* element = RPOP srclist
|
|
* LPUSH dstlist element
|
|
* RETURN element
|
|
* ELSE
|
|
* RETURN nil
|
|
* END
|
|
* END
|
|
*
|
|
* The idea is to be able to get an element from a list in a reliable way
|
|
* since the element is not just returned but pushed against another list
|
|
* as well. This command was originally proposed by Ezra Zygmuntowicz.
|
|
*/
|
|
static void rpoplpushcommand(redisClient *c) {
|
|
robj *sobj;
|
|
|
|
sobj = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (sobj == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
if (sobj->type != REDIS_LIST) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
list *srclist = sobj->ptr;
|
|
listNode *ln = listLast(srclist);
|
|
|
|
if (ln == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
robj *dobj = lookupKeyWrite(c->db,c->argv[2]);
|
|
robj *ele = listNodeValue(ln);
|
|
list *dstlist;
|
|
|
|
if (dobj == NULL) {
|
|
|
|
/* Create the list if the key does not exist */
|
|
dobj = createListObject();
|
|
dictAdd(c->db->dict,c->argv[2],dobj);
|
|
incrRefCount(c->argv[2]);
|
|
} else if (dobj->type != REDIS_LIST) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
/* Add the element to the target list */
|
|
dstlist = dobj->ptr;
|
|
listAddNodeHead(dstlist,ele);
|
|
incrRefCount(ele);
|
|
|
|
/* Send the element to the client as reply as well */
|
|
addReplyBulkLen(c,ele);
|
|
addReply(c,ele);
|
|
addReply(c,shared.crlf);
|
|
|
|
/* Finally remove the element from the source list */
|
|
listDelNode(srclist,ln);
|
|
server.dirty++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
/* ==================================== Sets ================================ */
|
|
|
|
static void saddCommand(redisClient *c) {
|
|
robj *set;
|
|
|
|
set = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (set == NULL) {
|
|
set = createSetObject();
|
|
dictAdd(c->db->dict,c->argv[1],set);
|
|
incrRefCount(c->argv[1]);
|
|
} else {
|
|
if (set->type != REDIS_SET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
}
|
|
if (dictAdd(set->ptr,c->argv[2],NULL) == DICT_OK) {
|
|
incrRefCount(c->argv[2]);
|
|
server.dirty++;
|
|
addReply(c,shared.cone);
|
|
} else {
|
|
addReply(c,shared.czero);
|
|
}
|
|
}
|
|
|
|
static void sremCommand(redisClient *c) {
|
|
robj *set;
|
|
|
|
set = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (set == NULL) {
|
|
addReply(c,shared.czero);
|
|
} else {
|
|
if (set->type != REDIS_SET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
if (dictDelete(set->ptr,c->argv[2]) == DICT_OK) {
|
|
server.dirty++;
|
|
if (htNeedsResize(set->ptr)) dictResize(set->ptr);
|
|
addReply(c,shared.cone);
|
|
} else {
|
|
addReply(c,shared.czero);
|
|
}
|
|
}
|
|
}
|
|
|
|
static void smoveCommand(redisClient *c) {
|
|
robj *srcset, *dstset;
|
|
|
|
srcset = lookupKeyWrite(c->db,c->argv[1]);
|
|
dstset = lookupKeyWrite(c->db,c->argv[2]);
|
|
|
|
/* If the source key does not exist return 0, if it's of the wrong type
|
|
* raise an error */
|
|
if (srcset == NULL || srcset->type != REDIS_SET) {
|
|
addReply(c, srcset ? shared.wrongtypeerr : shared.czero);
|
|
return;
|
|
}
|
|
/* Error if the destination key is not a set as well */
|
|
if (dstset && dstset->type != REDIS_SET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
/* Remove the element from the source set */
|
|
if (dictDelete(srcset->ptr,c->argv[3]) == DICT_ERR) {
|
|
/* Key not found in the src set! return zero */
|
|
addReply(c,shared.czero);
|
|
return;
|
|
}
|
|
server.dirty++;
|
|
/* Add the element to the destination set */
|
|
if (!dstset) {
|
|
dstset = createSetObject();
|
|
dictAdd(c->db->dict,c->argv[2],dstset);
|
|
incrRefCount(c->argv[2]);
|
|
}
|
|
if (dictAdd(dstset->ptr,c->argv[3],NULL) == DICT_OK)
|
|
incrRefCount(c->argv[3]);
|
|
addReply(c,shared.cone);
|
|
}
|
|
|
|
static void sismemberCommand(redisClient *c) {
|
|
robj *set;
|
|
|
|
set = lookupKeyRead(c->db,c->argv[1]);
|
|
if (set == NULL) {
|
|
addReply(c,shared.czero);
|
|
} else {
|
|
if (set->type != REDIS_SET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
if (dictFind(set->ptr,c->argv[2]))
|
|
addReply(c,shared.cone);
|
|
else
|
|
addReply(c,shared.czero);
|
|
}
|
|
}
|
|
|
|
static void scardCommand(redisClient *c) {
|
|
robj *o;
|
|
dict *s;
|
|
|
|
o = lookupKeyRead(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.czero);
|
|
return;
|
|
} else {
|
|
if (o->type != REDIS_SET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
s = o->ptr;
|
|
addReplySds(c,sdscatprintf(sdsempty(),":%lu\r\n",
|
|
dictSize(s)));
|
|
}
|
|
}
|
|
}
|
|
|
|
static void spopCommand(redisClient *c) {
|
|
robj *set;
|
|
dictEntry *de;
|
|
|
|
set = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (set == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
if (set->type != REDIS_SET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
de = dictGetRandomKey(set->ptr);
|
|
if (de == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
robj *ele = dictGetEntryKey(de);
|
|
|
|
addReplyBulkLen(c,ele);
|
|
addReply(c,ele);
|
|
addReply(c,shared.crlf);
|
|
dictDelete(set->ptr,ele);
|
|
if (htNeedsResize(set->ptr)) dictResize(set->ptr);
|
|
server.dirty++;
|
|
}
|
|
}
|
|
}
|
|
|
|
static void srandmemberCommand(redisClient *c) {
|
|
robj *set;
|
|
dictEntry *de;
|
|
|
|
set = lookupKeyRead(c->db,c->argv[1]);
|
|
if (set == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
if (set->type != REDIS_SET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
de = dictGetRandomKey(set->ptr);
|
|
if (de == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
robj *ele = dictGetEntryKey(de);
|
|
|
|
addReplyBulkLen(c,ele);
|
|
addReply(c,ele);
|
|
addReply(c,shared.crlf);
|
|
}
|
|
}
|
|
}
|
|
|
|
static int qsortCompareSetsByCardinality(const void *s1, const void *s2) {
|
|
dict **d1 = (void*) s1, **d2 = (void*) s2;
|
|
|
|
return dictSize(*d1)-dictSize(*d2);
|
|
}
|
|
|
|
static void sinterGenericCommand(redisClient *c, robj **setskeys, unsigned long setsnum, robj *dstkey) {
|
|
dict **dv = zmalloc(sizeof(dict*)*setsnum);
|
|
dictIterator *di;
|
|
dictEntry *de;
|
|
robj *lenobj = NULL, *dstset = NULL;
|
|
unsigned long j, cardinality = 0;
|
|
|
|
for (j = 0; j < setsnum; j++) {
|
|
robj *setobj;
|
|
|
|
setobj = dstkey ?
|
|
lookupKeyWrite(c->db,setskeys[j]) :
|
|
lookupKeyRead(c->db,setskeys[j]);
|
|
if (!setobj) {
|
|
zfree(dv);
|
|
if (dstkey) {
|
|
deleteKey(c->db,dstkey);
|
|
addReply(c,shared.czero);
|
|
} else {
|
|
addReply(c,shared.nullmultibulk);
|
|
}
|
|
return;
|
|
}
|
|
if (setobj->type != REDIS_SET) {
|
|
zfree(dv);
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
dv[j] = setobj->ptr;
|
|
}
|
|
/* Sort sets from the smallest to largest, this will improve our
|
|
* algorithm's performace */
|
|
qsort(dv,setsnum,sizeof(dict*),qsortCompareSetsByCardinality);
|
|
|
|
/* The first thing we should output is the total number of elements...
|
|
* since this is a multi-bulk write, but at this stage we don't know
|
|
* the intersection set size, so we use a trick, append an empty object
|
|
* to the output list and save the pointer to later modify it with the
|
|
* right length */
|
|
if (!dstkey) {
|
|
lenobj = createObject(REDIS_STRING,NULL);
|
|
addReply(c,lenobj);
|
|
decrRefCount(lenobj);
|
|
} else {
|
|
/* If we have a target key where to store the resulting set
|
|
* create this key with an empty set inside */
|
|
dstset = createSetObject();
|
|
}
|
|
|
|
/* Iterate all the elements of the first (smallest) set, and test
|
|
* the element against all the other sets, if at least one set does
|
|
* not include the element it is discarded */
|
|
di = dictGetIterator(dv[0]);
|
|
|
|
while((de = dictNext(di)) != NULL) {
|
|
robj *ele;
|
|
|
|
for (j = 1; j < setsnum; j++)
|
|
if (dictFind(dv[j],dictGetEntryKey(de)) == NULL) break;
|
|
if (j != setsnum)
|
|
continue; /* at least one set does not contain the member */
|
|
ele = dictGetEntryKey(de);
|
|
if (!dstkey) {
|
|
addReplyBulkLen(c,ele);
|
|
addReply(c,ele);
|
|
addReply(c,shared.crlf);
|
|
cardinality++;
|
|
} else {
|
|
dictAdd(dstset->ptr,ele,NULL);
|
|
incrRefCount(ele);
|
|
}
|
|
}
|
|
dictReleaseIterator(di);
|
|
|
|
if (dstkey) {
|
|
/* Store the resulting set into the target */
|
|
deleteKey(c->db,dstkey);
|
|
dictAdd(c->db->dict,dstkey,dstset);
|
|
incrRefCount(dstkey);
|
|
}
|
|
|
|
if (!dstkey) {
|
|
lenobj->ptr = sdscatprintf(sdsempty(),"*%lu\r\n",cardinality);
|
|
} else {
|
|
addReplySds(c,sdscatprintf(sdsempty(),":%lu\r\n",
|
|
dictSize((dict*)dstset->ptr)));
|
|
server.dirty++;
|
|
}
|
|
zfree(dv);
|
|
}
|
|
|
|
static void sinterCommand(redisClient *c) {
|
|
sinterGenericCommand(c,c->argv+1,c->argc-1,NULL);
|
|
}
|
|
|
|
static void sinterstoreCommand(redisClient *c) {
|
|
sinterGenericCommand(c,c->argv+2,c->argc-2,c->argv[1]);
|
|
}
|
|
|
|
#define REDIS_OP_UNION 0
|
|
#define REDIS_OP_DIFF 1
|
|
|
|
static void sunionDiffGenericCommand(redisClient *c, robj **setskeys, int setsnum, robj *dstkey, int op) {
|
|
dict **dv = zmalloc(sizeof(dict*)*setsnum);
|
|
dictIterator *di;
|
|
dictEntry *de;
|
|
robj *dstset = NULL;
|
|
int j, cardinality = 0;
|
|
|
|
for (j = 0; j < setsnum; j++) {
|
|
robj *setobj;
|
|
|
|
setobj = dstkey ?
|
|
lookupKeyWrite(c->db,setskeys[j]) :
|
|
lookupKeyRead(c->db,setskeys[j]);
|
|
if (!setobj) {
|
|
dv[j] = NULL;
|
|
continue;
|
|
}
|
|
if (setobj->type != REDIS_SET) {
|
|
zfree(dv);
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
dv[j] = setobj->ptr;
|
|
}
|
|
|
|
/* We need a temp set object to store our union. If the dstkey
|
|
* is not NULL (that is, we are inside an SUNIONSTORE operation) then
|
|
* this set object will be the resulting object to set into the target key*/
|
|
dstset = createSetObject();
|
|
|
|
/* Iterate all the elements of all the sets, add every element a single
|
|
* time to the result set */
|
|
for (j = 0; j < setsnum; j++) {
|
|
if (op == REDIS_OP_DIFF && j == 0 && !dv[j]) break; /* result set is empty */
|
|
if (!dv[j]) continue; /* non existing keys are like empty sets */
|
|
|
|
di = dictGetIterator(dv[j]);
|
|
|
|
while((de = dictNext(di)) != NULL) {
|
|
robj *ele;
|
|
|
|
/* dictAdd will not add the same element multiple times */
|
|
ele = dictGetEntryKey(de);
|
|
if (op == REDIS_OP_UNION || j == 0) {
|
|
if (dictAdd(dstset->ptr,ele,NULL) == DICT_OK) {
|
|
incrRefCount(ele);
|
|
cardinality++;
|
|
}
|
|
} else if (op == REDIS_OP_DIFF) {
|
|
if (dictDelete(dstset->ptr,ele) == DICT_OK) {
|
|
cardinality--;
|
|
}
|
|
}
|
|
}
|
|
dictReleaseIterator(di);
|
|
|
|
if (op == REDIS_OP_DIFF && cardinality == 0) break; /* result set is empty */
|
|
}
|
|
|
|
/* Output the content of the resulting set, if not in STORE mode */
|
|
if (!dstkey) {
|
|
addReplySds(c,sdscatprintf(sdsempty(),"*%d\r\n",cardinality));
|
|
di = dictGetIterator(dstset->ptr);
|
|
while((de = dictNext(di)) != NULL) {
|
|
robj *ele;
|
|
|
|
ele = dictGetEntryKey(de);
|
|
addReplyBulkLen(c,ele);
|
|
addReply(c,ele);
|
|
addReply(c,shared.crlf);
|
|
}
|
|
dictReleaseIterator(di);
|
|
} else {
|
|
/* If we have a target key where to store the resulting set
|
|
* create this key with the result set inside */
|
|
deleteKey(c->db,dstkey);
|
|
dictAdd(c->db->dict,dstkey,dstset);
|
|
incrRefCount(dstkey);
|
|
}
|
|
|
|
/* Cleanup */
|
|
if (!dstkey) {
|
|
decrRefCount(dstset);
|
|
} else {
|
|
addReplySds(c,sdscatprintf(sdsempty(),":%lu\r\n",
|
|
dictSize((dict*)dstset->ptr)));
|
|
server.dirty++;
|
|
}
|
|
zfree(dv);
|
|
}
|
|
|
|
static void sunionCommand(redisClient *c) {
|
|
sunionDiffGenericCommand(c,c->argv+1,c->argc-1,NULL,REDIS_OP_UNION);
|
|
}
|
|
|
|
static void sunionstoreCommand(redisClient *c) {
|
|
sunionDiffGenericCommand(c,c->argv+2,c->argc-2,c->argv[1],REDIS_OP_UNION);
|
|
}
|
|
|
|
static void sdiffCommand(redisClient *c) {
|
|
sunionDiffGenericCommand(c,c->argv+1,c->argc-1,NULL,REDIS_OP_DIFF);
|
|
}
|
|
|
|
static void sdiffstoreCommand(redisClient *c) {
|
|
sunionDiffGenericCommand(c,c->argv+2,c->argc-2,c->argv[1],REDIS_OP_DIFF);
|
|
}
|
|
|
|
/* ==================================== ZSets =============================== */
|
|
|
|
/* ZSETs are ordered sets using two data structures to hold the same elements
|
|
* in order to get O(log(N)) INSERT and REMOVE operations into a sorted
|
|
* data structure.
|
|
*
|
|
* The elements are added to an hash table mapping Redis objects to scores.
|
|
* At the same time the elements are added to a skip list mapping scores
|
|
* to Redis objects (so objects are sorted by scores in this "view"). */
|
|
|
|
/* This skiplist implementation is almost a C translation of the original
|
|
* algorithm described by William Pugh in "Skip Lists: A Probabilistic
|
|
* Alternative to Balanced Trees", modified in three ways:
|
|
* a) this implementation allows for repeated values.
|
|
* b) the comparison is not just by key (our 'score') but by satellite data.
|
|
* c) there is a back pointer, so it's a doubly linked list with the back
|
|
* pointers being only at "level 1". This allows to traverse the list
|
|
* from tail to head, useful for ZREVRANGE. */
|
|
|
|
static zskiplistNode *zslCreateNode(int level, double score, robj *obj) {
|
|
zskiplistNode *zn = zmalloc(sizeof(*zn));
|
|
|
|
zn->forward = zmalloc(sizeof(zskiplistNode*) * level);
|
|
zn->score = score;
|
|
zn->obj = obj;
|
|
return zn;
|
|
}
|
|
|
|
static zskiplist *zslCreate(void) {
|
|
int j;
|
|
zskiplist *zsl;
|
|
|
|
zsl = zmalloc(sizeof(*zsl));
|
|
zsl->level = 1;
|
|
zsl->length = 0;
|
|
zsl->header = zslCreateNode(ZSKIPLIST_MAXLEVEL,0,NULL);
|
|
for (j = 0; j < ZSKIPLIST_MAXLEVEL; j++)
|
|
zsl->header->forward[j] = NULL;
|
|
zsl->header->backward = NULL;
|
|
zsl->tail = NULL;
|
|
return zsl;
|
|
}
|
|
|
|
static void zslFreeNode(zskiplistNode *node) {
|
|
decrRefCount(node->obj);
|
|
zfree(node->forward);
|
|
zfree(node);
|
|
}
|
|
|
|
static void zslFree(zskiplist *zsl) {
|
|
zskiplistNode *node = zsl->header->forward[0], *next;
|
|
|
|
zfree(zsl->header->forward);
|
|
zfree(zsl->header);
|
|
while(node) {
|
|
next = node->forward[0];
|
|
zslFreeNode(node);
|
|
node = next;
|
|
}
|
|
zfree(zsl);
|
|
}
|
|
|
|
static int zslRandomLevel(void) {
|
|
int level = 1;
|
|
while ((random()&0xFFFF) < (ZSKIPLIST_P * 0xFFFF))
|
|
level += 1;
|
|
return level;
|
|
}
|
|
|
|
static void zslInsert(zskiplist *zsl, double score, robj *obj) {
|
|
zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
|
|
int i, level;
|
|
|
|
x = zsl->header;
|
|
for (i = zsl->level-1; i >= 0; i--) {
|
|
while (x->forward[i] &&
|
|
(x->forward[i]->score < score ||
|
|
(x->forward[i]->score == score &&
|
|
compareStringObjects(x->forward[i]->obj,obj) < 0)))
|
|
x = x->forward[i];
|
|
update[i] = x;
|
|
}
|
|
/* we assume the key is not already inside, since we allow duplicated
|
|
* scores, and the re-insertion of score and redis object should never
|
|
* happpen since the caller of zslInsert() should test in the hash table
|
|
* if the element is already inside or not. */
|
|
level = zslRandomLevel();
|
|
if (level > zsl->level) {
|
|
for (i = zsl->level; i < level; i++)
|
|
update[i] = zsl->header;
|
|
zsl->level = level;
|
|
}
|
|
x = zslCreateNode(level,score,obj);
|
|
for (i = 0; i < level; i++) {
|
|
x->forward[i] = update[i]->forward[i];
|
|
update[i]->forward[i] = x;
|
|
}
|
|
x->backward = (update[0] == zsl->header) ? NULL : update[0];
|
|
if (x->forward[0])
|
|
x->forward[0]->backward = x;
|
|
else
|
|
zsl->tail = x;
|
|
zsl->length++;
|
|
}
|
|
|
|
/* Delete an element with matching score/object from the skiplist. */
|
|
static int zslDelete(zskiplist *zsl, double score, robj *obj) {
|
|
zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
|
|
int i;
|
|
|
|
x = zsl->header;
|
|
for (i = zsl->level-1; i >= 0; i--) {
|
|
while (x->forward[i] &&
|
|
(x->forward[i]->score < score ||
|
|
(x->forward[i]->score == score &&
|
|
compareStringObjects(x->forward[i]->obj,obj) < 0)))
|
|
x = x->forward[i];
|
|
update[i] = x;
|
|
}
|
|
/* We may have multiple elements with the same score, what we need
|
|
* is to find the element with both the right score and object. */
|
|
x = x->forward[0];
|
|
if (x && score == x->score && compareStringObjects(x->obj,obj) == 0) {
|
|
for (i = 0; i < zsl->level; i++) {
|
|
if (update[i]->forward[i] != x) break;
|
|
update[i]->forward[i] = x->forward[i];
|
|
}
|
|
if (x->forward[0]) {
|
|
x->forward[0]->backward = (x->backward == zsl->header) ?
|
|
NULL : x->backward;
|
|
} else {
|
|
zsl->tail = x->backward;
|
|
}
|
|
zslFreeNode(x);
|
|
while(zsl->level > 1 && zsl->header->forward[zsl->level-1] == NULL)
|
|
zsl->level--;
|
|
zsl->length--;
|
|
return 1;
|
|
} else {
|
|
return 0; /* not found */
|
|
}
|
|
return 0; /* not found */
|
|
}
|
|
|
|
/* Delete all the elements with score between min and max from the skiplist.
|
|
* Min and mx are inclusive, so a score >= min || score <= max is deleted.
|
|
* Note that this function takes the reference to the hash table view of the
|
|
* sorted set, in order to remove the elements from the hash table too. */
|
|
static unsigned long zslDeleteRange(zskiplist *zsl, double min, double max, dict *dict) {
|
|
zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
|
|
unsigned long removed = 0;
|
|
int i;
|
|
|
|
x = zsl->header;
|
|
for (i = zsl->level-1; i >= 0; i--) {
|
|
while (x->forward[i] && x->forward[i]->score < min)
|
|
x = x->forward[i];
|
|
update[i] = x;
|
|
}
|
|
/* We may have multiple elements with the same score, what we need
|
|
* is to find the element with both the right score and object. */
|
|
x = x->forward[0];
|
|
while (x && x->score <= max) {
|
|
zskiplistNode *next;
|
|
|
|
for (i = 0; i < zsl->level; i++) {
|
|
if (update[i]->forward[i] != x) break;
|
|
update[i]->forward[i] = x->forward[i];
|
|
}
|
|
if (x->forward[0]) {
|
|
x->forward[0]->backward = (x->backward == zsl->header) ?
|
|
NULL : x->backward;
|
|
} else {
|
|
zsl->tail = x->backward;
|
|
}
|
|
next = x->forward[0];
|
|
dictDelete(dict,x->obj);
|
|
zslFreeNode(x);
|
|
while(zsl->level > 1 && zsl->header->forward[zsl->level-1] == NULL)
|
|
zsl->level--;
|
|
zsl->length--;
|
|
removed++;
|
|
x = next;
|
|
}
|
|
return removed; /* not found */
|
|
}
|
|
|
|
/* Find the first node having a score equal or greater than the specified one.
|
|
* Returns NULL if there is no match. */
|
|
static zskiplistNode *zslFirstWithScore(zskiplist *zsl, double score) {
|
|
zskiplistNode *x;
|
|
int i;
|
|
|
|
x = zsl->header;
|
|
for (i = zsl->level-1; i >= 0; i--) {
|
|
while (x->forward[i] && x->forward[i]->score < score)
|
|
x = x->forward[i];
|
|
}
|
|
/* We may have multiple elements with the same score, what we need
|
|
* is to find the element with both the right score and object. */
|
|
return x->forward[0];
|
|
}
|
|
|
|
/* The actual Z-commands implementations */
|
|
|
|
/* This generic command implements both ZADD and ZINCRBY.
|
|
* scoreval is the score if the operation is a ZADD (doincrement == 0) or
|
|
* the increment if the operation is a ZINCRBY (doincrement == 1). */
|
|
static void zaddGenericCommand(redisClient *c, robj *key, robj *ele, double scoreval, int doincrement) {
|
|
robj *zsetobj;
|
|
zset *zs;
|
|
double *score;
|
|
|
|
zsetobj = lookupKeyWrite(c->db,key);
|
|
if (zsetobj == NULL) {
|
|
zsetobj = createZsetObject();
|
|
dictAdd(c->db->dict,key,zsetobj);
|
|
incrRefCount(key);
|
|
} else {
|
|
if (zsetobj->type != REDIS_ZSET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
}
|
|
zs = zsetobj->ptr;
|
|
|
|
/* Ok now since we implement both ZADD and ZINCRBY here the code
|
|
* needs to handle the two different conditions. It's all about setting
|
|
* '*score', that is, the new score to set, to the right value. */
|
|
score = zmalloc(sizeof(double));
|
|
if (doincrement) {
|
|
dictEntry *de;
|
|
|
|
/* Read the old score. If the element was not present starts from 0 */
|
|
de = dictFind(zs->dict,ele);
|
|
if (de) {
|
|
double *oldscore = dictGetEntryVal(de);
|
|
*score = *oldscore + scoreval;
|
|
} else {
|
|
*score = scoreval;
|
|
}
|
|
} else {
|
|
*score = scoreval;
|
|
}
|
|
|
|
/* What follows is a simple remove and re-insert operation that is common
|
|
* to both ZADD and ZINCRBY... */
|
|
if (dictAdd(zs->dict,ele,score) == DICT_OK) {
|
|
/* case 1: New element */
|
|
incrRefCount(ele); /* added to hash */
|
|
zslInsert(zs->zsl,*score,ele);
|
|
incrRefCount(ele); /* added to skiplist */
|
|
server.dirty++;
|
|
if (doincrement)
|
|
addReplyDouble(c,*score);
|
|
else
|
|
addReply(c,shared.cone);
|
|
} else {
|
|
dictEntry *de;
|
|
double *oldscore;
|
|
|
|
/* case 2: Score update operation */
|
|
de = dictFind(zs->dict,ele);
|
|
redisAssert(de != NULL);
|
|
oldscore = dictGetEntryVal(de);
|
|
if (*score != *oldscore) {
|
|
int deleted;
|
|
|
|
/* Remove and insert the element in the skip list with new score */
|
|
deleted = zslDelete(zs->zsl,*oldscore,ele);
|
|
redisAssert(deleted != 0);
|
|
zslInsert(zs->zsl,*score,ele);
|
|
incrRefCount(ele);
|
|
/* Update the score in the hash table */
|
|
dictReplace(zs->dict,ele,score);
|
|
server.dirty++;
|
|
} else {
|
|
zfree(score);
|
|
}
|
|
if (doincrement)
|
|
addReplyDouble(c,*score);
|
|
else
|
|
addReply(c,shared.czero);
|
|
}
|
|
}
|
|
|
|
static void zaddCommand(redisClient *c) {
|
|
double scoreval;
|
|
|
|
scoreval = strtod(c->argv[2]->ptr,NULL);
|
|
zaddGenericCommand(c,c->argv[1],c->argv[3],scoreval,0);
|
|
}
|
|
|
|
static void zincrbyCommand(redisClient *c) {
|
|
double scoreval;
|
|
|
|
scoreval = strtod(c->argv[2]->ptr,NULL);
|
|
zaddGenericCommand(c,c->argv[1],c->argv[3],scoreval,1);
|
|
}
|
|
|
|
static void zremCommand(redisClient *c) {
|
|
robj *zsetobj;
|
|
zset *zs;
|
|
|
|
zsetobj = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (zsetobj == NULL) {
|
|
addReply(c,shared.czero);
|
|
} else {
|
|
dictEntry *de;
|
|
double *oldscore;
|
|
int deleted;
|
|
|
|
if (zsetobj->type != REDIS_ZSET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
zs = zsetobj->ptr;
|
|
de = dictFind(zs->dict,c->argv[2]);
|
|
if (de == NULL) {
|
|
addReply(c,shared.czero);
|
|
return;
|
|
}
|
|
/* Delete from the skiplist */
|
|
oldscore = dictGetEntryVal(de);
|
|
deleted = zslDelete(zs->zsl,*oldscore,c->argv[2]);
|
|
redisAssert(deleted != 0);
|
|
|
|
/* Delete from the hash table */
|
|
dictDelete(zs->dict,c->argv[2]);
|
|
if (htNeedsResize(zs->dict)) dictResize(zs->dict);
|
|
server.dirty++;
|
|
addReply(c,shared.cone);
|
|
}
|
|
}
|
|
|
|
static void zremrangebyscoreCommand(redisClient *c) {
|
|
double min = strtod(c->argv[2]->ptr,NULL);
|
|
double max = strtod(c->argv[3]->ptr,NULL);
|
|
robj *zsetobj;
|
|
zset *zs;
|
|
|
|
zsetobj = lookupKeyWrite(c->db,c->argv[1]);
|
|
if (zsetobj == NULL) {
|
|
addReply(c,shared.czero);
|
|
} else {
|
|
long deleted;
|
|
|
|
if (zsetobj->type != REDIS_ZSET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
zs = zsetobj->ptr;
|
|
deleted = zslDeleteRange(zs->zsl,min,max,zs->dict);
|
|
if (htNeedsResize(zs->dict)) dictResize(zs->dict);
|
|
server.dirty += deleted;
|
|
addReplySds(c,sdscatprintf(sdsempty(),":%lu\r\n",deleted));
|
|
}
|
|
}
|
|
|
|
static void zrangeGenericCommand(redisClient *c, int reverse) {
|
|
robj *o;
|
|
int start = atoi(c->argv[2]->ptr);
|
|
int end = atoi(c->argv[3]->ptr);
|
|
|
|
o = lookupKeyRead(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.nullmultibulk);
|
|
} else {
|
|
if (o->type != REDIS_ZSET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
zset *zsetobj = o->ptr;
|
|
zskiplist *zsl = zsetobj->zsl;
|
|
zskiplistNode *ln;
|
|
|
|
int llen = zsl->length;
|
|
int rangelen, j;
|
|
robj *ele;
|
|
|
|
/* convert negative indexes */
|
|
if (start < 0) start = llen+start;
|
|
if (end < 0) end = llen+end;
|
|
if (start < 0) start = 0;
|
|
if (end < 0) end = 0;
|
|
|
|
/* indexes sanity checks */
|
|
if (start > end || start >= llen) {
|
|
/* Out of range start or start > end result in empty list */
|
|
addReply(c,shared.emptymultibulk);
|
|
return;
|
|
}
|
|
if (end >= llen) end = llen-1;
|
|
rangelen = (end-start)+1;
|
|
|
|
/* Return the result in form of a multi-bulk reply */
|
|
if (reverse) {
|
|
ln = zsl->tail;
|
|
while (start--)
|
|
ln = ln->backward;
|
|
} else {
|
|
ln = zsl->header->forward[0];
|
|
while (start--)
|
|
ln = ln->forward[0];
|
|
}
|
|
|
|
addReplySds(c,sdscatprintf(sdsempty(),"*%d\r\n",rangelen));
|
|
for (j = 0; j < rangelen; j++) {
|
|
ele = ln->obj;
|
|
addReplyBulkLen(c,ele);
|
|
addReply(c,ele);
|
|
addReply(c,shared.crlf);
|
|
ln = reverse ? ln->backward : ln->forward[0];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static void zrangeCommand(redisClient *c) {
|
|
zrangeGenericCommand(c,0);
|
|
}
|
|
|
|
static void zrevrangeCommand(redisClient *c) {
|
|
zrangeGenericCommand(c,1);
|
|
}
|
|
|
|
static void zrangebyscoreCommand(redisClient *c) {
|
|
robj *o;
|
|
double min = strtod(c->argv[2]->ptr,NULL);
|
|
double max = strtod(c->argv[3]->ptr,NULL);
|
|
int offset = 0, limit = -1;
|
|
|
|
if (c->argc != 4 && c->argc != 7) {
|
|
addReplySds(c,
|
|
sdsnew("-ERR wrong number of arguments for ZRANGEBYSCORE\r\n"));
|
|
return;
|
|
} else if (c->argc == 7 && strcasecmp(c->argv[4]->ptr,"limit")) {
|
|
addReply(c,shared.syntaxerr);
|
|
return;
|
|
} else if (c->argc == 7) {
|
|
offset = atoi(c->argv[5]->ptr);
|
|
limit = atoi(c->argv[6]->ptr);
|
|
if (offset < 0) offset = 0;
|
|
}
|
|
|
|
o = lookupKeyRead(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.nullmultibulk);
|
|
} else {
|
|
if (o->type != REDIS_ZSET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
zset *zsetobj = o->ptr;
|
|
zskiplist *zsl = zsetobj->zsl;
|
|
zskiplistNode *ln;
|
|
robj *ele, *lenobj;
|
|
unsigned int rangelen = 0;
|
|
|
|
/* Get the first node with the score >= min */
|
|
ln = zslFirstWithScore(zsl,min);
|
|
if (ln == NULL) {
|
|
/* No element matching the speciifed interval */
|
|
addReply(c,shared.emptymultibulk);
|
|
return;
|
|
}
|
|
|
|
/* We don't know in advance how many matching elements there
|
|
* are in the list, so we push this object that will represent
|
|
* the multi-bulk length in the output buffer, and will "fix"
|
|
* it later */
|
|
lenobj = createObject(REDIS_STRING,NULL);
|
|
addReply(c,lenobj);
|
|
decrRefCount(lenobj);
|
|
|
|
while(ln && ln->score <= max) {
|
|
if (offset) {
|
|
offset--;
|
|
ln = ln->forward[0];
|
|
continue;
|
|
}
|
|
if (limit == 0) break;
|
|
ele = ln->obj;
|
|
addReplyBulkLen(c,ele);
|
|
addReply(c,ele);
|
|
addReply(c,shared.crlf);
|
|
ln = ln->forward[0];
|
|
rangelen++;
|
|
if (limit > 0) limit--;
|
|
}
|
|
lenobj->ptr = sdscatprintf(sdsempty(),"*%d\r\n",rangelen);
|
|
}
|
|
}
|
|
}
|
|
|
|
static void zcardCommand(redisClient *c) {
|
|
robj *o;
|
|
zset *zs;
|
|
|
|
o = lookupKeyRead(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.czero);
|
|
return;
|
|
} else {
|
|
if (o->type != REDIS_ZSET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
zs = o->ptr;
|
|
addReplySds(c,sdscatprintf(sdsempty(),":%lu\r\n",zs->zsl->length));
|
|
}
|
|
}
|
|
}
|
|
|
|
static void zscoreCommand(redisClient *c) {
|
|
robj *o;
|
|
zset *zs;
|
|
|
|
o = lookupKeyRead(c->db,c->argv[1]);
|
|
if (o == NULL) {
|
|
addReply(c,shared.nullbulk);
|
|
return;
|
|
} else {
|
|
if (o->type != REDIS_ZSET) {
|
|
addReply(c,shared.wrongtypeerr);
|
|
} else {
|
|
dictEntry *de;
|
|
|
|
zs = o->ptr;
|
|
de = dictFind(zs->dict,c->argv[2]);
|
|
if (!de) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
double *score = dictGetEntryVal(de);
|
|
|
|
addReplyDouble(c,*score);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/* ========================= Non type-specific commands ==================== */
|
|
|
|
static void flushdbCommand(redisClient *c) {
|
|
server.dirty += dictSize(c->db->dict);
|
|
dictEmpty(c->db->dict);
|
|
dictEmpty(c->db->expires);
|
|
addReply(c,shared.ok);
|
|
}
|
|
|
|
static void flushallCommand(redisClient *c) {
|
|
server.dirty += emptyDb();
|
|
addReply(c,shared.ok);
|
|
rdbSave(server.dbfilename);
|
|
server.dirty++;
|
|
}
|
|
|
|
static redisSortOperation *createSortOperation(int type, robj *pattern) {
|
|
redisSortOperation *so = zmalloc(sizeof(*so));
|
|
so->type = type;
|
|
so->pattern = pattern;
|
|
return so;
|
|
}
|
|
|
|
/* Return the value associated to the key with a name obtained
|
|
* substituting the first occurence of '*' in 'pattern' with 'subst' */
|
|
static robj *lookupKeyByPattern(redisDb *db, robj *pattern, robj *subst) {
|
|
char *p;
|
|
sds spat, ssub;
|
|
robj keyobj;
|
|
int prefixlen, sublen, postfixlen;
|
|
/* Expoit the internal sds representation to create a sds string allocated on the stack in order to make this function faster */
|
|
struct {
|
|
long len;
|
|
long free;
|
|
char buf[REDIS_SORTKEY_MAX+1];
|
|
} keyname;
|
|
|
|
/* If the pattern is "#" return the substitution object itself in order
|
|
* to implement the "SORT ... GET #" feature. */
|
|
spat = pattern->ptr;
|
|
if (spat[0] == '#' && spat[1] == '\0') {
|
|
return subst;
|
|
}
|
|
|
|
/* The substitution object may be specially encoded. If so we create
|
|
* a decoded object on the fly. Otherwise getDecodedObject will just
|
|
* increment the ref count, that we'll decrement later. */
|
|
subst = getDecodedObject(subst);
|
|
|
|
ssub = subst->ptr;
|
|
if (sdslen(spat)+sdslen(ssub)-1 > REDIS_SORTKEY_MAX) return NULL;
|
|
p = strchr(spat,'*');
|
|
if (!p) {
|
|
decrRefCount(subst);
|
|
return NULL;
|
|
}
|
|
|
|
prefixlen = p-spat;
|
|
sublen = sdslen(ssub);
|
|
postfixlen = sdslen(spat)-(prefixlen+1);
|
|
memcpy(keyname.buf,spat,prefixlen);
|
|
memcpy(keyname.buf+prefixlen,ssub,sublen);
|
|
memcpy(keyname.buf+prefixlen+sublen,p+1,postfixlen);
|
|
keyname.buf[prefixlen+sublen+postfixlen] = '\0';
|
|
keyname.len = prefixlen+sublen+postfixlen;
|
|
|
|
initStaticStringObject(keyobj,((char*)&keyname)+(sizeof(long)*2))
|
|
decrRefCount(subst);
|
|
|
|
/* printf("lookup '%s' => %p\n", keyname.buf,de); */
|
|
return lookupKeyRead(db,&keyobj);
|
|
}
|
|
|
|
/* sortCompare() is used by qsort in sortCommand(). Given that qsort_r with
|
|
* the additional parameter is not standard but a BSD-specific we have to
|
|
* pass sorting parameters via the global 'server' structure */
|
|
static int sortCompare(const void *s1, const void *s2) {
|
|
const redisSortObject *so1 = s1, *so2 = s2;
|
|
int cmp;
|
|
|
|
if (!server.sort_alpha) {
|
|
/* Numeric sorting. Here it's trivial as we precomputed scores */
|
|
if (so1->u.score > so2->u.score) {
|
|
cmp = 1;
|
|
} else if (so1->u.score < so2->u.score) {
|
|
cmp = -1;
|
|
} else {
|
|
cmp = 0;
|
|
}
|
|
} else {
|
|
/* Alphanumeric sorting */
|
|
if (server.sort_bypattern) {
|
|
if (!so1->u.cmpobj || !so2->u.cmpobj) {
|
|
/* At least one compare object is NULL */
|
|
if (so1->u.cmpobj == so2->u.cmpobj)
|
|
cmp = 0;
|
|
else if (so1->u.cmpobj == NULL)
|
|
cmp = -1;
|
|
else
|
|
cmp = 1;
|
|
} else {
|
|
/* We have both the objects, use strcoll */
|
|
cmp = strcoll(so1->u.cmpobj->ptr,so2->u.cmpobj->ptr);
|
|
}
|
|
} else {
|
|
/* Compare elements directly */
|
|
robj *dec1, *dec2;
|
|
|
|
dec1 = getDecodedObject(so1->obj);
|
|
dec2 = getDecodedObject(so2->obj);
|
|
cmp = strcoll(dec1->ptr,dec2->ptr);
|
|
decrRefCount(dec1);
|
|
decrRefCount(dec2);
|
|
}
|
|
}
|
|
return server.sort_desc ? -cmp : cmp;
|
|
}
|
|
|
|
/* The SORT command is the most complex command in Redis. Warning: this code
|
|
* is optimized for speed and a bit less for readability */
|
|
static void sortCommand(redisClient *c) {
|
|
list *operations;
|
|
int outputlen = 0;
|
|
int desc = 0, alpha = 0;
|
|
int limit_start = 0, limit_count = -1, start, end;
|
|
int j, dontsort = 0, vectorlen;
|
|
int getop = 0; /* GET operation counter */
|
|
robj *sortval, *sortby = NULL, *storekey = NULL;
|
|
redisSortObject *vector; /* Resulting vector to sort */
|
|
|
|
/* Lookup the key to sort. It must be of the right types */
|
|
sortval = lookupKeyRead(c->db,c->argv[1]);
|
|
if (sortval == NULL) {
|
|
addReply(c,shared.nokeyerr);
|
|
return;
|
|
}
|
|
if (sortval->type != REDIS_SET && sortval->type != REDIS_LIST &&
|
|
sortval->type != REDIS_ZSET)
|
|
{
|
|
addReply(c,shared.wrongtypeerr);
|
|
return;
|
|
}
|
|
|
|
/* Create a list of operations to perform for every sorted element.
|
|
* Operations can be GET/DEL/INCR/DECR */
|
|
operations = listCreate();
|
|
listSetFreeMethod(operations,zfree);
|
|
j = 2;
|
|
|
|
/* Now we need to protect sortval incrementing its count, in the future
|
|
* SORT may have options able to overwrite/delete keys during the sorting
|
|
* and the sorted key itself may get destroied */
|
|
incrRefCount(sortval);
|
|
|
|
/* The SORT command has an SQL-alike syntax, parse it */
|
|
while(j < c->argc) {
|
|
int leftargs = c->argc-j-1;
|
|
if (!strcasecmp(c->argv[j]->ptr,"asc")) {
|
|
desc = 0;
|
|
} else if (!strcasecmp(c->argv[j]->ptr,"desc")) {
|
|
desc = 1;
|
|
} else if (!strcasecmp(c->argv[j]->ptr,"alpha")) {
|
|
alpha = 1;
|
|
} else if (!strcasecmp(c->argv[j]->ptr,"limit") && leftargs >= 2) {
|
|
limit_start = atoi(c->argv[j+1]->ptr);
|
|
limit_count = atoi(c->argv[j+2]->ptr);
|
|
j+=2;
|
|
} else if (!strcasecmp(c->argv[j]->ptr,"store") && leftargs >= 1) {
|
|
storekey = c->argv[j+1];
|
|
j++;
|
|
} else if (!strcasecmp(c->argv[j]->ptr,"by") && leftargs >= 1) {
|
|
sortby = c->argv[j+1];
|
|
/* If the BY pattern does not contain '*', i.e. it is constant,
|
|
* we don't need to sort nor to lookup the weight keys. */
|
|
if (strchr(c->argv[j+1]->ptr,'*') == NULL) dontsort = 1;
|
|
j++;
|
|
} else if (!strcasecmp(c->argv[j]->ptr,"get") && leftargs >= 1) {
|
|
listAddNodeTail(operations,createSortOperation(
|
|
REDIS_SORT_GET,c->argv[j+1]));
|
|
getop++;
|
|
j++;
|
|
} else {
|
|
decrRefCount(sortval);
|
|
listRelease(operations);
|
|
addReply(c,shared.syntaxerr);
|
|
return;
|
|
}
|
|
j++;
|
|
}
|
|
|
|
/* Load the sorting vector with all the objects to sort */
|
|
switch(sortval->type) {
|
|
case REDIS_LIST: vectorlen = listLength((list*)sortval->ptr); break;
|
|
case REDIS_SET: vectorlen = dictSize((dict*)sortval->ptr); break;
|
|
case REDIS_ZSET: vectorlen = dictSize(((zset*)sortval->ptr)->dict); break;
|
|
default: vectorlen = 0; redisAssert(0); /* Avoid GCC warning */
|
|
}
|
|
vector = zmalloc(sizeof(redisSortObject)*vectorlen);
|
|
j = 0;
|
|
|
|
if (sortval->type == REDIS_LIST) {
|
|
list *list = sortval->ptr;
|
|
listNode *ln;
|
|
|
|
listRewind(list);
|
|
while((ln = listYield(list))) {
|
|
robj *ele = ln->value;
|
|
vector[j].obj = ele;
|
|
vector[j].u.score = 0;
|
|
vector[j].u.cmpobj = NULL;
|
|
j++;
|
|
}
|
|
} else {
|
|
dict *set;
|
|
dictIterator *di;
|
|
dictEntry *setele;
|
|
|
|
if (sortval->type == REDIS_SET) {
|
|
set = sortval->ptr;
|
|
} else {
|
|
zset *zs = sortval->ptr;
|
|
set = zs->dict;
|
|
}
|
|
|
|
di = dictGetIterator(set);
|
|
while((setele = dictNext(di)) != NULL) {
|
|
vector[j].obj = dictGetEntryKey(setele);
|
|
vector[j].u.score = 0;
|
|
vector[j].u.cmpobj = NULL;
|
|
j++;
|
|
}
|
|
dictReleaseIterator(di);
|
|
}
|
|
redisAssert(j == vectorlen);
|
|
|
|
/* Now it's time to load the right scores in the sorting vector */
|
|
if (dontsort == 0) {
|
|
for (j = 0; j < vectorlen; j++) {
|
|
if (sortby) {
|
|
robj *byval;
|
|
|
|
byval = lookupKeyByPattern(c->db,sortby,vector[j].obj);
|
|
if (!byval || byval->type != REDIS_STRING) continue;
|
|
if (alpha) {
|
|
vector[j].u.cmpobj = getDecodedObject(byval);
|
|
} else {
|
|
if (byval->encoding == REDIS_ENCODING_RAW) {
|
|
vector[j].u.score = strtod(byval->ptr,NULL);
|
|
} else {
|
|
/* Don't need to decode the object if it's
|
|
* integer-encoded (the only encoding supported) so
|
|
* far. We can just cast it */
|
|
if (byval->encoding == REDIS_ENCODING_INT) {
|
|
vector[j].u.score = (long)byval->ptr;
|
|
} else
|
|
redisAssert(1 != 1);
|
|
}
|
|
}
|
|
} else {
|
|
if (!alpha) {
|
|
if (vector[j].obj->encoding == REDIS_ENCODING_RAW)
|
|
vector[j].u.score = strtod(vector[j].obj->ptr,NULL);
|
|
else {
|
|
if (vector[j].obj->encoding == REDIS_ENCODING_INT)
|
|
vector[j].u.score = (long) vector[j].obj->ptr;
|
|
else
|
|
redisAssert(1 != 1);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/* We are ready to sort the vector... perform a bit of sanity check
|
|
* on the LIMIT option too. We'll use a partial version of quicksort. */
|
|
start = (limit_start < 0) ? 0 : limit_start;
|
|
end = (limit_count < 0) ? vectorlen-1 : start+limit_count-1;
|
|
if (start >= vectorlen) {
|
|
start = vectorlen-1;
|
|
end = vectorlen-2;
|
|
}
|
|
if (end >= vectorlen) end = vectorlen-1;
|
|
|
|
if (dontsort == 0) {
|
|
server.sort_desc = desc;
|
|
server.sort_alpha = alpha;
|
|
server.sort_bypattern = sortby ? 1 : 0;
|
|
if (sortby && (start != 0 || end != vectorlen-1))
|
|
pqsort(vector,vectorlen,sizeof(redisSortObject),sortCompare, start,end);
|
|
else
|
|
qsort(vector,vectorlen,sizeof(redisSortObject),sortCompare);
|
|
}
|
|
|
|
/* Send command output to the output buffer, performing the specified
|
|
* GET/DEL/INCR/DECR operations if any. */
|
|
outputlen = getop ? getop*(end-start+1) : end-start+1;
|
|
if (storekey == NULL) {
|
|
/* STORE option not specified, sent the sorting result to client */
|
|
addReplySds(c,sdscatprintf(sdsempty(),"*%d\r\n",outputlen));
|
|
for (j = start; j <= end; j++) {
|
|
listNode *ln;
|
|
if (!getop) {
|
|
addReplyBulkLen(c,vector[j].obj);
|
|
addReply(c,vector[j].obj);
|
|
addReply(c,shared.crlf);
|
|
}
|
|
listRewind(operations);
|
|
while((ln = listYield(operations))) {
|
|
redisSortOperation *sop = ln->value;
|
|
robj *val = lookupKeyByPattern(c->db,sop->pattern,
|
|
vector[j].obj);
|
|
|
|
if (sop->type == REDIS_SORT_GET) {
|
|
if (!val || val->type != REDIS_STRING) {
|
|
addReply(c,shared.nullbulk);
|
|
} else {
|
|
addReplyBulkLen(c,val);
|
|
addReply(c,val);
|
|
addReply(c,shared.crlf);
|
|
}
|
|
} else {
|
|
redisAssert(sop->type == REDIS_SORT_GET); /* always fails */
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
robj *listObject = createListObject();
|
|
list *listPtr = (list*) listObject->ptr;
|
|
|
|
/* STORE option specified, set the sorting result as a List object */
|
|
for (j = start; j <= end; j++) {
|
|
listNode *ln;
|
|
if (!getop) {
|
|
listAddNodeTail(listPtr,vector[j].obj);
|
|
incrRefCount(vector[j].obj);
|
|
}
|
|
listRewind(operations);
|
|
while((ln = listYield(operations))) {
|
|
redisSortOperation *sop = ln->value;
|
|
robj *val = lookupKeyByPattern(c->db,sop->pattern,
|
|
vector[j].obj);
|
|
|
|
if (sop->type == REDIS_SORT_GET) {
|
|
if (!val || val->type != REDIS_STRING) {
|
|
listAddNodeTail(listPtr,createStringObject("",0));
|
|
} else {
|
|
listAddNodeTail(listPtr,val);
|
|
incrRefCount(val);
|
|
}
|
|
} else {
|
|
redisAssert(sop->type == REDIS_SORT_GET); /* always fails */
|
|
}
|
|
}
|
|
}
|
|
if (dictReplace(c->db->dict,storekey,listObject)) {
|
|
incrRefCount(storekey);
|
|
}
|
|
/* Note: we add 1 because the DB is dirty anyway since even if the
|
|
* SORT result is empty a new key is set and maybe the old content
|
|
* replaced. */
|
|
server.dirty += 1+outputlen;
|
|
addReplySds(c,sdscatprintf(sdsempty(),":%d\r\n",outputlen));
|
|
}
|
|
|
|
/* Cleanup */
|
|
decrRefCount(sortval);
|
|
listRelease(operations);
|
|
for (j = 0; j < vectorlen; j++) {
|
|
if (sortby && alpha && vector[j].u.cmpobj)
|
|
decrRefCount(vector[j].u.cmpobj);
|
|
}
|
|
zfree(vector);
|
|
}
|
|
|
|
/* Create the string returned by the INFO command. This is decoupled
|
|
* by the INFO command itself as we need to report the same information
|
|
* on memory corruption problems. */
|
|
static sds genRedisInfoString(void) {
|
|
sds info;
|
|
time_t uptime = time(NULL)-server.stat_starttime;
|
|
int j;
|
|
|
|
info = sdscatprintf(sdsempty(),
|
|
"redis_version:%s\r\n"
|
|
"arch_bits:%s\r\n"
|
|
"multiplexing_api:%s\r\n"
|
|
"uptime_in_seconds:%ld\r\n"
|
|
"uptime_in_days:%ld\r\n"
|
|
"connected_clients:%d\r\n"
|
|
"connected_slaves:%d\r\n"
|
|
"used_memory:%zu\r\n"
|
|
"changes_since_last_save:%lld\r\n"
|
|
"bgsave_in_progress:%d\r\n"
|
|
"last_save_time:%ld\r\n"
|
|
"bgrewriteaof_in_progress:%d\r\n"
|
|
"total_connections_received:%lld\r\n"
|
|
"total_commands_processed:%lld\r\n"
|
|
"role:%s\r\n"
|
|
,REDIS_VERSION,
|
|
(sizeof(long) == 8) ? "64" : "32",
|
|
aeGetApiName(),
|
|
uptime,
|
|
uptime/(3600*24),
|
|
listLength(server.clients)-listLength(server.slaves),
|
|
listLength(server.slaves),
|
|
server.usedmemory,
|
|
server.dirty,
|
|
server.bgsavechildpid != -1,
|
|
server.lastsave,
|
|
server.bgrewritechildpid != -1,
|
|
server.stat_numconnections,
|
|
server.stat_numcommands,
|
|
server.masterhost == NULL ? "master" : "slave"
|
|
);
|
|
if (server.masterhost) {
|
|
info = sdscatprintf(info,
|
|
"master_host:%s\r\n"
|
|
"master_port:%d\r\n"
|
|
"master_link_status:%s\r\n"
|
|
"master_last_io_seconds_ago:%d\r\n"
|
|
,server.masterhost,
|
|
server.masterport,
|
|
(server.replstate == REDIS_REPL_CONNECTED) ?
|
|
"up" : "down",
|
|
server.master ? ((int)(time(NULL)-server.master->lastinteraction)) : -1
|
|
);
|
|
}
|
|
for (j = 0; j < server.dbnum; j++) {
|
|
long long keys, vkeys;
|
|
|
|
keys = dictSize(server.db[j].dict);
|
|
vkeys = dictSize(server.db[j].expires);
|
|
if (keys || vkeys) {
|
|
info = sdscatprintf(info, "db%d:keys=%lld,expires=%lld\r\n",
|
|
j, keys, vkeys);
|
|
}
|
|
}
|
|
return info;
|
|
}
|
|
|
|
static void infoCommand(redisClient *c) {
|
|
sds info = genRedisInfoString();
|
|
addReplySds(c,sdscatprintf(sdsempty(),"$%lu\r\n",
|
|
(unsigned long)sdslen(info)));
|
|
addReplySds(c,info);
|
|
addReply(c,shared.crlf);
|
|
}
|
|
|
|
static void monitorCommand(redisClient *c) {
|
|
/* ignore MONITOR if aleady slave or in monitor mode */
|
|
if (c->flags & REDIS_SLAVE) return;
|
|
|
|
c->flags |= (REDIS_SLAVE|REDIS_MONITOR);
|
|
c->slaveseldb = 0;
|
|
listAddNodeTail(server.monitors,c);
|
|
addReply(c,shared.ok);
|
|
}
|
|
|
|
/* ================================= Expire ================================= */
|
|
static int removeExpire(redisDb *db, robj *key) {
|
|
if (dictDelete(db->expires,key) == DICT_OK) {
|
|
return 1;
|
|
} else {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
static int setExpire(redisDb *db, robj *key, time_t when) {
|
|
if (dictAdd(db->expires,key,(void*)when) == DICT_ERR) {
|
|
return 0;
|
|
} else {
|
|
incrRefCount(key);
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
/* Return the expire time of the specified key, or -1 if no expire
|
|
* is associated with this key (i.e. the key is non volatile) */
|
|
static time_t getExpire(redisDb *db, robj *key) {
|
|
dictEntry *de;
|
|
|
|
/* No expire? return ASAP */
|
|
if (dictSize(db->expires) == 0 ||
|
|
(de = dictFind(db->expires,key)) == NULL) return -1;
|
|
|
|
return (time_t) dictGetEntryVal(de);
|
|
}
|
|
|
|
static int expireIfNeeded(redisDb *db, robj *key) {
|
|
time_t when;
|
|
dictEntry *de;
|
|
|
|
/* No expire? return ASAP */
|
|
if (dictSize(db->expires) == 0 ||
|
|
(de = dictFind(db->expires,key)) == NULL) return 0;
|
|
|
|
/* Lookup the expire */
|
|
when = (time_t) dictGetEntryVal(de);
|
|
if (time(NULL) <= when) return 0;
|
|
|
|
/* Delete the key */
|
|
dictDelete(db->expires,key);
|
|
return dictDelete(db->dict,key) == DICT_OK;
|
|
}
|
|
|
|
static int deleteIfVolatile(redisDb *db, robj *key) {
|
|
dictEntry *de;
|
|
|
|
/* No expire? return ASAP */
|
|
if (dictSize(db->expires) == 0 ||
|
|
(de = dictFind(db->expires,key)) == NULL) return 0;
|
|
|
|
/* Delete the key */
|
|
server.dirty++;
|
|
dictDelete(db->expires,key);
|
|
return dictDelete(db->dict,key) == DICT_OK;
|
|
}
|
|
|
|
static void expireGenericCommand(redisClient *c, robj *key, time_t seconds) {
|
|
dictEntry *de;
|
|
|
|
de = dictFind(c->db->dict,key);
|
|
if (de == NULL) {
|
|
addReply(c,shared.czero);
|
|
return;
|
|
}
|
|
if (seconds < 0) {
|
|
if (deleteKey(c->db,key)) server.dirty++;
|
|
addReply(c, shared.cone);
|
|
return;
|
|
} else {
|
|
time_t when = time(NULL)+seconds;
|
|
if (setExpire(c->db,key,when)) {
|
|
addReply(c,shared.cone);
|
|
server.dirty++;
|
|
} else {
|
|
addReply(c,shared.czero);
|
|
}
|
|
return;
|
|
}
|
|
}
|
|
|
|
static void expireCommand(redisClient *c) {
|
|
expireGenericCommand(c,c->argv[1],strtol(c->argv[2]->ptr,NULL,10));
|
|
}
|
|
|
|
static void expireatCommand(redisClient *c) {
|
|
expireGenericCommand(c,c->argv[1],strtol(c->argv[2]->ptr,NULL,10)-time(NULL));
|
|
}
|
|
|
|
static void ttlCommand(redisClient *c) {
|
|
time_t expire;
|
|
int ttl = -1;
|
|
|
|
expire = getExpire(c->db,c->argv[1]);
|
|
if (expire != -1) {
|
|
ttl = (int) (expire-time(NULL));
|
|
if (ttl < 0) ttl = -1;
|
|
}
|
|
addReplySds(c,sdscatprintf(sdsempty(),":%d\r\n",ttl));
|
|
}
|
|
|
|
/* =============================== Replication ============================= */
|
|
|
|
static int syncWrite(int fd, char *ptr, ssize_t size, int timeout) {
|
|
ssize_t nwritten, ret = size;
|
|
time_t start = time(NULL);
|
|
|
|
timeout++;
|
|
while(size) {
|
|
if (aeWait(fd,AE_WRITABLE,1000) & AE_WRITABLE) {
|
|
nwritten = write(fd,ptr,size);
|
|
if (nwritten == -1) return -1;
|
|
ptr += nwritten;
|
|
size -= nwritten;
|
|
}
|
|
if ((time(NULL)-start) > timeout) {
|
|
errno = ETIMEDOUT;
|
|
return -1;
|
|
}
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
static int syncRead(int fd, char *ptr, ssize_t size, int timeout) {
|
|
ssize_t nread, totread = 0;
|
|
time_t start = time(NULL);
|
|
|
|
timeout++;
|
|
while(size) {
|
|
if (aeWait(fd,AE_READABLE,1000) & AE_READABLE) {
|
|
nread = read(fd,ptr,size);
|
|
if (nread == -1) return -1;
|
|
ptr += nread;
|
|
size -= nread;
|
|
totread += nread;
|
|
}
|
|
if ((time(NULL)-start) > timeout) {
|
|
errno = ETIMEDOUT;
|
|
return -1;
|
|
}
|
|
}
|
|
return totread;
|
|
}
|
|
|
|
static int syncReadLine(int fd, char *ptr, ssize_t size, int timeout) {
|
|
ssize_t nread = 0;
|
|
|
|
size--;
|
|
while(size) {
|
|
char c;
|
|
|
|
if (syncRead(fd,&c,1,timeout) == -1) return -1;
|
|
if (c == '\n') {
|
|
*ptr = '\0';
|
|
if (nread && *(ptr-1) == '\r') *(ptr-1) = '\0';
|
|
return nread;
|
|
} else {
|
|
*ptr++ = c;
|
|
*ptr = '\0';
|
|
nread++;
|
|
}
|
|
}
|
|
return nread;
|
|
}
|
|
|
|
static void syncCommand(redisClient *c) {
|
|
/* ignore SYNC if aleady slave or in monitor mode */
|
|
if (c->flags & REDIS_SLAVE) return;
|
|
|
|
/* SYNC can't be issued when the server has pending data to send to
|
|
* the client about already issued commands. We need a fresh reply
|
|
* buffer registering the differences between the BGSAVE and the current
|
|
* dataset, so that we can copy to other slaves if needed. */
|
|
if (listLength(c->reply) != 0) {
|
|
addReplySds(c,sdsnew("-ERR SYNC is invalid with pending input\r\n"));
|
|
return;
|
|
}
|
|
|
|
redisLog(REDIS_NOTICE,"Slave ask for synchronization");
|
|
/* Here we need to check if there is a background saving operation
|
|
* in progress, or if it is required to start one */
|
|
if (server.bgsavechildpid != -1) {
|
|
/* Ok a background save is in progress. Let's check if it is a good
|
|
* one for replication, i.e. if there is another slave that is
|
|
* registering differences since the server forked to save */
|
|
redisClient *slave;
|
|
listNode *ln;
|
|
|
|
listRewind(server.slaves);
|
|
while((ln = listYield(server.slaves))) {
|
|
slave = ln->value;
|
|
if (slave->replstate == REDIS_REPL_WAIT_BGSAVE_END) break;
|
|
}
|
|
if (ln) {
|
|
/* Perfect, the server is already registering differences for
|
|
* another slave. Set the right state, and copy the buffer. */
|
|
listRelease(c->reply);
|
|
c->reply = listDup(slave->reply);
|
|
c->replstate = REDIS_REPL_WAIT_BGSAVE_END;
|
|
redisLog(REDIS_NOTICE,"Waiting for end of BGSAVE for SYNC");
|
|
} else {
|
|
/* No way, we need to wait for the next BGSAVE in order to
|
|
* register differences */
|
|
c->replstate = REDIS_REPL_WAIT_BGSAVE_START;
|
|
redisLog(REDIS_NOTICE,"Waiting for next BGSAVE for SYNC");
|
|
}
|
|
} else {
|
|
/* Ok we don't have a BGSAVE in progress, let's start one */
|
|
redisLog(REDIS_NOTICE,"Starting BGSAVE for SYNC");
|
|
if (rdbSaveBackground(server.dbfilename) != REDIS_OK) {
|
|
redisLog(REDIS_NOTICE,"Replication failed, can't BGSAVE");
|
|
addReplySds(c,sdsnew("-ERR Unalbe to perform background save\r\n"));
|
|
return;
|
|
}
|
|
c->replstate = REDIS_REPL_WAIT_BGSAVE_END;
|
|
}
|
|
c->repldbfd = -1;
|
|
c->flags |= REDIS_SLAVE;
|
|
c->slaveseldb = 0;
|
|
listAddNodeTail(server.slaves,c);
|
|
return;
|
|
}
|
|
|
|
static void sendBulkToSlave(aeEventLoop *el, int fd, void *privdata, int mask) {
|
|
redisClient *slave = privdata;
|
|
REDIS_NOTUSED(el);
|
|
REDIS_NOTUSED(mask);
|
|
char buf[REDIS_IOBUF_LEN];
|
|
ssize_t nwritten, buflen;
|
|
|
|
if (slave->repldboff == 0) {
|
|
/* Write the bulk write count before to transfer the DB. In theory here
|
|
* we don't know how much room there is in the output buffer of the
|
|
* socket, but in pratice SO_SNDLOWAT (the minimum count for output
|
|
* operations) will never be smaller than the few bytes we need. */
|
|
sds bulkcount;
|
|
|
|
bulkcount = sdscatprintf(sdsempty(),"$%lld\r\n",(unsigned long long)
|
|
slave->repldbsize);
|
|
if (write(fd,bulkcount,sdslen(bulkcount)) != (signed)sdslen(bulkcount))
|
|
{
|
|
sdsfree(bulkcount);
|
|
freeClient(slave);
|
|
return;
|
|
}
|
|
sdsfree(bulkcount);
|
|
}
|
|
lseek(slave->repldbfd,slave->repldboff,SEEK_SET);
|
|
buflen = read(slave->repldbfd,buf,REDIS_IOBUF_LEN);
|
|
if (buflen <= 0) {
|
|
redisLog(REDIS_WARNING,"Read error sending DB to slave: %s",
|
|
(buflen == 0) ? "premature EOF" : strerror(errno));
|
|
freeClient(slave);
|
|
return;
|
|
}
|
|
if ((nwritten = write(fd,buf,buflen)) == -1) {
|
|
redisLog(REDIS_DEBUG,"Write error sending DB to slave: %s",
|
|
strerror(errno));
|
|
freeClient(slave);
|
|
return;
|
|
}
|
|
slave->repldboff += nwritten;
|
|
if (slave->repldboff == slave->repldbsize) {
|
|
close(slave->repldbfd);
|
|
slave->repldbfd = -1;
|
|
aeDeleteFileEvent(server.el,slave->fd,AE_WRITABLE);
|
|
slave->replstate = REDIS_REPL_ONLINE;
|
|
if (aeCreateFileEvent(server.el, slave->fd, AE_WRITABLE,
|
|
sendReplyToClient, slave) == AE_ERR) {
|
|
freeClient(slave);
|
|
return;
|
|
}
|
|
addReplySds(slave,sdsempty());
|
|
redisLog(REDIS_NOTICE,"Synchronization with slave succeeded");
|
|
}
|
|
}
|
|
|
|
/* This function is called at the end of every backgrond saving.
|
|
* The argument bgsaveerr is REDIS_OK if the background saving succeeded
|
|
* otherwise REDIS_ERR is passed to the function.
|
|
*
|
|
* The goal of this function is to handle slaves waiting for a successful
|
|
* background saving in order to perform non-blocking synchronization. */
|
|
static void updateSlavesWaitingBgsave(int bgsaveerr) {
|
|
listNode *ln;
|
|
int startbgsave = 0;
|
|
|
|
listRewind(server.slaves);
|
|
while((ln = listYield(server.slaves))) {
|
|
redisClient *slave = ln->value;
|
|
|
|
if (slave->replstate == REDIS_REPL_WAIT_BGSAVE_START) {
|
|
startbgsave = 1;
|
|
slave->replstate = REDIS_REPL_WAIT_BGSAVE_END;
|
|
} else if (slave->replstate == REDIS_REPL_WAIT_BGSAVE_END) {
|
|
struct redis_stat buf;
|
|
|
|
if (bgsaveerr != REDIS_OK) {
|
|
freeClient(slave);
|
|
redisLog(REDIS_WARNING,"SYNC failed. BGSAVE child returned an error");
|
|
continue;
|
|
}
|
|
if ((slave->repldbfd = open(server.dbfilename,O_RDONLY)) == -1 ||
|
|
redis_fstat(slave->repldbfd,&buf) == -1) {
|
|
freeClient(slave);
|
|
redisLog(REDIS_WARNING,"SYNC failed. Can't open/stat DB after BGSAVE: %s", strerror(errno));
|
|
continue;
|
|
}
|
|
slave->repldboff = 0;
|
|
slave->repldbsize = buf.st_size;
|
|
slave->replstate = REDIS_REPL_SEND_BULK;
|
|
aeDeleteFileEvent(server.el,slave->fd,AE_WRITABLE);
|
|
if (aeCreateFileEvent(server.el, slave->fd, AE_WRITABLE, sendBulkToSlave, slave) == AE_ERR) {
|
|
freeClient(slave);
|
|
continue;
|
|
}
|
|
}
|
|
}
|
|
if (startbgsave) {
|
|
if (rdbSaveBackground(server.dbfilename) != REDIS_OK) {
|
|
listRewind(server.slaves);
|
|
redisLog(REDIS_WARNING,"SYNC failed. BGSAVE failed");
|
|
while((ln = listYield(server.slaves))) {
|
|
redisClient *slave = ln->value;
|
|
|
|
if (slave->replstate == REDIS_REPL_WAIT_BGSAVE_START)
|
|
freeClient(slave);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static int syncWithMaster(void) {
|
|
char buf[1024], tmpfile[256], authcmd[1024];
|
|
int dumpsize;
|
|
int fd = anetTcpConnect(NULL,server.masterhost,server.masterport);
|
|
int dfd;
|
|
|
|
if (fd == -1) {
|
|
redisLog(REDIS_WARNING,"Unable to connect to MASTER: %s",
|
|
strerror(errno));
|
|
return REDIS_ERR;
|
|
}
|
|
|
|
/* AUTH with the master if required. */
|
|
if(server.masterauth) {
|
|
snprintf(authcmd, 1024, "AUTH %s\r\n", server.masterauth);
|
|
if (syncWrite(fd, authcmd, strlen(server.masterauth)+7, 5) == -1) {
|
|
close(fd);
|
|
redisLog(REDIS_WARNING,"Unable to AUTH to MASTER: %s",
|
|
strerror(errno));
|
|
return REDIS_ERR;
|
|
}
|
|
/* Read the AUTH result. */
|
|
if (syncReadLine(fd,buf,1024,3600) == -1) {
|
|
close(fd);
|
|
redisLog(REDIS_WARNING,"I/O error reading auth result from MASTER: %s",
|
|
strerror(errno));
|
|
return REDIS_ERR;
|
|
}
|
|
if (buf[0] != '+') {
|
|
close(fd);
|
|
redisLog(REDIS_WARNING,"Cannot AUTH to MASTER, is the masterauth password correct?");
|
|
return REDIS_ERR;
|
|
}
|
|
}
|
|
|
|
/* Issue the SYNC command */
|
|
if (syncWrite(fd,"SYNC \r\n",7,5) == -1) {
|
|
close(fd);
|
|
redisLog(REDIS_WARNING,"I/O error writing to MASTER: %s",
|
|
strerror(errno));
|
|
return REDIS_ERR;
|
|
}
|
|
/* Read the bulk write count */
|
|
if (syncReadLine(fd,buf,1024,3600) == -1) {
|
|
close(fd);
|
|
redisLog(REDIS_WARNING,"I/O error reading bulk count from MASTER: %s",
|
|
strerror(errno));
|
|
return REDIS_ERR;
|
|
}
|
|
if (buf[0] != '$') {
|
|
close(fd);
|
|
redisLog(REDIS_WARNING,"Bad protocol from MASTER, the first byte is not '$', are you sure the host and port are right?");
|
|
return REDIS_ERR;
|
|
}
|
|
dumpsize = atoi(buf+1);
|
|
redisLog(REDIS_NOTICE,"Receiving %d bytes data dump from MASTER",dumpsize);
|
|
/* Read the bulk write data on a temp file */
|
|
snprintf(tmpfile,256,"temp-%d.%ld.rdb",(int)time(NULL),(long int)random());
|
|
dfd = open(tmpfile,O_CREAT|O_WRONLY,0644);
|
|
if (dfd == -1) {
|
|
close(fd);
|
|
redisLog(REDIS_WARNING,"Opening the temp file needed for MASTER <-> SLAVE synchronization: %s",strerror(errno));
|
|
return REDIS_ERR;
|
|
}
|
|
while(dumpsize) {
|
|
int nread, nwritten;
|
|
|
|
nread = read(fd,buf,(dumpsize < 1024)?dumpsize:1024);
|
|
if (nread == -1) {
|
|
redisLog(REDIS_WARNING,"I/O error trying to sync with MASTER: %s",
|
|
strerror(errno));
|
|
close(fd);
|
|
close(dfd);
|
|
return REDIS_ERR;
|
|
}
|
|
nwritten = write(dfd,buf,nread);
|
|
if (nwritten == -1) {
|
|
redisLog(REDIS_WARNING,"Write error writing to the DB dump file needed for MASTER <-> SLAVE synchrnonization: %s", strerror(errno));
|
|
close(fd);
|
|
close(dfd);
|
|
return REDIS_ERR;
|
|
}
|
|
dumpsize -= nread;
|
|
}
|
|
close(dfd);
|
|
if (rename(tmpfile,server.dbfilename) == -1) {
|
|
redisLog(REDIS_WARNING,"Failed trying to rename the temp DB into dump.rdb in MASTER <-> SLAVE synchronization: %s", strerror(errno));
|
|
unlink(tmpfile);
|
|
close(fd);
|
|
return REDIS_ERR;
|
|
}
|
|
emptyDb();
|
|
if (rdbLoad(server.dbfilename) != REDIS_OK) {
|
|
redisLog(REDIS_WARNING,"Failed trying to load the MASTER synchronization DB from disk");
|
|
close(fd);
|
|
return REDIS_ERR;
|
|
}
|
|
server.master = createClient(fd);
|
|
server.master->flags |= REDIS_MASTER;
|
|
server.master->authenticated = 1;
|
|
server.replstate = REDIS_REPL_CONNECTED;
|
|
return REDIS_OK;
|
|
}
|
|
|
|
static void slaveofCommand(redisClient *c) {
|
|
if (!strcasecmp(c->argv[1]->ptr,"no") &&
|
|
!strcasecmp(c->argv[2]->ptr,"one")) {
|
|
if (server.masterhost) {
|
|
sdsfree(server.masterhost);
|
|
server.masterhost = NULL;
|
|
if (server.master) freeClient(server.master);
|
|
server.replstate = REDIS_REPL_NONE;
|
|
redisLog(REDIS_NOTICE,"MASTER MODE enabled (user request)");
|
|
}
|
|
} else {
|
|
sdsfree(server.masterhost);
|
|
server.masterhost = sdsdup(c->argv[1]->ptr);
|
|
server.masterport = atoi(c->argv[2]->ptr);
|
|
if (server.master) freeClient(server.master);
|
|
server.replstate = REDIS_REPL_CONNECT;
|
|
redisLog(REDIS_NOTICE,"SLAVE OF %s:%d enabled (user request)",
|
|
server.masterhost, server.masterport);
|
|
}
|
|
addReply(c,shared.ok);
|
|
}
|
|
|
|
/* ============================ Maxmemory directive ======================== */
|
|
|
|
/* This function gets called when 'maxmemory' is set on the config file to limit
|
|
* the max memory used by the server, and we are out of memory.
|
|
* This function will try to, in order:
|
|
*
|
|
* - Free objects from the free list
|
|
* - Try to remove keys with an EXPIRE set
|
|
*
|
|
* It is not possible to free enough memory to reach used-memory < maxmemory
|
|
* the server will start refusing commands that will enlarge even more the
|
|
* memory usage.
|
|
*/
|
|
static void freeMemoryIfNeeded(void) {
|
|
while (server.maxmemory && zmalloc_used_memory() > server.maxmemory) {
|
|
if (listLength(server.objfreelist)) {
|
|
robj *o;
|
|
|
|
listNode *head = listFirst(server.objfreelist);
|
|
o = listNodeValue(head);
|
|
listDelNode(server.objfreelist,head);
|
|
zfree(o);
|
|
} else {
|
|
int j, k, freed = 0;
|
|
|
|
for (j = 0; j < server.dbnum; j++) {
|
|
int minttl = -1;
|
|
robj *minkey = NULL;
|
|
struct dictEntry *de;
|
|
|
|
if (dictSize(server.db[j].expires)) {
|
|
freed = 1;
|
|
/* From a sample of three keys drop the one nearest to
|
|
* the natural expire */
|
|
for (k = 0; k < 3; k++) {
|
|
time_t t;
|
|
|
|
de = dictGetRandomKey(server.db[j].expires);
|
|
t = (time_t) dictGetEntryVal(de);
|
|
if (minttl == -1 || t < minttl) {
|
|
minkey = dictGetEntryKey(de);
|
|
minttl = t;
|
|
}
|
|
}
|
|
deleteKey(server.db+j,minkey);
|
|
}
|
|
}
|
|
if (!freed) return; /* nothing to free... */
|
|
}
|
|
}
|
|
}
|
|
|
|
/* ============================== Append Only file ========================== */
|
|
|
|
static void feedAppendOnlyFile(struct redisCommand *cmd, int dictid, robj **argv, int argc) {
|
|
sds buf = sdsempty();
|
|
int j;
|
|
ssize_t nwritten;
|
|
time_t now;
|
|
robj *tmpargv[3];
|
|
|
|
/* The DB this command was targetting is not the same as the last command
|
|
* we appendend. To issue a SELECT command is needed. */
|
|
if (dictid != server.appendseldb) {
|
|
char seldb[64];
|
|
|
|
snprintf(seldb,sizeof(seldb),"%d",dictid);
|
|
buf = sdscatprintf(buf,"*2\r\n$6\r\nSELECT\r\n$%lu\r\n%s\r\n",
|
|
(unsigned long)strlen(seldb),seldb);
|
|
server.appendseldb = dictid;
|
|
}
|
|
|
|
/* "Fix" the argv vector if the command is EXPIRE. We want to translate
|
|
* EXPIREs into EXPIREATs calls */
|
|
if (cmd->proc == expireCommand) {
|
|
long when;
|
|
|
|
tmpargv[0] = createStringObject("EXPIREAT",8);
|
|
tmpargv[1] = argv[1];
|
|
incrRefCount(argv[1]);
|
|
when = time(NULL)+strtol(argv[2]->ptr,NULL,10);
|
|
tmpargv[2] = createObject(REDIS_STRING,
|
|
sdscatprintf(sdsempty(),"%ld",when));
|
|
argv = tmpargv;
|
|
}
|
|
|
|
/* Append the actual command */
|
|
buf = sdscatprintf(buf,"*%d\r\n",argc);
|
|
for (j = 0; j < argc; j++) {
|
|
robj *o = argv[j];
|
|
|
|
o = getDecodedObject(o);
|
|
buf = sdscatprintf(buf,"$%lu\r\n",(unsigned long)sdslen(o->ptr));
|
|
buf = sdscatlen(buf,o->ptr,sdslen(o->ptr));
|
|
buf = sdscatlen(buf,"\r\n",2);
|
|
decrRefCount(o);
|
|
}
|
|
|
|
/* Free the objects from the modified argv for EXPIREAT */
|
|
if (cmd->proc == expireCommand) {
|
|
for (j = 0; j < 3; j++)
|
|
decrRefCount(argv[j]);
|
|
}
|
|
|
|
/* We want to perform a single write. This should be guaranteed atomic
|
|
* at least if the filesystem we are writing is a real physical one.
|
|
* While this will save us against the server being killed I don't think
|
|
* there is much to do about the whole server stopping for power problems
|
|
* or alike */
|
|
nwritten = write(server.appendfd,buf,sdslen(buf));
|
|
if (nwritten != (signed)sdslen(buf)) {
|
|
/* Ooops, we are in troubles. The best thing to do for now is
|
|
* to simply exit instead to give the illusion that everything is
|
|
* working as expected. */
|
|
if (nwritten == -1) {
|
|
redisLog(REDIS_WARNING,"Exiting on error writing to the append-only file: %s",strerror(errno));
|
|
} else {
|
|
redisLog(REDIS_WARNING,"Exiting on short write while writing to the append-only file: %s",strerror(errno));
|
|
}
|
|
exit(1);
|
|
}
|
|
/* If a background append only file rewriting is in progress we want to
|
|
* accumulate the differences between the child DB and the current one
|
|
* in a buffer, so that when the child process will do its work we
|
|
* can append the differences to the new append only file. */
|
|
if (server.bgrewritechildpid != -1)
|
|
server.bgrewritebuf = sdscatlen(server.bgrewritebuf,buf,sdslen(buf));
|
|
|
|
sdsfree(buf);
|
|
now = time(NULL);
|
|
if (server.appendfsync == APPENDFSYNC_ALWAYS ||
|
|
(server.appendfsync == APPENDFSYNC_EVERYSEC &&
|
|
now-server.lastfsync > 1))
|
|
{
|
|
fsync(server.appendfd); /* Let's try to get this data on the disk */
|
|
server.lastfsync = now;
|
|
}
|
|
}
|
|
|
|
/* In Redis commands are always executed in the context of a client, so in
|
|
* order to load the append only file we need to create a fake client. */
|
|
static struct redisClient *createFakeClient(void) {
|
|
struct redisClient *c = zmalloc(sizeof(*c));
|
|
|
|
selectDb(c,0);
|
|
c->fd = -1;
|
|
c->querybuf = sdsempty();
|
|
c->argc = 0;
|
|
c->argv = NULL;
|
|
c->flags = 0;
|
|
/* We set the fake client as a slave waiting for the synchronization
|
|
* so that Redis will not try to send replies to this client. */
|
|
c->replstate = REDIS_REPL_WAIT_BGSAVE_START;
|
|
c->reply = listCreate();
|
|
listSetFreeMethod(c->reply,decrRefCount);
|
|
listSetDupMethod(c->reply,dupClientReplyValue);
|
|
return c;
|
|
}
|
|
|
|
static void freeFakeClient(struct redisClient *c) {
|
|
sdsfree(c->querybuf);
|
|
listRelease(c->reply);
|
|
zfree(c);
|
|
}
|
|
|
|
/* Replay the append log file. On error REDIS_OK is returned. On non fatal
|
|
* error (the append only file is zero-length) REDIS_ERR is returned. On
|
|
* fatal error an error message is logged and the program exists. */
|
|
int loadAppendOnlyFile(char *filename) {
|
|
struct redisClient *fakeClient;
|
|
FILE *fp = fopen(filename,"r");
|
|
struct redis_stat sb;
|
|
|
|
if (redis_fstat(fileno(fp),&sb) != -1 && sb.st_size == 0)
|
|
return REDIS_ERR;
|
|
|
|
if (fp == NULL) {
|
|
redisLog(REDIS_WARNING,"Fatal error: can't open the append log file for reading: %s",strerror(errno));
|
|
exit(1);
|
|
}
|
|
|
|
fakeClient = createFakeClient();
|
|
while(1) {
|
|
int argc, j;
|
|
unsigned long len;
|
|
robj **argv;
|
|
char buf[128];
|
|
sds argsds;
|
|
struct redisCommand *cmd;
|
|
|
|
if (fgets(buf,sizeof(buf),fp) == NULL) {
|
|
if (feof(fp))
|
|
break;
|
|
else
|
|
goto readerr;
|
|
}
|
|
if (buf[0] != '*') goto fmterr;
|
|
argc = atoi(buf+1);
|
|
argv = zmalloc(sizeof(robj*)*argc);
|
|
for (j = 0; j < argc; j++) {
|
|
if (fgets(buf,sizeof(buf),fp) == NULL) goto readerr;
|
|
if (buf[0] != '$') goto fmterr;
|
|
len = strtol(buf+1,NULL,10);
|
|
argsds = sdsnewlen(NULL,len);
|
|
if (len && fread(argsds,len,1,fp) == 0) goto fmterr;
|
|
argv[j] = createObject(REDIS_STRING,argsds);
|
|
if (fread(buf,2,1,fp) == 0) goto fmterr; /* discard CRLF */
|
|
}
|
|
|
|
/* Command lookup */
|
|
cmd = lookupCommand(argv[0]->ptr);
|
|
if (!cmd) {
|
|
redisLog(REDIS_WARNING,"Unknown command '%s' reading the append only file", argv[0]->ptr);
|
|
exit(1);
|
|
}
|
|
/* Try object sharing and encoding */
|
|
if (server.shareobjects) {
|
|
int j;
|
|
for(j = 1; j < argc; j++)
|
|
argv[j] = tryObjectSharing(argv[j]);
|
|
}
|
|
if (cmd->flags & REDIS_CMD_BULK)
|
|
tryObjectEncoding(argv[argc-1]);
|
|
/* Run the command in the context of a fake client */
|
|
fakeClient->argc = argc;
|
|
fakeClient->argv = argv;
|
|
cmd->proc(fakeClient);
|
|
/* Discard the reply objects list from the fake client */
|
|
while(listLength(fakeClient->reply))
|
|
listDelNode(fakeClient->reply,listFirst(fakeClient->reply));
|
|
/* Clean up, ready for the next command */
|
|
for (j = 0; j < argc; j++) decrRefCount(argv[j]);
|
|
zfree(argv);
|
|
}
|
|
fclose(fp);
|
|
freeFakeClient(fakeClient);
|
|
return REDIS_OK;
|
|
|
|
readerr:
|
|
if (feof(fp)) {
|
|
redisLog(REDIS_WARNING,"Unexpected end of file reading the append only file");
|
|
} else {
|
|
redisLog(REDIS_WARNING,"Unrecoverable error reading the append only file: %s", strerror(errno));
|
|
}
|
|
exit(1);
|
|
fmterr:
|
|
redisLog(REDIS_WARNING,"Bad file format reading the append only file");
|
|
exit(1);
|
|
}
|
|
|
|
/* Write an object into a file in the bulk format $<count>\r\n<payload>\r\n */
|
|
static int fwriteBulk(FILE *fp, robj *obj) {
|
|
char buf[128];
|
|
obj = getDecodedObject(obj);
|
|
snprintf(buf,sizeof(buf),"$%ld\r\n",(long)sdslen(obj->ptr));
|
|
if (fwrite(buf,strlen(buf),1,fp) == 0) goto err;
|
|
if (sdslen(obj->ptr) && fwrite(obj->ptr,sdslen(obj->ptr),1,fp) == 0)
|
|
goto err;
|
|
if (fwrite("\r\n",2,1,fp) == 0) goto err;
|
|
decrRefCount(obj);
|
|
return 1;
|
|
err:
|
|
decrRefCount(obj);
|
|
return 0;
|
|
}
|
|
|
|
/* Write a double value in bulk format $<count>\r\n<payload>\r\n */
|
|
static int fwriteBulkDouble(FILE *fp, double d) {
|
|
char buf[128], dbuf[128];
|
|
|
|
snprintf(dbuf,sizeof(dbuf),"%.17g\r\n",d);
|
|
snprintf(buf,sizeof(buf),"$%lu\r\n",(unsigned long)strlen(dbuf)-2);
|
|
if (fwrite(buf,strlen(buf),1,fp) == 0) return 0;
|
|
if (fwrite(dbuf,strlen(dbuf),1,fp) == 0) return 0;
|
|
return 1;
|
|
}
|
|
|
|
/* Write a long value in bulk format $<count>\r\n<payload>\r\n */
|
|
static int fwriteBulkLong(FILE *fp, long l) {
|
|
char buf[128], lbuf[128];
|
|
|
|
snprintf(lbuf,sizeof(lbuf),"%ld\r\n",l);
|
|
snprintf(buf,sizeof(buf),"$%lu\r\n",(unsigned long)strlen(lbuf)-2);
|
|
if (fwrite(buf,strlen(buf),1,fp) == 0) return 0;
|
|
if (fwrite(lbuf,strlen(lbuf),1,fp) == 0) return 0;
|
|
return 1;
|
|
}
|
|
|
|
/* Write a sequence of commands able to fully rebuild the dataset into
|
|
* "filename". Used both by REWRITEAOF and BGREWRITEAOF. */
|
|
static int rewriteAppendOnlyFile(char *filename) {
|
|
dictIterator *di = NULL;
|
|
dictEntry *de;
|
|
FILE *fp;
|
|
char tmpfile[256];
|
|
int j;
|
|
time_t now = time(NULL);
|
|
|
|
/* Note that we have to use a different temp name here compared to the
|
|
* one used by rewriteAppendOnlyFileBackground() function. */
|
|
snprintf(tmpfile,256,"temp-rewriteaof-%d.aof", (int) getpid());
|
|
fp = fopen(tmpfile,"w");
|
|
if (!fp) {
|
|
redisLog(REDIS_WARNING, "Failed rewriting the append only file: %s", strerror(errno));
|
|
return REDIS_ERR;
|
|
}
|
|
for (j = 0; j < server.dbnum; j++) {
|
|
char selectcmd[] = "*2\r\n$6\r\nSELECT\r\n";
|
|
redisDb *db = server.db+j;
|
|
dict *d = db->dict;
|
|
if (dictSize(d) == 0) continue;
|
|
di = dictGetIterator(d);
|
|
if (!di) {
|
|
fclose(fp);
|
|
return REDIS_ERR;
|
|
}
|
|
|
|
/* SELECT the new DB */
|
|
if (fwrite(selectcmd,sizeof(selectcmd)-1,1,fp) == 0) goto werr;
|
|
if (fwriteBulkLong(fp,j) == 0) goto werr;
|
|
|
|
/* Iterate this DB writing every entry */
|
|
while((de = dictNext(di)) != NULL) {
|
|
robj *key = dictGetEntryKey(de);
|
|
robj *o = dictGetEntryVal(de);
|
|
time_t expiretime = getExpire(db,key);
|
|
|
|
/* Save the key and associated value */
|
|
if (o->type == REDIS_STRING) {
|
|
/* Emit a SET command */
|
|
char cmd[]="*3\r\n$3\r\nSET\r\n";
|
|
if (fwrite(cmd,sizeof(cmd)-1,1,fp) == 0) goto werr;
|
|
/* Key and value */
|
|
if (fwriteBulk(fp,key) == 0) goto werr;
|
|
if (fwriteBulk(fp,o) == 0) goto werr;
|
|
} else if (o->type == REDIS_LIST) {
|
|
/* Emit the RPUSHes needed to rebuild the list */
|
|
list *list = o->ptr;
|
|
listNode *ln;
|
|
|
|
listRewind(list);
|
|
while((ln = listYield(list))) {
|
|
char cmd[]="*3\r\n$5\r\nRPUSH\r\n";
|
|
robj *eleobj = listNodeValue(ln);
|
|
|
|
if (fwrite(cmd,sizeof(cmd)-1,1,fp) == 0) goto werr;
|
|
if (fwriteBulk(fp,key) == 0) goto werr;
|
|
if (fwriteBulk(fp,eleobj) == 0) goto werr;
|
|
}
|
|
} else if (o->type == REDIS_SET) {
|
|
/* Emit the SADDs needed to rebuild the set */
|
|
dict *set = o->ptr;
|
|
dictIterator *di = dictGetIterator(set);
|
|
dictEntry *de;
|
|
|
|
while((de = dictNext(di)) != NULL) {
|
|
char cmd[]="*3\r\n$4\r\nSADD\r\n";
|
|
robj *eleobj = dictGetEntryKey(de);
|
|
|
|
if (fwrite(cmd,sizeof(cmd)-1,1,fp) == 0) goto werr;
|
|
if (fwriteBulk(fp,key) == 0) goto werr;
|
|
if (fwriteBulk(fp,eleobj) == 0) goto werr;
|
|
}
|
|
dictReleaseIterator(di);
|
|
} else if (o->type == REDIS_ZSET) {
|
|
/* Emit the ZADDs needed to rebuild the sorted set */
|
|
zset *zs = o->ptr;
|
|
dictIterator *di = dictGetIterator(zs->dict);
|
|
dictEntry *de;
|
|
|
|
while((de = dictNext(di)) != NULL) {
|
|
char cmd[]="*4\r\n$4\r\nZADD\r\n";
|
|
robj *eleobj = dictGetEntryKey(de);
|
|
double *score = dictGetEntryVal(de);
|
|
|
|
if (fwrite(cmd,sizeof(cmd)-1,1,fp) == 0) goto werr;
|
|
if (fwriteBulk(fp,key) == 0) goto werr;
|
|
if (fwriteBulkDouble(fp,*score) == 0) goto werr;
|
|
if (fwriteBulk(fp,eleobj) == 0) goto werr;
|
|
}
|
|
dictReleaseIterator(di);
|
|
} else {
|
|
redisAssert(0 != 0);
|
|
}
|
|
/* Save the expire time */
|
|
if (expiretime != -1) {
|
|
char cmd[]="*3\r\n$8\r\nEXPIREAT\r\n";
|
|
/* If this key is already expired skip it */
|
|
if (expiretime < now) continue;
|
|
if (fwrite(cmd,sizeof(cmd)-1,1,fp) == 0) goto werr;
|
|
if (fwriteBulk(fp,key) == 0) goto werr;
|
|
if (fwriteBulkLong(fp,expiretime) == 0) goto werr;
|
|
}
|
|
}
|
|
dictReleaseIterator(di);
|
|
}
|
|
|
|
/* Make sure data will not remain on the OS's output buffers */
|
|
fflush(fp);
|
|
fsync(fileno(fp));
|
|
fclose(fp);
|
|
|
|
/* Use RENAME to make sure the DB file is changed atomically only
|
|
* if the generate DB file is ok. */
|
|
if (rename(tmpfile,filename) == -1) {
|
|
redisLog(REDIS_WARNING,"Error moving temp append only file on the final destination: %s", strerror(errno));
|
|
unlink(tmpfile);
|
|
return REDIS_ERR;
|
|
}
|
|
redisLog(REDIS_NOTICE,"SYNC append only file rewrite performed");
|
|
return REDIS_OK;
|
|
|
|
werr:
|
|
fclose(fp);
|
|
unlink(tmpfile);
|
|
redisLog(REDIS_WARNING,"Write error writing append only file on disk: %s", strerror(errno));
|
|
if (di) dictReleaseIterator(di);
|
|
return REDIS_ERR;
|
|
}
|
|
|
|
/* This is how rewriting of the append only file in background works:
|
|
*
|
|
* 1) The user calls BGREWRITEAOF
|
|
* 2) Redis calls this function, that forks():
|
|
* 2a) the child rewrite the append only file in a temp file.
|
|
* 2b) the parent accumulates differences in server.bgrewritebuf.
|
|
* 3) When the child finished '2a' exists.
|
|
* 4) The parent will trap the exit code, if it's OK, will append the
|
|
* data accumulated into server.bgrewritebuf into the temp file, and
|
|
* finally will rename(2) the temp file in the actual file name.
|
|
* The the new file is reopened as the new append only file. Profit!
|
|
*/
|
|
static int rewriteAppendOnlyFileBackground(void) {
|
|
pid_t childpid;
|
|
|
|
if (server.bgrewritechildpid != -1) return REDIS_ERR;
|
|
if ((childpid = fork()) == 0) {
|
|
/* Child */
|
|
char tmpfile[256];
|
|
close(server.fd);
|
|
|
|
snprintf(tmpfile,256,"temp-rewriteaof-bg-%d.aof", (int) getpid());
|
|
if (rewriteAppendOnlyFile(tmpfile) == REDIS_OK) {
|
|
exit(0);
|
|
} else {
|
|
exit(1);
|
|
}
|
|
} else {
|
|
/* Parent */
|
|
if (childpid == -1) {
|
|
redisLog(REDIS_WARNING,
|
|
"Can't rewrite append only file in background: fork: %s",
|
|
strerror(errno));
|
|
return REDIS_ERR;
|
|
}
|
|
redisLog(REDIS_NOTICE,
|
|
"Background append only file rewriting started by pid %d",childpid);
|
|
server.bgrewritechildpid = childpid;
|
|
/* We set appendseldb to -1 in order to force the next call to the
|
|
* feedAppendOnlyFile() to issue a SELECT command, so the differences
|
|
* accumulated by the parent into server.bgrewritebuf will start
|
|
* with a SELECT statement and it will be safe to merge. */
|
|
server.appendseldb = -1;
|
|
return REDIS_OK;
|
|
}
|
|
return REDIS_OK; /* unreached */
|
|
}
|
|
|
|
static void bgrewriteaofCommand(redisClient *c) {
|
|
if (server.bgrewritechildpid != -1) {
|
|
addReplySds(c,sdsnew("-ERR background append only file rewriting already in progress\r\n"));
|
|
return;
|
|
}
|
|
if (rewriteAppendOnlyFileBackground() == REDIS_OK) {
|
|
char *status = "+Background append only file rewriting started\r\n";
|
|
addReplySds(c,sdsnew(status));
|
|
} else {
|
|
addReply(c,shared.err);
|
|
}
|
|
}
|
|
|
|
static void aofRemoveTempFile(pid_t childpid) {
|
|
char tmpfile[256];
|
|
|
|
snprintf(tmpfile,256,"temp-rewriteaof-bg-%d.aof", (int) childpid);
|
|
unlink(tmpfile);
|
|
}
|
|
|
|
/* ================================= Debugging ============================== */
|
|
|
|
static void debugCommand(redisClient *c) {
|
|
if (!strcasecmp(c->argv[1]->ptr,"segfault")) {
|
|
*((char*)-1) = 'x';
|
|
} else if (!strcasecmp(c->argv[1]->ptr,"reload")) {
|
|
if (rdbSave(server.dbfilename) != REDIS_OK) {
|
|
addReply(c,shared.err);
|
|
return;
|
|
}
|
|
emptyDb();
|
|
if (rdbLoad(server.dbfilename) != REDIS_OK) {
|
|
addReply(c,shared.err);
|
|
return;
|
|
}
|
|
redisLog(REDIS_WARNING,"DB reloaded by DEBUG RELOAD");
|
|
addReply(c,shared.ok);
|
|
} else if (!strcasecmp(c->argv[1]->ptr,"loadaof")) {
|
|
emptyDb();
|
|
if (loadAppendOnlyFile(server.appendfilename) != REDIS_OK) {
|
|
addReply(c,shared.err);
|
|
return;
|
|
}
|
|
redisLog(REDIS_WARNING,"Append Only File loaded by DEBUG LOADAOF");
|
|
addReply(c,shared.ok);
|
|
} else if (!strcasecmp(c->argv[1]->ptr,"object") && c->argc == 3) {
|
|
dictEntry *de = dictFind(c->db->dict,c->argv[2]);
|
|
robj *key, *val;
|
|
|
|
if (!de) {
|
|
addReply(c,shared.nokeyerr);
|
|
return;
|
|
}
|
|
key = dictGetEntryKey(de);
|
|
val = dictGetEntryVal(de);
|
|
addReplySds(c,sdscatprintf(sdsempty(),
|
|
"+Key at:%p refcount:%d, value at:%p refcount:%d encoding:%d\r\n",
|
|
(void*)key, key->refcount, (void*)val, val->refcount,
|
|
val->encoding));
|
|
} else {
|
|
addReplySds(c,sdsnew(
|
|
"-ERR Syntax error, try DEBUG [SEGFAULT|OBJECT <key>|RELOAD]\r\n"));
|
|
}
|
|
}
|
|
|
|
static void _redisAssert(char *estr) {
|
|
redisLog(REDIS_WARNING,"=== ASSERTION FAILED ===");
|
|
redisLog(REDIS_WARNING,"==> %s\n",estr);
|
|
#ifdef HAVE_BACKTRACE
|
|
redisLog(REDIS_WARNING,"(forcing SIGSEGV in order to print the stack trace)");
|
|
*((char*)-1) = 'x';
|
|
#endif
|
|
}
|
|
|
|
/* =================================== Main! ================================ */
|
|
|
|
#ifdef __linux__
|
|
int linuxOvercommitMemoryValue(void) {
|
|
FILE *fp = fopen("/proc/sys/vm/overcommit_memory","r");
|
|
char buf[64];
|
|
|
|
if (!fp) return -1;
|
|
if (fgets(buf,64,fp) == NULL) {
|
|
fclose(fp);
|
|
return -1;
|
|
}
|
|
fclose(fp);
|
|
|
|
return atoi(buf);
|
|
}
|
|
|
|
void linuxOvercommitMemoryWarning(void) {
|
|
if (linuxOvercommitMemoryValue() == 0) {
|
|
redisLog(REDIS_WARNING,"WARNING overcommit_memory is set to 0! Background save may fail under low condition memory. To fix this issue add 'vm.overcommit_memory = 1' to /etc/sysctl.conf and then reboot or run the command 'sysctl vm.overcommit_memory=1' for this to take effect.");
|
|
}
|
|
}
|
|
#endif /* __linux__ */
|
|
|
|
static void daemonize(void) {
|
|
int fd;
|
|
FILE *fp;
|
|
|
|
if (fork() != 0) exit(0); /* parent exits */
|
|
printf("New pid: %d\n", getpid());
|
|
setsid(); /* create a new session */
|
|
|
|
/* Every output goes to /dev/null. If Redis is daemonized but
|
|
* the 'logfile' is set to 'stdout' in the configuration file
|
|
* it will not log at all. */
|
|
if ((fd = open("/dev/null", O_RDWR, 0)) != -1) {
|
|
dup2(fd, STDIN_FILENO);
|
|
dup2(fd, STDOUT_FILENO);
|
|
dup2(fd, STDERR_FILENO);
|
|
if (fd > STDERR_FILENO) close(fd);
|
|
}
|
|
/* Try to write the pid file */
|
|
fp = fopen(server.pidfile,"w");
|
|
if (fp) {
|
|
fprintf(fp,"%d\n",getpid());
|
|
fclose(fp);
|
|
}
|
|
}
|
|
|
|
int main(int argc, char **argv) {
|
|
initServerConfig();
|
|
if (argc == 2) {
|
|
resetServerSaveParams();
|
|
loadServerConfig(argv[1]);
|
|
} else if (argc > 2) {
|
|
fprintf(stderr,"Usage: ./redis-server [/path/to/redis.conf]\n");
|
|
exit(1);
|
|
} else {
|
|
redisLog(REDIS_WARNING,"Warning: no config file specified, using the default config. In order to specify a config file use 'redis-server /path/to/redis.conf'");
|
|
}
|
|
if (server.daemonize) daemonize();
|
|
initServer();
|
|
redisLog(REDIS_NOTICE,"Server started, Redis version " REDIS_VERSION);
|
|
#ifdef __linux__
|
|
linuxOvercommitMemoryWarning();
|
|
#endif
|
|
if (server.appendonly) {
|
|
if (loadAppendOnlyFile(server.appendfilename) == REDIS_OK)
|
|
redisLog(REDIS_NOTICE,"DB loaded from append only file");
|
|
} else {
|
|
if (rdbLoad(server.dbfilename) == REDIS_OK)
|
|
redisLog(REDIS_NOTICE,"DB loaded from disk");
|
|
}
|
|
if (aeCreateFileEvent(server.el, server.fd, AE_READABLE,
|
|
acceptHandler, NULL) == AE_ERR) oom("creating file event");
|
|
redisLog(REDIS_NOTICE,"The server is now ready to accept connections on port %d", server.port);
|
|
aeMain(server.el);
|
|
aeDeleteEventLoop(server.el);
|
|
return 0;
|
|
}
|
|
|
|
/* ============================= Backtrace support ========================= */
|
|
|
|
#ifdef HAVE_BACKTRACE
|
|
static char *findFuncName(void *pointer, unsigned long *offset);
|
|
|
|
static void *getMcontextEip(ucontext_t *uc) {
|
|
#if defined(__FreeBSD__)
|
|
return (void*) uc->uc_mcontext.mc_eip;
|
|
#elif defined(__dietlibc__)
|
|
return (void*) uc->uc_mcontext.eip;
|
|
#elif defined(__APPLE__) && !defined(MAC_OS_X_VERSION_10_6)
|
|
#if __x86_64__
|
|
return (void*) uc->uc_mcontext->__ss.__rip;
|
|
#else
|
|
return (void*) uc->uc_mcontext->__ss.__eip;
|
|
#endif
|
|
#elif defined(__APPLE__) && defined(MAC_OS_X_VERSION_10_6)
|
|
#if defined(_STRUCT_X86_THREAD_STATE64) && !defined(__i386__)
|
|
return (void*) uc->uc_mcontext->__ss.__rip;
|
|
#else
|
|
return (void*) uc->uc_mcontext->__ss.__eip;
|
|
#endif
|
|
#elif defined(__i386__) || defined(__X86_64__) /* Linux x86 */
|
|
return (void*) uc->uc_mcontext.gregs[REG_EIP];
|
|
#elif defined(__ia64__) /* Linux IA64 */
|
|
return (void*) uc->uc_mcontext.sc_ip;
|
|
#else
|
|
return NULL;
|
|
#endif
|
|
}
|
|
|
|
static void segvHandler(int sig, siginfo_t *info, void *secret) {
|
|
void *trace[100];
|
|
char **messages = NULL;
|
|
int i, trace_size = 0;
|
|
unsigned long offset=0;
|
|
ucontext_t *uc = (ucontext_t*) secret;
|
|
sds infostring;
|
|
REDIS_NOTUSED(info);
|
|
|
|
redisLog(REDIS_WARNING,
|
|
"======= Ooops! Redis %s got signal: -%d- =======", REDIS_VERSION, sig);
|
|
infostring = genRedisInfoString();
|
|
redisLog(REDIS_WARNING, "%s",infostring);
|
|
/* It's not safe to sdsfree() the returned string under memory
|
|
* corruption conditions. Let it leak as we are going to abort */
|
|
|
|
trace_size = backtrace(trace, 100);
|
|
/* overwrite sigaction with caller's address */
|
|
if (getMcontextEip(uc) != NULL) {
|
|
trace[1] = getMcontextEip(uc);
|
|
}
|
|
messages = backtrace_symbols(trace, trace_size);
|
|
|
|
for (i=1; i<trace_size; ++i) {
|
|
char *fn = findFuncName(trace[i], &offset), *p;
|
|
|
|
p = strchr(messages[i],'+');
|
|
if (!fn || (p && ((unsigned long)strtol(p+1,NULL,10)) < offset)) {
|
|
redisLog(REDIS_WARNING,"%s", messages[i]);
|
|
} else {
|
|
redisLog(REDIS_WARNING,"%d redis-server %p %s + %d", i, trace[i], fn, (unsigned int)offset);
|
|
}
|
|
}
|
|
// free(messages); Don't call free() with possibly corrupted memory.
|
|
exit(0);
|
|
}
|
|
|
|
static void setupSigSegvAction(void) {
|
|
struct sigaction act;
|
|
|
|
sigemptyset (&act.sa_mask);
|
|
/* When the SA_SIGINFO flag is set in sa_flags then sa_sigaction
|
|
* is used. Otherwise, sa_handler is used */
|
|
act.sa_flags = SA_NODEFER | SA_ONSTACK | SA_RESETHAND | SA_SIGINFO;
|
|
act.sa_sigaction = segvHandler;
|
|
sigaction (SIGSEGV, &act, NULL);
|
|
sigaction (SIGBUS, &act, NULL);
|
|
sigaction (SIGFPE, &act, NULL);
|
|
sigaction (SIGILL, &act, NULL);
|
|
sigaction (SIGBUS, &act, NULL);
|
|
return;
|
|
}
|
|
|
|
#include "staticsymbols.h"
|
|
/* This function try to convert a pointer into a function name. It's used in
|
|
* oreder to provide a backtrace under segmentation fault that's able to
|
|
* display functions declared as static (otherwise the backtrace is useless). */
|
|
static char *findFuncName(void *pointer, unsigned long *offset){
|
|
int i, ret = -1;
|
|
unsigned long off, minoff = 0;
|
|
|
|
/* Try to match against the Symbol with the smallest offset */
|
|
for (i=0; symsTable[i].pointer; i++) {
|
|
unsigned long lp = (unsigned long) pointer;
|
|
|
|
if (lp != (unsigned long)-1 && lp >= symsTable[i].pointer) {
|
|
off=lp-symsTable[i].pointer;
|
|
if (ret < 0 || off < minoff) {
|
|
minoff=off;
|
|
ret=i;
|
|
}
|
|
}
|
|
}
|
|
if (ret == -1) return NULL;
|
|
*offset = minoff;
|
|
return symsTable[ret].name;
|
|
}
|
|
#else /* HAVE_BACKTRACE */
|
|
static void setupSigSegvAction(void) {
|
|
}
|
|
#endif /* HAVE_BACKTRACE */
|
|
|
|
|
|
|
|
/* The End */
|
|
|
|
|
|
|