oidmap: make entry cleanup explicit in oidmap_clear
cover oidmap: make entry cleanup explicit in oidmap_clear
Hello,
This small patch improves the clarity and safety of oidmap cleanup by making entry destruction explicit in oidmap_clear().
Previously, oidmap_clear() implicitly relied on callers to understand how and when stored entries were freed. This change introduces an explicit cleanup path, making ownership and lifecycle of oidmap entries clearer and less error-prone.
In addition to the implementation change, unit tests are added to exercise the cleanup semantics and verify correct behavior during map teardown.
Thanks,
Seyi
Seyi Kufoiji (1):
oidmap: make entry cleanup explicit in oidmap_clear
oidmap.c | 23 ++++++++++++++++++++--- oidmap.h | 15 +++++++++++++++ t/unit-tests/u-oidmap.c | 41 +++++++++++++++++++++++++++++++++++++++++ 3 files changed, 76 insertions(+), 3 deletions(-)
Signature · 1 line
2.43.0
PATCH 1/1 oidmap: make entry cleanup explicit in oidmap_clear
Replace oidmap's use of hashmap_clear_() and layout-dependent freeing with an explicit iteration and optional free callback. This removes reliance on struct layout assumptions while keeping the existing API intact.
Add tests for oidmap_clear_with_free behavior. test_oidmap__clear_with_free_callback verifies that entries are freed when a callback is provided, while test_oidmap__clear_without_free_callback verifies that entries are not freed when no callback is given. These tests ensure the new clear implementation behaves correctly and preserves ownership semantics.
--- oidmap.c | 23 ++++++++++++++++++++--- oidmap.h | 15 +++++++++++++++ t/unit-tests/u-oidmap.c | 41 +++++++++++++++++++++++++++++++++++++++++ 3 files changed, 76 insertions(+), 3 deletions(-)
oidmap.c +20 -3
@@ -24,11 +24,28 @@ void oidmap_init(struct oidmap *map, size_t initial_size)void oidmap_clear (struct oidmap *map,int free_entries) { -if (!map) +oidmap_clear_with_free (map, + free_entries ? free :NULL ); +} + +void oidmap_clear_with_free (struct oidmap *map, +oidmap_free_fn free_fn) +{ +struct hashmap_iter iter; +struct hashmap_entry *e; + +if (!map || !map->map.cmpfn)return ; -/* TODO: make oidmap itself not depend on struct layouts */ -hashmap_clear_ (&map->map, free_entries ?0 :-1 ); +hashmap_iter_init (&map->map, &iter); +while ((e =hashmap_iter_next (&iter))) { +struct oidmap_entry *entry = + container_of(e, struct oidmap_entry, internal_entry); +if (free_fn) +free_fn (entry); + } + +hashmap_clear (&map->map); }void *oidmap_get (const struct oidmap *map,const struct object_id *key)
oidmap.h +15 -0
@@ -35,6 +35,21 @@ struct oidmap {*/ void oidmap_init (struct oidmap *map,size_t initial_size); +/* +* Function type for functions that free oidmap entries. +*/ +typedef void (*oidmap_free_fn )(void *); + +/* +* Clear an oidmap, freeing any allocated memory. The map is empty and +* can be reused without another explicit init. +* +* The `free_fn`, if not NULL, is called for each oidmap entry in the map +* to free any user data associated with the entry. +*/ +void oidmap_clear_with_free (struct oidmap *map, +oidmap_free_fn free_fn); +/* * Clear an oidmap, freeing any allocated memory. The map is empty and * can be reused without another explicit init.
t/unit-tests/u-oidmap.c +41 -0
50 lines not on this page · raw message
Signature · 1 line
2.43.0