da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/***********************************************************************
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* This software is part of the ast package *
3e14f97f673e8a630f076077de35afdd43dc1587Roger A. Faulkner* Copyright (c) 1985-2010 AT&T Intellectual Property *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* and is licensed under the *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Common Public License, Version 1.0 *
7c2fbfb345896881c631598ee3852ce9ce33fb07April Chin* by AT&T Intellectual Property *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* A copy of the License is available at *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Information and Software Systems Research *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* AT&T Research *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Florham Park NJ *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Glenn Fowler <gsf@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* David Korn <dgk@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Phong Vo <kpv@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin***********************************************************************/
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin * Glenn Fowler
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin * AT&T Research
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin * hash table library private definitions
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef int (*Hash_compare_f)(const char*, const char*, ...);
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef void* (*Hash_region_f)(void*, void*, size_t, int);
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef struct /* root local pointers */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin unsigned char bucketsize; /* min bucket size in char*'s */ \
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASHMINSIZE (1<<4) /* min table slots (power of 2) */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH(r,n,h) if (r->local->hash) h = r->namesize ? (*r->local->hash)(n, r->namesize) : (*r->local->hash)(n);\
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin register const char* _hash_s1 = n;\
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin register const char* _hash_s2 = _hash_s1 + r->namesize;\
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef struct /* library private info */