mirror of
https://salsa.debian.org/srivasta/make-dfsg.git
synced 2024-12-27 06:27:57 +00:00
234 lines
8.4 KiB
C
234 lines
8.4 KiB
C
/* hash.h -- decls for hash table
|
||
Copyright (C) 1995, 1999, 2002, 2010 Free Software Foundation, Inc.
|
||
Written by Greg McGary <gkm@gnu.org> <greg@mcgary.org>
|
||
|
||
GNU Make is free software; you can redistribute it and/or modify it under the
|
||
terms of the GNU General Public License as published by the Free Software
|
||
Foundation; either version 3 of the License, or (at your option) any later
|
||
version.
|
||
|
||
GNU Make is distributed in the hope that it will be useful, but WITHOUT ANY
|
||
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
|
||
A PARTICULAR PURPOSE. See the GNU General Public License for more details.
|
||
|
||
You should have received a copy of the GNU General Public License along with
|
||
this program. If not, see <http://www.gnu.org/licenses/>. */
|
||
|
||
#ifndef _hash_h_
|
||
#define _hash_h_
|
||
|
||
#include <stdio.h>
|
||
#include <ctype.h>
|
||
|
||
#if defined __cplusplus || (defined __STDC__ && __STDC__) || defined WINDOWS32
|
||
# if !defined __GLIBC__ || !defined __P
|
||
# undef __P
|
||
# define __P(protos) protos
|
||
# endif
|
||
#else /* Not C++ or ANSI C. */
|
||
# undef __P
|
||
# define __P(protos) ()
|
||
/* We can get away without defining 'const' here only because in this file
|
||
it is used only inside the prototype for 'fnmatch', which is elided in
|
||
non-ANSI C where 'const' is problematical. */
|
||
#endif /* C++ or ANSI C. */
|
||
|
||
typedef unsigned long (*hash_func_t) __P((void const *key));
|
||
typedef int (*hash_cmp_func_t) __P((void const *x, void const *y));
|
||
typedef void (*hash_map_func_t) __P((void const *item));
|
||
typedef void (*hash_map_arg_func_t) __P((void const *item, void *arg));
|
||
|
||
struct hash_table
|
||
{
|
||
void **ht_vec;
|
||
hash_func_t ht_hash_1; /* primary hash function */
|
||
hash_func_t ht_hash_2; /* secondary hash function */
|
||
hash_cmp_func_t ht_compare; /* comparison function */
|
||
unsigned long ht_size; /* total number of slots (power of 2) */
|
||
unsigned long ht_capacity; /* usable slots, limited by loading-factor */
|
||
unsigned long ht_fill; /* items in table */
|
||
unsigned long ht_empty_slots; /* empty slots not including deleted slots */
|
||
unsigned long ht_collisions; /* # of failed calls to comparison function */
|
||
unsigned long ht_lookups; /* # of queries */
|
||
unsigned int ht_rehashes; /* # of times we've expanded table */
|
||
};
|
||
|
||
typedef int (*qsort_cmp_t) __P((void const *, void const *));
|
||
|
||
void hash_init __P((struct hash_table *ht, unsigned long size,
|
||
hash_func_t hash_1, hash_func_t hash_2, hash_cmp_func_t hash_cmp));
|
||
void hash_load __P((struct hash_table *ht, void *item_table,
|
||
unsigned long cardinality, unsigned long size));
|
||
void **hash_find_slot __P((struct hash_table *ht, void const *key));
|
||
void *hash_find_item __P((struct hash_table *ht, void const *key));
|
||
void *hash_insert __P((struct hash_table *ht, const void *item));
|
||
void *hash_insert_at __P((struct hash_table *ht, const void *item, void const *slot));
|
||
void *hash_delete __P((struct hash_table *ht, void const *item));
|
||
void *hash_delete_at __P((struct hash_table *ht, void const *slot));
|
||
void hash_delete_items __P((struct hash_table *ht));
|
||
void hash_free_items __P((struct hash_table *ht));
|
||
void hash_free __P((struct hash_table *ht, int free_items));
|
||
void hash_map __P((struct hash_table *ht, hash_map_func_t map));
|
||
void hash_map_arg __P((struct hash_table *ht, hash_map_arg_func_t map, void *arg));
|
||
void hash_print_stats __P((struct hash_table *ht, FILE *out_FILE));
|
||
void **hash_dump __P((struct hash_table *ht, void **vector_0, qsort_cmp_t compare));
|
||
|
||
extern void *hash_deleted_item;
|
||
#define HASH_VACANT(item) ((item) == 0 || (void *) (item) == hash_deleted_item)
|
||
|
||
|
||
/* hash and comparison macros for case-sensitive string keys. */
|
||
|
||
/* Due to the strcache, it's not uncommon for the string pointers to
|
||
be identical. Take advantage of that to short-circuit string compares. */
|
||
|
||
#define STRING_HASH_1(KEY, RESULT) do { \
|
||
unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
|
||
while (*++_key_) \
|
||
(RESULT) += (*_key_ << (_key_[1] & 0xf)); \
|
||
} while (0)
|
||
#define return_STRING_HASH_1(KEY) do { \
|
||
unsigned long _result_ = 0; \
|
||
STRING_HASH_1 ((KEY), _result_); \
|
||
return _result_; \
|
||
} while (0)
|
||
|
||
#define STRING_HASH_2(KEY, RESULT) do { \
|
||
unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
|
||
while (*++_key_) \
|
||
(RESULT) += (*_key_ << (_key_[1] & 0x7)); \
|
||
} while (0)
|
||
#define return_STRING_HASH_2(KEY) do { \
|
||
unsigned long _result_ = 0; \
|
||
STRING_HASH_2 ((KEY), _result_); \
|
||
return _result_; \
|
||
} while (0)
|
||
|
||
#define STRING_COMPARE(X, Y, RESULT) do { \
|
||
RESULT = (X) == (Y) ? 0 : strcmp ((X), (Y)); \
|
||
} while (0)
|
||
#define return_STRING_COMPARE(X, Y) do { \
|
||
return (X) == (Y) ? 0 : strcmp ((X), (Y)); \
|
||
} while (0)
|
||
|
||
|
||
#define STRING_N_HASH_1(KEY, N, RESULT) do { \
|
||
unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
|
||
int _n_ = (N); \
|
||
if (_n_) \
|
||
while (--_n_ && *++_key_) \
|
||
(RESULT) += (*_key_ << (_key_[1] & 0xf)); \
|
||
(RESULT) += *++_key_; \
|
||
} while (0)
|
||
#define return_STRING_N_HASH_1(KEY, N) do { \
|
||
unsigned long _result_ = 0; \
|
||
STRING_N_HASH_1 ((KEY), (N), _result_); \
|
||
return _result_; \
|
||
} while (0)
|
||
|
||
#define STRING_N_HASH_2(KEY, N, RESULT) do { \
|
||
unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
|
||
int _n_ = (N); \
|
||
if (_n_) \
|
||
while (--_n_ && *++_key_) \
|
||
(RESULT) += (*_key_ << (_key_[1] & 0x7)); \
|
||
(RESULT) += *++_key_; \
|
||
} while (0)
|
||
#define return_STRING_N_HASH_2(KEY, N) do { \
|
||
unsigned long _result_ = 0; \
|
||
STRING_N_HASH_2 ((KEY), (N), _result_); \
|
||
return _result_; \
|
||
} while (0)
|
||
|
||
#define STRING_N_COMPARE(X, Y, N, RESULT) do { \
|
||
RESULT = (X) == (Y) ? 0 : strncmp ((X), (Y), (N)); \
|
||
} while (0)
|
||
#define return_STRING_N_COMPARE(X, Y, N) do { \
|
||
return (X) == (Y) ? 0 : strncmp ((X), (Y), (N)); \
|
||
} while (0)
|
||
|
||
#ifdef HAVE_CASE_INSENSITIVE_FS
|
||
|
||
/* hash and comparison macros for case-insensitive string _key_s. */
|
||
|
||
#define ISTRING_HASH_1(KEY, RESULT) do { \
|
||
unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
|
||
while (*++_key_) \
|
||
(RESULT) += ((isupper (*_key_) ? tolower (*_key_) : *_key_) << (_key_[1] & 0xf)); \
|
||
} while (0)
|
||
#define return_ISTRING_HASH_1(KEY) do { \
|
||
unsigned long _result_ = 0; \
|
||
ISTRING_HASH_1 ((KEY), _result_); \
|
||
return _result_; \
|
||
} while (0)
|
||
|
||
#define ISTRING_HASH_2(KEY, RESULT) do { \
|
||
unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
|
||
while (*++_key_) \
|
||
(RESULT) += ((isupper (*_key_) ? tolower (*_key_) : *_key_) << (_key_[1] & 0x7)); \
|
||
} while (0)
|
||
#define return_ISTRING_HASH_2(KEY) do { \
|
||
unsigned long _result_ = 0; \
|
||
ISTRING_HASH_2 ((KEY), _result_); \
|
||
return _result_; \
|
||
} while (0)
|
||
|
||
#define ISTRING_COMPARE(X, Y, RESULT) do { \
|
||
RESULT = (X) == (Y) ? 0 : strcasecmp ((X), (Y)); \
|
||
} while (0)
|
||
#define return_ISTRING_COMPARE(X, Y) do { \
|
||
return (X) == (Y) ? 0 : strcasecmp ((X), (Y)); \
|
||
} while (0)
|
||
|
||
#else
|
||
|
||
#define ISTRING_HASH_1(KEY, RESULT) STRING_HASH_1 ((KEY), (RESULT))
|
||
#define return_ISTRING_HASH_1(KEY) return_STRING_HASH_1 (KEY)
|
||
|
||
#define ISTRING_HASH_2(KEY, RESULT) STRING_HASH_2 ((KEY), (RESULT))
|
||
#define return_ISTRING_HASH_2(KEY) return_STRING_HASH_2 (KEY)
|
||
|
||
#define ISTRING_COMPARE(X, Y, RESULT) STRING_COMPARE ((X), (Y), (RESULT))
|
||
#define return_ISTRING_COMPARE(X, Y) return_STRING_COMPARE ((X), (Y))
|
||
|
||
#endif
|
||
|
||
/* hash and comparison macros for integer _key_s. */
|
||
|
||
#define INTEGER_HASH_1(KEY, RESULT) do { \
|
||
(RESULT) += ((unsigned long)(KEY)); \
|
||
} while (0)
|
||
#define return_INTEGER_HASH_1(KEY) do { \
|
||
unsigned long _result_ = 0; \
|
||
INTEGER_HASH_1 ((KEY), _result_); \
|
||
return _result_; \
|
||
} while (0)
|
||
|
||
#define INTEGER_HASH_2(KEY, RESULT) do { \
|
||
(RESULT) += ~((unsigned long)(KEY)); \
|
||
} while (0)
|
||
#define return_INTEGER_HASH_2(KEY) do { \
|
||
unsigned long _result_ = 0; \
|
||
INTEGER_HASH_2 ((KEY), _result_); \
|
||
return _result_; \
|
||
} while (0)
|
||
|
||
#define INTEGER_COMPARE(X, Y, RESULT) do { \
|
||
(RESULT) = X - Y; \
|
||
} while (0)
|
||
#define return_INTEGER_COMPARE(X, Y) do { \
|
||
int _result_; \
|
||
INTEGER_COMPARE (X, Y, _result_); \
|
||
return _result_; \
|
||
} while (0)
|
||
|
||
/* hash and comparison macros for address keys. */
|
||
|
||
#define ADDRESS_HASH_1(KEY, RESULT) INTEGER_HASH_1 (((unsigned long)(KEY)) >> 3, (RESULT))
|
||
#define ADDRESS_HASH_2(KEY, RESULT) INTEGER_HASH_2 (((unsigned long)(KEY)) >> 3, (RESULT))
|
||
#define ADDRESS_COMPARE(X, Y, RESULT) INTEGER_COMPARE ((X), (Y), (RESULT))
|
||
#define return_ADDRESS_HASH_1(KEY) return_INTEGER_HASH_1 (((unsigned long)(KEY)) >> 3)
|
||
#define return_ADDRESS_HASH_2(KEY) return_INTEGER_HASH_2 (((unsigned long)(KEY)) >> 3)
|
||
#define return_ADDRESS_COMPARE(X, Y) return_INTEGER_COMPARE ((X), (Y))
|
||
|
||
#endif /* not _hash_h_ */
|