gvsafronov/futriix
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Use long for rehash and iterator index in dict.h.

Browse Source 
This allows to support datasets with more than 2 billion of keys
(possible in very large memory instances, this bug was actually
reported).

Closes issue #1814.
This commit is contained in:
antirez 2014-08-26 10:18:56 +02:00
parent 293348d0de
commit 064d5c96ac
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/dict.h
View File

@ -77,7 +77,7 @@ typedef struct dict {
dictType *type; dictType *type;
void *privdata; void *privdata;
dictht ht[2]; dictht ht[2];
int rehashidx; /* rehashing not in progress if rehashidx == -1 */ long rehashidx; /* rehashing not in progress if rehashidx == -1 */
int iterators; /* number of iterators currently running */ int iterators; /* number of iterators currently running */
} dict; } dict;
@ -87,9 +87,11 @@ typedef struct dict {
* should be called while iterating. */ * should be called while iterating. */
typedef struct dictIterator { typedef struct dictIterator {
dict *d; dict *d;
int table, index, safe; long index;
int table, safe;
dictEntry *entry, *nextEntry; dictEntry *entry, *nextEntry;
long long fingerprint; /* unsafe iterator fingerprint for misuse detection */ /* unsafe iterator fingerprint for misuse detection. */
long long fingerprint;
} dictIterator; } dictIterator;
typedef void (dictScanFunction)(void *privdata, const dictEntry *de); typedef void (dictScanFunction)(void *privdata, const dictEntry *de);