Mercurial > dovecot > original-hg > dovecot-1.2
view src/lib/hash2.h @ 9191:b340ecb24469 HEAD
Fix VPATH build of RQUOTA support.
Some rpcgen derive #include "..." paths from the infile argument.
This will be off for VPATH builds, as the generated rquota_xdr.c
code will look in $(srcdir), but we'll generate the rquota.h file in
$(builddir). Play safe and copy rquota.x to $(builddir) first.
This fixes the build on openSUSE 11.1.
author | Matthias Andree <matthias.andree@gmx.de> |
---|---|
date | Tue, 07 Jul 2009 21:01:36 +0200 |
parents | 29ed66459a74 |
children |
line wrap: on
line source
#ifndef HASH2_H #define HASH2_H struct hash2_iter { struct hash2_value *value, *next_value; unsigned int key_hash; }; /* Returns hash code for the key. */ typedef unsigned int hash2_key_callback_t(const void *key); /* Returns TRUE if the key matches the value. */ typedef bool hash2_cmp_callback_t(const void *key, const void *value, void *context); /* Create a new hash table. If initial_size is 0, the default value is used. */ struct hash2_table * hash2_create(unsigned int initial_size, unsigned int value_size, hash2_key_callback_t *key_hash_cb, hash2_cmp_callback_t *key_compare_cb, void *context); void hash2_destroy(struct hash2_table **hash); /* Remove all nodes from hash table. */ void hash2_clear(struct hash2_table *hash); void *hash2_lookup(const struct hash2_table *hash, const void *key) ATTR_PURE; /* Iterate through all nodes with the given hash. iter must initially be zero-filled. */ void *hash2_iterate(const struct hash2_table *hash, unsigned int key_hash, struct hash2_iter *iter); /* Insert node to the hash table and returns pointer to the value that can be written to. Assumes it doesn't already exist (or that a duplicate entry is wanted). */ void *hash2_insert(struct hash2_table *hash, const void *key); /* Like hash2_insert(), but insert directly using a hash. */ void *hash2_insert_hash(struct hash2_table *hash, unsigned int key_hash); /* Remove a node. */ void hash2_remove(struct hash2_table *hash, const void *key); /* Remove the last node iterator returned. Iterating continues from the next node. */ void hash2_remove_iter(struct hash2_table *hash, struct hash2_iter *iter); /* Return the number of nodes in hash table. */ unsigned int hash2_count(const struct hash2_table *hash) ATTR_PURE; #endif