]> git.saurik.com Git - redis.git/blame - src/db.c
Fixed bug breaking rdbSaveMillisecondTime() in 32 bit systems. Thanks to @anydot...
[redis.git] / src / db.c
CommitLineData
e2641e09 1#include "redis.h"
2
3#include <signal.h>
7dcc10b6 4#include <ctype.h>
e2641e09 5
c772d9c6 6void SlotToKeyAdd(robj *key);
7void SlotToKeyDel(robj *key);
8
e2641e09 9/*-----------------------------------------------------------------------------
10 * C-level DB API
11 *----------------------------------------------------------------------------*/
12
5d46e370 13/* Important notes on lookup and disk store.
14 *
15 * When disk store is enabled on lookup we can have different cases.
16 *
17 * a) The key is in memory:
18 * - If the key is not in IO_SAVEINPROG state we can access it.
19 * As if it's just IO_SAVE this means we have the key in the IO queue
20 * but can't be accessed by the IO thread (it requires to be
21 * translated into an IO Job by the cache cron function.)
22 * - If the key is in IO_SAVEINPROG we can't touch the key and have
23 * to blocking wait completion of operations.
24 * b) The key is not in memory:
25 * - If it's marked as non existing on disk as well (negative cache)
26 * we don't need to perform the disk access.
27 * - if the key MAY EXIST, but is not in memory, and it is marked as IO_SAVE
28 * then the key can only be a deleted one. As IO_SAVE keys are never
29 * evicted (dirty state), so the only possibility is that key was deleted.
30 * - if the key MAY EXIST we need to blocking load it.
31 * We check that the key is not in IO_SAVEINPROG state before accessing
32 * the disk object. If it is in this state, we wait.
33 */
34
e2641e09 35robj *lookupKey(redisDb *db, robj *key) {
36 dictEntry *de = dictFind(db->dict,key->ptr);
37 if (de) {
c0ba9ebe 38 robj *val = dictGetVal(de);
e2641e09 39
7d0966a6 40 /* Update the access time for the aging algorithm.
41 * Don't do it if we have a saving child, as this will trigger
42 * a copy on write madness. */
43 if (server.bgsavechildpid == -1 && server.bgrewritechildpid == -1)
44 val->lru = server.lruclock;
53eeeaff 45 server.stat_keyspace_hits++;
e2641e09 46 return val;
47 } else {
53eeeaff 48 server.stat_keyspace_misses++;
e2641e09 49 return NULL;
50 }
51}
52
53robj *lookupKeyRead(redisDb *db, robj *key) {
54 expireIfNeeded(db,key);
55 return lookupKey(db,key);
56}
57
58robj *lookupKeyWrite(redisDb *db, robj *key) {
bcf2995c 59 expireIfNeeded(db,key);
e2641e09 60 return lookupKey(db,key);
61}
62
63robj *lookupKeyReadOrReply(redisClient *c, robj *key, robj *reply) {
64 robj *o = lookupKeyRead(c->db, key);
65 if (!o) addReply(c,reply);
66 return o;
67}
68
69robj *lookupKeyWriteOrReply(redisClient *c, robj *key, robj *reply) {
70 robj *o = lookupKeyWrite(c->db, key);
71 if (!o) addReply(c,reply);
72 return o;
73}
74
f85cd526 75/* Add the key to the DB. It's up to the caller to increment the reference
76 * counte of the value if needed.
77 *
78 * The program is aborted if the key already exists. */
79void dbAdd(redisDb *db, robj *key, robj *val) {
80 sds copy = sdsdup(key->ptr);
81 int retval = dictAdd(db->dict, copy, val);
82
eab0e26e 83 redisAssertWithInfo(NULL,key,retval == REDIS_OK);
f85cd526 84 if (server.cluster_enabled) SlotToKeyAdd(key);
85 }
86
87/* Overwrite an existing key with a new value. Incrementing the reference
88 * count of the new value is up to the caller.
89 * This function does not modify the expire time of the existing key.
90 *
91 * The program is aborted if the key was not already present. */
92void dbOverwrite(redisDb *db, robj *key, robj *val) {
93 struct dictEntry *de = dictFind(db->dict,key->ptr);
94
eab0e26e 95 redisAssertWithInfo(NULL,key,de != NULL);
f85cd526 96 dictReplace(db->dict, key->ptr, val);
e2641e09 97}
98
f85cd526 99/* High level Set operation. This function can be used in order to set
100 * a key, whatever it was existing or not, to a new object.
e2641e09 101 *
f85cd526 102 * 1) The ref count of the value object is incremented.
103 * 2) clients WATCHing for the destination key notified.
104 * 3) The expire time of the key is reset (the key is made persistent). */
105void setKey(redisDb *db, robj *key, robj *val) {
106 if (lookupKeyWrite(db,key) == NULL) {
107 dbAdd(db,key,val);
e2641e09 108 } else {
f85cd526 109 dbOverwrite(db,key,val);
e2641e09 110 }
f85cd526 111 incrRefCount(val);
112 removeExpire(db,key);
113 touchWatchedKey(db,key);
e2641e09 114}
115
116int dbExists(redisDb *db, robj *key) {
117 return dictFind(db->dict,key->ptr) != NULL;
118}
119
120/* Return a random key, in form of a Redis object.
121 * If there are no keys, NULL is returned.
122 *
123 * The function makes sure to return keys not already expired. */
124robj *dbRandomKey(redisDb *db) {
125 struct dictEntry *de;
126
127 while(1) {
128 sds key;
129 robj *keyobj;
130
131 de = dictGetRandomKey(db->dict);
132 if (de == NULL) return NULL;
133
c0ba9ebe 134 key = dictGetKey(de);
e2641e09 135 keyobj = createStringObject(key,sdslen(key));
136 if (dictFind(db->expires,key)) {
137 if (expireIfNeeded(db,keyobj)) {
138 decrRefCount(keyobj);
139 continue; /* search for another key. This expired. */
140 }
141 }
142 return keyobj;
143 }
144}
145
146/* Delete a key, value, and associated expiration entry if any, from the DB */
147int dbDelete(redisDb *db, robj *key) {
148 /* Deleting an entry from the expires dict will not free the sds of
149 * the key, because it is shared with the main dictionary. */
150 if (dictSize(db->expires) > 0) dictDelete(db->expires,key->ptr);
c772d9c6 151 if (dictDelete(db->dict,key->ptr) == DICT_OK) {
152 if (server.cluster_enabled) SlotToKeyDel(key);
153 return 1;
154 } else {
155 return 0;
156 }
e2641e09 157}
158
69bfffb4 159/* Empty the whole database.
160 * If diskstore is enabled this function will just flush the in-memory cache. */
e2641e09 161long long emptyDb() {
162 int j;
163 long long removed = 0;
164
165 for (j = 0; j < server.dbnum; j++) {
166 removed += dictSize(server.db[j].dict);
167 dictEmpty(server.db[j].dict);
168 dictEmpty(server.db[j].expires);
169 }
170 return removed;
171}
172
173int selectDb(redisClient *c, int id) {
174 if (id < 0 || id >= server.dbnum)
175 return REDIS_ERR;
176 c->db = &server.db[id];
177 return REDIS_OK;
178}
179
cea8c5cd 180/*-----------------------------------------------------------------------------
181 * Hooks for key space changes.
182 *
183 * Every time a key in the database is modified the function
184 * signalModifiedKey() is called.
185 *
186 * Every time a DB is flushed the function signalFlushDb() is called.
187 *----------------------------------------------------------------------------*/
188
189void signalModifiedKey(redisDb *db, robj *key) {
190 touchWatchedKey(db,key);
cea8c5cd 191}
192
193void signalFlushedDb(int dbid) {
194 touchWatchedKeysOnFlush(dbid);
cea8c5cd 195}
196
e2641e09 197/*-----------------------------------------------------------------------------
198 * Type agnostic commands operating on the key space
199 *----------------------------------------------------------------------------*/
200
201void flushdbCommand(redisClient *c) {
202 server.dirty += dictSize(c->db->dict);
cea8c5cd 203 signalFlushedDb(c->db->id);
e2641e09 204 dictEmpty(c->db->dict);
205 dictEmpty(c->db->expires);
206 addReply(c,shared.ok);
207}
208
209void flushallCommand(redisClient *c) {
cea8c5cd 210 signalFlushedDb(-1);
e2641e09 211 server.dirty += emptyDb();
212 addReply(c,shared.ok);
213 if (server.bgsavechildpid != -1) {
214 kill(server.bgsavechildpid,SIGKILL);
215 rdbRemoveTempFile(server.bgsavechildpid);
216 }
13cd1515 217 if (server.saveparamslen > 0) {
218 /* Normally rdbSave() will reset dirty, but we don't want this here
219 * as otherwise FLUSHALL will not be replicated nor put into the AOF. */
220 int saved_dirty = server.dirty;
221 rdbSave(server.dbfilename);
222 server.dirty = saved_dirty;
223 }
e2641e09 224 server.dirty++;
225}
226
227void delCommand(redisClient *c) {
228 int deleted = 0, j;
229
230 for (j = 1; j < c->argc; j++) {
231 if (dbDelete(c->db,c->argv[j])) {
cea8c5cd 232 signalModifiedKey(c->db,c->argv[j]);
e2641e09 233 server.dirty++;
234 deleted++;
235 }
236 }
237 addReplyLongLong(c,deleted);
238}
239
240void existsCommand(redisClient *c) {
241 expireIfNeeded(c->db,c->argv[1]);
242 if (dbExists(c->db,c->argv[1])) {
243 addReply(c, shared.cone);
244 } else {
245 addReply(c, shared.czero);
246 }
247}
248
249void selectCommand(redisClient *c) {
250 int id = atoi(c->argv[1]->ptr);
251
a7b058da 252 if (server.cluster_enabled && id != 0) {
ecc91094 253 addReplyError(c,"SELECT is not allowed in cluster mode");
254 return;
255 }
e2641e09 256 if (selectDb(c,id) == REDIS_ERR) {
3ab20376 257 addReplyError(c,"invalid DB index");
e2641e09 258 } else {
259 addReply(c,shared.ok);
260 }
261}
262
263void randomkeyCommand(redisClient *c) {
264 robj *key;
265
266 if ((key = dbRandomKey(c->db)) == NULL) {
267 addReply(c,shared.nullbulk);
268 return;
269 }
270
271 addReplyBulk(c,key);
272 decrRefCount(key);
273}
274
275void keysCommand(redisClient *c) {
276 dictIterator *di;
277 dictEntry *de;
278 sds pattern = c->argv[1]->ptr;
e0e1c195 279 int plen = sdslen(pattern), allkeys;
e2641e09 280 unsigned long numkeys = 0;
b301c1fc 281 void *replylen = addDeferredMultiBulkLength(c);
e2641e09 282
283 di = dictGetIterator(c->db->dict);
e0e1c195 284 allkeys = (pattern[0] == '*' && pattern[1] == '\0');
e2641e09 285 while((de = dictNext(di)) != NULL) {
c0ba9ebe 286 sds key = dictGetKey(de);
e2641e09 287 robj *keyobj;
288
e0e1c195 289 if (allkeys || stringmatchlen(pattern,plen,key,sdslen(key),0)) {
e2641e09 290 keyobj = createStringObject(key,sdslen(key));
291 if (expireIfNeeded(c->db,keyobj) == 0) {
292 addReplyBulk(c,keyobj);
293 numkeys++;
294 }
295 decrRefCount(keyobj);
296 }
297 }
298 dictReleaseIterator(di);
b301c1fc 299 setDeferredMultiBulkLength(c,replylen,numkeys);
e2641e09 300}
301
302void dbsizeCommand(redisClient *c) {
b70d3555 303 addReplyLongLong(c,dictSize(c->db->dict));
e2641e09 304}
305
306void lastsaveCommand(redisClient *c) {
b70d3555 307 addReplyLongLong(c,server.lastsave);
e2641e09 308}
309
310void typeCommand(redisClient *c) {
311 robj *o;
312 char *type;
313
314 o = lookupKeyRead(c->db,c->argv[1]);
315 if (o == NULL) {
3ab20376 316 type = "none";
e2641e09 317 } else {
318 switch(o->type) {
3ab20376
PN
319 case REDIS_STRING: type = "string"; break;
320 case REDIS_LIST: type = "list"; break;
321 case REDIS_SET: type = "set"; break;
322 case REDIS_ZSET: type = "zset"; break;
323 case REDIS_HASH: type = "hash"; break;
324 default: type = "unknown"; break;
e2641e09 325 }
326 }
3ab20376 327 addReplyStatus(c,type);
e2641e09 328}
329
e2641e09 330void shutdownCommand(redisClient *c) {
331 if (prepareForShutdown() == REDIS_OK)
332 exit(0);
3ab20376 333 addReplyError(c,"Errors trying to SHUTDOWN. Check logs.");
e2641e09 334}
335
336void renameGenericCommand(redisClient *c, int nx) {
337 robj *o;
7dcc10b6 338 long long expire;
e2641e09 339
340 /* To use the same key as src and dst is probably an error */
341 if (sdscmp(c->argv[1]->ptr,c->argv[2]->ptr) == 0) {
342 addReply(c,shared.sameobjecterr);
343 return;
344 }
345
346 if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.nokeyerr)) == NULL)
347 return;
348
349 incrRefCount(o);
4ab18a33 350 expire = getExpire(c->db,c->argv[1]);
f85cd526 351 if (lookupKeyWrite(c->db,c->argv[2]) != NULL) {
e2641e09 352 if (nx) {
353 decrRefCount(o);
354 addReply(c,shared.czero);
355 return;
356 }
4ab18a33 357 /* Overwrite: delete the old key before creating the new one with the same name. */
358 dbDelete(c->db,c->argv[2]);
e2641e09 359 }
4ab18a33 360 dbAdd(c->db,c->argv[2],o);
361 if (expire != -1) setExpire(c->db,c->argv[2],expire);
e2641e09 362 dbDelete(c->db,c->argv[1]);
cea8c5cd 363 signalModifiedKey(c->db,c->argv[1]);
364 signalModifiedKey(c->db,c->argv[2]);
e2641e09 365 server.dirty++;
366 addReply(c,nx ? shared.cone : shared.ok);
367}
368
369void renameCommand(redisClient *c) {
370 renameGenericCommand(c,0);
371}
372
373void renamenxCommand(redisClient *c) {
374 renameGenericCommand(c,1);
375}
376
377void moveCommand(redisClient *c) {
378 robj *o;
379 redisDb *src, *dst;
380 int srcid;
381
ecc91094 382 if (server.cluster_enabled) {
383 addReplyError(c,"MOVE is not allowed in cluster mode");
384 return;
385 }
386
e2641e09 387 /* Obtain source and target DB pointers */
388 src = c->db;
389 srcid = c->db->id;
390 if (selectDb(c,atoi(c->argv[2]->ptr)) == REDIS_ERR) {
391 addReply(c,shared.outofrangeerr);
392 return;
393 }
394 dst = c->db;
395 selectDb(c,srcid); /* Back to the source DB */
396
397 /* If the user is moving using as target the same
398 * DB as the source DB it is probably an error. */
399 if (src == dst) {
400 addReply(c,shared.sameobjecterr);
401 return;
402 }
403
404 /* Check if the element exists and get a reference */
405 o = lookupKeyWrite(c->db,c->argv[1]);
406 if (!o) {
407 addReply(c,shared.czero);
408 return;
409 }
410
f85cd526 411 /* Return zero if the key already exists in the target DB */
412 if (lookupKeyWrite(dst,c->argv[1]) != NULL) {
e2641e09 413 addReply(c,shared.czero);
414 return;
415 }
f85cd526 416 dbAdd(dst,c->argv[1],o);
e2641e09 417 incrRefCount(o);
418
419 /* OK! key moved, free the entry in the source DB */
420 dbDelete(src,c->argv[1]);
421 server.dirty++;
422 addReply(c,shared.cone);
423}
424
425/*-----------------------------------------------------------------------------
426 * Expires API
427 *----------------------------------------------------------------------------*/
428
429int removeExpire(redisDb *db, robj *key) {
430 /* An expire may only be removed if there is a corresponding entry in the
431 * main dict. Otherwise, the key will never be freed. */
eab0e26e 432 redisAssertWithInfo(NULL,key,dictFind(db->dict,key->ptr) != NULL);
a539d29a 433 return dictDelete(db->expires,key->ptr) == DICT_OK;
e2641e09 434}
435
7dcc10b6 436void setExpire(redisDb *db, robj *key, long long when) {
437 dictEntry *kde, *de;
e2641e09 438
439 /* Reuse the sds from the main dict in the expire dict */
7dcc10b6 440 kde = dictFind(db->dict,key->ptr);
441 redisAssertWithInfo(NULL,key,kde != NULL);
442 de = dictReplaceRaw(db->expires,dictGetKey(kde));
443 dictSetSignedIntegerVal(de,when);
e2641e09 444}
445
446/* Return the expire time of the specified key, or -1 if no expire
447 * is associated with this key (i.e. the key is non volatile) */
7dcc10b6 448long long getExpire(redisDb *db, robj *key) {
e2641e09 449 dictEntry *de;
450
451 /* No expire? return ASAP */
452 if (dictSize(db->expires) == 0 ||
453 (de = dictFind(db->expires,key->ptr)) == NULL) return -1;
454
455 /* The entry was found in the expire dict, this means it should also
456 * be present in the main dict (safety check). */
eab0e26e 457 redisAssertWithInfo(NULL,key,dictFind(db->dict,key->ptr) != NULL);
7dcc10b6 458 return dictGetSignedIntegerVal(de);
e2641e09 459}
460
bcf2995c 461/* Propagate expires into slaves and the AOF file.
462 * When a key expires in the master, a DEL operation for this key is sent
463 * to all the slaves and the AOF file if enabled.
464 *
465 * This way the key expiry is centralized in one place, and since both
466 * AOF and the master->slave link guarantee operation ordering, everything
467 * will be consistent even if we allow write operations against expiring
468 * keys. */
469void propagateExpire(redisDb *db, robj *key) {
bcf2995c 470 robj *argv[2];
471
bcf2995c 472 argv[0] = createStringObject("DEL",3);
473 argv[1] = key;
474 incrRefCount(key);
475
476 if (server.appendonly)
1b1f47c9 477 feedAppendOnlyFile(server.delCommand,db->id,argv,2);
bcf2995c 478 if (listLength(server.slaves))
479 replicationFeedSlaves(server.slaves,db->id,argv,2);
480
c25a5d3b 481 decrRefCount(argv[0]);
482 decrRefCount(argv[1]);
bcf2995c 483}
484
e2641e09 485int expireIfNeeded(redisDb *db, robj *key) {
7dcc10b6 486 long long when = getExpire(db,key);
bcf2995c 487
3a73be75 488 if (when < 0) return 0; /* No expire for this key */
489
040b0ade
HW
490 /* Don't expire anything while loading. It will be done later. */
491 if (server.loading) return 0;
492
bcf2995c 493 /* If we are running in the context of a slave, return ASAP:
494 * the slave key expiration is controlled by the master that will
495 * send us synthesized DEL operations for expired keys.
496 *
497 * Still we try to return the right information to the caller,
498 * that is, 0 if we think the key should be still valid, 1 if
499 * we think the key is expired at this time. */
500 if (server.masterhost != NULL) {
501 return time(NULL) > when;
502 }
503
e2641e09 504 /* Return when this key has not expired */
7dcc10b6 505 if (mstime() <= when) return 0;
e2641e09 506
507 /* Delete the key */
508 server.stat_expiredkeys++;
bcf2995c 509 propagateExpire(db,key);
e2641e09 510 return dbDelete(db,key);
511}
512
513/*-----------------------------------------------------------------------------
514 * Expires Commands
515 *----------------------------------------------------------------------------*/
516
52d46855 517/* Given an string object return true if it contains exactly the "ms"
518 * or "MS" string. This is used in order to check if the last argument
519 * of EXPIRE, EXPIREAT or TTL is "ms" to switch into millisecond input/output */
520int stringObjectEqualsMs(robj *a) {
521 char *arg = a->ptr;
522 return tolower(arg[0]) == 'm' && tolower(arg[1]) == 's' && arg[2] == '\0';
523}
524
7dcc10b6 525void expireGenericCommand(redisClient *c, long long offset) {
e2641e09 526 dictEntry *de;
7dcc10b6 527 robj *key = c->argv[1], *param = c->argv[2];
528 long long milliseconds;
529 int time_in_seconds = 1;
e2641e09 530
7dcc10b6 531 if (getLongLongFromObjectOrReply(c, param, &milliseconds, NULL) != REDIS_OK)
532 return;
e2641e09 533
7dcc10b6 534 /* If no "ms" argument was passed the time is in second, so we need
535 * to multilpy it by 1000 */
536 if (c->argc == 4) {
52d46855 537 if (!stringObjectEqualsMs(c->argv[3])) {
7dcc10b6 538 addReply(c,shared.syntaxerr);
539 return;
540 }
541 time_in_seconds = 0; /* "ms" argument passed. */
542 }
543 if (time_in_seconds) milliseconds *= 1000;
544 milliseconds -= offset;
e2641e09 545
546 de = dictFind(c->db->dict,key->ptr);
547 if (de == NULL) {
548 addReply(c,shared.czero);
549 return;
550 }
812ecc8b 551 /* EXPIRE with negative TTL, or EXPIREAT with a timestamp into the past
552 * should never be executed as a DEL when load the AOF or in the context
553 * of a slave instance.
554 *
555 * Instead we take the other branch of the IF statement setting an expire
556 * (possibly in the past) and wait for an explicit DEL from the master. */
7dcc10b6 557 if (milliseconds <= 0 && !server.loading && !server.masterhost) {
812ecc8b 558 robj *aux;
559
eab0e26e 560 redisAssertWithInfo(c,key,dbDelete(c->db,key));
812ecc8b 561 server.dirty++;
562
563 /* Replicate/AOF this as an explicit DEL. */
564 aux = createStringObject("DEL",3);
565 rewriteClientCommandVector(c,2,aux,key);
566 decrRefCount(aux);
cea8c5cd 567 signalModifiedKey(c->db,key);
812ecc8b 568 addReply(c, shared.cone);
e2641e09 569 return;
570 } else {
7dcc10b6 571 long long when = mstime()+milliseconds;
0cf5b7b5 572 setExpire(c->db,key,when);
573 addReply(c,shared.cone);
cea8c5cd 574 signalModifiedKey(c->db,key);
0cf5b7b5 575 server.dirty++;
e2641e09 576 return;
577 }
578}
579
580void expireCommand(redisClient *c) {
52d46855 581 if (c->argc > 4) {
582 addReply(c,shared.syntaxerr);
583 return;
584 }
7dcc10b6 585 expireGenericCommand(c,0);
e2641e09 586}
587
588void expireatCommand(redisClient *c) {
52d46855 589 if (c->argc > 4) {
590 addReply(c,shared.syntaxerr);
591 return;
592 }
7dcc10b6 593 expireGenericCommand(c,mstime());
e2641e09 594}
595
596void ttlCommand(redisClient *c) {
7dcc10b6 597 long long expire, ttl = -1;
52d46855 598 int output_ms = 0;
599
600 if (c->argc == 3) {
601 if (stringObjectEqualsMs(c->argv[2])) {
602 output_ms = 1;
603 } else {
604 addReply(c,shared.syntaxerr);
605 return;
606 }
607 }
e2641e09 608
609 expire = getExpire(c->db,c->argv[1]);
610 if (expire != -1) {
7dcc10b6 611 ttl = expire-mstime();
e2641e09 612 if (ttl < 0) ttl = -1;
613 }
7dcc10b6 614 if (ttl == -1) {
615 addReplyLongLong(c,-1);
616 } else {
52d46855 617 addReplyLongLong(c,output_ms ? ttl : ((ttl+500)/1000));
7dcc10b6 618 }
e2641e09 619}
a539d29a 620
621void persistCommand(redisClient *c) {
622 dictEntry *de;
623
624 de = dictFind(c->db->dict,c->argv[1]->ptr);
625 if (de == NULL) {
626 addReply(c,shared.czero);
627 } else {
1fb4e8de 628 if (removeExpire(c->db,c->argv[1])) {
a539d29a 629 addReply(c,shared.cone);
1fb4e8de 630 server.dirty++;
631 } else {
a539d29a 632 addReply(c,shared.czero);
1fb4e8de 633 }
a539d29a 634 }
635}
9791f0f8 636
637/* -----------------------------------------------------------------------------
638 * API to get key arguments from commands
639 * ---------------------------------------------------------------------------*/
640
641int *getKeysUsingCommandTable(struct redisCommand *cmd,robj **argv, int argc, int *numkeys) {
642 int j, i = 0, last, *keys;
643 REDIS_NOTUSED(argv);
644
645 if (cmd->firstkey == 0) {
646 *numkeys = 0;
647 return NULL;
648 }
649 last = cmd->lastkey;
650 if (last < 0) last = argc+last;
651 keys = zmalloc(sizeof(int)*((last - cmd->firstkey)+1));
652 for (j = cmd->firstkey; j <= last; j += cmd->keystep) {
653 redisAssert(j < argc);
b4b51446 654 keys[i++] = j;
9791f0f8 655 }
b4b51446 656 *numkeys = i;
9791f0f8 657 return keys;
658}
659
660int *getKeysFromCommand(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
661 if (cmd->getkeys_proc) {
662 return cmd->getkeys_proc(cmd,argv,argc,numkeys,flags);
663 } else {
664 return getKeysUsingCommandTable(cmd,argv,argc,numkeys);
665 }
666}
667
668void getKeysFreeResult(int *result) {
669 zfree(result);
670}
671
672int *noPreloadGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
673 if (flags & REDIS_GETKEYS_PRELOAD) {
674 *numkeys = 0;
675 return NULL;
676 } else {
677 return getKeysUsingCommandTable(cmd,argv,argc,numkeys);
678 }
679}
680
681int *renameGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
682 if (flags & REDIS_GETKEYS_PRELOAD) {
683 int *keys = zmalloc(sizeof(int));
684 *numkeys = 1;
685 keys[0] = 1;
4b61ca46 686 return keys;
9791f0f8 687 } else {
688 return getKeysUsingCommandTable(cmd,argv,argc,numkeys);
689 }
690}
691
692int *zunionInterGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
693 int i, num, *keys;
694 REDIS_NOTUSED(cmd);
695 REDIS_NOTUSED(flags);
696
697 num = atoi(argv[2]->ptr);
698 /* Sanity check. Don't return any key if the command is going to
699 * reply with syntax error. */
700 if (num > (argc-3)) {
701 *numkeys = 0;
702 return NULL;
703 }
6e1b9b58 704 keys = zmalloc(sizeof(int)*num);
9791f0f8 705 for (i = 0; i < num; i++) keys[i] = 3+i;
706 *numkeys = num;
707 return keys;
708}
c772d9c6 709
710/* Slot to Key API. This is used by Redis Cluster in order to obtain in
711 * a fast way a key that belongs to a specified hash slot. This is useful
712 * while rehashing the cluster. */
713void SlotToKeyAdd(robj *key) {
714 unsigned int hashslot = keyHashSlot(key->ptr,sdslen(key->ptr));
715
716 zslInsert(server.cluster.slots_to_keys,hashslot,key);
717 incrRefCount(key);
718}
719
720void SlotToKeyDel(robj *key) {
721 unsigned int hashslot = keyHashSlot(key->ptr,sdslen(key->ptr));
722
723 zslDelete(server.cluster.slots_to_keys,hashslot,key);
724}
725
484354ff 726unsigned int GetKeysInSlot(unsigned int hashslot, robj **keys, unsigned int count) {
c772d9c6 727 zskiplistNode *n;
728 zrangespec range;
484354ff 729 int j = 0;
c772d9c6 730
731 range.min = range.max = hashslot;
732 range.minex = range.maxex = 0;
733
734 n = zslFirstInRange(server.cluster.slots_to_keys, range);
484354ff 735 while(n && n->score == hashslot && count--) {
736 keys[j++] = n->obj;
737 n = n->level[0].forward;
738 }
739 return j;
c772d9c6 740}