2 This file is part of GNUnet.
3 (C) 2001-2013 Christian Grothoff (and other contributing authors)
5 GNUnet is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published
7 by the Free Software Foundation; either version 3, or (at your
8 option) any later version.
10 GNUnet is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with GNUnet; see the file COPYING. If not, write to the
17 Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 Boston, MA 02111-1307, USA.
22 * @file include/gnunet_container_lib.h
23 * @brief container classes for GNUnet
24 * @author Christian Grothoff
26 * @defgroup hashmap multi hash-map
27 * @defgroup heap min- or max-heap with arbitrary element removal
28 * @defgroup bloomfilter Bloom filter (probabilistic set tests)
29 * @defgroup dll Doubly-linked list
30 * @defgroup metadata Meta data (GNU libextractor key-value pairs)
33 #ifndef GNUNET_CONTAINER_LIB_H
34 #define GNUNET_CONTAINER_LIB_H
36 /* add error and config prototypes */
37 #include "gnunet_crypto_lib.h"
38 #include <extractor.h>
40 #ifndef EXTRACTOR_METATYPE_GNUNET_ORIGINAL_FILENAME
41 /* hack for LE < 0.6.3 */
42 #define EXTRACTOR_METATYPE_GNUNET_ORIGINAL_FILENAME 180
48 #if 0 /* keep Emacsens' auto-indent happy */
54 /* ******************* bloomfilter ***************** */
57 * @brief bloomfilter representation (opaque)
58 * @ingroup bloomfilter
60 struct GNUNET_CONTAINER_BloomFilter;
63 * @ingroup bloomfilter
64 * Iterator over struct GNUNET_HashCodes.
67 * @param next set to the next hash code
68 * @return #GNUNET_YES if next was updated
69 * #GNUNET_NO if there are no more entries
71 typedef int (*GNUNET_HashCodeIterator) (void *cls, struct GNUNET_HashCode * next);
75 * @ingroup bloomfilter
76 * Load a Bloom filter from a file.
78 * @param filename the name of the file (or the prefix)
79 * @param size the size of the bloom-filter (number of
80 * bytes of storage space to use); will be rounded up
82 * @param k the number of #GNUNET_CRYPTO_hash-functions to apply per
83 * element (number of bits set per element in the set)
84 * @return the bloomfilter
86 struct GNUNET_CONTAINER_BloomFilter *
87 GNUNET_CONTAINER_bloomfilter_load (const char *filename, size_t size,
92 * @ingroup bloomfilter
93 * Create a Bloom filter from raw bits.
95 * @param data the raw bits in memory (maybe NULL,
96 * in which case all bits should be considered
98 * @param size the size of the bloom-filter (number of
99 * bytes of storage space to use); also size of @a data
100 * -- unless data is NULL. Must be a power of 2.
101 * @param k the number of #GNUNET_CRYPTO_hash-functions to apply per
102 * element (number of bits set per element in the set)
103 * @return the bloomfilter
105 struct GNUNET_CONTAINER_BloomFilter *
106 GNUNET_CONTAINER_bloomfilter_init (const char *data, size_t size,
111 * @ingroup bloomfilter
112 * Copy the raw data of this Bloom filter into
113 * the given data array.
115 * @param data where to write the data
116 * @param size the size of the given @a data array
117 * @return #GNUNET_SYSERR if the data array of the wrong size
120 GNUNET_CONTAINER_bloomfilter_get_raw_data (const struct
121 GNUNET_CONTAINER_BloomFilter *bf,
122 char *data, size_t size);
126 * @ingroup bloomfilter
127 * Test if an element is in the filter.
129 * @param e the element
130 * @param bf the filter
131 * @return #GNUNET_YES if the element is in the filter, #GNUNET_NO if not
134 GNUNET_CONTAINER_bloomfilter_test (const struct GNUNET_CONTAINER_BloomFilter
135 *bf, const struct GNUNET_HashCode * e);
139 * @ingroup bloomfilter
140 * Add an element to the filter.
142 * @param bf the filter
143 * @param e the element
146 GNUNET_CONTAINER_bloomfilter_add (struct GNUNET_CONTAINER_BloomFilter *bf,
147 const struct GNUNET_HashCode * e);
151 * @ingroup bloomfilter
152 * Remove an element from the filter.
154 * @param bf the filter
155 * @param e the element to remove
158 GNUNET_CONTAINER_bloomfilter_remove (struct GNUNET_CONTAINER_BloomFilter *bf,
159 const struct GNUNET_HashCode * e);
163 * @ingroup bloomfilter
164 * Create a copy of a bloomfilter.
166 * @param bf the filter
169 struct GNUNET_CONTAINER_BloomFilter *
170 GNUNET_CONTAINER_bloomfilter_copy (const struct GNUNET_CONTAINER_BloomFilter
176 * @ingroup bloomfilter
177 * Free the space associcated with a filter
178 * in memory, flush to drive if needed (do not
179 * free the space on the drive).
181 * @param bf the filter
184 GNUNET_CONTAINER_bloomfilter_free (struct GNUNET_CONTAINER_BloomFilter *bf);
188 * @ingroup bloomfilter
189 * Get size of the bloom filter.
191 * @param bf the filter
192 * @return number of bytes used for the data of the bloom filter
195 GNUNET_CONTAINER_bloomfilter_get_size (const struct GNUNET_CONTAINER_BloomFilter
200 * @ingroup bloomfilter
201 * Reset a Bloom filter to empty.
203 * @param bf the filter
206 GNUNET_CONTAINER_bloomfilter_clear (struct GNUNET_CONTAINER_BloomFilter *bf);
210 * @ingroup bloomfilter
211 * "or" the entries of the given raw data array with the
212 * data of the given Bloom filter. Assumes that
213 * the @a size of the @a data array and the current filter
216 * @param bf the filter
217 * @param data data to OR-in
218 * @param size size of @a data
219 * @return #GNUNET_OK on success
222 GNUNET_CONTAINER_bloomfilter_or (struct GNUNET_CONTAINER_BloomFilter *bf,
223 const char *data, size_t size);
227 * @ingroup bloomfilter
228 * "or" the entries of the given raw data array with the
229 * data of the given Bloom filter. Assumes that
230 * the size of the two filters matches.
232 * @param bf the filter
233 * @param to_or the bloomfilter to or-in
234 * @return #GNUNET_OK on success
237 GNUNET_CONTAINER_bloomfilter_or2 (struct GNUNET_CONTAINER_BloomFilter *bf,
238 const struct GNUNET_CONTAINER_BloomFilter
242 * @ingroup bloomfilter
243 * Resize a bloom filter. Note that this operation
244 * is pretty costly. Essentially, the Bloom filter
245 * needs to be completely re-build.
247 * @param bf the filter
248 * @param iterator an iterator over all elements stored in the BF
249 * @param iterator_cls closure for @a iterator
250 * @param size the new size for the filter
251 * @param k the new number of #GNUNET_CRYPTO_hash-function to apply per element
254 GNUNET_CONTAINER_bloomfilter_resize (struct GNUNET_CONTAINER_BloomFilter *bf,
255 GNUNET_HashCodeIterator iterator,
256 void *iterator_cls, size_t size,
260 /* ****************** metadata ******************* */
264 * Meta data to associate with a file, directory or namespace.
266 struct GNUNET_CONTAINER_MetaData;
270 * Create a fresh meta data container.
272 * @return empty meta-data container
274 struct GNUNET_CONTAINER_MetaData *
275 GNUNET_CONTAINER_meta_data_create (void);
280 * Duplicate a MetaData token.
282 * @param md what to duplicate
283 * @return duplicate meta-data container
285 struct GNUNET_CONTAINER_MetaData *
286 GNUNET_CONTAINER_meta_data_duplicate (const struct GNUNET_CONTAINER_MetaData
293 * @param md what to free
296 GNUNET_CONTAINER_meta_data_destroy (struct GNUNET_CONTAINER_MetaData *md);
301 * Test if two MDs are equal. We consider them equal if
302 * the meta types, formats and content match (we do not
303 * include the mime types and plugins names in this
306 * @param md1 first value to check
307 * @param md2 other value to check
308 * @return #GNUNET_YES if they are equal
311 GNUNET_CONTAINER_meta_data_test_equal (const struct GNUNET_CONTAINER_MetaData
313 const struct GNUNET_CONTAINER_MetaData
321 * @param md metadata to extend
322 * @param plugin_name name of the plugin that produced this value;
323 * special values can be used (i.e. '<zlib>' for zlib being
324 * used in the main libextractor library and yielding
326 * @param type libextractor-type describing the meta data
327 * @param format basic format information about data
328 * @param data_mime_type mime-type of data (not of the original file);
329 * can be NULL (if mime-type is not known)
330 * @param data actual meta-data found
331 * @param data_size number of bytes in data
332 * @return #GNUNET_OK on success, #GNUNET_SYSERR if this entry already exists
333 * data_mime_type and plugin_name are not considered for "exists" checks
336 GNUNET_CONTAINER_meta_data_insert (struct GNUNET_CONTAINER_MetaData *md,
337 const char *plugin_name,
338 enum EXTRACTOR_MetaType type,
339 enum EXTRACTOR_MetaFormat format,
340 const char *data_mime_type, const char *data,
346 * Extend metadata. Merges the meta data from the second argument
347 * into the first, discarding duplicate key-value pairs.
349 * @param md metadata to extend
350 * @param in metadata to merge
353 GNUNET_CONTAINER_meta_data_merge (struct GNUNET_CONTAINER_MetaData *md,
354 const struct GNUNET_CONTAINER_MetaData *in);
361 * @param md metadata to manipulate
362 * @param type type of the item to remove
363 * @param data specific value to remove, NULL to remove all
364 * entries of the given type
365 * @param data_size number of bytes in data
366 * @return #GNUNET_OK on success, #GNUNET_SYSERR if the item does not exist in md
369 GNUNET_CONTAINER_meta_data_delete (struct GNUNET_CONTAINER_MetaData *md,
370 enum EXTRACTOR_MetaType type,
371 const char *data, size_t data_size);
376 * Remove all items in the container.
378 * @param md metadata to manipulate
381 GNUNET_CONTAINER_meta_data_clear (struct GNUNET_CONTAINER_MetaData *md);
386 * Add the current time as the publication date
389 * @param md metadata to modify
392 GNUNET_CONTAINER_meta_data_add_publication_date (struct
393 GNUNET_CONTAINER_MetaData *md);
398 * Iterate over MD entries.
400 * @param md metadata to inspect
401 * @param iter function to call on each entry
402 * @param iter_cls closure for @a iter
403 * @return number of entries
406 GNUNET_CONTAINER_meta_data_iterate (const struct GNUNET_CONTAINER_MetaData *md,
407 EXTRACTOR_MetaDataProcessor iter,
412 * Get the first MD entry of the given type. Caller
413 * is responsible for freeing the return value.
414 * Also, only meta data items that are strings (0-terminated)
415 * are returned by this function.
417 * @param md metadata to inspect
418 * @param type type to look for
419 * @return NULL if no entry was found
422 GNUNET_CONTAINER_meta_data_get_by_type (const struct GNUNET_CONTAINER_MetaData
423 *md, enum EXTRACTOR_MetaType type);
428 * Get the first matching MD entry of the given types. Caller is
429 * responsible for freeing the return value. Also, only meta data
430 * items that are strings (0-terminated) are returned by this
433 * @param md metadata to inspect
434 * @param ... -1-terminated list of types
435 * @return NULL if we do not have any such entry,
436 * otherwise client is responsible for freeing the value!
439 GNUNET_CONTAINER_meta_data_get_first_by_types (const struct
440 GNUNET_CONTAINER_MetaData *md,
445 * Get a thumbnail from the meta-data (if present). Only matches meta
446 * data with mime type "image" and binary format.
448 * @param md metadata to inspect
449 * @param thumb will be set to the thumbnail data. Must be
450 * freed by the caller!
451 * @return number of bytes in thumbnail, 0 if not available
454 GNUNET_CONTAINER_meta_data_get_thumbnail (const struct GNUNET_CONTAINER_MetaData
455 *md, unsigned char **thumb);
461 * Options for metadata serialization.
463 enum GNUNET_CONTAINER_MetaDataSerializationOptions
467 * Serialize all of the data.
469 GNUNET_CONTAINER_META_DATA_SERIALIZE_FULL = 0,
473 * If not enough space is available, it is acceptable
474 * to only serialize some of the metadata.
476 GNUNET_CONTAINER_META_DATA_SERIALIZE_PART = 1,
480 * Speed is of the essence, do not allow compression.
482 GNUNET_CONTAINER_META_DATA_SERIALIZE_NO_COMPRESS = 2
488 * Serialize meta-data to target.
490 * @param md metadata to serialize
491 * @param target where to write the serialized metadata;
492 * *target can be NULL, in which case memory is allocated
493 * @param max maximum number of bytes available
494 * @param opt is it ok to just write SOME of the
495 * meta-data to match the size constraint,
496 * possibly discarding some data?
497 * @return number of bytes written on success,
498 * -1 on error (typically: not enough
502 GNUNET_CONTAINER_meta_data_serialize (const struct GNUNET_CONTAINER_MetaData
503 *md, char **target, size_t max,
505 GNUNET_CONTAINER_MetaDataSerializationOptions
511 * Get the size of the full meta-data in serialized form.
513 * @param md metadata to inspect
514 * @return number of bytes needed for serialization, -1 on error
517 GNUNET_CONTAINER_meta_data_get_serialized_size (const struct
518 GNUNET_CONTAINER_MetaData *md);
523 * Deserialize meta-data. Initializes md.
525 * @param input serialized meta-data.
526 * @param size number of bytes available
527 * @return MD on success, NULL on error (i.e.
530 struct GNUNET_CONTAINER_MetaData *
531 GNUNET_CONTAINER_meta_data_deserialize (const char *input, size_t size);
534 /* ******************************* HashMap **************************** */
538 * Opaque handle for a HashMap.
540 struct GNUNET_CONTAINER_MultiHashMap;
544 * Opaque handle to an iterator over
547 struct GNUNET_CONTAINER_MultiHashMapIterator;
551 * Options for storing values in the HashMap.
553 enum GNUNET_CONTAINER_MultiHashMapOption
558 * If a value with the given key exists, replace it. Note that the
559 * old value would NOT be freed by replace (the application has to
560 * make sure that this happens if required).
562 GNUNET_CONTAINER_MULTIHASHMAPOPTION_REPLACE,
566 * Allow multiple values with the same key.
568 GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE,
572 * There must only be one value per key; storing a value should fail
573 * if a value under the same key already exists.
575 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY,
578 * @ingroup hashmap There must only be one value per key, but don't
579 * bother checking if a value already exists (faster than
580 * #GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY; implemented
581 * just like #GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE but this
582 * option documents better what is intended if
583 * #GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY is what is
586 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST
592 * Iterator over hash map entries.
595 * @param key current key code
596 * @param value value in the hash map
597 * @return #GNUNET_YES if we should continue to
601 typedef int (*GNUNET_CONTAINER_HashMapIterator) (void *cls,
602 const struct GNUNET_HashCode *key,
608 * Create a multi hash map.
610 * @param len initial size (map will grow as needed)
611 * @param do_not_copy_keys #GNUNET_NO is always safe and should be used by default;
612 * #GNUNET_YES means that on 'put', the 'key' does not have
613 * to be copied as the destination of the pointer is
614 * guaranteed to be life as long as the value is stored in
615 * the hashmap. This can significantly reduce memory
616 * consumption, but of course is also a recipie for
617 * heap corruption if the assumption is not true. Only
618 * use this if (1) memory use is important in this case and
619 * (2) you have triple-checked that the invariant holds
620 * @return NULL on error
622 struct GNUNET_CONTAINER_MultiHashMap *
623 GNUNET_CONTAINER_multihashmap_create (unsigned int len,
624 int do_not_copy_keys);
629 * Destroy a hash map. Will not free any values
630 * stored in the hash map!
635 GNUNET_CONTAINER_multihashmap_destroy (struct GNUNET_CONTAINER_MultiHashMap
641 * Given a key find a value in the map matching the key.
644 * @param key what to look for
645 * @return NULL if no value was found; note that
646 * this is indistinguishable from values that just
647 * happen to be NULL; use "contains" to test for
648 * key-value pairs with value NULL
651 GNUNET_CONTAINER_multihashmap_get (const struct GNUNET_CONTAINER_MultiHashMap
652 *map, const struct GNUNET_HashCode * key);
657 * Remove the given key-value pair from the map. Note that if the
658 * key-value pair is in the map multiple times, only one of the pairs
662 * @param key key of the key-value pair
663 * @param value value of the key-value pair
664 * @return #GNUNET_YES on success, #GNUNET_NO if the key-value pair
668 GNUNET_CONTAINER_multihashmap_remove (struct GNUNET_CONTAINER_MultiHashMap *map,
669 const struct GNUNET_HashCode * key,
674 * Remove all entries for the given key from the map.
675 * Note that the values would not be "freed".
678 * @param key identifies values to be removed
679 * @return number of values removed
682 GNUNET_CONTAINER_multihashmap_remove_all (struct GNUNET_CONTAINER_MultiHashMap
683 *map, const struct GNUNET_HashCode * key);
688 * Check if the map contains any value under the given
689 * key (including values that are NULL).
692 * @param key the key to test if a value exists for it
693 * @return #GNUNET_YES if such a value exists,
697 GNUNET_CONTAINER_multihashmap_contains (const struct
698 GNUNET_CONTAINER_MultiHashMap *map,
699 const struct GNUNET_HashCode * key);
704 * Check if the map contains the given value under the given
708 * @param key the key to test if a value exists for it
709 * @param value value to test for
710 * @return #GNUNET_YES if such a value exists,
714 GNUNET_CONTAINER_multihashmap_contains_value (const struct
715 GNUNET_CONTAINER_MultiHashMap
716 *map, const struct GNUNET_HashCode * key,
722 * Store a key-value pair in the map.
725 * @param key key to use
726 * @param value value to use
727 * @param opt options for put
728 * @return #GNUNET_OK on success,
729 * #GNUNET_NO if a value was replaced (with REPLACE)
730 * #GNUNET_SYSERR if UNIQUE_ONLY was the option and the
731 * value already exists
734 GNUNET_CONTAINER_multihashmap_put (struct GNUNET_CONTAINER_MultiHashMap *map,
735 const struct GNUNET_HashCode * key, void *value,
736 enum GNUNET_CONTAINER_MultiHashMapOption
741 * Get the number of key-value pairs in the map.
744 * @return the number of key value pairs
747 GNUNET_CONTAINER_multihashmap_size (const struct GNUNET_CONTAINER_MultiHashMap
753 * Iterate over all entries in the map.
756 * @param it function to call on each entry
757 * @param it_cls extra argument to @a it
758 * @return the number of key value pairs processed,
759 * #GNUNET_SYSERR if it aborted iteration
762 GNUNET_CONTAINER_multihashmap_iterate (const struct
763 GNUNET_CONTAINER_MultiHashMap *map,
764 GNUNET_CONTAINER_HashMapIterator it,
770 * Create an iterator for a multihashmap.
771 * The iterator can be used to retrieve all the elements in the multihashmap
772 * one by one, without having to handle all elements at once (in contrast to
773 * 'GNUNET_CONTAINER_multihashmap_iterate'). Note that the iterator can not be
774 * used anymore if elements have been removed from 'map' after the creation of
775 * the iterator, or 'map' has been destroyed. Adding elements to 'map' may
776 * result in skipped or repeated elements.
778 * @param map the map to create an iterator for
779 * @return an iterator over the given multihashmap @a map
781 struct GNUNET_CONTAINER_MultiHashMapIterator *
782 GNUNET_CONTAINER_multihashmap_iterator_create (const struct GNUNET_CONTAINER_MultiHashMap *map);
787 * Retrieve the next element from the hash map at the iterator's
788 * position. If there are no elements left, #GNUNET_NO is returned,
789 * and @a key and @a value are not modified. This operation is only
790 * allowed if no elements have been removed from the multihashmap
791 * since the creation of @a iter, and the map has not been destroyed.
792 * Adding elements may result in repeating or skipping elements.
794 * @param iter the iterator to get the next element from
795 * @param key pointer to store the key in, can be NULL
796 * @param value pointer to store the value in, can be NULL
797 * @return #GNUNET_YES we returned an element,
798 * #GNUNET_NO if we are out of elements
801 GNUNET_CONTAINER_multihashmap_iterator_next (struct GNUNET_CONTAINER_MultiHashMapIterator *iter,
802 struct GNUNET_HashCode *key, const void **value);
807 * Destroy a multihashmap iterator.
809 * @param iter the iterator to destroy
812 GNUNET_CONTAINER_multihashmap_iterator_destroy (struct GNUNET_CONTAINER_MultiHashMapIterator *iter);
817 * Iterate over all entries in the map that match a particular key.
820 * @param key key that the entries must correspond to
821 * @param it function to call on each entry
822 * @param it_cls extra argument to @a it
823 * @return the number of key value pairs processed,
824 * #GNUNET_SYSERR if it aborted iteration
827 GNUNET_CONTAINER_multihashmap_get_multiple (const struct
828 GNUNET_CONTAINER_MultiHashMap *map,
829 const struct GNUNET_HashCode * key,
830 GNUNET_CONTAINER_HashMapIterator it,
833 /* Version of multihashmap with 32 bit keys */
837 * Opaque handle for the 32-bit key HashMap.
839 struct GNUNET_CONTAINER_MultiHashMap32;
844 * Iterator over hash map entries.
847 * @param key current key code
848 * @param value value in the hash map
849 * @return #GNUNET_YES if we should continue to
853 typedef int (*GNUNET_CONTAINER_HashMapIterator32) (void *cls,
860 * Create a 32-bit key multi hash map.
862 * @param len initial size (map will grow as needed)
863 * @return NULL on error
865 struct GNUNET_CONTAINER_MultiHashMap32 *
866 GNUNET_CONTAINER_multihashmap32_create (unsigned int len);
871 * Destroy a 32-bit key hash map. Will not free any values
872 * stored in the hash map!
877 GNUNET_CONTAINER_multihashmap32_destroy (struct GNUNET_CONTAINER_MultiHashMap32
883 * Get the number of key-value pairs in the map.
886 * @return the number of key value pairs
889 GNUNET_CONTAINER_multihashmap32_size (const struct
890 GNUNET_CONTAINER_MultiHashMap32 *map);
895 * Given a key find a value in the map matching the key.
898 * @param key what to look for
899 * @return NULL if no value was found; note that
900 * this is indistinguishable from values that just
901 * happen to be NULL; use "contains" to test for
902 * key-value pairs with value NULL
905 GNUNET_CONTAINER_multihashmap32_get (const struct
906 GNUNET_CONTAINER_MultiHashMap32 *map,
912 * Iterate over all entries in the map.
915 * @param it function to call on each entry
916 * @param it_cls extra argument to @a it
917 * @return the number of key value pairs processed,
918 * #GNUNET_SYSERR if it aborted iteration
921 GNUNET_CONTAINER_multihashmap32_iterate (const struct
922 GNUNET_CONTAINER_MultiHashMap32 *map,
923 GNUNET_CONTAINER_HashMapIterator32 it,
929 * Remove the given key-value pair from the map. Note that if the
930 * key-value pair is in the map multiple times, only one of the pairs
934 * @param key key of the key-value pair
935 * @param value value of the key-value pair
936 * @return #GNUNET_YES on success, #GNUNET_NO if the key-value pair
940 GNUNET_CONTAINER_multihashmap32_remove (struct GNUNET_CONTAINER_MultiHashMap32
948 * Remove all entries for the given key from the map.
949 * Note that the values would not be "freed".
952 * @param key identifies values to be removed
953 * @return number of values removed
956 GNUNET_CONTAINER_multihashmap32_remove_all (struct
957 GNUNET_CONTAINER_MultiHashMap32
964 * Check if the map contains any value under the given
965 * key (including values that are NULL).
968 * @param key the key to test if a value exists for it
969 * @return #GNUNET_YES if such a value exists,
973 GNUNET_CONTAINER_multihashmap32_contains (const struct
974 GNUNET_CONTAINER_MultiHashMap32 *map,
980 * Check if the map contains the given value under the given
984 * @param key the key to test if a value exists for it
985 * @param value value to test for
986 * @return #GNUNET_YES if such a value exists,
990 GNUNET_CONTAINER_multihashmap32_contains_value (const struct
991 GNUNET_CONTAINER_MultiHashMap32
999 * Store a key-value pair in the map.
1001 * @param map the map
1002 * @param key key to use
1003 * @param value value to use
1004 * @param opt options for put
1005 * @return #GNUNET_OK on success,
1006 * #GNUNET_NO if a value was replaced (with REPLACE)
1007 * #GNUNET_SYSERR if #GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY was the option and the
1008 * value already exists
1011 GNUNET_CONTAINER_multihashmap32_put (struct GNUNET_CONTAINER_MultiHashMap32
1012 *map, uint32_t key, void *value,
1013 enum GNUNET_CONTAINER_MultiHashMapOption
1019 * Iterate over all entries in the map that match a particular key.
1021 * @param map the map
1022 * @param key key that the entries must correspond to
1023 * @param it function to call on each entry
1024 * @param it_cls extra argument to @a it
1025 * @return the number of key value pairs processed,
1026 * #GNUNET_SYSERR if it aborted iteration
1029 GNUNET_CONTAINER_multihashmap32_get_multiple (const struct
1030 GNUNET_CONTAINER_MultiHashMap32
1032 GNUNET_CONTAINER_HashMapIterator32
1038 /* ******************** doubly-linked list *************** */
1039 /* To avoid mistakes: head->prev == tail->next == NULL */
1043 * Insert an element at the head of a DLL. Assumes that head, tail and
1044 * element are structs with prev and next fields.
1046 * @param head pointer to the head of the DLL
1047 * @param tail pointer to the tail of the DLL
1048 * @param element element to insert
1050 #define GNUNET_CONTAINER_DLL_insert(head,tail,element) do { \
1051 GNUNET_assert ( ( (element)->prev == NULL) && ((head) != (element))); \
1052 GNUNET_assert ( ( (element)->next == NULL) && ((tail) != (element))); \
1053 (element)->next = (head); \
1054 (element)->prev = NULL; \
1055 if ((tail) == NULL) \
1058 (head)->prev = element; \
1059 (head) = (element); } while (0)
1064 * Insert an element at the tail of a DLL. Assumes that head, tail and
1065 * element are structs with prev and next fields.
1067 * @param head pointer to the head of the DLL
1068 * @param tail pointer to the tail of the DLL
1069 * @param element element to insert
1071 #define GNUNET_CONTAINER_DLL_insert_tail(head,tail,element) do { \
1072 GNUNET_assert ( ( (element)->prev == NULL) && ((head) != (element))); \
1073 GNUNET_assert ( ( (element)->next == NULL) && ((tail) != (element))); \
1074 (element)->prev = (tail); \
1075 (element)->next = NULL; \
1076 if ((head) == NULL) \
1079 (tail)->next = element; \
1080 (tail) = (element); } while (0)
1085 * Insert an element into a DLL after the given other element. Insert
1086 * at the head if the other element is NULL.
1088 * @param head pointer to the head of the DLL
1089 * @param tail pointer to the tail of the DLL
1090 * @param other prior element, NULL for insertion at head of DLL
1091 * @param element element to insert
1093 #define GNUNET_CONTAINER_DLL_insert_after(head,tail,other,element) do { \
1094 GNUNET_assert ( ( (element)->prev == NULL) && ((head) != (element))); \
1095 GNUNET_assert ( ( (element)->next == NULL) && ((tail) != (element))); \
1096 (element)->prev = (other); \
1097 if (NULL == other) \
1099 (element)->next = (head); \
1100 (head) = (element); \
1104 (element)->next = (other)->next; \
1105 (other)->next = (element); \
1107 if (NULL == (element)->next) \
1108 (tail) = (element); \
1110 (element)->next->prev = (element); } while (0)
1115 * Insert an element into a DLL before the given other element. Insert
1116 * at the tail if the other element is NULL.
1118 * @param head pointer to the head of the DLL
1119 * @param tail pointer to the tail of the DLL
1120 * @param other prior element, NULL for insertion at head of DLL
1121 * @param element element to insert
1123 #define GNUNET_CONTAINER_DLL_insert_before(head,tail,other,element) do { \
1124 GNUNET_assert ( ( (element)->prev == NULL) && ((head) != (element))); \
1125 GNUNET_assert ( ( (element)->next == NULL) && ((tail) != (element))); \
1126 (element)->next = (other); \
1127 if (NULL == other) \
1129 (element)->prev = (tail); \
1130 (tail) = (element); \
1134 (element)->prev = (other)->prev; \
1135 (other)->prev = (element); \
1137 if (NULL == (element)->prev) \
1138 (head) = (element); \
1140 (element)->prev->next = (element); } while (0)
1145 * Remove an element from a DLL. Assumes that head, tail and
1146 * element point to structs with prev and next fields.
1148 * Using the head or tail pointer as the element
1149 * argument does NOT work with this macro.
1150 * Make sure to store head/tail in another pointer
1151 * and use it to remove the head or tail of the list.
1153 * @param head pointer to the head of the DLL
1154 * @param tail pointer to the tail of the DLL
1155 * @param element element to remove
1157 #define GNUNET_CONTAINER_DLL_remove(head,tail,element) do { \
1158 GNUNET_assert ( ( (element)->prev != NULL) || ((head) == (element))); \
1159 GNUNET_assert ( ( (element)->next != NULL) || ((tail) == (element))); \
1160 if ((element)->prev == NULL) \
1161 (head) = (element)->next; \
1163 (element)->prev->next = (element)->next; \
1164 if ((element)->next == NULL) \
1165 (tail) = (element)->prev; \
1167 (element)->next->prev = (element)->prev; \
1168 (element)->next = NULL; \
1169 (element)->prev = NULL; } while (0)
1172 /* ************ Multi-DLL interface, allows DLL elements to be
1173 in multiple lists at the same time *********************** */
1177 * Insert an element at the head of a MDLL. Assumes that head, tail and
1178 * element are structs with prev and next fields.
1180 * @param mdll suffix name for the next and prev pointers in the element
1181 * @param head pointer to the head of the MDLL
1182 * @param tail pointer to the tail of the MDLL
1183 * @param element element to insert
1185 #define GNUNET_CONTAINER_MDLL_insert(mdll,head,tail,element) do { \
1186 GNUNET_assert ( ( (element)->prev_##mdll == NULL) && ((head) != (element))); \
1187 GNUNET_assert ( ( (element)->next_##mdll == NULL) && ((tail) != (element))); \
1188 (element)->next_##mdll = (head); \
1189 (element)->prev_##mdll = NULL; \
1190 if ((tail) == NULL) \
1193 (head)->prev_##mdll = element; \
1194 (head) = (element); } while (0)
1199 * Insert an element at the tail of a MDLL. Assumes that head, tail and
1200 * element are structs with prev and next fields.
1202 * @param mdll suffix name for the next and prev pointers in the element
1203 * @param head pointer to the head of the MDLL
1204 * @param tail pointer to the tail of the MDLL
1205 * @param element element to insert
1207 #define GNUNET_CONTAINER_MDLL_insert_tail(mdll,head,tail,element) do { \
1208 GNUNET_assert ( ( (element)->prev_##mdll == NULL) && ((head) != (element))); \
1209 GNUNET_assert ( ( (element)->next_##mdll == NULL) && ((tail) != (element))); \
1210 (element)->prev_##mdll = (tail); \
1211 (element)->next_##mdll = NULL; \
1212 if ((head) == NULL) \
1215 (tail)->next_##mdll = element; \
1216 (tail) = (element); } while (0)
1221 * Insert an element into a MDLL after the given other element. Insert
1222 * at the head if the other element is NULL.
1224 * @param mdll suffix name for the next and prev pointers in the element
1225 * @param head pointer to the head of the MDLL
1226 * @param tail pointer to the tail of the MDLL
1227 * @param other prior element, NULL for insertion at head of MDLL
1228 * @param element element to insert
1230 #define GNUNET_CONTAINER_MDLL_insert_after(mdll,head,tail,other,element) do { \
1231 GNUNET_assert ( ( (element)->prev_##mdll == NULL) && ((head) != (element))); \
1232 GNUNET_assert ( ( (element)->next_##mdll == NULL) && ((tail) != (element))); \
1233 (element)->prev_##mdll = (other); \
1234 if (NULL == other) \
1236 (element)->next_##mdll = (head); \
1237 (head) = (element); \
1241 (element)->next_##mdll = (other)->next_##mdll; \
1242 (other)->next_##mdll = (element); \
1244 if (NULL == (element)->next_##mdll) \
1245 (tail) = (element); \
1247 (element)->next->prev_##mdll = (element); } while (0)
1252 * Insert an element into a MDLL before the given other element. Insert
1253 * at the tail if the other element is NULL.
1255 * @param mdll suffix name for the next and prev pointers in the element
1256 * @param head pointer to the head of the MDLL
1257 * @param tail pointer to the tail of the MDLL
1258 * @param other prior element, NULL for insertion at head of MDLL
1259 * @param element element to insert
1261 #define GNUNET_CONTAINER_MDLL_insert_before(mdll,head,tail,other,element) do { \
1262 GNUNET_assert ( ( (element)->prev_##mdll == NULL) && ((head) != (element))); \
1263 GNUNET_assert ( ( (element)->next_##mdll == NULL) && ((tail) != (element))); \
1264 (element)->next_##mdll = (other); \
1265 if (NULL == other) \
1267 (element)->prev = (tail); \
1268 (tail) = (element); \
1272 (element)->prev_##mdll = (other)->prev_##mdll; \
1273 (other)->prev_##mdll = (element); \
1275 if (NULL == (element)->prev_##mdll) \
1276 (head) = (element); \
1278 (element)->prev_##mdll->next_##mdll = (element); } while (0)
1283 * Remove an element from a MDLL. Assumes
1284 * that head, tail and element are structs
1285 * with prev and next fields.
1287 * @param mdll suffix name for the next and prev pointers in the element
1288 * @param head pointer to the head of the MDLL
1289 * @param tail pointer to the tail of the MDLL
1290 * @param element element to remove
1292 #define GNUNET_CONTAINER_MDLL_remove(mdll,head,tail,element) do { \
1293 GNUNET_assert ( ( (element)->prev_##mdll != NULL) || ((head) == (element))); \
1294 GNUNET_assert ( ( (element)->next_##mdll != NULL) || ((tail) == (element))); \
1295 if ((element)->prev_##mdll == NULL) \
1296 (head) = (element)->next_##mdll; \
1298 (element)->prev_##mdll->next_##mdll = (element)->next_##mdll; \
1299 if ((element)->next_##mdll == NULL) \
1300 (tail) = (element)->prev_##mdll; \
1302 (element)->next_##mdll->prev_##mdll = (element)->prev_##mdll; \
1303 (element)->next_##mdll = NULL; \
1304 (element)->prev_##mdll = NULL; } while (0)
1308 /* ******************** Heap *************** */
1313 * Cost by which elements in a heap can be ordered.
1315 typedef uint64_t GNUNET_CONTAINER_HeapCostType;
1320 * Heap type, either max or min.
1322 enum GNUNET_CONTAINER_HeapOrder
1326 * Heap with the maximum cost at the root.
1328 GNUNET_CONTAINER_HEAP_ORDER_MAX,
1332 * Heap with the minimum cost at the root.
1334 GNUNET_CONTAINER_HEAP_ORDER_MIN
1342 struct GNUNET_CONTAINER_Heap;
1347 * Handle to a node in a heap.
1349 struct GNUNET_CONTAINER_HeapNode;
1354 * Create a new heap.
1356 * @param order how should the heap be sorted?
1357 * @return handle to the heap
1359 struct GNUNET_CONTAINER_Heap *
1360 GNUNET_CONTAINER_heap_create (enum GNUNET_CONTAINER_HeapOrder order);
1365 * Destroys the heap. Only call on a heap that
1368 * @param heap heap to destroy
1371 GNUNET_CONTAINER_heap_destroy (struct GNUNET_CONTAINER_Heap *heap);
1376 * Get element stored at root of heap.
1378 * @param heap heap to inspect
1379 * @return NULL if heap is empty
1382 GNUNET_CONTAINER_heap_peek (const struct GNUNET_CONTAINER_Heap *heap);
1387 * Get the current size of the heap
1389 * @param heap the heap to get the size of
1390 * @return number of elements stored
1393 GNUNET_CONTAINER_heap_get_size (const struct GNUNET_CONTAINER_Heap *heap);
1398 * Get the current cost of the node
1400 * @param node the node to get the cost of
1401 * @return cost of the node
1403 GNUNET_CONTAINER_HeapCostType
1404 GNUNET_CONTAINER_heap_node_get_cost (const struct GNUNET_CONTAINER_HeapNode
1411 * @param cls closure
1412 * @param node internal node of the heap
1413 * @param element value stored at the node
1414 * @param cost cost associated with the node
1415 * @return #GNUNET_YES if we should continue to iterate,
1416 * #GNUNET_NO if not.
1418 typedef int (*GNUNET_CONTAINER_HeapIterator) (void *cls,
1419 struct GNUNET_CONTAINER_HeapNode *
1420 node, void *element,
1421 GNUNET_CONTAINER_HeapCostType
1427 * Iterate over all entries in the heap.
1429 * @param heap the heap
1430 * @param iterator function to call on each entry
1431 * @param iterator_cls closure for @a iterator
1434 GNUNET_CONTAINER_heap_iterate (const struct GNUNET_CONTAINER_Heap *heap,
1435 GNUNET_CONTAINER_HeapIterator iterator,
1436 void *iterator_cls);
1440 * Perform a random walk of the tree. The walk is biased
1441 * towards elements closer to the root of the tree (since
1442 * each walk starts at the root and ends at a random leaf).
1443 * The heap internally tracks the current position of the
1446 * @param heap heap to walk
1447 * @return data stored at the next random node in the walk;
1448 * NULL if the tree is empty.
1451 GNUNET_CONTAINER_heap_walk_get_next (struct GNUNET_CONTAINER_Heap *heap);
1456 * Inserts a new element into the heap.
1458 * @param heap heap to modify
1459 * @param element element to insert
1460 * @param cost cost for the element
1461 * @return node for the new element
1463 struct GNUNET_CONTAINER_HeapNode *
1464 GNUNET_CONTAINER_heap_insert (struct GNUNET_CONTAINER_Heap *heap, void *element,
1465 GNUNET_CONTAINER_HeapCostType cost);
1470 * Remove root of the heap.
1472 * @param heap heap to modify
1473 * @return element data stored at the root node
1476 GNUNET_CONTAINER_heap_remove_root (struct GNUNET_CONTAINER_Heap *heap);
1481 * Removes a node from the heap.
1483 * @param node node to remove
1484 * @return element data stored at the node, NULL if heap is empty
1487 GNUNET_CONTAINER_heap_remove_node (struct GNUNET_CONTAINER_HeapNode *node);
1492 * Updates the cost of any node in the tree
1494 * @param heap heap to modify
1495 * @param node node for which the cost is to be changed
1496 * @param new_cost new cost for the node
1499 GNUNET_CONTAINER_heap_update_cost (struct GNUNET_CONTAINER_Heap *heap,
1500 struct GNUNET_CONTAINER_HeapNode *node,
1501 GNUNET_CONTAINER_HeapCostType new_cost);
1504 /* ******************** Singly linked list *************** */
1507 * Possible ways for how data stored in the linked list
1508 * might be allocated.
1509 * @deprecated use DLL macros
1511 enum GNUNET_CONTAINER_SListDisposition
1514 * Single-linked list must copy the buffer.
1515 * @deprecated use DLL macros
1517 GNUNET_CONTAINER_SLIST_DISPOSITION_TRANSIENT = 0,
1520 * Data is static, no need to copy or free.
1521 * @deprecated use DLL macros
1523 GNUNET_CONTAINER_SLIST_DISPOSITION_STATIC = 2,
1526 * Data is dynamic, do not copy but free when done.
1527 * @deprecated use DLL macros
1529 GNUNET_CONTAINER_SLIST_DISPOSITION_DYNAMIC = 4
1535 * Handle to a singly linked list
1536 * @deprecated use DLL macros
1538 struct GNUNET_CONTAINER_SList;
1541 * Handle to a singly linked list iterator
1542 * @deprecated use DLL macros
1544 struct GNUNET_CONTAINER_SList_Iterator
1547 * Linked list that we are iterating over.
1549 struct GNUNET_CONTAINER_SList *list;
1552 * Last element accessed.
1554 struct GNUNET_CONTAINER_SList_Elem *last;
1557 * Current list element.
1559 struct GNUNET_CONTAINER_SList_Elem *elem;
1565 * Add a new element to the list
1567 * @param disp memory disposition
1568 * @param buf payload buffer
1569 * @param len length of the buffer
1570 * @deprecated use DLL macros
1573 GNUNET_CONTAINER_slist_add (struct GNUNET_CONTAINER_SList *l,
1574 enum GNUNET_CONTAINER_SListDisposition disp,
1575 const void *buf, size_t len);
1579 * Add a new element to the end of the list
1581 * @param disp memory disposition
1582 * @param buf payload buffer
1583 * @param len length of the buffer
1584 * @deprecated use DLL macros
1587 GNUNET_CONTAINER_slist_add_end (struct GNUNET_CONTAINER_SList *l,
1588 enum GNUNET_CONTAINER_SListDisposition disp,
1589 const void *buf, size_t len);
1593 * Append a singly linked list to another
1594 * @param dst list to append to
1596 * @deprecated use DLL macros
1599 GNUNET_CONTAINER_slist_append (struct GNUNET_CONTAINER_SList *dst,
1600 struct GNUNET_CONTAINER_SList *src);
1604 * Create a new singly linked list
1605 * @return the new list
1606 * @deprecated use DLL macros
1608 struct GNUNET_CONTAINER_SList *
1609 GNUNET_CONTAINER_slist_create (void);
1613 * Destroy a singly linked list
1614 * @param l the list to be destroyed
1615 * @deprecated use DLL macros
1618 GNUNET_CONTAINER_slist_destroy (struct GNUNET_CONTAINER_SList *l);
1622 * Return the beginning of a list
1625 * @return iterator pointing to the beginning (by value! Either allocate the
1626 * structure on the stack, or use GNUNET_malloc() yourself! All other
1627 * functions do take pointer to this struct though)
1628 * @deprecated use DLL macros
1630 struct GNUNET_CONTAINER_SList_Iterator
1631 GNUNET_CONTAINER_slist_begin (struct GNUNET_CONTAINER_SList *l);
1638 * @deprecated use DLL macros
1641 GNUNET_CONTAINER_slist_clear (struct GNUNET_CONTAINER_SList *l);
1645 * Check if a list contains a certain element
1647 * @param buf payload buffer to find
1648 * @param len length of the payload (number of bytes in buf)
1649 * @return GNUNET_YES if found, GNUNET_NO otherwise
1650 * @deprecated use DLL macros
1653 GNUNET_CONTAINER_slist_contains (const struct GNUNET_CONTAINER_SList *l,
1654 const void *buf, size_t len);
1657 * Check if a list contains a certain element using 'compare' function
1660 * @param buf payload buffer to find
1661 * @param len length of the payload (number of bytes in buf)
1662 * @param compare comparison function
1664 * @return NULL if the 'buf' could not be found, pointer to the
1665 * list element, if found
1666 * @deprecated use DLL macros
1669 GNUNET_CONTAINER_slist_contains2 (const struct GNUNET_CONTAINER_SList *l,
1670 const void *buf, size_t len,
1671 int (*compare)(const void *, const size_t, const void *, const size_t));
1673 * Count the elements of a list
1675 * @return number of elements in the list
1676 * @deprecated use DLL macros
1679 GNUNET_CONTAINER_slist_count (const struct GNUNET_CONTAINER_SList *l);
1683 * Remove an element from the list
1684 * @param i iterator that points to the element to be removed
1685 * @deprecated use DLL macros
1688 GNUNET_CONTAINER_slist_erase (struct GNUNET_CONTAINER_SList_Iterator *i);
1692 * Insert an element into a list at a specific position
1693 * @param before where to insert the new element
1694 * @param disp memory disposition
1695 * @param buf payload buffer
1696 * @param len length of the payload
1697 * @deprecated use DLL macros
1700 GNUNET_CONTAINER_slist_insert (struct GNUNET_CONTAINER_SList_Iterator *before,
1701 enum GNUNET_CONTAINER_SListDisposition disp,
1702 const void *buf, size_t len);
1706 * Advance an iterator to the next element
1708 * @return GNUNET_YES on success, GNUNET_NO if the end has been reached
1709 * @deprecated use DLL macros
1712 GNUNET_CONTAINER_slist_next (struct GNUNET_CONTAINER_SList_Iterator *i);
1716 * Check if an iterator points beyond the end of a list
1718 * @return GNUNET_YES if the end has been reached, GNUNET_NO if the iterator
1719 * points to a valid element
1720 * @deprecated use DLL macros
1723 GNUNET_CONTAINER_slist_end (struct GNUNET_CONTAINER_SList_Iterator *i);
1727 * Retrieve the element at a specific position in a list
1730 * @param len set to the payload length
1732 * @deprecated use DLL macros
1735 GNUNET_CONTAINER_slist_get (const struct GNUNET_CONTAINER_SList_Iterator *i,
1740 * Release an iterator
1742 * @deprecated use DLL macros
1745 GNUNET_CONTAINER_slist_iter_destroy (struct GNUNET_CONTAINER_SList_Iterator *i);
1748 #if 0 /* keep Emacsens' auto-indent happy */
1756 /* ifndef GNUNET_CONTAINER_LIB_H */
1758 /* end of gnunet_container_lib.h */