summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--src/dict.c33
-rw-r--r--src/dict.h9
-rw-r--r--src/server.c11
3 files changed, 32 insertions, 21 deletions
diff --git a/src/dict.c b/src/dict.c
index 7fecb2daa..90fd4f52e 100644
--- a/src/dict.c
+++ b/src/dict.c
@@ -47,15 +47,15 @@
#include "zmalloc.h"
#include "redisassert.h"
-/* Using dictEnableResize() / dictDisableResize() we make possible to
- * enable/disable resizing of the hash table as needed. This is very important
+/* Using dictEnableResize() / dictDisableResize() we make possible to disable
+ * resizing and rehashing of the hash table as needed. This is very important
* for Redis, as we use copy-on-write and don't want to move too much memory
* around when there is a child performing saving operations.
*
* Note that even when dict_can_resize is set to 0, not all resizes are
* prevented: a hash table is still allowed to grow if the ratio between
* the number of elements and the buckets > dict_force_resize_ratio. */
-static int dict_can_resize = 1;
+static dictResizeEnable dict_can_resize = DICT_RESIZE_ENABLE;
static unsigned int dict_force_resize_ratio = 5;
/* -------------------------- private prototypes ---------------------------- */
@@ -127,7 +127,7 @@ int dictResize(dict *d)
{
unsigned long minimal;
- if (!dict_can_resize || dictIsRehashing(d)) return DICT_ERR;
+ if (dict_can_resize != DICT_RESIZE_ENABLE || dictIsRehashing(d)) return DICT_ERR;
minimal = d->ht_used[0];
if (minimal < DICT_HT_INITIAL_SIZE)
minimal = DICT_HT_INITIAL_SIZE;
@@ -210,7 +210,12 @@ int dictTryExpand(dict *d, unsigned long size) {
* work it does would be unbound and the function may block for a long time. */
int dictRehash(dict *d, int n) {
int empty_visits = n*10; /* Max number of empty buckets to visit. */
- if (!dictIsRehashing(d)) return 0;
+ if (dict_can_resize == DICT_RESIZE_FORBID || !dictIsRehashing(d)) return 0;
+ if (dict_can_resize == DICT_RESIZE_AVOID &&
+ (DICTHT_SIZE(d->ht_size_exp[1]) / DICTHT_SIZE(d->ht_size_exp[0]) < dict_force_resize_ratio))
+ {
+ return 0;
+ }
while(n-- && d->ht_used[0] != 0) {
dictEntry *de, *nextde;
@@ -1072,10 +1077,12 @@ static int _dictExpandIfNeeded(dict *d)
* table (global setting) or we should avoid it but the ratio between
* elements/buckets is over the "safe" threshold, we resize doubling
* the number of buckets. */
- if (d->ht_used[0] >= DICTHT_SIZE(d->ht_size_exp[0]) &&
- (dict_can_resize ||
- d->ht_used[0]/ DICTHT_SIZE(d->ht_size_exp[0]) > dict_force_resize_ratio) &&
- dictTypeExpandAllowed(d))
+ if (!dictTypeExpandAllowed(d))
+ return DICT_OK;
+ if ((dict_can_resize == DICT_RESIZE_ENABLE &&
+ d->ht_used[0] >= DICTHT_SIZE(d->ht_size_exp[0])) ||
+ (dict_can_resize != DICT_RESIZE_FORBID &&
+ d->ht_used[0] / DICTHT_SIZE(d->ht_size_exp[0]) > dict_force_resize_ratio))
{
return dictExpand(d, d->ht_used[0] + 1);
}
@@ -1135,12 +1142,8 @@ void dictEmpty(dict *d, void(callback)(dict*)) {
d->pauserehash = 0;
}
-void dictEnableResize(void) {
- dict_can_resize = 1;
-}
-
-void dictDisableResize(void) {
- dict_can_resize = 0;
+void dictSetResizeEnabled(dictResizeEnable enable) {
+ dict_can_resize = enable;
}
uint64_t dictGetHash(dict *d, const void *key) {
diff --git a/src/dict.h b/src/dict.h
index 16f576ffd..00b721d3d 100644
--- a/src/dict.h
+++ b/src/dict.h
@@ -179,6 +179,12 @@ typedef void (dictScanBucketFunction)(dict *d, dictEntry **bucketref);
#define randomULong() random()
#endif
+typedef enum {
+ DICT_RESIZE_ENABLE,
+ DICT_RESIZE_AVOID,
+ DICT_RESIZE_FORBID,
+} dictResizeEnable;
+
/* API */
dict *dictCreate(dictType *type);
int dictExpand(dict *d, unsigned long size);
@@ -210,8 +216,7 @@ void dictGetStats(char *buf, size_t bufsize, dict *d);
uint64_t dictGenHashFunction(const void *key, size_t len);
uint64_t dictGenCaseHashFunction(const unsigned char *buf, size_t len);
void dictEmpty(dict *d, void(callback)(dict*));
-void dictEnableResize(void);
-void dictDisableResize(void);
+void dictSetResizeEnabled(dictResizeEnable enable);
int dictRehash(dict *d, int n);
int dictRehashMilliseconds(dict *d, int ms);
void dictSetHashFunctionSeed(uint8_t *seed);
diff --git a/src/server.c b/src/server.c
index f01e7382d..ae83ec25c 100644
--- a/src/server.c
+++ b/src/server.c
@@ -622,13 +622,15 @@ int incrementallyRehash(int dbid) {
* as we want to avoid resizing the hash tables when there is a child in order
* to play well with copy-on-write (otherwise when a resize happens lots of
* memory pages are copied). The goal of this function is to update the ability
- * for dict.c to resize the hash tables accordingly to the fact we have an
+ * for dict.c to resize or rehash the tables accordingly to the fact we have an
* active fork child running. */
void updateDictResizePolicy(void) {
- if (!hasActiveChildProcess())
- dictEnableResize();
+ if (server.in_fork_child != CHILD_TYPE_NONE)
+ dictSetResizeEnabled(DICT_RESIZE_FORBID);
+ else if (hasActiveChildProcess())
+ dictSetResizeEnabled(DICT_RESIZE_AVOID);
else
- dictDisableResize();
+ dictSetResizeEnabled(DICT_RESIZE_ENABLE);
}
const char *strChildType(int type) {
@@ -6496,6 +6498,7 @@ int redisFork(int purpose) {
server.in_fork_child = purpose;
setupChildSignalHandlers();
setOOMScoreAdj(CONFIG_OOM_BGCHILD);
+ updateDictResizePolicy();
dismissMemoryInChild();
closeChildUnusedResourceAfterFork();
/* Close the reading part, so that if the parent crashes, the child will