]>
git.saurik.com Git - redis.git/blob - src/db.c
5 void SlotToKeyAdd(robj
*key
);
6 void SlotToKeyDel(robj
*key
);
8 /*-----------------------------------------------------------------------------
10 *----------------------------------------------------------------------------*/
12 /* Important notes on lookup and disk store.
14 * When disk store is enabled on lookup we can have different cases.
16 * a) The key is in memory:
17 * - If the key is not in IO_SAVEINPROG state we can access it.
18 * As if it's just IO_SAVE this means we have the key in the IO queue
19 * but can't be accessed by the IO thread (it requires to be
20 * translated into an IO Job by the cache cron function.)
21 * - If the key is in IO_SAVEINPROG we can't touch the key and have
22 * to blocking wait completion of operations.
23 * b) The key is not in memory:
24 * - If it's marked as non existing on disk as well (negative cache)
25 * we don't need to perform the disk access.
26 * - if the key MAY EXIST, but is not in memory, and it is marked as IO_SAVE
27 * then the key can only be a deleted one. As IO_SAVE keys are never
28 * evicted (dirty state), so the only possibility is that key was deleted.
29 * - if the key MAY EXIST we need to blocking load it.
30 * We check that the key is not in IO_SAVEINPROG state before accessing
31 * the disk object. If it is in this state, we wait.
34 robj
*lookupKey(redisDb
*db
, robj
*key
) {
35 dictEntry
*de
= dictFind(db
->dict
,key
->ptr
);
37 robj
*val
= dictGetEntryVal(de
);
39 /* Update the access time for the aging algorithm.
40 * Don't do it if we have a saving child, as this will trigger
41 * a copy on write madness. */
42 if (server
.bgsavechildpid
== -1 && server
.bgrewritechildpid
== -1)
43 val
->lru
= server
.lruclock
;
44 server
.stat_keyspace_hits
++;
47 server
.stat_keyspace_misses
++;
52 robj
*lookupKeyRead(redisDb
*db
, robj
*key
) {
53 expireIfNeeded(db
,key
);
54 return lookupKey(db
,key
);
57 robj
*lookupKeyWrite(redisDb
*db
, robj
*key
) {
58 expireIfNeeded(db
,key
);
59 return lookupKey(db
,key
);
62 robj
*lookupKeyReadOrReply(redisClient
*c
, robj
*key
, robj
*reply
) {
63 robj
*o
= lookupKeyRead(c
->db
, key
);
64 if (!o
) addReply(c
,reply
);
68 robj
*lookupKeyWriteOrReply(redisClient
*c
, robj
*key
, robj
*reply
) {
69 robj
*o
= lookupKeyWrite(c
->db
, key
);
70 if (!o
) addReply(c
,reply
);
74 /* Add the key to the DB. It's up to the caller to increment the reference
75 * counte of the value if needed.
77 * The program is aborted if the key already exists. */
78 void dbAdd(redisDb
*db
, robj
*key
, robj
*val
) {
79 sds copy
= sdsdup(key
->ptr
);
80 int retval
= dictAdd(db
->dict
, copy
, val
);
82 redisAssertWithInfo(NULL
,key
,retval
== REDIS_OK
);
83 if (server
.cluster_enabled
) SlotToKeyAdd(key
);
86 /* Overwrite an existing key with a new value. Incrementing the reference
87 * count of the new value is up to the caller.
88 * This function does not modify the expire time of the existing key.
90 * The program is aborted if the key was not already present. */
91 void dbOverwrite(redisDb
*db
, robj
*key
, robj
*val
) {
92 struct dictEntry
*de
= dictFind(db
->dict
,key
->ptr
);
94 redisAssertWithInfo(NULL
,key
,de
!= NULL
);
95 dictReplace(db
->dict
, key
->ptr
, val
);
98 /* High level Set operation. This function can be used in order to set
99 * a key, whatever it was existing or not, to a new object.
101 * 1) The ref count of the value object is incremented.
102 * 2) clients WATCHing for the destination key notified.
103 * 3) The expire time of the key is reset (the key is made persistent). */
104 void setKey(redisDb
*db
, robj
*key
, robj
*val
) {
105 if (lookupKeyWrite(db
,key
) == NULL
) {
108 dbOverwrite(db
,key
,val
);
111 removeExpire(db
,key
);
112 touchWatchedKey(db
,key
);
115 int dbExists(redisDb
*db
, robj
*key
) {
116 return dictFind(db
->dict
,key
->ptr
) != NULL
;
119 /* Return a random key, in form of a Redis object.
120 * If there are no keys, NULL is returned.
122 * The function makes sure to return keys not already expired. */
123 robj
*dbRandomKey(redisDb
*db
) {
124 struct dictEntry
*de
;
130 de
= dictGetRandomKey(db
->dict
);
131 if (de
== NULL
) return NULL
;
133 key
= dictGetEntryKey(de
);
134 keyobj
= createStringObject(key
,sdslen(key
));
135 if (dictFind(db
->expires
,key
)) {
136 if (expireIfNeeded(db
,keyobj
)) {
137 decrRefCount(keyobj
);
138 continue; /* search for another key. This expired. */
145 /* Delete a key, value, and associated expiration entry if any, from the DB */
146 int dbDelete(redisDb
*db
, robj
*key
) {
147 /* Deleting an entry from the expires dict will not free the sds of
148 * the key, because it is shared with the main dictionary. */
149 if (dictSize(db
->expires
) > 0) dictDelete(db
->expires
,key
->ptr
);
150 if (dictDelete(db
->dict
,key
->ptr
) == DICT_OK
) {
151 if (server
.cluster_enabled
) SlotToKeyDel(key
);
158 /* Empty the whole database.
159 * If diskstore is enabled this function will just flush the in-memory cache. */
160 long long emptyDb() {
162 long long removed
= 0;
164 for (j
= 0; j
< server
.dbnum
; j
++) {
165 removed
+= dictSize(server
.db
[j
].dict
);
166 dictEmpty(server
.db
[j
].dict
);
167 dictEmpty(server
.db
[j
].expires
);
172 int selectDb(redisClient
*c
, int id
) {
173 if (id
< 0 || id
>= server
.dbnum
)
175 c
->db
= &server
.db
[id
];
179 /*-----------------------------------------------------------------------------
180 * Hooks for key space changes.
182 * Every time a key in the database is modified the function
183 * signalModifiedKey() is called.
185 * Every time a DB is flushed the function signalFlushDb() is called.
186 *----------------------------------------------------------------------------*/
188 void signalModifiedKey(redisDb
*db
, robj
*key
) {
189 touchWatchedKey(db
,key
);
192 void signalFlushedDb(int dbid
) {
193 touchWatchedKeysOnFlush(dbid
);
196 /*-----------------------------------------------------------------------------
197 * Type agnostic commands operating on the key space
198 *----------------------------------------------------------------------------*/
200 void flushdbCommand(redisClient
*c
) {
201 server
.dirty
+= dictSize(c
->db
->dict
);
202 signalFlushedDb(c
->db
->id
);
203 dictEmpty(c
->db
->dict
);
204 dictEmpty(c
->db
->expires
);
205 addReply(c
,shared
.ok
);
208 void flushallCommand(redisClient
*c
) {
210 server
.dirty
+= emptyDb();
211 addReply(c
,shared
.ok
);
212 if (server
.bgsavechildpid
!= -1) {
213 kill(server
.bgsavechildpid
,SIGKILL
);
214 rdbRemoveTempFile(server
.bgsavechildpid
);
216 if (server
.saveparamslen
> 0) {
217 /* Normally rdbSave() will reset dirty, but we don't want this here
218 * as otherwise FLUSHALL will not be replicated nor put into the AOF. */
219 int saved_dirty
= server
.dirty
;
220 rdbSave(server
.dbfilename
);
221 server
.dirty
= saved_dirty
;
226 void delCommand(redisClient
*c
) {
229 for (j
= 1; j
< c
->argc
; j
++) {
230 if (dbDelete(c
->db
,c
->argv
[j
])) {
231 signalModifiedKey(c
->db
,c
->argv
[j
]);
236 addReplyLongLong(c
,deleted
);
239 void existsCommand(redisClient
*c
) {
240 expireIfNeeded(c
->db
,c
->argv
[1]);
241 if (dbExists(c
->db
,c
->argv
[1])) {
242 addReply(c
, shared
.cone
);
244 addReply(c
, shared
.czero
);
248 void selectCommand(redisClient
*c
) {
249 int id
= atoi(c
->argv
[1]->ptr
);
251 if (server
.cluster_enabled
&& id
!= 0) {
252 addReplyError(c
,"SELECT is not allowed in cluster mode");
255 if (selectDb(c
,id
) == REDIS_ERR
) {
256 addReplyError(c
,"invalid DB index");
258 addReply(c
,shared
.ok
);
262 void randomkeyCommand(redisClient
*c
) {
265 if ((key
= dbRandomKey(c
->db
)) == NULL
) {
266 addReply(c
,shared
.nullbulk
);
274 void keysCommand(redisClient
*c
) {
277 sds pattern
= c
->argv
[1]->ptr
;
278 int plen
= sdslen(pattern
), allkeys
;
279 unsigned long numkeys
= 0;
280 void *replylen
= addDeferredMultiBulkLength(c
);
282 di
= dictGetIterator(c
->db
->dict
);
283 allkeys
= (pattern
[0] == '*' && pattern
[1] == '\0');
284 while((de
= dictNext(di
)) != NULL
) {
285 sds key
= dictGetEntryKey(de
);
288 if (allkeys
|| stringmatchlen(pattern
,plen
,key
,sdslen(key
),0)) {
289 keyobj
= createStringObject(key
,sdslen(key
));
290 if (expireIfNeeded(c
->db
,keyobj
) == 0) {
291 addReplyBulk(c
,keyobj
);
294 decrRefCount(keyobj
);
297 dictReleaseIterator(di
);
298 setDeferredMultiBulkLength(c
,replylen
,numkeys
);
301 void dbsizeCommand(redisClient
*c
) {
302 addReplyLongLong(c
,dictSize(c
->db
->dict
));
305 void lastsaveCommand(redisClient
*c
) {
306 addReplyLongLong(c
,server
.lastsave
);
309 void typeCommand(redisClient
*c
) {
313 o
= lookupKeyRead(c
->db
,c
->argv
[1]);
318 case REDIS_STRING
: type
= "string"; break;
319 case REDIS_LIST
: type
= "list"; break;
320 case REDIS_SET
: type
= "set"; break;
321 case REDIS_ZSET
: type
= "zset"; break;
322 case REDIS_HASH
: type
= "hash"; break;
323 default: type
= "unknown"; break;
326 addReplyStatus(c
,type
);
329 void shutdownCommand(redisClient
*c
) {
330 if (prepareForShutdown() == REDIS_OK
)
332 addReplyError(c
,"Errors trying to SHUTDOWN. Check logs.");
335 void renameGenericCommand(redisClient
*c
, int nx
) {
339 /* To use the same key as src and dst is probably an error */
340 if (sdscmp(c
->argv
[1]->ptr
,c
->argv
[2]->ptr
) == 0) {
341 addReply(c
,shared
.sameobjecterr
);
345 if ((o
= lookupKeyWriteOrReply(c
,c
->argv
[1],shared
.nokeyerr
)) == NULL
)
349 expire
= getExpire(c
->db
,c
->argv
[1]);
350 if (lookupKeyWrite(c
->db
,c
->argv
[2]) != NULL
) {
353 addReply(c
,shared
.czero
);
356 /* Overwrite: delete the old key before creating the new one with the same name. */
357 dbDelete(c
->db
,c
->argv
[2]);
359 dbAdd(c
->db
,c
->argv
[2],o
);
360 if (expire
!= -1) setExpire(c
->db
,c
->argv
[2],expire
);
361 dbDelete(c
->db
,c
->argv
[1]);
362 signalModifiedKey(c
->db
,c
->argv
[1]);
363 signalModifiedKey(c
->db
,c
->argv
[2]);
365 addReply(c
,nx
? shared
.cone
: shared
.ok
);
368 void renameCommand(redisClient
*c
) {
369 renameGenericCommand(c
,0);
372 void renamenxCommand(redisClient
*c
) {
373 renameGenericCommand(c
,1);
376 void moveCommand(redisClient
*c
) {
381 if (server
.cluster_enabled
) {
382 addReplyError(c
,"MOVE is not allowed in cluster mode");
386 /* Obtain source and target DB pointers */
389 if (selectDb(c
,atoi(c
->argv
[2]->ptr
)) == REDIS_ERR
) {
390 addReply(c
,shared
.outofrangeerr
);
394 selectDb(c
,srcid
); /* Back to the source DB */
396 /* If the user is moving using as target the same
397 * DB as the source DB it is probably an error. */
399 addReply(c
,shared
.sameobjecterr
);
403 /* Check if the element exists and get a reference */
404 o
= lookupKeyWrite(c
->db
,c
->argv
[1]);
406 addReply(c
,shared
.czero
);
410 /* Return zero if the key already exists in the target DB */
411 if (lookupKeyWrite(dst
,c
->argv
[1]) != NULL
) {
412 addReply(c
,shared
.czero
);
415 dbAdd(dst
,c
->argv
[1],o
);
418 /* OK! key moved, free the entry in the source DB */
419 dbDelete(src
,c
->argv
[1]);
421 addReply(c
,shared
.cone
);
424 /*-----------------------------------------------------------------------------
426 *----------------------------------------------------------------------------*/
428 int removeExpire(redisDb
*db
, robj
*key
) {
429 /* An expire may only be removed if there is a corresponding entry in the
430 * main dict. Otherwise, the key will never be freed. */
431 redisAssertWithInfo(NULL
,key
,dictFind(db
->dict
,key
->ptr
) != NULL
);
432 return dictDelete(db
->expires
,key
->ptr
) == DICT_OK
;
435 void setExpire(redisDb
*db
, robj
*key
, time_t when
) {
438 /* Reuse the sds from the main dict in the expire dict */
439 de
= dictFind(db
->dict
,key
->ptr
);
440 redisAssertWithInfo(NULL
,key
,de
!= NULL
);
441 dictReplace(db
->expires
,dictGetEntryKey(de
),(void*)when
);
444 /* Return the expire time of the specified key, or -1 if no expire
445 * is associated with this key (i.e. the key is non volatile) */
446 time_t getExpire(redisDb
*db
, robj
*key
) {
449 /* No expire? return ASAP */
450 if (dictSize(db
->expires
) == 0 ||
451 (de
= dictFind(db
->expires
,key
->ptr
)) == NULL
) return -1;
453 /* The entry was found in the expire dict, this means it should also
454 * be present in the main dict (safety check). */
455 redisAssertWithInfo(NULL
,key
,dictFind(db
->dict
,key
->ptr
) != NULL
);
456 return (time_t) dictGetEntryVal(de
);
459 /* Propagate expires into slaves and the AOF file.
460 * When a key expires in the master, a DEL operation for this key is sent
461 * to all the slaves and the AOF file if enabled.
463 * This way the key expiry is centralized in one place, and since both
464 * AOF and the master->slave link guarantee operation ordering, everything
465 * will be consistent even if we allow write operations against expiring
467 void propagateExpire(redisDb
*db
, robj
*key
) {
470 argv
[0] = createStringObject("DEL",3);
474 if (server
.appendonly
)
475 feedAppendOnlyFile(server
.delCommand
,db
->id
,argv
,2);
476 if (listLength(server
.slaves
))
477 replicationFeedSlaves(server
.slaves
,db
->id
,argv
,2);
479 decrRefCount(argv
[0]);
480 decrRefCount(argv
[1]);
483 int expireIfNeeded(redisDb
*db
, robj
*key
) {
484 time_t when
= getExpire(db
,key
);
486 if (when
< 0) return 0; /* No expire for this key */
488 /* Don't expire anything while loading. It will be done later. */
489 if (server
.loading
) return 0;
491 /* If we are running in the context of a slave, return ASAP:
492 * the slave key expiration is controlled by the master that will
493 * send us synthesized DEL operations for expired keys.
495 * Still we try to return the right information to the caller,
496 * that is, 0 if we think the key should be still valid, 1 if
497 * we think the key is expired at this time. */
498 if (server
.masterhost
!= NULL
) {
499 return time(NULL
) > when
;
502 /* Return when this key has not expired */
503 if (time(NULL
) <= when
) return 0;
506 server
.stat_expiredkeys
++;
507 propagateExpire(db
,key
);
508 return dbDelete(db
,key
);
511 /*-----------------------------------------------------------------------------
513 *----------------------------------------------------------------------------*/
515 void expireGenericCommand(redisClient
*c
, robj
*key
, robj
*param
, long offset
) {
519 if (getLongFromObjectOrReply(c
, param
, &seconds
, NULL
) != REDIS_OK
) return;
523 de
= dictFind(c
->db
->dict
,key
->ptr
);
525 addReply(c
,shared
.czero
);
528 /* EXPIRE with negative TTL, or EXPIREAT with a timestamp into the past
529 * should never be executed as a DEL when load the AOF or in the context
530 * of a slave instance.
532 * Instead we take the other branch of the IF statement setting an expire
533 * (possibly in the past) and wait for an explicit DEL from the master. */
534 if (seconds
<= 0 && !server
.loading
&& !server
.masterhost
) {
537 redisAssertWithInfo(c
,key
,dbDelete(c
->db
,key
));
540 /* Replicate/AOF this as an explicit DEL. */
541 aux
= createStringObject("DEL",3);
542 rewriteClientCommandVector(c
,2,aux
,key
);
544 signalModifiedKey(c
->db
,key
);
545 addReply(c
, shared
.cone
);
548 time_t when
= time(NULL
)+seconds
;
549 setExpire(c
->db
,key
,when
);
550 addReply(c
,shared
.cone
);
551 signalModifiedKey(c
->db
,key
);
557 void expireCommand(redisClient
*c
) {
558 expireGenericCommand(c
,c
->argv
[1],c
->argv
[2],0);
561 void expireatCommand(redisClient
*c
) {
562 expireGenericCommand(c
,c
->argv
[1],c
->argv
[2],time(NULL
));
565 void ttlCommand(redisClient
*c
) {
566 time_t expire
, ttl
= -1;
568 expire
= getExpire(c
->db
,c
->argv
[1]);
570 ttl
= (expire
-time(NULL
));
571 if (ttl
< 0) ttl
= -1;
573 addReplyLongLong(c
,(long long)ttl
);
576 void persistCommand(redisClient
*c
) {
579 de
= dictFind(c
->db
->dict
,c
->argv
[1]->ptr
);
581 addReply(c
,shared
.czero
);
583 if (removeExpire(c
->db
,c
->argv
[1])) {
584 addReply(c
,shared
.cone
);
587 addReply(c
,shared
.czero
);
592 /* -----------------------------------------------------------------------------
593 * API to get key arguments from commands
594 * ---------------------------------------------------------------------------*/
596 int *getKeysUsingCommandTable(struct redisCommand
*cmd
,robj
**argv
, int argc
, int *numkeys
) {
597 int j
, i
= 0, last
, *keys
;
600 if (cmd
->firstkey
== 0) {
605 if (last
< 0) last
= argc
+last
;
606 keys
= zmalloc(sizeof(int)*((last
- cmd
->firstkey
)+1));
607 for (j
= cmd
->firstkey
; j
<= last
; j
+= cmd
->keystep
) {
608 redisAssert(j
< argc
);
615 int *getKeysFromCommand(struct redisCommand
*cmd
,robj
**argv
, int argc
, int *numkeys
, int flags
) {
616 if (cmd
->getkeys_proc
) {
617 return cmd
->getkeys_proc(cmd
,argv
,argc
,numkeys
,flags
);
619 return getKeysUsingCommandTable(cmd
,argv
,argc
,numkeys
);
623 void getKeysFreeResult(int *result
) {
627 int *noPreloadGetKeys(struct redisCommand
*cmd
,robj
**argv
, int argc
, int *numkeys
, int flags
) {
628 if (flags
& REDIS_GETKEYS_PRELOAD
) {
632 return getKeysUsingCommandTable(cmd
,argv
,argc
,numkeys
);
636 int *renameGetKeys(struct redisCommand
*cmd
,robj
**argv
, int argc
, int *numkeys
, int flags
) {
637 if (flags
& REDIS_GETKEYS_PRELOAD
) {
638 int *keys
= zmalloc(sizeof(int));
643 return getKeysUsingCommandTable(cmd
,argv
,argc
,numkeys
);
647 int *zunionInterGetKeys(struct redisCommand
*cmd
,robj
**argv
, int argc
, int *numkeys
, int flags
) {
650 REDIS_NOTUSED(flags
);
652 num
= atoi(argv
[2]->ptr
);
653 /* Sanity check. Don't return any key if the command is going to
654 * reply with syntax error. */
655 if (num
> (argc
-3)) {
659 keys
= zmalloc(sizeof(int)*num
);
660 for (i
= 0; i
< num
; i
++) keys
[i
] = 3+i
;
665 /* Slot to Key API. This is used by Redis Cluster in order to obtain in
666 * a fast way a key that belongs to a specified hash slot. This is useful
667 * while rehashing the cluster. */
668 void SlotToKeyAdd(robj
*key
) {
669 unsigned int hashslot
= keyHashSlot(key
->ptr
,sdslen(key
->ptr
));
671 zslInsert(server
.cluster
.slots_to_keys
,hashslot
,key
);
675 void SlotToKeyDel(robj
*key
) {
676 unsigned int hashslot
= keyHashSlot(key
->ptr
,sdslen(key
->ptr
));
678 zslDelete(server
.cluster
.slots_to_keys
,hashslot
,key
);
681 unsigned int GetKeysInSlot(unsigned int hashslot
, robj
**keys
, unsigned int count
) {
686 range
.min
= range
.max
= hashslot
;
687 range
.minex
= range
.maxex
= 0;
689 n
= zslFirstInRange(server
.cluster
.slots_to_keys
, range
);
690 while(n
&& n
->score
== hashslot
&& count
--) {
692 n
= n
->level
[0].forward
;