db.c 21.8 KB
Newer Older
1 2 3
#include "redis.h"

#include <signal.h>
4
#include <ctype.h>
5

6 7 8
void SlotToKeyAdd(robj *key);
void SlotToKeyDel(robj *key);

9 10 11 12
/*-----------------------------------------------------------------------------
 * C-level DB API
 *----------------------------------------------------------------------------*/

A
antirez 已提交
13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34
/* Important notes on lookup and disk store.
 *
 * When disk store is enabled on lookup we can have different cases.
 *
 * a) The key is in memory:
 *    - If the key is not in IO_SAVEINPROG state we can access it.
 *      As if it's just IO_SAVE this means we have the key in the IO queue
 *      but can't be accessed by the IO thread (it requires to be
 *      translated into an IO Job by the cache cron function.)
 *    - If the key is in IO_SAVEINPROG we can't touch the key and have
 *      to blocking wait completion of operations.
 * b) The key is not in memory:
 *    - If it's marked as non existing on disk as well (negative cache)
 *      we don't need to perform the disk access.
 *    - if the key MAY EXIST, but is not in memory, and it is marked as IO_SAVE
 *      then the key can only be a deleted one. As IO_SAVE keys are never
 *      evicted (dirty state), so the only possibility is that key was deleted.
 *    - if the key MAY EXIST we need to blocking load it.
 *      We check that the key is not in IO_SAVEINPROG state before accessing
 *      the disk object. If it is in this state, we wait.
 */

35 36 37
robj *lookupKey(redisDb *db, robj *key) {
    dictEntry *de = dictFind(db->dict,key->ptr);
    if (de) {
38
        robj *val = dictGetVal(de);
39

40 41 42
        /* Update the access time for the aging algorithm.
         * Don't do it if we have a saving child, as this will trigger
         * a copy on write madness. */
A
antirez 已提交
43
        if (server.rdb_child_pid == -1 && server.aof_child_pid == -1)
44
            val->lru = server.lruclock;
45 46 47 48 49 50 51
        return val;
    } else {
        return NULL;
    }
}

robj *lookupKeyRead(redisDb *db, robj *key) {
52 53
    robj *val;

54
    expireIfNeeded(db,key);
55 56 57 58 59 60
    val = lookupKey(db,key);
    if (val == NULL)
        server.stat_keyspace_misses++;
    else
        server.stat_keyspace_hits++;
    return val;
61 62 63
}

robj *lookupKeyWrite(redisDb *db, robj *key) {
64
    expireIfNeeded(db,key);
65 66 67 68 69 70 71 72 73 74 75 76 77 78 79
    return lookupKey(db,key);
}

robj *lookupKeyReadOrReply(redisClient *c, robj *key, robj *reply) {
    robj *o = lookupKeyRead(c->db, key);
    if (!o) addReply(c,reply);
    return o;
}

robj *lookupKeyWriteOrReply(redisClient *c, robj *key, robj *reply) {
    robj *o = lookupKeyWrite(c->db, key);
    if (!o) addReply(c,reply);
    return o;
}

80 81 82 83 84 85 86 87
/* Add the key to the DB. It's up to the caller to increment the reference
 * counte of the value if needed.
 *
 * The program is aborted if the key already exists. */
void dbAdd(redisDb *db, robj *key, robj *val) {
    sds copy = sdsdup(key->ptr);
    int retval = dictAdd(db->dict, copy, val);

88
    redisAssertWithInfo(NULL,key,retval == REDIS_OK);
89 90 91 92 93 94 95 96 97 98 99
    if (server.cluster_enabled) SlotToKeyAdd(key);
 }

/* Overwrite an existing key with a new value. Incrementing the reference
 * count of the new value is up to the caller.
 * This function does not modify the expire time of the existing key.
 *
 * The program is aborted if the key was not already present. */
void dbOverwrite(redisDb *db, robj *key, robj *val) {
    struct dictEntry *de = dictFind(db->dict,key->ptr);
    
100
    redisAssertWithInfo(NULL,key,de != NULL);
101
    dictReplace(db->dict, key->ptr, val);
102 103
}

104 105
/* High level Set operation. This function can be used in order to set
 * a key, whatever it was existing or not, to a new object.
106
 *
107 108 109 110 111 112
 * 1) The ref count of the value object is incremented.
 * 2) clients WATCHing for the destination key notified.
 * 3) The expire time of the key is reset (the key is made persistent). */
