libbpf: Fix possible compiler warnings in hashmap

The hashmap__for_each_entry[_safe] is accessing 'map' as a pointer.
But it does without parentheses so passing a static hash map with an
ampersand (like '&slab_hash') will cause compiler warnings due
to unmatched types as '->' operator has a higher precedence.

Signed-off-by: Namhyung Kim <namhyung@kernel.org>
Signed-off-by: Andrii Nakryiko <andrii@kernel.org>
Link: https://lore.kernel.org/bpf/20241011170021.1490836-1-namhyung@kernel.org

diff --git a/tools/lib/bpf/hashmap.h b/tools/lib/bpf/hashmap.h
index c12f8320e6682d50d0ec6a12e3e4d15802b9972c..0c4f155e8eb745d9179bb1dbc43b2dac46c71895 100644 (file)
--- a/tools/lib/bpf/hashmap.h
+++ b/tools/lib/bpf/hashmap.h
@@ -166,8 +166,8 @@ bool hashmap_find(const struct hashmap *map, long key, long *value);
  * @bkt: integer used as a bucket loop cursor
  */
 #define hashmap__for_each_entry(map, cur, bkt)                             \
-       for (bkt = 0; bkt < map->cap; bkt++)                                \
-               for (cur = map->buckets[bkt]; cur; cur = cur->next)
+       for (bkt = 0; bkt < (map)->cap; bkt++)                              \
+               for (cur = (map)->buckets[bkt]; cur; cur = cur->next)
 
 /*
  * hashmap__for_each_entry_safe - iterate over all entries in hashmap, safe
@@ -178,8 +178,8 @@ bool hashmap_find(const struct hashmap *map, long key, long *value);
  * @bkt: integer used as a bucket loop cursor
  */
 #define hashmap__for_each_entry_safe(map, cur, tmp, bkt)                   \
-       for (bkt = 0; bkt < map->cap; bkt++)                                \
-               for (cur = map->buckets[bkt];                               \
+       for (bkt = 0; bkt < (map)->cap; bkt++)                              \
+               for (cur = (map)->buckets[bkt];                             \
                     cur && ({tmp = cur->next; true; });                    \
                     cur = tmp)
 
@@ -190,19 +190,19 @@ bool hashmap_find(const struct hashmap *map, long key, long *value);
  * @key: key to iterate entries for
  */
 #define hashmap__for_each_key_entry(map, cur, _key)                        \
-       for (cur = map->buckets                                             \
-                    ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
+       for (cur = (map)->buckets                                           \
+                    ? (map)->buckets[hash_bits((map)->hash_fn((_key), (map)->ctx), (map)->cap_bits)] \
                     : NULL;                                                \
             cur;                                                           \
             cur = cur->next)                                               \
-               if (map->equal_fn(cur->key, (_key), map->ctx))
+               if ((map)->equal_fn(cur->key, (_key), (map)->ctx))
 
 #define hashmap__for_each_key_entry_safe(map, cur, tmp, _key)              \
-       for (cur = map->buckets                                             \
-                    ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
+       for (cur = (map)->buckets                                           \
+                    ? (map)->buckets[hash_bits((map)->hash_fn((_key), (map)->ctx), (map)->cap_bits)] \
                     : NULL;                                                \
             cur && ({ tmp = cur->next; true; });                           \
             cur = tmp)                                                     \
-               if (map->equal_fn(cur->key, (_key), map->ctx))
+               if ((map)->equal_fn(cur->key, (_key), (map)->ctx))
 
 #endif /* __LIBBPF_HASHMAP_H */