| /redis-3.2.3/src/ |
| H A D | quicklist.c | 638 entry->node, &entry->zi); in quicklistDelEntry()
672 entry.node->zl = ziplistDelete(entry.node->zl, &entry.zi); in quicklistReplaceAtIndex()
673 entry.node->zl = ziplistInsert(entry.node->zl, entry.zi, data, sz); in quicklistReplaceAtIndex()
1118 initEntry(entry); in quicklistNext()
1158 ziplistGet(entry->zi, &entry->value, &entry->sz, &entry->longval); in quicklistNext()
1263 entry->node = n; in quicklistIndex()
1274 entry->zi = ziplistIndex(entry->node->zl, entry->offset); in quicklistIndex()
1275 ziplistGet(entry->zi, &entry->value, &entry->sz, &entry->longval); in quicklistIndex()
1497 (char *)entry.value, entry.longval); in _itrprintr()
2312 i, entry.sz, entry.value, result[i]); in quicklistTest()
[all …]
|
| H A D | dict.h | 92 dictEntry *entry, *nextEntry; member
103 #define dictFreeVal(d, entry) \ argument
107 #define dictSetVal(d, entry, _val_) do { \ argument
111 entry->v.val = (_val_); \
115 do { entry->v.s64 = _val_; } while(0)
118 do { entry->v.u64 = _val_; } while(0)
120 #define dictSetDoubleVal(entry, _val_) \ argument
121 do { entry->v.d = _val_; } while(0)
123 #define dictFreeKey(d, entry) \ argument
127 #define dictSetKey(d, entry, _key_) do { \ argument
[all …]
|
| H A D | t_list.c | 116 entry->li = li; in listTypeNext()
118 return quicklistNext(li->iter, &entry->entry); in listTypeNext()
129 if (entry->entry.value) { in listTypeGet()
130 value = createStringObject((char *)entry->entry.value, in listTypeGet()
131 entry->entry.sz); in listTypeGet()
147 quicklistInsertAfter((quicklist *)entry->entry.quicklist, in listTypeInsert()
148 &entry->entry, str, len); in listTypeInsert()
150 quicklistInsertBefore((quicklist *)entry->entry.quicklist, in listTypeInsert()
151 &entry->entry, str, len); in listTypeInsert()
172 quicklistDelEntry(iter->iter, &entry->entry); in listTypeDelete()
[all …]
|
| H A D | ziplist.c | 870 zlentry entry; in ziplistGet() local
882 *sval = zipLoadInteger(p+entry.headersize,entry.encoding); in ziplistGet()
917 zlentry entry; in ziplistCompare() local
934 zval = zipLoadInteger(p+entry.headersize,entry.encoding); in ziplistCompare()
1028 zlentry entry; in ziplistRepr() local
1054 entry.headersize+entry.len, in ziplistRepr()
1058 entry.len); in ziplistRepr()
1252 if (entry) { in ziplistTest()
1284 if (entry) { in ziplistTest()
1302 if (entry) { in ziplistTest()
[all …]
|
| H A D | dict.c | 327 dictSetVal(d, entry, val); in dictAdd()
349 dictEntry *entry; in dictAddRaw() local
364 entry = zmalloc(sizeof(*entry)); in dictAddRaw()
366 ht->table[index] = entry; in dictAddRaw()
370 dictSetKey(d, entry, key); in dictAddRaw()
371 return entry; in dictAddRaw()
387 entry = dictFind(d, key); in dictReplace()
393 auxentry = *entry; in dictReplace()
408 return entry ? entry : dictAddRaw(d,key); in dictReplaceRaw()
566 iter->entry = NULL; in dictGetIterator()
[all …]
|
| H A D | sort.c | 355 listTypeEntry entry; in sortCommand() local
360 while(j < vectorlen && listTypeNext(li,&entry)) { in sortCommand()
361 vector[j].obj = listTypeGet(&entry); in sortCommand()
373 listTypeEntry entry; in sortCommand() local
374 while(listTypeNext(li,&entry)) { in sortCommand()
375 vector[j].obj = listTypeGet(&entry); in sortCommand()
|
| H A D | quicklist.h | 137 void quicklistDelEntry(quicklistIter *iter, quicklistEntry *entry);
148 quicklistEntry *entry);
|
| H A D | redis-cli.c | 277 redisReply *entry = reply->element[j]; in cliIntegrateHelp() local
278 char *cmdname = entry->element[0]->str; in cliIntegrateHelp()
302 int args = llabs(entry->element[1]->integer); in cliIntegrateHelp()
303 if (entry->element[3]->integer == 1) { in cliIntegrateHelp()
308 if (entry->element[1]->integer < 0) in cliIntegrateHelp()
352 helpEntry *entry; in cliOutputHelp() local
370 entry = &helpEntries[i]; in cliOutputHelp()
371 if (entry->type != CLI_HELP_COMMAND) continue; in cliOutputHelp()
373 help = entry->org; in cliOutputHelp()
376 if (argc == entry->argc) { in cliOutputHelp()
[all …]
|
| H A D | aof.c | 793 quicklistEntry entry; in rewriteListObject() local
795 while (quicklistNext(li,&entry)) { in rewriteListObject()
804 if (entry.value) { in rewriteListObject()
805 if (rioWriteBulkString(r,(char*)entry.value,entry.sz) == 0) return 0; in rewriteListObject()
807 if (rioWriteBulkLongLong(r,entry.longval) == 0) return 0; in rewriteListObject()
|
| H A D | scripting.c | 53 void ldbLog(sds entry);
1536 void ldbLog(sds entry) { in ldbLog() argument
1537 listAddNodeTail(ldb.logs,entry); in ldbLog()
1544 void ldbLogWithMaxLen(sds entry) { in ldbLogWithMaxLen() argument
1546 if (ldb.maxlen && sdslen(entry) > ldb.maxlen) { in ldbLogWithMaxLen()
1547 sdsrange(entry,0,ldb.maxlen-1); in ldbLogWithMaxLen()
1548 entry = sdscatlen(entry," ...",4); in ldbLogWithMaxLen()
1551 ldbLog(entry); in ldbLogWithMaxLen()
|
| H A D | server.h | 1034 quicklistEntry entry; /* Entry in quicklist */ member
1162 int listTypeNext(listTypeIterator *li, listTypeEntry *entry);
1163 robj *listTypeGet(listTypeEntry *entry);
1164 void listTypeInsert(listTypeEntry *entry, robj *value, int where);
1165 int listTypeEqual(listTypeEntry *entry, robj *o);
1166 void listTypeDelete(listTypeIterator *iter, listTypeEntry *entry);
|
| H A D | debug.c | 157 listTypeEntry entry; in computeDatasetDigest() local
158 while(listTypeNext(li,&entry)) { in computeDatasetDigest()
159 robj *eleobj = listTypeGet(&entry); in computeDatasetDigest()
|
| /redis-3.2.3/deps/hiredis/ |
| H A D | dict.h | 72 dictEntry *entry, *nextEntry; member
79 #define dictFreeEntryVal(ht, entry) \ argument
81 (ht)->type->valDestructor((ht)->privdata, (entry)->val)
83 #define dictSetHashVal(ht, entry, _val_) do { \ argument
85 entry->val = (ht)->type->valDup((ht)->privdata, _val_); \
87 entry->val = (_val_); \
90 #define dictFreeEntryKey(ht, entry) \ argument
92 (ht)->type->keyDestructor((ht)->privdata, (entry)->key)
94 #define dictSetHashKey(ht, entry, _key_) do { \ argument
96 entry->key = (ht)->type->keyDup((ht)->privdata, _key_); \
[all …]
|
| H A D | dict.c | 137 dictEntry *entry; in dictAdd() local
145 entry = malloc(sizeof(*entry)); in dictAdd()
146 entry->next = ht->table[index]; in dictAdd()
147 ht->table[index] = entry; in dictAdd()
161 dictEntry *entry, auxentry; in dictReplace() local
168 entry = dictFind(ht, key); in dictReplace()
175 auxentry = *entry; in dictReplace()
263 iter->entry = NULL; in dictGetIterator()
270 if (iter->entry == NULL) { in dictNext()
278 if (iter->entry) { in dictNext()
[all …]
|
| /redis-3.2.3/ |
| H A D | MANIFESTO | 19 all kinds of computers, including entry-level servers, is increasing
|