void setKey(redisDb *db, robj *key, robj *val) {
    if (lookupKeyWrite(db,key) == NULL) {
        dbAdd(db,key,val);
113
    } else {
114
        dbOverwrite(db,key,val);
115
    }
116 117
    incrRefCount(val);
    removeExpire(db,key);
118
    signalModifiedKey(db,key);
119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138
}

int dbExists(redisDb *db, robj *key) {
    return dictFind(db->dict,key->ptr) != NULL;
}

/* Return a random key, in form of a Redis object.
 * If there are no keys, NULL is returned.
 *
 * The function makes sure to return keys not already expired. */
robj *dbRandomKey(redisDb *db) {
    struct dictEntry *de;

    while(1) {
        sds key;
        robj *keyobj;

        de = dictGetRandomKey(db->dict);
        if (de == NULL) return NULL;

139
        key = dictGetKey(de);
140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155
        keyobj = createStringObject(key,sdslen(key));
        if (dictFind(db->expires,key)) {
            if (expireIfNeeded(db,keyobj)) {
                decrRefCount(keyobj);
                continue; /* search for another key. This expired. */
            }
        }
        return keyobj;
    }
}

/* Delete a key, value, and associated expiration entry if any, from the DB */
int dbDelete(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);
156 157 158 159 160 161
    if (dictDelete(db->dict,key->ptr) == DICT_OK) {
        if (server.cluster_enabled) SlotToKeyDel(key);
        return 1;
    } else {
        return 0;
    }
162 163
}

164 165
/* Empty the whole database.
 * If diskstore is enabled this function will just flush the in-memory cache. */
166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184
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;
}

int selectDb(redisClient *c, int id) {
    if (id < 0 || id >= server.dbnum)
        return REDIS_ERR;
    c->db = &server.db[id];
    return REDIS_OK;
}

185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201
/*-----------------------------------------------------------------------------
 * Hooks for key space changes.
 *
 * Every time a key in the database is modified the function
 * signalModifiedKey() is called.
 *
 * Every time a DB is flushed the function signalFlushDb() is called.
 *----------------------------------------------------------------------------*/

void signalModifiedKey(redisDb *db, robj *key) {
    touchWatchedKey(db,key);
}

void signalFlushedDb(int dbid) {
    touchWatchedKeysOnFlush(dbid);
}

202 203 204 205 206 207
/*-----------------------------------------------------------------------------
 * Type agnostic commands operating on the key space
 *----------------------------------------------------------------------------*/

void flushdbCommand(redisClient *c) {
    server.dirty += dictSize(c->db->dict);
208
    signalFlushedDb(c->db->id);
209 210 211 212 213 214
    dictEmpty(c->db->dict);
    dictEmpty(c->db->expires);
    addReply(c,shared.ok);
}

void flushallCommand(redisClient *c) {
215
    signalFlushedDb(-1);
216 217
    server.dirty += emptyDb();
    addReply(c,shared.ok);
A
antirez 已提交
218 219 220
    if (server.rdb_child_pid != -1) {
        kill(server.rdb_child_pid,SIGKILL);
        rdbRemoveTempFile(server.rdb_child_pid);
221
    }
222 223 224 225
    if (server.saveparamslen > 0) {
        /* Normally rdbSave() will reset dirty, but we don't want this here
         * as otherwise FLUSHALL will not be replicated nor put into the AOF. */
        int saved_dirty = server.dirty;
A
antirez 已提交
226
        rdbSave(server.rdb_filename);
227 228
        server.dirty = saved_dirty;
    }
229 230 231 232 233 234 235 236
    server.dirty++;
}

void delCommand(redisClient *c) {
    int deleted = 0, j;

    for (j = 1; j < c->argc; j++) {
        if (dbDelete(c->db,c->argv[j])) {
237
            signalModifiedKey(c->db,c->argv[j]);
238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256
            server.dirty++;
            deleted++;
        }
    }
    addReplyLongLong(c,deleted);
}

void existsCommand(redisClient *c) {
    expireIfNeeded(c->db,c->argv[1]);
    if (dbExists(c->db,c->argv[1])) {
        addReply(c, shared.cone);
    } else {
        addReply(c, shared.czero);
    }
}

