X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/9311d2b527b0bb3e72e61b143718e6def51491e6..HEAD:/src/db.c?ds=sidebyside diff --git a/src/db.c b/src/db.c index e65106a5..da22cc98 100644 --- a/src/db.c +++ b/src/db.c @@ -1,3 +1,32 @@ +/* + * Copyright (c) 2009-2012, Salvatore Sanfilippo + * 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. + */ + #include "redis.h" #include @@ -22,7 +51,7 @@ robj *lookupKey(redisDb *db, robj *key) { val->lru = server.lruclock; return val; } else { - return NULL; + return recover(db, key); } } @@ -40,7 +69,9 @@ robj *lookupKeyRead(redisDb *db, robj *key) { robj *lookupKeyWrite(redisDb *db, robj *key) { expireIfNeeded(db,key); - return lookupKey(db,key); + robj *val = lookupKey(db,key); + if (val) val->archived = 0; + return val; } robj *lookupKeyReadOrReply(redisClient *c, robj *key, robj *reply) { @@ -62,6 +93,7 @@ robj *lookupKeyWriteOrReply(redisClient *c, robj *key, robj *reply) { void dbAdd(redisDb *db, robj *key, robj *val) { sds copy = sdsdup(key->ptr); int retval = dictAdd(db->dict, copy, val); + val->archived = 0; redisAssertWithInfo(NULL,key,retval == REDIS_OK); } @@ -96,7 +128,11 @@ void setKey(redisDb *db, robj *key, robj *val) { } int dbExists(redisDb *db, robj *key) { - return dictFind(db->dict,key->ptr) != NULL; + if (dictFind(db->dict,key->ptr) != NULL) + return 1; + if (recover(db, key) != NULL) + return 1; + return 0; } /* Return a random key, in form of a Redis object. @@ -126,7 +162,7 @@ robj *dbRandomKey(redisDb *db) { } /* Delete a key, value, and associated expiration entry if any, from the DB */ -int dbDelete(redisDb *db, robj *key) { +int dbDeleteSoft(redisDb *db, robj *key) { /* Deleting an entry from the expires dict will not free the sds of * the key, because it is shared with the main dictionary. */ if (dictSize(db->expires) > 0) dictDelete(db->expires,key->ptr); @@ -137,6 +173,12 @@ int dbDelete(redisDb *db, robj *key) { } } +/* Delete a key, value, and associated expiration entry if any, even archived */ +int dbDelete(redisDb *db, robj *key) { + purge(key); + return dbDeleteSoft(db, key); +} + long long emptyDb() { int j; long long removed = 0; @@ -226,7 +268,11 @@ void existsCommand(redisClient *c) { } void selectCommand(redisClient *c) { - int id = atoi(c->argv[1]->ptr); + long id; + + if (getLongFromObjectOrReply(c, c->argv[1], &id, + "invalid DB index") != REDIS_OK) + return; if (selectDb(c,id) == REDIS_ERR) { addReplyError(c,"invalid DB index"); @@ -271,6 +317,9 @@ void keysCommand(redisClient *c) { } } dictReleaseIterator(di); + + rummage(c, &numkeys); + setDeferredMultiBulkLength(c,replylen,numkeys); }