]>
git.saurik.com Git - redis.git/blob - src/db.c
7a9c9c4cdef7f56d6c12d3a06ef041d81d52c77c
5 /*-----------------------------------------------------------------------------
7 *----------------------------------------------------------------------------*/
9 /* Important notes on lookup and disk store.
11 * When disk store is enabled on lookup we can have different cases.
13 * a) The key is in memory:
14 * - If the key is not in IO_SAVEINPROG state we can access it.
15 * As if it's just IO_SAVE this means we have the key in the IO queue
16 * but can't be accessed by the IO thread (it requires to be
17 * translated into an IO Job by the cache cron function.)
18 * - If the key is in IO_SAVEINPROG we can't touch the key and have
19 * to blocking wait completion of operations.
20 * b) The key is not in memory:
21 * - If it's marked as non existing on disk as well (negative cache)
22 * we don't need to perform the disk access.
23 * - if the key MAY EXIST, but is not in memory, and it is marked as IO_SAVE
24 * then the key can only be a deleted one. As IO_SAVE keys are never
25 * evicted (dirty state), so the only possibility is that key was deleted.
26 * - if the key MAY EXIST we need to blocking load it.
27 * We check that the key is not in IO_SAVEINPROG state before accessing
28 * the disk object. If it is in this state, we wait.
31 void lookupWaitBusyKey(redisDb
*db
, robj
*key
) {
32 /* FIXME: wait just for this key, not everything */
33 waitEmptyIOJobsQueue();
34 processAllPendingIOJobs();
35 redisAssert((cacheScheduleIOGetFlags(db
,key
) & REDIS_IO_SAVEINPROG
) == 0);
38 robj
*lookupKey(redisDb
*db
, robj
*key
) {
39 dictEntry
*de
= dictFind(db
->dict
,key
->ptr
);
41 robj
*val
= dictGetEntryVal(de
);
43 /* Update the access time for the aging algorithm.
44 * Don't do it if we have a saving child, as this will trigger
45 * a copy on write madness. */
46 if (server
.bgsavechildpid
== -1 && server
.bgrewritechildpid
== -1)
47 val
->lru
= server
.lruclock
;
49 if (server
.ds_enabled
&&
50 cacheScheduleIOGetFlags(db
,key
) & REDIS_IO_SAVEINPROG
)
52 /* Need to wait for the key to get unbusy */
53 redisLog(REDIS_DEBUG
,"Lookup found a key in SAVEINPROG state. Waiting. (Key was in the cache)");
54 lookupWaitBusyKey(db
,key
);
56 server
.stat_keyspace_hits
++;
62 /* Key not found in the in memory hash table, but if disk store is
63 * enabled we may have this key on disk. If so load it in memory
64 * in a blocking way. */
65 if (server
.ds_enabled
&& cacheKeyMayExist(db
,key
)) {
66 long flags
= cacheScheduleIOGetFlags(db
,key
);
68 /* They key is not in cache, but it has a SAVE op in queue?
69 * The only possibility is that the key was deleted, since
70 * dirty keys are not evicted. */
71 if (flags
& REDIS_IO_SAVE
) {
72 server
.stat_keyspace_misses
++;
76 /* At this point we need to blocking load the key in memory.
77 * The first thing we do is waiting here if the key is busy. */
78 if (flags
& REDIS_IO_SAVEINPROG
) {
79 redisLog(REDIS_DEBUG
,"Lookup found a key in SAVEINPROG state. Waiting (while force loading).");
80 lookupWaitBusyKey(db
,key
);
83 redisLog(REDIS_DEBUG
,"Force loading key %s via lookup", key
->ptr
);
84 val
= dsGet(db
,key
,&expire
);
86 int retval
= dbAdd(db
,key
,val
);
87 redisAssert(retval
== REDIS_OK
);
88 if (expire
!= -1) setExpire(db
,key
,expire
);
89 server
.stat_keyspace_hits
++;
92 cacheSetKeyDoesNotExist(db
,key
);
95 server
.stat_keyspace_misses
++;
100 robj
*lookupKeyRead(redisDb
*db
, robj
*key
) {
101 expireIfNeeded(db
,key
);
102 return lookupKey(db
,key
);
105 robj
*lookupKeyWrite(redisDb
*db
, robj
*key
) {
106 expireIfNeeded(db
,key
);
107 return lookupKey(db
,key
);
110 robj
*lookupKeyReadOrReply(redisClient
*c
, robj
*key
, robj
*reply
) {
111 robj
*o
= lookupKeyRead(c
->db
, key
);
112 if (!o
) addReply(c
,reply
);
116 robj
*lookupKeyWriteOrReply(redisClient
*c
, robj
*key
, robj
*reply
) {
117 robj
*o
= lookupKeyWrite(c
->db
, key
);
118 if (!o
) addReply(c
,reply
);
122 /* Add the key to the DB. If the key already exists REDIS_ERR is returned,
123 * otherwise REDIS_OK is returned, and the caller should increment the
124 * refcount of 'val'. */
125 int dbAdd(redisDb
*db
, robj
*key
, robj
*val
) {
126 /* Perform a lookup before adding the key, as we need to copy the
128 if (dictFind(db
->dict
, key
->ptr
) != NULL
) {
131 sds copy
= sdsdup(key
->ptr
);
132 dictAdd(db
->dict
, copy
, val
);
133 if (server
.ds_enabled
) cacheSetKeyMayExist(db
,key
);
138 /* If the key does not exist, this is just like dbAdd(). Otherwise
139 * the value associated to the key is replaced with the new one.
141 * On update (key already existed) 0 is returned. Otherwise 1. */
142 int dbReplace(redisDb
*db
, robj
*key
, robj
*val
) {
146 if ((oldval
= dictFetchValue(db
->dict
,key
->ptr
)) == NULL
) {
147 sds copy
= sdsdup(key
->ptr
);
148 dictAdd(db
->dict
, copy
, val
);
151 dictReplace(db
->dict
, key
->ptr
, val
);
154 if (server
.ds_enabled
) cacheSetKeyMayExist(db
,key
);
158 int dbExists(redisDb
*db
, robj
*key
) {
159 return dictFind(db
->dict
,key
->ptr
) != NULL
;
162 /* Return a random key, in form of a Redis object.
163 * If there are no keys, NULL is returned.
165 * The function makes sure to return keys not already expired. */
166 robj
*dbRandomKey(redisDb
*db
) {
167 struct dictEntry
*de
;
173 de
= dictGetRandomKey(db
->dict
);
174 if (de
== NULL
) return NULL
;
176 key
= dictGetEntryKey(de
);
177 keyobj
= createStringObject(key
,sdslen(key
));
178 if (dictFind(db
->expires
,key
)) {
179 if (expireIfNeeded(db
,keyobj
)) {
180 decrRefCount(keyobj
);
181 continue; /* search for another key. This expired. */
188 /* Delete a key, value, and associated expiration entry if any, from the DB */
189 int dbDelete(redisDb
*db
, robj
*key
) {
190 /* If diskstore is enabled make sure to awake waiting clients for this key
191 * as it is not really useful to wait for a key already deleted to be
192 * loaded from disk. */
193 if (server
.ds_enabled
) {
194 handleClientsBlockedOnSwappedKey(db
,key
);
195 cacheSetKeyDoesNotExist(db
,key
);
198 /* Deleting an entry from the expires dict will not free the sds of
199 * the key, because it is shared with the main dictionary. */
200 if (dictSize(db
->expires
) > 0) dictDelete(db
->expires
,key
->ptr
);
201 return dictDelete(db
->dict
,key
->ptr
) == DICT_OK
;
204 /* Empty the whole database.
205 * If diskstore is enabled this function will just flush the in-memory cache. */
206 long long emptyDb() {
208 long long removed
= 0;
210 for (j
= 0; j
< server
.dbnum
; j
++) {
211 removed
+= dictSize(server
.db
[j
].dict
);
212 dictEmpty(server
.db
[j
].dict
);
213 dictEmpty(server
.db
[j
].expires
);
214 if (server
.ds_enabled
) dictEmpty(server
.db
[j
].io_negcache
);
219 int selectDb(redisClient
*c
, int id
) {
220 if (id
< 0 || id
>= server
.dbnum
)
222 c
->db
= &server
.db
[id
];
226 /*-----------------------------------------------------------------------------
227 * Hooks for key space changes.
229 * Every time a key in the database is modified the function
230 * signalModifiedKey() is called.
232 * Every time a DB is flushed the function signalFlushDb() is called.
233 *----------------------------------------------------------------------------*/
235 void signalModifiedKey(redisDb
*db
, robj
*key
) {
236 touchWatchedKey(db
,key
);
237 if (server
.ds_enabled
)
238 cacheScheduleIO(db
,key
,REDIS_IO_SAVE
);
241 void signalFlushedDb(int dbid
) {
242 touchWatchedKeysOnFlush(dbid
);
245 /*-----------------------------------------------------------------------------
246 * Type agnostic commands operating on the key space
247 *----------------------------------------------------------------------------*/
249 void flushdbCommand(redisClient
*c
) {
250 server
.dirty
+= dictSize(c
->db
->dict
);
251 signalFlushedDb(c
->db
->id
);
252 dictEmpty(c
->db
->dict
);
253 dictEmpty(c
->db
->expires
);
254 if (server
.ds_enabled
) dsFlushDb(c
->db
->id
);
255 addReply(c
,shared
.ok
);
258 void flushallCommand(redisClient
*c
) {
260 server
.dirty
+= emptyDb();
261 addReply(c
,shared
.ok
);
262 if (server
.bgsavechildpid
!= -1) {
263 kill(server
.bgsavechildpid
,SIGKILL
);
264 rdbRemoveTempFile(server
.bgsavechildpid
);
266 if (server
.ds_enabled
)
269 rdbSave(server
.dbfilename
);
273 void delCommand(redisClient
*c
) {
276 for (j
= 1; j
< c
->argc
; j
++) {
277 if (server
.ds_enabled
) {
278 lookupKeyRead(c
->db
,c
->argv
[j
]);
279 /* FIXME: this can be optimized a lot, no real need to load
280 * a possibly huge value. */
282 if (dbDelete(c
->db
,c
->argv
[j
])) {
283 signalModifiedKey(c
->db
,c
->argv
[j
]);
286 } else if (server
.ds_enabled
) {
287 if (cacheKeyMayExist(c
->db
,c
->argv
[j
]) &&
288 dsExists(c
->db
,c
->argv
[j
]))
290 cacheScheduleIO(c
->db
,c
->argv
[j
],REDIS_IO_SAVE
);
295 addReplyLongLong(c
,deleted
);
298 void existsCommand(redisClient
*c
) {
299 expireIfNeeded(c
->db
,c
->argv
[1]);
300 if (dbExists(c
->db
,c
->argv
[1])) {
301 addReply(c
, shared
.cone
);
303 addReply(c
, shared
.czero
);
307 void selectCommand(redisClient
*c
) {
308 int id
= atoi(c
->argv
[1]->ptr
);
310 if (selectDb(c
,id
) == REDIS_ERR
) {
311 addReplyError(c
,"invalid DB index");
313 addReply(c
,shared
.ok
);
317 void randomkeyCommand(redisClient
*c
) {
320 if ((key
= dbRandomKey(c
->db
)) == NULL
) {
321 addReply(c
,shared
.nullbulk
);
329 void keysCommand(redisClient
*c
) {
332 sds pattern
= c
->argv
[1]->ptr
;
333 int plen
= sdslen(pattern
), allkeys
;
334 unsigned long numkeys
= 0;
335 void *replylen
= addDeferredMultiBulkLength(c
);
337 di
= dictGetIterator(c
->db
->dict
);
338 allkeys
= (pattern
[0] == '*' && pattern
[1] == '\0');
339 while((de
= dictNext(di
)) != NULL
) {
340 sds key
= dictGetEntryKey(de
);
343 if (allkeys
|| stringmatchlen(pattern
,plen
,key
,sdslen(key
),0)) {
344 keyobj
= createStringObject(key
,sdslen(key
));
345 if (expireIfNeeded(c
->db
,keyobj
) == 0) {
346 addReplyBulk(c
,keyobj
);
349 decrRefCount(keyobj
);
352 dictReleaseIterator(di
);
353 setDeferredMultiBulkLength(c
,replylen
,numkeys
);
356 void dbsizeCommand(redisClient
*c
) {
357 addReplyLongLong(c
,dictSize(c
->db
->dict
));
360 void lastsaveCommand(redisClient
*c
) {
361 addReplyLongLong(c
,server
.lastsave
);
364 void typeCommand(redisClient
*c
) {
368 o
= lookupKeyRead(c
->db
,c
->argv
[1]);
373 case REDIS_STRING
: type
= "string"; break;
374 case REDIS_LIST
: type
= "list"; break;
375 case REDIS_SET
: type
= "set"; break;
376 case REDIS_ZSET
: type
= "zset"; break;
377 case REDIS_HASH
: type
= "hash"; break;
378 default: type
= "unknown"; break;
381 addReplyStatus(c
,type
);
384 void shutdownCommand(redisClient
*c
) {
385 if (prepareForShutdown() == REDIS_OK
)
387 addReplyError(c
,"Errors trying to SHUTDOWN. Check logs.");
390 void renameGenericCommand(redisClient
*c
, int nx
) {
393 /* To use the same key as src and dst is probably an error */
394 if (sdscmp(c
->argv
[1]->ptr
,c
->argv
[2]->ptr
) == 0) {
395 addReply(c
,shared
.sameobjecterr
);
399 if ((o
= lookupKeyWriteOrReply(c
,c
->argv
[1],shared
.nokeyerr
)) == NULL
)
403 if (dbAdd(c
->db
,c
->argv
[2],o
) == REDIS_ERR
) {
406 addReply(c
,shared
.czero
);
409 dbReplace(c
->db
,c
->argv
[2],o
);
411 dbDelete(c
->db
,c
->argv
[1]);
412 signalModifiedKey(c
->db
,c
->argv
[1]);
413 signalModifiedKey(c
->db
,c
->argv
[2]);
415 addReply(c
,nx
? shared
.cone
: shared
.ok
);
418 void renameCommand(redisClient
*c
) {
419 renameGenericCommand(c
,0);
422 void renamenxCommand(redisClient
*c
) {
423 renameGenericCommand(c
,1);
426 void moveCommand(redisClient
*c
) {
431 /* Obtain source and target DB pointers */
434 if (selectDb(c
,atoi(c
->argv
[2]->ptr
)) == REDIS_ERR
) {
435 addReply(c
,shared
.outofrangeerr
);
439 selectDb(c
,srcid
); /* Back to the source DB */
441 /* If the user is moving using as target the same
442 * DB as the source DB it is probably an error. */
444 addReply(c
,shared
.sameobjecterr
);
448 /* Check if the element exists and get a reference */
449 o
= lookupKeyWrite(c
->db
,c
->argv
[1]);
451 addReply(c
,shared
.czero
);
455 /* Try to add the element to the target DB */
456 if (dbAdd(dst
,c
->argv
[1],o
) == REDIS_ERR
) {
457 addReply(c
,shared
.czero
);
462 /* OK! key moved, free the entry in the source DB */
463 dbDelete(src
,c
->argv
[1]);
465 addReply(c
,shared
.cone
);
468 /*-----------------------------------------------------------------------------
470 *----------------------------------------------------------------------------*/
472 int removeExpire(redisDb
*db
, robj
*key
) {
473 /* An expire may only be removed if there is a corresponding entry in the
474 * main dict. Otherwise, the key will never be freed. */
475 redisAssert(dictFind(db
->dict
,key
->ptr
) != NULL
);
476 return dictDelete(db
->expires
,key
->ptr
) == DICT_OK
;
479 void setExpire(redisDb
*db
, robj
*key
, time_t when
) {
482 /* Reuse the sds from the main dict in the expire dict */
483 de
= dictFind(db
->dict
,key
->ptr
);
484 redisAssert(de
!= NULL
);
485 dictReplace(db
->expires
,dictGetEntryKey(de
),(void*)when
);
488 /* Return the expire time of the specified key, or -1 if no expire
489 * is associated with this key (i.e. the key is non volatile) */
490 time_t getExpire(redisDb
*db
, robj
*key
) {
493 /* No expire? return ASAP */
494 if (dictSize(db
->expires
) == 0 ||
495 (de
= dictFind(db
->expires
,key
->ptr
)) == NULL
) return -1;
497 /* The entry was found in the expire dict, this means it should also
498 * be present in the main dict (safety check). */
499 redisAssert(dictFind(db
->dict
,key
->ptr
) != NULL
);
500 return (time_t) dictGetEntryVal(de
);
503 /* Propagate expires into slaves and the AOF file.
504 * When a key expires in the master, a DEL operation for this key is sent
505 * to all the slaves and the AOF file if enabled.
507 * This way the key expiry is centralized in one place, and since both
508 * AOF and the master->slave link guarantee operation ordering, everything
509 * will be consistent even if we allow write operations against expiring
511 void propagateExpire(redisDb
*db
, robj
*key
) {
514 argv
[0] = createStringObject("DEL",3);
518 if (server
.appendonly
)
519 feedAppendOnlyFile(server
.delCommand
,db
->id
,argv
,2);
520 if (listLength(server
.slaves
))
521 replicationFeedSlaves(server
.slaves
,db
->id
,argv
,2);
523 decrRefCount(argv
[0]);
524 decrRefCount(argv
[1]);
527 int expireIfNeeded(redisDb
*db
, robj
*key
) {
528 time_t when
= getExpire(db
,key
);
530 if (when
< 0) return 0; /* No expire for this key */
532 /* If we are running in the context of a slave, return ASAP:
533 * the slave key expiration is controlled by the master that will
534 * send us synthesized DEL operations for expired keys.
536 * Still we try to return the right information to the caller,
537 * that is, 0 if we think the key should be still valid, 1 if
538 * we think the key is expired at this time. */
539 if (server
.masterhost
!= NULL
) {
540 return time(NULL
) > when
;
543 /* Return when this key has not expired */
544 if (time(NULL
) <= when
) return 0;
547 server
.stat_expiredkeys
++;
548 propagateExpire(db
,key
);
549 return dbDelete(db
,key
);
552 /*-----------------------------------------------------------------------------
554 *----------------------------------------------------------------------------*/
556 void expireGenericCommand(redisClient
*c
, robj
*key
, robj
*param
, long offset
) {
560 if (getLongFromObjectOrReply(c
, param
, &seconds
, NULL
) != REDIS_OK
) return;
564 de
= dictFind(c
->db
->dict
,key
->ptr
);
566 addReply(c
,shared
.czero
);
570 if (dbDelete(c
->db
,key
)) server
.dirty
++;
571 addReply(c
, shared
.cone
);
572 signalModifiedKey(c
->db
,key
);
575 time_t when
= time(NULL
)+seconds
;
576 setExpire(c
->db
,key
,when
);
577 addReply(c
,shared
.cone
);
578 signalModifiedKey(c
->db
,key
);
584 void expireCommand(redisClient
*c
) {
585 expireGenericCommand(c
,c
->argv
[1],c
->argv
[2],0);
588 void expireatCommand(redisClient
*c
) {
589 expireGenericCommand(c
,c
->argv
[1],c
->argv
[2],time(NULL
));
592 void ttlCommand(redisClient
*c
) {
593 time_t expire
, ttl
= -1;
595 if (server
.ds_enabled
) lookupKeyRead(c
->db
,c
->argv
[1]);
596 expire
= getExpire(c
->db
,c
->argv
[1]);
598 ttl
= (expire
-time(NULL
));
599 if (ttl
< 0) ttl
= -1;
601 addReplyLongLong(c
,(long long)ttl
);
604 void persistCommand(redisClient
*c
) {
607 de
= dictFind(c
->db
->dict
,c
->argv
[1]->ptr
);
609 addReply(c
,shared
.czero
);
611 if (removeExpire(c
->db
,c
->argv
[1])) {
612 addReply(c
,shared
.cone
);
615 addReply(c
,shared
.czero
);
620 /* -----------------------------------------------------------------------------
621 * API to get key arguments from commands
622 * ---------------------------------------------------------------------------*/
624 int *getKeysUsingCommandTable(struct redisCommand
*cmd
,robj
**argv
, int argc
, int *numkeys
) {
625 int j
, i
= 0, last
, *keys
;
628 if (cmd
->firstkey
== 0) {
633 if (last
< 0) last
= argc
+last
;
634 keys
= zmalloc(sizeof(int)*((last
- cmd
->firstkey
)+1));
635 for (j
= cmd
->firstkey
; j
<= last
; j
+= cmd
->keystep
) {
636 redisAssert(j
< argc
);
643 int *getKeysFromCommand(struct redisCommand
*cmd
,robj
**argv
, int argc
, int *numkeys
, int flags
) {
644 if (cmd
->getkeys_proc
) {
645 return cmd
->getkeys_proc(cmd
,argv
,argc
,numkeys
,flags
);
647 return getKeysUsingCommandTable(cmd
,argv
,argc
,numkeys
);
651 void getKeysFreeResult(int *result
) {
655 int *noPreloadGetKeys(struct redisCommand
*cmd
,robj
**argv
, int argc
, int *numkeys
, int flags
) {
656 if (flags
& REDIS_GETKEYS_PRELOAD
) {
660 return getKeysUsingCommandTable(cmd
,argv
,argc
,numkeys
);
664 int *renameGetKeys(struct redisCommand
*cmd
,robj
**argv
, int argc
, int *numkeys
, int flags
) {
665 if (flags
& REDIS_GETKEYS_PRELOAD
) {
666 int *keys
= zmalloc(sizeof(int));
671 return getKeysUsingCommandTable(cmd
,argv
,argc
,numkeys
);
675 int *zunionInterGetKeys(struct redisCommand
*cmd
,robj
**argv
, int argc
, int *numkeys
, int flags
) {
678 REDIS_NOTUSED(flags
);
680 num
= atoi(argv
[2]->ptr
);
681 /* Sanity check. Don't return any key if the command is going to
682 * reply with syntax error. */
683 if (num
> (argc
-3)) {
687 keys
= zmalloc(sizeof(int)*num
);
688 for (i
= 0; i
< num
; i
++) keys
[i
] = 3+i
;