GNUnet  0.10.x
Data Structures | Macros | Functions
container_multihashmap.c File Reference

hash map where the same key may be present multiple times More...

#include "platform.h"
#include "gnunet_container_lib.h"
Include dependency graph for container_multihashmap.c:

Go to the source code of this file.

Data Structures

struct  BigMapEntry
 An entry in the hash map with the full key. More...
 
struct  SmallMapEntry
 An entry in the hash map with just a pointer to the key. More...
 
union  MapEntry
 Entry in the map. More...
 
struct  GNUNET_CONTAINER_MultiHashMap
 Internal representation of the hash map. More...
 
struct  GNUNET_CONTAINER_MultiHashMapIterator
 Cursor into a multihashmap. More...
 

Macros

#define LOG(kind, ...)   GNUNET_log_from(kind, "util-container-multihashmap", __VA_ARGS__)
 
#define NEXT_CACHE_SIZE   16
 Maximum recursion depth for callbacks of GNUNET_CONTAINER_multihashmap_get_multiple() themselve s again calling GNUNET_CONTAINER_multihashmap_get_multiple(). More...
 

Functions

struct GNUNET_CONTAINER_MultiHashMapGNUNET_CONTAINER_multihashmap_create (unsigned int len, int do_not_copy_keys)
 Create a multi hash map. More...
 
void GNUNET_CONTAINER_multihashmap_destroy (struct GNUNET_CONTAINER_MultiHashMap *map)
 Destroy a hash map. More...
 
static unsigned int idx_of (const struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key)
 Compute the index of the bucket for the given key. More...
 
unsigned int GNUNET_CONTAINER_multihashmap_size (const struct GNUNET_CONTAINER_MultiHashMap *map)
 Get the number of key-value pairs in the map. More...
 
void * GNUNET_CONTAINER_multihashmap_get (const struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key)
 Given a key find a value in the map matching the key. More...
 
int GNUNET_CONTAINER_multihashmap_iterate (struct GNUNET_CONTAINER_MultiHashMap *map, GNUNET_CONTAINER_MulitHashMapIteratorCallback it, void *it_cls)
 Iterate over all entries in the map. More...
 
static void update_next_cache_bme (struct GNUNET_CONTAINER_MultiHashMap *map, const struct BigMapEntry *bme)
 We are about to free() the bme, make sure it is not in the list of next values for any iterator in the map's next_cache. More...
 
static void update_next_cache_sme (struct GNUNET_CONTAINER_MultiHashMap *map, const struct SmallMapEntry *sme)
 We are about to free() the sme, make sure it is not in the list of next values for any iterator in the map's next_cache. More...
 
int GNUNET_CONTAINER_multihashmap_remove (struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, const void *value)
 Remove the given key-value pair from the map. More...
 
int GNUNET_CONTAINER_multihashmap_remove_all (struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key)
 Remove all entries for the given key from the map. More...
 
static int remove_all (void *cls, const struct GNUNET_HashCode *key, void *value)
 Callback used to remove all entries from the map. More...
 
unsigned int GNUNET_CONTAINER_multihashmap_clear (struct GNUNET_CONTAINER_MultiHashMap *map)
 Remove all entries from the map. More...
 
int GNUNET_CONTAINER_multihashmap_contains (const struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key)
 Check if the map contains any value under the given key (including values that are NULL). More...
 
int GNUNET_CONTAINER_multihashmap_contains_value (const struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, const void *value)
 Check if the map contains the given value under the given key. More...
 
static void grow (struct GNUNET_CONTAINER_MultiHashMap *map)
 Grow the given map to a more appropriate size. More...
 
int GNUNET_CONTAINER_multihashmap_put (struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
 Store a key-value pair in the map. More...
 
int GNUNET_CONTAINER_multihashmap_get_multiple (struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, GNUNET_CONTAINER_MulitHashMapIteratorCallback it, void *it_cls)
 Iterate over all entries in the map that match a particular key. More...
 
unsigned int GNUNET_CONTAINER_multihashmap_get_random (const struct GNUNET_CONTAINER_MultiHashMap *map, GNUNET_CONTAINER_MulitHashMapIteratorCallback it, void *it_cls)
 Call it on a random value from the map, or not at all if the map is empty. More...
 
struct GNUNET_CONTAINER_MultiHashMapIteratorGNUNET_CONTAINER_multihashmap_iterator_create (const struct GNUNET_CONTAINER_MultiHashMap *map)
 Create an iterator for a multihashmap. More...
 
int GNUNET_CONTAINER_multihashmap_iterator_next (struct GNUNET_CONTAINER_MultiHashMapIterator *iter, struct GNUNET_HashCode *key, const void **value)
 Retrieve the next element from the hash map at the iterator's position. More...
 
void GNUNET_CONTAINER_multihashmap_iterator_destroy (struct GNUNET_CONTAINER_MultiHashMapIterator *iter)
 Destroy a multihashmap iterator. More...
 

Detailed Description

hash map where the same key may be present multiple times

Author
Christian Grothoff

Definition in file container_multihashmap.c.

Macro Definition Documentation

◆ LOG

#define LOG (   kind,
  ... 
)    GNUNET_log_from(kind, "util-container-multihashmap", __VA_ARGS__)

