If the percentage of used slots in the HT reaches HASHTABLE_MIN_FILL * we resize the hash table to save memory */
| 1562 | /* If the percentage of used slots in the HT reaches HASHTABLE_MIN_FILL |
| 1563 | * we resize the hash table to save memory */ |
| 1564 | void tryResizeHashTables(int dbid) { |
| 1565 | if (htNeedsResize(server.db[dbid].dict)) |
| 1566 | dictResize(server.db[dbid].dict); |
| 1567 | if (htNeedsResize(server.db[dbid].expires)) |
| 1568 | dictResize(server.db[dbid].expires); |
| 1569 | } |
| 1570 | |
| 1571 | /* Our hash table implementation performs rehashing incrementally while |
| 1572 | * we write/read from the hash table. Still if the server is idle, the hash |
no test coverage detected