void selectCommand(redisClient *c) {
    int id = atoi(c->argv[1]->ptr);

257
    if (server.cluster_enabled && id != 0) {
A
antirez 已提交
258 259 260
        addReplyError(c,"SELECT is not allowed in cluster mode");
        return;
    }
261
    if (selectDb(c,id) == REDIS_ERR) {
262
        addReplyError(c,"invalid DB index");
263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283
    } else {
        addReply(c,shared.ok);
    }
}

void randomkeyCommand(redisClient *c) {
    robj *key;

    if ((key = dbRandomKey(c->db)) == NULL) {
        addReply(c,shared.nullbulk);
        return;
    }

    addReplyBulk(c,key);
    decrRefCount(key);
}

void keysCommand(redisClient *c) {
    dictIterator *di;
    dictEntry *de;
    sds pattern = c->argv[1]->ptr;
A
antirez 已提交
284
    int plen = sdslen(pattern), allkeys;
285
    unsigned long numkeys = 0;
286
    void *replylen = addDeferredMultiBulkLength(c);
287 288

    di = dictGetIterator(c->db->dict);
A
antirez 已提交
289
    allkeys = (pattern[0] == '*' && pattern[1] == '\0');
290
    while((de = dictNext(di)) != NULL) {
291
        sds key = dictGetKey(de);
292 293
        robj *keyobj;

A
antirez 已提交
294
        if (allkeys || stringmatchlen(pattern,plen,key,sdslen(key),0)) {
295 296 297 298 299 300 301 302 303
            keyobj = createStringObject(key,sdslen(key));
            if (expireIfNeeded(c->db,keyobj) == 0) {
                addReplyBulk(c,keyobj);
                numkeys++;
            }
            decrRefCount(keyobj);
        }
    }
    dictReleaseIterator(di);
304
    setDeferredMultiBulkLength(c,replylen,numkeys);
305 306 307
}

void dbsizeCommand(redisClient *c) {
308
    addReplyLongLong(c,dictSize(c->db->dict));
309 310 311
}

void lastsaveCommand(redisClient *c) {
312
    addReplyLongLong(c,server.lastsave);
313 314 315 316 317 318 319 320
}

void typeCommand(redisClient *c) {
    robj *o;
    char *type;

    o = lookupKeyRead(c->db,c->argv[1]);
    if (o == NULL) {
321
        type = "none";
322 323
    } else {
        switch(o->type) {
324 325 326 327 328 329
        case REDIS_STRING: type = "string"; break;
        case REDIS_LIST: type = "list"; break;
        case REDIS_SET: type = "set"; break;
        case REDIS_ZSET: type = "zset"; break;
        case REDIS_HASH: type = "hash"; break;
        default: type = "unknown"; break;
330 331
        }
    }
332
    addReplyStatus(c,type);
333 334 335
}

void shutdownCommand(redisClient *c) {
336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351
    int flags = 0;

    if (c->argc > 2) {
        addReply(c,shared.syntaxerr);
        return;
    } else if (c->argc == 2) {
        if (!strcasecmp(c->argv[1]->ptr,"nosave")) {
            flags |= REDIS_SHUTDOWN_NOSAVE;
        } else if (!strcasecmp(c->argv[1]->ptr,"save")) {
            flags |= REDIS_SHUTDOWN_SAVE;
        } else {
            addReply(c,shared.syntaxerr);
            return;
        }
    }
    if (prepareForShutdown(flags) == REDIS_OK) exit(0);
352
    addReplyError(c,"Errors trying to SHUTDOWN. Check logs.");
353 354 355 356
}

void renameGenericCommand(redisClient *c, int nx) {
    robj *o;
357
    long long expire;
358 359 360 361 362 363 364 365 366 367 368

    /* 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;
    }

    if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.nokeyerr)) == NULL)
        return;

    incrRefCount(o);
369
    expire = getExpire(c->db,c->argv[1]);
370
    if (lookupKeyWrite(c->db,c->argv[2]) != NULL) {
371 372 373 374 375
        if (nx) {
            decrRefCount(o);
            addReply(c,shared.czero);
            return;
        }
376 377
        /* Overwrite: delete the old key before creating the new one with the same name. */
        dbDelete(c->db,c->argv[2]);
378
    }