Definition at line 29 of file container_multihashmap.c.

◆ NEXT_CACHE_SIZE

#define NEXT_CACHE_SIZE   16

Maximum recursion depth for callbacks of GNUNET_CONTAINER_multihashmap_get_multiple() themselve s again calling GNUNET_CONTAINER_multihashmap_get_multiple().

Should be totally excessive, but if violated we die.

Definition at line 38 of file container_multihashmap.c.

Referenced by GNUNET_CONTAINER_multihashmap_get_multiple(), and GNUNET_CONTAINER_multihashmap_iterate().

Function Documentation

◆ idx_of()

static unsigned int idx_of ( const struct GNUNET_CONTAINER_MultiHashMap map,
const struct GNUNET_HashCode key 
)
static

Compute the index of the bucket for the given key.

Parameters
maphash map for which to compute the index
keywhat key should the index be computed for
Returns
offset into the "map" array of "map"

Definition at line 279 of file container_multihashmap.c.

References GNUNET_assert, and GNUNET_CONTAINER_MultiHashMap::map_length.

Referenced by GNUNET_CONTAINER_multihashmap_contains(), GNUNET_CONTAINER_multihashmap_contains_value(), GNUNET_CONTAINER_multihashmap_get(), GNUNET_CONTAINER_multihashmap_get_multiple(), GNUNET_CONTAINER_multihashmap_put(), GNUNET_CONTAINER_multihashmap_remove(), GNUNET_CONTAINER_multihashmap_remove_all(), and grow().

281 {
282  GNUNET_assert(map != NULL);
283  return (*(unsigned int *)key) % map->map_length;
284 }
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
unsigned int map_length
Length of the "map" array.
Here is the caller graph for this function:

◆ update_next_cache_bme()

static void update_next_cache_bme ( struct GNUNET_CONTAINER_MultiHashMap map,
const struct BigMapEntry bme 
)
static

We are about to free() the bme, make sure it is not in the list of next values for any iterator in the map's next_cache.

Parameters
mapthe map to check
bmethe entry that is about to be free'd

Definition at line 419 of file container_multihashmap.c.

References MapEntry::bme, BigMapEntry::next, GNUNET_CONTAINER_MultiHashMap::next_cache, and GNUNET_CONTAINER_MultiHashMap::next_cache_off.

Referenced by GNUNET_CONTAINER_multihashmap_remove(), and GNUNET_CONTAINER_multihashmap_remove_all().

421 {
422  for (unsigned int i = 0; i < map->next_cache_off; i++)
423  if (map->next_cache[i].bme == bme)
424  map->next_cache[i].bme = bme->next;
425 }
unsigned int next_cache_off
Offset of next_cache entries in use, must be smaller than NEXT_CACHE_SIZE.
union MapEntry next_cache[16]
Map entries indicating iteration positions currently in use by GNUNET_CONTAINER_multihashmap_get_mult...
struct BigMapEntry * next
If there is a hash collision, we create a linked list.
struct BigMapEntry * bme
Variant used if map entries contain the full key.
Here is the caller graph for this function:

◆ update_next_cache_sme()

static void update_next_cache_sme ( struct GNUNET_CONTAINER_MultiHashMap map,
const struct SmallMapEntry sme 
)
static

We are about to free() the sme, make sure it is not in the list of next values for any iterator in the map's next_cache.

Parameters
mapthe map to check
smethe entry that is about to be free'd

Definition at line 436 of file container_multihashmap.c.

References SmallMapEntry::next, GNUNET_CONTAINER_MultiHashMap::next_cache, GNUNET_CONTAINER_MultiHashMap::next_cache_off, and MapEntry::sme.

Referenced by GNUNET_CONTAINER_multihashmap_remove(), and GNUNET_CONTAINER_multihashmap_remove_all().

438 {
439  for (unsigned int i = 0; i < map->next_cache_off; i++)
440  if (map->next_cache[i].sme == sme)
441  map->next_cache[i].sme = sme->next;
442 }
struct SmallMapEntry * next
If there is a hash collision, we create a linked list.
unsigned int next_cache_off
Offset of next_cache entries in use, must be smaller than NEXT_CACHE_SIZE.
struct SmallMapEntry * sme
Variant used if map entries only contain a pointer to the key.
union MapEntry next_cache[16]
Map entries indicating iteration positions currently in use by GNUNET_CONTAINER_multihashmap_get_mult...
Here is the caller graph for this function:

