]> git.saurik.com Git - redis.git/blob - src/db.c
setKey(): call the higher level wrapper setModifiedKey() instead of touchWatchedKey...
[redis.git] / src / db.c
1 #include "redis.h"
2
3 #include <signal.h>
4 #include <ctype.h>
5
6 void SlotToKeyAdd(robj *key);
7 void SlotToKeyDel(robj *key);
8
9 /*-----------------------------------------------------------------------------
10 * C-level DB API
11 *----------------------------------------------------------------------------*/
12
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
35 robj *lookupKey(redisDb *db, robj *key) {
36 dictEntry *de = dictFind(db->dict,key->ptr);
37 if (de) {
38 robj *val = dictGetVal(de);
39
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.rdb_child_pid == -1 && server.aof_child_pid == -1)
44 val->lru = server.lruclock;
45 server.stat_keyspace_hits++;
46 return val;
47 } else {
48 server.stat_keyspace_misses++;
49 return NULL;
50 }
51 }
52
53 robj *lookupKeyRead(redisDb *db, robj *key) {
54 expireIfNeeded(db,key);
55 return lookupKey(db,key);
56 }
57
58 robj *lookupKeyWrite(redisDb *db, robj *key) {
59 expireIfNeeded(db,key);
60 return lookupKey(db,key);
61 }
62
63 robj *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
69 robj *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
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. */
79 void dbAdd(redisDb *db, robj *key, robj *val) {
80 sds copy = sdsdup(key->ptr);
81 int retval = dictAdd(db->dict, copy, val);
82
83 redisAssertWithInfo(NULL,key,retval == REDIS_OK);
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. */
92 void dbOverwrite(redisDb *db, robj *key, robj *val) {
93 struct dictEntry *de = dictFind(db->dict,key->ptr);
94
95 redisAssertWithInfo(NULL,key,de != NULL);
96 dictReplace(db->dict, key->ptr, val);
97 }
98
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.
101 *
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). */
105 void setKey(redisDb *db, robj *key, robj *val) {
106 if (lookupKeyWrite(db,key) == NULL) {
107 dbAdd(db,key,val);
108 } else {
109 dbOverwrite(db,key,val);
110 }
111 incrRefCount(val);
112 removeExpire(db,key);
113 signalModifiedKey(db,key);
114 }
115
116 int 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. */
124 robj *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
134 key = dictGetKey(de);
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 */
147 int 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);
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 }
157 }
158
159 /* Empty the whole database.
160 * If diskstore is enabled this function will just flush the in-memory cache. */
161 long 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
173 int 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
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
189 void signalModifiedKey(redisDb *db, robj *key) {
190 touchWatchedKey(db,key);
191 }
192
193 void signalFlushedDb(int dbid) {
194 touchWatchedKeysOnFlush(dbid);
195 }
196
197 /*-----------------------------------------------------------------------------
198 * Type agnostic commands operating on the key space
199 *----------------------------------------------------------------------------*/
200
201 void flushdbCommand(redisClient *c) {
202 server.dirty += dictSize(c->db->dict);
203 signalFlushedDb(c->db->id);
204 dictEmpty(c->db->dict);
205 dictEmpty(c->db->expires);
206 addReply(c,shared.ok);
207 }
208
209 void flushallCommand(redisClient *c) {
210 signalFlushedDb(-1);
211 server.dirty += emptyDb();
212 addReply(c,shared.ok);
213 if (server.rdb_child_pid != -1) {
214 kill(server.rdb_child_pid,SIGKILL);
215 rdbRemoveTempFile(server.rdb_child_pid);
216 }
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.rdb_filename);
222 server.dirty = saved_dirty;
223 }
224 server.dirty++;
225 }
226
227 void 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])) {
232 signalModifiedKey(c->db,c->argv[j]);
233 server.dirty++;
234 deleted++;
235 }
236 }
237 addReplyLongLong(c,deleted);
238 }
239
240 void 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
249 void selectCommand(redisClient *c) {
250 int id = atoi(c->argv[1]->ptr);
251
252 if (server.cluster_enabled && id != 0) {
253 addReplyError(c,"SELECT is not allowed in cluster mode");
254 return;
255 }
256 if (selectDb(c,id) == REDIS_ERR) {
257 addReplyError(c,"invalid DB index");
258 } else {
259 addReply(c,shared.ok);
260 }
261 }
262
263 void 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
275 void keysCommand(redisClient *c) {
276 dictIterator *di;
277 dictEntry *de;
278 sds pattern = c->argv[1]->ptr;
279 int plen = sdslen(pattern), allkeys;
280 unsigned long numkeys = 0;
281 void *replylen = addDeferredMultiBulkLength(c);
282
283 di = dictGetIterator(c->db->dict);
284 allkeys = (pattern[0] == '*' && pattern[1] == '\0');
285 while((de = dictNext(di)) != NULL) {
286 sds key = dictGetKey(de);
287 robj *keyobj;
288
289 if (allkeys || stringmatchlen(pattern,plen,key,sdslen(key),0)) {
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);
299 setDeferredMultiBulkLength(c,replylen,numkeys);
300 }
301
302 void dbsizeCommand(redisClient *c) {
303 addReplyLongLong(c,dictSize(c->db->dict));
304 }
305
306 void lastsaveCommand(redisClient *c) {
307 addReplyLongLong(c,server.lastsave);
308 }
309
310 void typeCommand(redisClient *c) {
311 robj *o;
312 char *type;
313
314 o = lookupKeyRead(c->db,c->argv[1]);
315 if (o == NULL) {
316 type = "none";
317 } else {
318 switch(o->type) {
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;
325 }
326 }
327 addReplyStatus(c,type);
328 }
329
330 void shutdownCommand(redisClient *c) {
331 int flags = 0;
332
333 if (c->argc > 2) {
334 addReply(c,shared.syntaxerr);
335 return;
336 } else if (c->argc == 2) {
337 if (!strcasecmp(c->argv[1]->ptr,"nosave")) {
338 flags |= REDIS_SHUTDOWN_NOSAVE;
339 } else if (!strcasecmp(c->argv[1]->ptr,"save")) {
340 flags |= REDIS_SHUTDOWN_SAVE;
341 } else {
342 addReply(c,shared.syntaxerr);
343 return;
344 }
345 }
346 if (prepareForShutdown(flags) == REDIS_OK) exit(0);
347 addReplyError(c,"Errors trying to SHUTDOWN. Check logs.");
348 }
349
350 void renameGenericCommand(redisClient *c, int nx) {
351 robj *o;
352 long long expire;
353
354 /* To use the same key as src and dst is probably an error */
355 if (sdscmp(c->argv[1]->ptr,c->argv[2]->ptr) == 0) {
356 addReply(c,shared.sameobjecterr);
357 return;
358 }
359
360 if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.nokeyerr)) == NULL)
361 return;
362
363 incrRefCount(o);
364 expire = getExpire(c->db,c->argv[1]);
365 if (lookupKeyWrite(c->db,c->argv[2]) != NULL) {
366 if (nx) {
367 decrRefCount(o);
368 addReply(c,shared.czero);
369 return;
370 }
371 /* Overwrite: delete the old key before creating the new one with the same name. */
372 dbDelete(c->db,c->argv[2]);
373 }
374 dbAdd(c->db,c->argv[2],o);
375 if (expire != -1) setExpire(c->db,c->argv[2],expire);
376 dbDelete(c->db,c->argv[1]);
377 signalModifiedKey(c->db,c->argv[1]);
378 signalModifiedKey(c->db,c->argv[2]);
379 server.dirty++;
380 addReply(c,nx ? shared.cone : shared.ok);
381 }
382
383 void renameCommand(redisClient *c) {
384 renameGenericCommand(c,0);
385 }
386
387 void renamenxCommand(redisClient *c) {
388 renameGenericCommand(c,1);
389 }
390
391 void moveCommand(redisClient *c) {
392 robj *o;
393 redisDb *src, *dst;
394 int srcid;
395
396 if (server.cluster_enabled) {
397 addReplyError(c,"MOVE is not allowed in cluster mode");
398 return;
399 }
400
401 /* Obtain source and target DB pointers */
402 src = c->db;
403 srcid = c->db->id;
404 if (selectDb(c,atoi(c->argv[2]->ptr)) == REDIS_ERR) {
405 addReply(c,shared.outofrangeerr);
406 return;
407 }
408 dst = c->db;
409 selectDb(c,srcid); /* Back to the source DB */
410
411 /* If the user is moving using as target the same
412 * DB as the source DB it is probably an error. */
413 if (src == dst) {
414 addReply(c,shared.sameobjecterr);
415 return;
416 }
417
418 /* Check if the element exists and get a reference */
419 o = lookupKeyWrite(c->db,c->argv[1]);
420 if (!o) {
421 addReply(c,shared.czero);
422 return;
423 }
424
425 /* Return zero if the key already exists in the target DB */
426 if (lookupKeyWrite(dst,c->argv[1]) != NULL) {
427 addReply(c,shared.czero);
428 return;
429 }
430 dbAdd(dst,c->argv[1],o);
431 incrRefCount(o);
432
433 /* OK! key moved, free the entry in the source DB */
434 dbDelete(src,c->argv[1]);
435 server.dirty++;
436 addReply(c,shared.cone);
437 }
438
439 /*-----------------------------------------------------------------------------
440 * Expires API
441 *----------------------------------------------------------------------------*/
442
443 int removeExpire(redisDb *db, robj *key) {
444 /* An expire may only be removed if there is a corresponding entry in the
445 * main dict. Otherwise, the key will never be freed. */
446 redisAssertWithInfo(NULL,key,dictFind(db->dict,key->ptr) != NULL);
447 return dictDelete(db->expires,key->ptr) == DICT_OK;
448 }
449
450 void setExpire(redisDb *db, robj *key, long long when) {
451 dictEntry *kde, *de;
452
453 /* Reuse the sds from the main dict in the expire dict */
454 kde = dictFind(db->dict,key->ptr);
455 redisAssertWithInfo(NULL,key,kde != NULL);
456 de = dictReplaceRaw(db->expires,dictGetKey(kde));
457 dictSetSignedIntegerVal(de,when);
458 }
459
460 /* Return the expire time of the specified key, or -1 if no expire
461 * is associated with this key (i.e. the key is non volatile) */
462 long long getExpire(redisDb *db, robj *key) {
463 dictEntry *de;
464
465 /* No expire? return ASAP */
466 if (dictSize(db->expires) == 0 ||
467 (de = dictFind(db->expires,key->ptr)) == NULL) return -1;
468
469 /* The entry was found in the expire dict, this means it should also
470 * be present in the main dict (safety check). */
471 redisAssertWithInfo(NULL,key,dictFind(db->dict,key->ptr) != NULL);
472 return dictGetSignedIntegerVal(de);
473 }
474
475 /* Propagate expires into slaves and the AOF file.
476 * When a key expires in the master, a DEL operation for this key is sent
477 * to all the slaves and the AOF file if enabled.
478 *
479 * This way the key expiry is centralized in one place, and since both
480 * AOF and the master->slave link guarantee operation ordering, everything
481 * will be consistent even if we allow write operations against expiring
482 * keys. */
483 void propagateExpire(redisDb *db, robj *key) {
484 robj *argv[2];
485
486 argv[0] = createStringObject("DEL",3);
487 argv[1] = key;
488 incrRefCount(key);
489
490 if (server.aof_state != REDIS_AOF_OFF)
491 feedAppendOnlyFile(server.delCommand,db->id,argv,2);
492 if (listLength(server.slaves))
493 replicationFeedSlaves(server.slaves,db->id,argv,2);
494
495 decrRefCount(argv[0]);
496 decrRefCount(argv[1]);
497 }
498
499 int expireIfNeeded(redisDb *db, robj *key) {
500 long long when = getExpire(db,key);
501
502 if (when < 0) return 0; /* No expire for this key */
503
504 /* Don't expire anything while loading. It will be done later. */
505 if (server.loading) return 0;
506
507 /* If we are running in the context of a slave, return ASAP:
508 * the slave key expiration is controlled by the master that will
509 * send us synthesized DEL operations for expired keys.
510 *
511 * Still we try to return the right information to the caller,
512 * that is, 0 if we think the key should be still valid, 1 if
513 * we think the key is expired at this time. */
514 if (server.masterhost != NULL) {
515 return time(NULL) > when;
516 }
517
518 /* Return when this key has not expired */
519 if (mstime() <= when) return 0;
520
521 /* Delete the key */
522 server.stat_expiredkeys++;
523 propagateExpire(db,key);
524 return dbDelete(db,key);
525 }
526
527 /*-----------------------------------------------------------------------------
528 * Expires Commands
529 *----------------------------------------------------------------------------*/
530
531 /* Given an string object return true if it contains exactly the "ms"
532 * or "MS" string. This is used in order to check if the last argument
533 * of EXPIRE, EXPIREAT or TTL is "ms" to switch into millisecond input/output */
534 int stringObjectEqualsMs(robj *a) {
535 char *arg = a->ptr;
536 return tolower(arg[0]) == 'm' && tolower(arg[1]) == 's' && arg[2] == '\0';
537 }
538
539 void expireGenericCommand(redisClient *c, long long offset, int unit) {
540 dictEntry *de;
541 robj *key = c->argv[1], *param = c->argv[2];
542 long long milliseconds;
543
544 if (getLongLongFromObjectOrReply(c, param, &milliseconds, NULL) != REDIS_OK)
545 return;
546
547 if (unit == UNIT_SECONDS) milliseconds *= 1000;
548 milliseconds -= offset;
549
550 de = dictFind(c->db->dict,key->ptr);
551 if (de == NULL) {
552 addReply(c,shared.czero);
553 return;
554 }
555 /* EXPIRE with negative TTL, or EXPIREAT with a timestamp into the past
556 * should never be executed as a DEL when load the AOF or in the context
557 * of a slave instance.
558 *
559 * Instead we take the other branch of the IF statement setting an expire
560 * (possibly in the past) and wait for an explicit DEL from the master. */
561 if (milliseconds <= 0 && !server.loading && !server.masterhost) {
562 robj *aux;
563
564 redisAssertWithInfo(c,key,dbDelete(c->db,key));
565 server.dirty++;
566
567 /* Replicate/AOF this as an explicit DEL. */
568 aux = createStringObject("DEL",3);
569 rewriteClientCommandVector(c,2,aux,key);
570 decrRefCount(aux);
571 signalModifiedKey(c->db,key);
572 addReply(c, shared.cone);
573 return;
574 } else {
575 long long when = mstime()+milliseconds;
576 setExpire(c->db,key,when);
577 addReply(c,shared.cone);
578 signalModifiedKey(c->db,key);
579 server.dirty++;
580 return;
581 }
582 }
583
584 void expireCommand(redisClient *c) {
585 expireGenericCommand(c,0,UNIT_SECONDS);
586 }
587
588 void expireatCommand(redisClient *c) {
589 expireGenericCommand(c,mstime(),UNIT_SECONDS);
590 }
591
592 void pexpireCommand(redisClient *c) {
593 expireGenericCommand(c,0,UNIT_MILLISECONDS);
594 }
595
596 void pexpireatCommand(redisClient *c) {
597 expireGenericCommand(c,mstime(),UNIT_MILLISECONDS);
598 }
599
600 void ttlGenericCommand(redisClient *c, int output_ms) {
601 long long expire, ttl = -1;
602
603 expire = getExpire(c->db,c->argv[1]);
604 if (expire != -1) {
605 ttl = expire-mstime();
606 if (ttl < 0) ttl = -1;
607 }
608 if (ttl == -1) {
609 addReplyLongLong(c,-1);
610 } else {
611 addReplyLongLong(c,output_ms ? ttl : ((ttl+500)/1000));
612 }
613 }
614
615 void ttlCommand(redisClient *c) {
616 ttlGenericCommand(c, 0);
617 }
618
619 void pttlCommand(redisClient *c) {
620 ttlGenericCommand(c, 1);
621 }
622
623 void persistCommand(redisClient *c) {
624 dictEntry *de;
625
626 de = dictFind(c->db->dict,c->argv[1]->ptr);
627 if (de == NULL) {
628 addReply(c,shared.czero);
629 } else {
630 if (removeExpire(c->db,c->argv[1])) {
631 addReply(c,shared.cone);
632 server.dirty++;
633 } else {
634 addReply(c,shared.czero);
635 }
636 }
637 }
638
639 /* -----------------------------------------------------------------------------
640 * API to get key arguments from commands
641 * ---------------------------------------------------------------------------*/
642
643 int *getKeysUsingCommandTable(struct redisCommand *cmd,robj **argv, int argc, int *numkeys) {
644 int j, i = 0, last, *keys;
645 REDIS_NOTUSED(argv);
646
647 if (cmd->firstkey == 0) {
648 *numkeys = 0;
649 return NULL;
650 }
651 last = cmd->lastkey;
652 if (last < 0) last = argc+last;
653 keys = zmalloc(sizeof(int)*((last - cmd->firstkey)+1));
654 for (j = cmd->firstkey; j <= last; j += cmd->keystep) {
655 redisAssert(j < argc);
656 keys[i++] = j;
657 }
658 *numkeys = i;
659 return keys;
660 }
661
662 int *getKeysFromCommand(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
663 if (cmd->getkeys_proc) {
664 return cmd->getkeys_proc(cmd,argv,argc,numkeys,flags);
665 } else {
666 return getKeysUsingCommandTable(cmd,argv,argc,numkeys);
667 }
668 }
669
670 void getKeysFreeResult(int *result) {
671 zfree(result);
672 }
673
674 int *noPreloadGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
675 if (flags & REDIS_GETKEYS_PRELOAD) {
676 *numkeys = 0;
677 return NULL;
678 } else {
679 return getKeysUsingCommandTable(cmd,argv,argc,numkeys);
680 }
681 }
682
683 int *renameGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
684 if (flags & REDIS_GETKEYS_PRELOAD) {
685 int *keys = zmalloc(sizeof(int));
686 *numkeys = 1;
687 keys[0] = 1;
688 return keys;
689 } else {
690 return getKeysUsingCommandTable(cmd,argv,argc,numkeys);
691 }
692 }
693
694 int *zunionInterGetKeys(struct redisCommand *cmd,robj **argv, int argc, int *numkeys, int flags) {
695 int i, num, *keys;
696 REDIS_NOTUSED(cmd);
697 REDIS_NOTUSED(flags);
698
699 num = atoi(argv[2]->ptr);
700 /* Sanity check. Don't return any key if the command is going to
701 * reply with syntax error. */
702 if (num > (argc-3)) {
703 *numkeys = 0;
704 return NULL;
705 }
706 keys = zmalloc(sizeof(int)*num);
707 for (i = 0; i < num; i++) keys[i] = 3+i;
708 *numkeys = num;
709 return keys;
710 }
711
712 /* Slot to Key API. This is used by Redis Cluster in order to obtain in
713 * a fast way a key that belongs to a specified hash slot. This is useful
714 * while rehashing the cluster. */
715 void SlotToKeyAdd(robj *key) {
716 unsigned int hashslot = keyHashSlot(key->ptr,sdslen(key->ptr));
717
718 zslInsert(server.cluster.slots_to_keys,hashslot,key);
719 incrRefCount(key);
720 }
721
722 void SlotToKeyDel(robj *key) {
723 unsigned int hashslot = keyHashSlot(key->ptr,sdslen(key->ptr));
724
725 zslDelete(server.cluster.slots_to_keys,hashslot,key);
726 }
727
728 unsigned int GetKeysInSlot(unsigned int hashslot, robj **keys, unsigned int count) {
729 zskiplistNode *n;
730 zrangespec range;
731 int j = 0;
732
733 range.min = range.max = hashslot;
734 range.minex = range.maxex = 0;
735
736 n = zslFirstInRange(server.cluster.slots_to_keys, range);
737 while(n && n->score == hashslot && count--) {
738 keys[j++] = n->obj;
739 n = n->level[0].forward;
740 }
741 return j;
742 }