Method incrementallyRehash

src/server.cpp:1692–1700

Our hash table implementation performs rehashing incrementally while * we write/read from the hash table. Still if the server is idle, the hash * table will use two tables for a long time. So we try to use 1 millisecond * of CPU time at every call of this function to perform some rehashing. * * The function returns the number of rehashes if some rehashing was performed, otherwise 0 * is retu

 * The function returns the number of rehashes if some rehashing was performed, otherwise 0
 * is returned. */
int redisDbPersistentData::incrementallyRehash() {
    /* Keys dictionary */
    int result = 0;
    if (dictIsRehashing(m_pdict))
        result += dictRehashMilliseconds(m_pdict,1);
    if (dictIsRehashing(m_pdictTombstone))
        dictRehashMilliseconds(m_pdictTombstone,1); // don't count this
    return result; /* already used our millisecond for this loop... */
}

/* This function is called once a background process of some kind terminates,
 * as we want to avoid resizing the hash tables when there is a child in order