◆ remove_all()

static int remove_all ( void *  cls,
const struct GNUNET_HashCode key,
void *  value 
)
static

Callback used to remove all entries from the map.

Parameters
clsthe struct GNUNET_CONTAINER_MultiHashMap
keythe key
valuethe value
Returns
GNUNET_OK (continue to iterate)

Definition at line 611 of file container_multihashmap.c.

References GNUNET_assert, GNUNET_CONTAINER_multihashmap_remove(), GNUNET_OK, GNUNET_YES, and map.

Referenced by GNUNET_CONTAINER_multihashmap_clear().

612 {
613  struct GNUNET_CONTAINER_MultiHashMap *map = cls;
614 
617  return GNUNET_OK;
618 }
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
Internal representation of the hash map.
static struct GNUNET_CONTAINER_MultiPeerMap * map
Handle to the map used to store old latency values for peers.
static char * value
Value of the record to add/remove.
int GNUNET_CONTAINER_multihashmap_remove(struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, const void *value)
Remove the given key-value pair from the map.
#define GNUNET_YES
Definition: gnunet_common.h:77
Here is the call graph for this function:
Here is the caller graph for this function:

◆ grow()

static void grow ( struct GNUNET_CONTAINER_MultiHashMap map)
static

Grow the given map to a more appropriate size.

Parameters
mapthe hash map to grow

Definition at line 722 of file container_multihashmap.c.

References MapEntry::bme, GNUNET_assert, GNUNET_free, GNUNET_malloc_large, idx_of(), GNUNET_CONTAINER_MultiHashMap::map, GNUNET_CONTAINER_MultiHashMap::map_length, GNUNET_CONTAINER_MultiHashMap::modification_counter, BigMapEntry::next, SmallMapEntry::next, MapEntry::sme, and GNUNET_CONTAINER_MultiHashMap::use_small_entries.

Referenced by GNUNET_CONTAINER_multihashmap_put().

723 {
724  union MapEntry *old_map;
725  union MapEntry *new_map;
726  unsigned int old_len;
727  unsigned int new_len;
728  unsigned int idx;
729 
730  old_map = map->map;
731  old_len = map->map_length;
732  GNUNET_assert(0 != old_len);
733  new_len = old_len * 2;
734  if (0 == new_len) /* 2^31 * 2 == 0 */
735  new_len = old_len; /* never use 0 */
736  if (new_len == old_len)
737  return; /* nothing changed */
738  new_map = GNUNET_malloc_large(new_len * sizeof(union MapEntry));
739  if (NULL == new_map)
740  return; /* grow not possible */
741  map->modification_counter++;
742  map->map_length = new_len;
743  map->map = new_map;
744  for (unsigned int i = 0; i < old_len; i++)
745  {
746  if (map->use_small_entries)
747  {
748  struct SmallMapEntry *sme;
749 
750  while (NULL != (sme = old_map[i].sme))
751  {
752  old_map[i].sme = sme->next;
753  idx = idx_of(map, sme->key);
754  sme->next = new_map[idx].sme;
755  new_map[idx].sme = sme;
756  }
757  }
758  else
759  {
760  struct BigMapEntry *bme;
761 
762  while (NULL != (bme = old_map[i].bme))
763  {
764  old_map[i].bme = bme->next;
765  idx = idx_of(map, &bme->key);
766  bme->next = new_map[idx].bme;
767  new_map[idx].bme = bme;
768  }
769  }
770  }
771  GNUNET_free(old_map);
772 }
union MapEntry * map
All of our buckets.
struct SmallMapEntry * next
If there is a hash collision, we create a linked list.
unsigned int modification_counter
Counts the destructive modifications (grow, remove) to the map, so that iterators can check if they a...
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct SmallMapEntry * sme
Variant used if map entries only contain a pointer to the key.
#define GNUNET_malloc_large(size)
Wrapper around malloc.
struct BigMapEntry * next
If there is a hash collision, we create a linked list.
unsigned int map_length
Length of the "map" array.
Entry in the map.
int use_small_entries
GNUNET_NO if the map entries are of type &#39;struct BigMapEntry&#39;, GNUNET_YES if the map entries are of t...
static unsigned int idx_of(const struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key)
Compute the index of the bucket for the given key.
An entry in the hash map with just a pointer to the key.
An entry in the hash map with the full key.
struct BigMapEntry * bme
Variant used if map entries contain the full key.
#define GNUNET_free(ptr)
Wrapper around free.
Here is the call graph for this function:
Here is the caller graph for this function: