57#if ! defined (__GNUNET_UTIL_LIB_H_INSIDE__)
58#error "Only <gnunet_util_lib.h> can be included directly."
61#ifndef GNUNET_CONTAINER_LIB_H
62#define GNUNET_CONTAINER_LIB_H
355#define GNUNET_CONTAINER_DLL_insert(head, tail, element) \
358 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
359 GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
360 GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
361 (element)->next = (head); \
362 (element)->prev = NULL; \
363 if (NULL == (tail)) \
369 (head)->prev = element; \
371 (head) = (element); \
384#define GNUNET_CONTAINER_DLL_insert_tail(head, tail, element) \
387 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
388 GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
389 GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
390 (element)->prev = (tail); \
391 (element)->next = NULL; \
392 if (NULL == (head)) \
398 (tail)->next = element; \
400 (tail) = (element); \
414#define GNUNET_CONTAINER_DLL_insert_after(head, tail, other, element) \
417 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
418 GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
419 GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
420 (element)->prev = (other); \
423 (element)->next = (head); \
424 (head) = (element); \
428 (element)->next = (other)->next; \
429 (other)->next = (element); \
431 if (NULL == (element)->next) \
433 (tail) = (element); \
437 (element)->next->prev = (element); \
452#define GNUNET_CONTAINER_DLL_insert_before(head, tail, other, element) \
455 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
456 GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
457 GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
458 (element)->next = (other); \
461 (element)->prev = (tail); \
462 (tail) = (element); \
466 (element)->prev = (other)->prev; \
467 (other)->prev = (element); \
469 if (NULL == (element)->prev) \
471 (head) = (element); \
475 (element)->prev->next = (element); \
494#define GNUNET_CONTAINER_DLL_remove(head, tail, element) \
497 GNUNET_assert ((NULL != (element)->prev) || ((head) == (element))); \
498 GNUNET_assert ((NULL != (element)->next) || ((tail) == (element))); \
499 if (NULL == (element)->prev) \
501 (head) = (element)->next; \
505 (element)->prev->next = (element)->next; \
507 if (NULL == (element)->next) \
509 (tail) = (element)->prev; \
513 (element)->next->prev = (element)->prev; \
515 (element)->next = NULL; \
516 (element)->prev = NULL; \
533#define GNUNET_CONTAINER_MDLL_insert(mdll, head, tail, element) \
536 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
537 GNUNET_assert ((NULL == (element)->prev_ ## mdll) && \
538 ((head) != (element))); \
539 GNUNET_assert ((NULL == (element)->next_ ## mdll) && \
540 ((tail) != (element))); \
541 (element)->next_ ## mdll = (head); \
542 (element)->prev_ ## mdll = NULL; \
543 if (NULL == (tail)) \
549 (head)->prev_ ## mdll = element; \
551 (head) = (element); \
565#define GNUNET_CONTAINER_MDLL_insert_tail(mdll, head, tail, element) \
568 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
569 GNUNET_assert ((NULL == (element)->prev_ ## mdll) && \
570 ((head) != (element))); \
571 GNUNET_assert ((NULL == (element)->next_ ## mdll) && \
572 ((tail) != (element))); \
573 (element)->prev_ ## mdll = (tail); \
574 (element)->next_ ## mdll = NULL; \
575 if (NULL == (head)) \
581 (tail)->next_ ## mdll = element; \
583 (tail) = (element); \
598#define GNUNET_CONTAINER_MDLL_insert_after(mdll, head, tail, other, element) \
601 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
602 GNUNET_assert ((NULL == (element)->prev_ ## mdll) && \
603 ((head) != (element))); \
604 GNUNET_assert ((NULL == (element)->next_ ## mdll) && \
605 ((tail) != (element))); \
606 (element)->prev_ ## mdll = (other); \
609 (element)->next_ ## mdll = (head); \
610 (head) = (element); \
614 (element)->next_ ## mdll = (other)->next_ ## mdll; \
615 (other)->next_ ## mdll = (element); \
617 if (NULL == (element)->next_ ## mdll) \
619 (tail) = (element); \
623 (element)->next_ ## mdll->prev_ ## mdll = (element); \
639#define GNUNET_CONTAINER_MDLL_insert_before(mdll, head, tail, other, element) \
642 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
643 GNUNET_assert (((element)->prev_ ## mdll == NULL) && \
644 ((head) != (element))); \
645 GNUNET_assert (((element)->next_ ## mdll == NULL) && \
646 ((tail) != (element))); \
647 (element)->next_ ## mdll = (other); \
650 (element)->prev_ ## mdll = (tail); \
651 (tail) = (element); \
655 (element)->prev_ ## mdll = (other)->prev_ ## mdll; \
656 (other)->prev_ ## mdll = (element); \
658 if (NULL == (element)->prev_ ## mdll) \
660 (head) = (element); \
664 (element)->prev_ ## mdll->next_ ## mdll = (element); \
680#define GNUNET_CONTAINER_MDLL_remove(mdll, head, tail, element) \
683 GNUNET_assert ((NULL != (element)->prev_ ## mdll) || \
684 ((head) == (element))); \
685 GNUNET_assert ((NULL != (element)->next_ ## mdll) || \
686 ((tail) == (element))); \
687 if (NULL == (element)->prev_ ## mdll) \
689 (head) = (element)->next_ ## mdll; \
693 (element)->prev_ ## mdll->next_ ## mdll = \
694 (element)->next_ ## mdll; \
696 if (NULL == (element)->next_ ## mdll) \
698 (tail) = (element)->prev_ ## mdll; \
702 (element)->next_ ## mdll->prev_ ## mdll = \
703 (element)->prev_ ## mdll; \
705 (element)->next_ ## mdll = NULL; \
706 (element)->prev_ ## mdll = NULL; \
723#define GNUNET_CONTAINER_DLL_insert_sorted(TYPE, \
731 if ((NULL == head) || \
732 (0 < comparator (comparator_cls, element, head))) \
735 GNUNET_CONTAINER_DLL_insert (head, tail, element); \
741 for (pos = head; NULL != pos; pos = pos->next) \
743 if (0 < comparator (comparator_cls, element, pos)) \
750 GNUNET_CONTAINER_DLL_insert_tail (head, tail, element); \
754 GNUNET_CONTAINER_DLL_insert_after (head, \
static char * data
The data to insert into the dht.
static int result
Global testing status.
commonly used definitions; globals in this file are exempt from the rule that the module name ("commo...
cryptographic primitives for GNUnet
Hash maps with multiple values per key.
void GNUNET_CONTAINER_bloomfilter_resize(struct GNUNET_CONTAINER_BloomFilter *bf, GNUNET_CONTAINER_HashCodeIterator iterator, void *iterator_cls, size_t size, unsigned int k)
Resize a bloom filter.
struct GNUNET_CONTAINER_BloomFilter * GNUNET_CONTAINER_bloomfilter_init(const char *data, size_t size, unsigned int k)
Create a Bloom filter from raw bits.
void GNUNET_CONTAINER_bloomfilter_add(struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Add an element to the filter.
bool GNUNET_CONTAINER_bloomfilter_test(const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Test if an element is in the filter.
struct GNUNET_CONTAINER_BloomFilter * GNUNET_CONTAINER_bloomfilter_copy(const struct GNUNET_CONTAINER_BloomFilter *bf)
Create a copy of a bloomfilter.
void GNUNET_CONTAINER_bloomfilter_clear(struct GNUNET_CONTAINER_BloomFilter *bf)
Reset a Bloom filter to empty.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_bloomfilter_get_raw_data(const struct GNUNET_CONTAINER_BloomFilter *bf, char *data, size_t size)
Copy the raw data of this Bloom filter into the given data array.
int(* GNUNET_CONTAINER_HashCodeIterator)(void *cls, struct GNUNET_HashCode *next)
Iterator over struct GNUNET_HashCode.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_bloomfilter_or2(struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_CONTAINER_BloomFilter *to_or)
"or" the entries of the given raw data array with the data of the given Bloom filter.
struct GNUNET_CONTAINER_BloomFilter * GNUNET_CONTAINER_bloomfilter_load(const char *filename, size_t size, unsigned int k)
Load a Bloom filter from a file.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_bloomfilter_or(struct GNUNET_CONTAINER_BloomFilter *bf, const char *data, size_t size)
"or" the entries of the given raw data array with the data of the given Bloom filter.
size_t GNUNET_CONTAINER_bloomfilter_get_size(const struct GNUNET_CONTAINER_BloomFilter *bf)
Get size of the bloom filter.
void GNUNET_CONTAINER_bloomfilter_remove(struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Remove an element from the filter.
void GNUNET_CONTAINER_bloomfilter_free(struct GNUNET_CONTAINER_BloomFilter *bf)
Free the space associated with a filter in memory, flush to drive if needed (do not free the space on...
void * GNUNET_CONTAINER_heap_remove_node(struct GNUNET_CONTAINER_HeapNode *node)
Removes a node from the heap.
void * GNUNET_CONTAINER_heap_peek(const struct GNUNET_CONTAINER_Heap *heap)
Get element stored at the root of heap.
GNUNET_CONTAINER_HeapOrder
Heap type, either max or min.
GNUNET_CONTAINER_HeapCostType GNUNET_CONTAINER_heap_node_get_cost(const struct GNUNET_CONTAINER_HeapNode *node)
Get the current cost of the node.
void * GNUNET_CONTAINER_heap_remove_root(struct GNUNET_CONTAINER_Heap *heap)
Remove root of the heap.
void GNUNET_CONTAINER_heap_update_cost(struct GNUNET_CONTAINER_HeapNode *node, GNUNET_CONTAINER_HeapCostType new_cost)
Updates the cost of any node in the tree.
struct GNUNET_CONTAINER_HeapNode * GNUNET_CONTAINER_heap_insert(struct GNUNET_CONTAINER_Heap *heap, void *element, GNUNET_CONTAINER_HeapCostType cost)
Inserts a new element into the heap.
enum GNUNET_GenericReturnValue(* GNUNET_CONTAINER_HeapIterator)(void *cls, struct GNUNET_CONTAINER_HeapNode *node, void *element, GNUNET_CONTAINER_HeapCostType cost)
Iterator for heap.
unsigned int GNUNET_CONTAINER_heap_get_size(const struct GNUNET_CONTAINER_Heap *heap)
Get the current size of the heap.
void GNUNET_CONTAINER_heap_iterate(const struct GNUNET_CONTAINER_Heap *heap, GNUNET_CONTAINER_HeapIterator iterator, void *iterator_cls)
Iterate over all entries in the heap, in no particular order.
uint64_t GNUNET_CONTAINER_HeapCostType
Cost by which elements in a heap can be ordered.
struct GNUNET_CONTAINER_Heap * GNUNET_CONTAINER_heap_create(enum GNUNET_CONTAINER_HeapOrder order)
Create a new heap.
void GNUNET_CONTAINER_heap_destroy(struct GNUNET_CONTAINER_Heap *heap)
Destroys the heap.
void * GNUNET_CONTAINER_heap_walk_get_next(struct GNUNET_CONTAINER_Heap *heap)
Perform a random walk of the tree.
@ GNUNET_CONTAINER_HEAP_ORDER_MIN
Heap with the minimum cost at the root.
@ GNUNET_CONTAINER_HEAP_ORDER_MAX
Heap with the maximum cost at the root.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_heap_peek2(const struct GNUNET_CONTAINER_Heap *heap, void **element, GNUNET_CONTAINER_HeapCostType *cost)
Get element and cost stored at the root of heap.
char * GNUNET_decompress(const char *input, size_t input_size, size_t output_size)
Decompress input, return the decompressed data as output.
int GNUNET_try_compression(const char *data, size_t old_size, char **result, size_t *new_size)
Try to compress the given block of data using libz.
size_t GNUNET_CONTAINER_bloomfilter_get_element_addresses(const struct GNUNET_CONTAINER_BloomFilter *bf)
Get the number of the addresses set per element in the bloom filter.
GNUNET_GenericReturnValue
Named constants for return values.
static unsigned int size
Size of the "table".
Handle to an element in a heap.
void * element
Our element.
struct GNUNET_CONTAINER_Heap * heap
Heap this node belongs to.
enum GNUNET_CONTAINER_HeapOrder order
How is the heap sorted?