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