This function performs just a step of rehashing, and only if hashing has * not been paused for our hash table. When we have iterators in the * middle of a rehashing we can't mess with the two hash tables otherwise * some element can be missed or duplicated. * * This function is called by common lookup or update operations in the * dictionary so that the hash table automatically migrates from
| 285 | * dictionary so that the hash table automatically migrates from H1 to H2 |
| 286 | * while it is actively used. */ |
| 287 | static void _dictRehashStep(dict *d) { |
| 288 | if (d->pauserehash == 0) dictRehash(d,1); |
| 289 | } |
| 290 | |
| 291 | /* Add an element to the target hash table */ |
| 292 | int dictAdd(dict *d, void *key, void *val) |
no test coverage detected