aaru-dps/libaaruformat
1
0
Fork 0
mirror of https://github.com/aaru-dps/libaaruformat.git synced 2026-02-04 05:24:56 +00:00
Code Issues 3 Packages Projects Releases Wiki Activity

Enhance hash map resizing logic with intelligent size calculation for large maps

Browse Source
This commit is contained in:
Natalia Portillo
2025-12-30 11:12:22 +00:00
parent 3385caac5d
commit 42aedc4bcf
1 changed files with 32 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
src/ddt/hash_map.c
View File

@@ -22,8 +22,10 @@
#include "hash_map.h"
#define INITIAL_SIZE 1024
#define LOAD_FACTOR 0.75
#define INITIAL_SIZE 1024
#define LOAD_FACTOR 0.75
#define LARGE_MAP_THRESHOLD (2ULL * 1024 * 1024 * 1024 / sizeof(kv_pair_t)) // ~2GB worth of entries
#define LARGE_GROWTH_FACTOR 1.25 // 25% growth for large maps
/**
* @brief Creates a new hash map with the specified initial size.
@@ -79,6 +81,32 @@ void free_map(hash_map_t *map)
free(map);
}
/**
* @brief Calculates the new size for hash map resizing.
*
* This function implements intelligent size calculation based on the current map size.
* For small to medium maps (below ~2GB), it doubles the size for fast growth.
* For large maps (at or above ~2GB), it uses a smaller growth factor (25%) to avoid
* excessive memory allocation.
*
* @param current_size The current size of the hash table.
*
* @return The calculated new size for the hash table.
*
* @note For maps below LARGE_MAP_THRESHOLD, size doubles (2x growth).
* @note For maps at or above LARGE_MAP_THRESHOLD, size grows by 25% (1.25x growth).
* @note This is a static (internal) function and should not be called directly.
*
* @see resize_map()
* @see insert_map()
*/
static size_t calculate_new_size(size_t current_size)
{
if(current_size < LARGE_MAP_THRESHOLD) return current_size * 2;
return (size_t)((double)current_size * LARGE_GROWTH_FACTOR);
}
/**
* @brief Resizes the hash map to a new size and rehashes all entries.
*
@@ -100,6 +128,7 @@ void free_map(hash_map_t *map)
* @warning If memory allocation for the new table fails, the program may terminate.
*
* @see insert_map()
* @see calculate_new_size()
*/
static void resize_map(hash_map_t *map, size_t new_size)
{
@@ -155,7 +184,7 @@ static void resize_map(hash_map_t *map, size_t new_size)
*/
bool insert_map(hash_map_t *map, uint64_t key, uint64_t value)
{
if((double)map->count / map->size > LOAD_FACTOR) resize_map(map, map->size * 2);
if((double)map->count / map->size > LOAD_FACTOR) resize_map(map, calculate_new_size(map->size));
size_t idx = key % map->size;