379 380
    dbAdd(c->db,c->argv[2],o);
    if (expire != -1) setExpire(c->db,c->argv[2],expire);
381
    dbDelete(c->db,c->argv[1]);
382 383
    signalModifiedKey(c->db,c->argv[1]);
    signalModifiedKey(c->db,c->argv[2]);
384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400
    server.dirty++;
    addReply(c,nx ? shared.cone : shared.ok);
}

void renameCommand(redisClient *c) {
    renameGenericCommand(c,0);
}

void renamenxCommand(redisClient *c) {
    renameGenericCommand(c,1);
}

void moveCommand(redisClient *c) {
    robj *o;
    redisDb *src, *dst;
    int srcid;

A
antirez 已提交
401 402 403 404 405
    if (server.cluster_enabled) {
        addReplyError(c,"MOVE is not allowed in cluster mode");
        return;
    }

406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429
    /* 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;
    }

430 431
    /* Return zero if the key already exists in the target DB */
    if (lookupKeyWrite(dst,c->argv[1]) != NULL) {
432 433 434
        addReply(c,shared.czero);
        return;
    }
435
    dbAdd(dst,c->argv[1],o);
436 437 438 439 440 441 442 443 444 445 446 447 448 449 450
    incrRefCount(o);

    /* OK! key moved, free the entry in the source DB */
    dbDelete(src,c->argv[1]);
    server.dirty++;
    addReply(c,shared.cone);
}

/*-----------------------------------------------------------------------------
 * Expires API
 *----------------------------------------------------------------------------*/

int removeExpire(redisDb *db, robj *key) {
    /* An expire may only be removed if there is a corresponding entry in the
     * main dict. Otherwise, the key will never be freed. */
451
    redisAssertWithInfo(NULL,key,dictFind(db->dict,key->ptr) != NULL);
A
antirez 已提交
452
    return dictDelete(db->expires,key->ptr) == DICT_OK;
453 454
}

455 456
void setExpire(redisDb *db, robj *key, long long when) {
    dictEntry *kde, *de;
457 458

    /* Reuse the sds from the main dict in the expire dict */
459 460 461 462
    kde = dictFind(db->dict,key->ptr);
    redisAssertWithInfo(NULL,key,kde != NULL);
    de = dictReplaceRaw(db->expires,dictGetKey(kde));
    dictSetSignedIntegerVal(de,when);
463 464 465 466
}

/* 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) */
467
long long getExpire(redisDb *db, robj *key) {
468 469 470 471 472 473 474 475
    dictEntry *de;

    /* No expire? return ASAP */
    if (dictSize(db->expires) == 0 ||
       (de = dictFind(db->expires,key->ptr)) == NULL) return -1;

    /* The entry was found in the expire dict, this means it should also
     * be present in the main dict (safety check). */
476
    redisAssertWithInfo(NULL,key,dictFind(db->dict,key->ptr) != NULL);
477
    return dictGetSignedIntegerVal(de);
478 479
}

480 481 482 483 484 485 486 487 488 489 490 491 492 493 494
/* Propagate expires into slaves and the AOF file.
 * When a key expires in the master, a DEL operation for this key is sent
 * to all the slaves and the AOF file if enabled.
 *
 * This way the key expiry is centralized in one place, and since both
 * AOF and the master->slave link guarantee operation ordering, everything
 * will be consistent even if we allow write operations against expiring
 * keys. */
void propagateExpire(redisDb *db, robj *key) {
    robj *argv[2];

    argv[0] = createStringObject("DEL",3);
    argv[1] = key;
    incrRefCount(key);

495
    if (server.aof_state != REDIS_AOF_OFF)
496
        feedAppendOnlyFile(server.delCommand,db->id,argv,2);
497 498 499
    if (listLength(server.slaves))
        replicationFeedSlaves(server.slaves,db->id,argv,2);

500 501
    decrRefCount(argv[0]);
    decrRefCount(argv[1]);
502 503
}

504
int expireIfNeeded(redisDb *db, robj *key) {
505
    long long when = getExpire(db,key);
506

507 508
    if (when < 0) return 0; /* No expire for this key */

509 510 511
    /* Don't expire anything while loading. It will be done later. */
    if (server.loading) return 0;

512 513 514 515 516 517 518 519 520 521 522
    /* If we are running in the context of a slave, return ASAP:
     * the slave key expiration is controlled by the master that will
     * send us synthesized DEL operations for expired keys.
     *
     * Still we try to return the right information to the caller, 
     * that is, 0 if we think the key should be still valid, 1 if
     * we think the key is expired at this time. */
    if (server.masterhost != NULL) {
        return time(NULL) > when;
    }

523
    /* Return when this key has not expired */
524
    if (mstime() <= when) return 0;
525 526 527

    /* Delete the key */
    server.stat_expiredkeys++;
528
    propagateExpire(db,key);
529 530 531 532 533 534 535
    return dbDelete(db,key);
}

/*-----------------------------------------------------------------------------
 * Expires Commands
 *----------------------------------------------------------------------------*/

536 537 538 539 540 541 542 543
/* Given an string object return true if it contains exactly the "ms"
 * or "MS" string. This is used in order to check if the last argument
 * of EXPIRE, EXPIREAT or TTL is "ms" to switch into millisecond input/output */
int stringObjectEqualsMs(robj *a) {
    char *arg = a->ptr;
    return tolower(arg[0]) == 'm' && tolower(arg[1]) == 's' && arg[2] == '\0';
}

544
void expireGenericCommand(redisClient *c, long long offset, int unit) {
545
    dictEntry *de;
546 547
    robj *key = c->argv[1], *param = c->argv[2];
    long long milliseconds;
548

549 550
    if (getLongLongFromObjectOrReply(c, param, &milliseconds, NULL) != REDIS_OK)
        return;
551

552
    if (unit == UNIT_SECONDS) milliseconds *= 1000;
553
    milliseconds -= offset;
554 555 556 557 558 559

    de = dictFind(c->db->dict,key->ptr);
    if (de == NULL) {
        addReply(c,shared.czero);
        return;
    }
560 561 562 563 564 565
    /* EXPIRE with negative TTL, or EXPIREAT with a timestamp into the past
     * should never be executed as a DEL when load the AOF or in the context
     * of a slave instance.
     *
     * Instead we take the other branch of the IF statement setting an expire
     * (possibly in the past) and wait for an explicit DEL from the master. */
566
    if (milliseconds <= 0 && !server.loading && !server.masterhost) {
567 568
        robj *aux;

569
        redisAssertWithInfo(c,key,dbDelete(c->db,key));
570 571 572 573 574 575
        server.dirty++;

        /* Replicate/AOF this as an explicit DEL. */
        aux = createStringObject("DEL",3);
        rewriteClientCommandVector(c,2,aux,key);
        decrRefCount(aux);
576
        signalModifiedKey(c->db,key);
577
        addReply(c, shared.cone);
578 579
        return;
    } else {
580
        long long when = mstime()+milliseconds;
581 582
        setExpire(c->db,key,when);
        addReply(c,shared.cone);
583
        signalModifiedKey(c->db,key);
584
        server.dirty++;
585 586 587 588 589
        return;
    }
}

void expireCommand(redisClient *c) {
590
    expireGenericCommand(c,0,UNIT_SECONDS);
591 592 593
}

void expireatCommand(redisClient *c) {
594
    expireGenericCommand(c,mstime(),UNIT_SECONDS);
595 596
}

597 598 599
void pexpireCommand(redisClient *c) {
    expireGenericCommand(c,0,UNIT_MILLISECONDS);
}
600

601 602 603 604 605 606
void pexpireatCommand(redisClient *c) {
    expireGenericCommand(c,mstime(),UNIT_MILLISECONDS);
}

void ttlGenericCommand(redisClient *c, int output_ms) {
    long long expire, ttl = -1;
607 608 609

    expire = getExpire(c->db,c->argv[1]);
    if (expire != -1) {
610
        ttl = expire-mstime();
611 612
        if (ttl < 0) ttl = -1;
    }
613 614 615
    if (ttl == -1) {
        addReplyLongLong(c,-1);
    } else {
616
        addReplyLongLong(c,output_ms ? ttl : ((ttl+500)/1000));
617
    }
618
}
A
antirez 已提交
619

620 621 622 623 624 625 626 627
void ttlCommand(redisClient *c) {
    ttlGenericCommand(c, 0);
}

void pttlCommand(redisClient *c) {
    ttlGenericCommand(c, 1);
}

A
antirez 已提交
628 629 630 631 632 633 634
void persistCommand(redisClient *c) {
    dictEntry *de;

    de = dictFind(c->db->dict,c->argv[1]->ptr);
    if (de == NULL) {
        addReply(c,shared.czero);
    } else {
A
antirez 已提交
635
        if (removeExpire(c->db,c->argv[1])) {
A
antirez 已提交
636
            addReply(c,shared.cone);
A
antirez 已提交
637 638
            server.dirty++;
        } else {
A
antirez 已提交
639
            addReply(c,shared.czero);
A
antirez 已提交
640
        }
A
antirez 已提交
641 642
    }
}
643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660

/* -----------------------------------------------------------------------------
 * API to get key arguments from commands
 * ---------------------------------------------------------------------------*/

int *getKeysUsingCommandTable(struct redisCommand *cmd,robj **argv, int argc, int *numkeys) {
    int j, i = 0, last, *keys;
    REDIS_NOTUSED(argv);

    if (cmd->firstkey == 0) {
        *numkeys = 0;
        return NULL;
    }
    last = cmd->lastkey;
    if (last < 0) last = argc+last;
    keys = zmalloc(sizeof(int)*((last - cmd->firstkey)+1));
    for (j = cmd->firstkey; j <= last; j += cmd->keystep) {
        redisAssert(j < argc);
661
        keys[i++] = j;
662
    }
663
    *numkeys = i;
664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692
    return keys;
}

int *getKeysFromCommand(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
    if (cmd->getkeys_proc) {
        return cmd->getkeys_proc(cmd,argv,argc,numkeys,flags);
    } else {
        return getKeysUsingCommandTable(cmd,argv,argc,numkeys);
    }
}

void getKeysFreeResult(int *result) {
    zfree(result);
}

int *noPreloadGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
    if (flags & REDIS_GETKEYS_PRELOAD) {
        *numkeys = 0;
        return NULL;
    } else {
        return getKeysUsingCommandTable(cmd,argv,argc,numkeys);
    }
}

int *renameGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
    if (flags & REDIS_GETKEYS_PRELOAD) {
        int *keys = zmalloc(sizeof(int));
        *numkeys = 1;
        keys[0] = 1;
693
        return keys;
694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710
    } else {
        return getKeysUsingCommandTable(cmd,argv,argc,numkeys);
    }
}

int *zunionInterGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
    int i, num, *keys;
    REDIS_NOTUSED(cmd);
    REDIS_NOTUSED(flags);

    num = atoi(argv[2]->ptr);
    /* Sanity check. Don't return any key if the command is going to
     * reply with syntax error. */
    if (num > (argc-3)) {
        *numkeys = 0;
        return NULL;
    }
711
    keys = zmalloc(sizeof(int)*num);
712 713 714 715
    for (i = 0; i < num; i++) keys[i] = 3+i;
    *numkeys = num;
    return keys;
}
716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732

/* Slot to Key API. This is used by Redis Cluster in order to obtain in
 * a fast way a key that belongs to a specified hash slot. This is useful
 * while rehashing the cluster. */
void SlotToKeyAdd(robj *key) {
    unsigned int hashslot = keyHashSlot(key->ptr,sdslen(key->ptr));

    zslInsert(server.cluster.slots_to_keys,hashslot,key);
    incrRefCount(key);
}

void SlotToKeyDel(robj *key) {
    unsigned int hashslot = keyHashSlot(key->ptr,sdslen(key->ptr));

    zslDelete(server.cluster.slots_to_keys,hashslot,key);
}

A
antirez 已提交
733
unsigned int GetKeysInSlot(unsigned int hashslot, robj **keys, unsigned int count) {
734 735
    zskiplistNode *n;
    zrangespec range;
A
antirez 已提交
736
    int j = 0;
737 738 739 740 741

    range.min = range.max = hashslot;
    range.minex = range.maxex = 0;
    
    n = zslFirstInRange(server.cluster.slots_to_keys, range);
A
antirez 已提交
742 743 744 745 746
    while(n && n->score == hashslot && count--) {
        keys[j++] = n->obj;
        n = n->level[0].forward;
    }
    return j;
747
}