da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* : : generated by proto : : */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/***********************************************************************
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* This software is part of the ast package *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Copyright (c) 1985-2010 AT&T Intellectual Property *
7c2fbfb345896881c631598ee3852ce9ce33fb07April Chin* and is licensed under the *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Common Public License, Version 1.0 *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* 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 interface definitions
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin * NOTE: new code should use the more general <cdt.h>
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#if !defined(__PROTO__)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#if !defined(__LINKAGE__)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_ALLOCATE (1L<<0) /* allocate new key names */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_HASHED (1L<<6) /* key names already hashed */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_RESIZE (1L<<2) /* table has been resized */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_SCANNING (1L<<3) /* currently scanning scope */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_SCOPE (1L<<4) /* push scope / create in bot */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_STATIC (1L<<5) /* static table allocation */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_CREATE (1L<<8) /* create bucket if not found */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_DELETE (1L<<9) /* delete bucket if found */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_RENAME (1L<<7) /* rename bucket if found */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_BUCKET (1L<<11) /* name is installed bucket */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_INSTALL (1L<<12) /* install allocated bucket */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_VALUE (1L<<15) /* value bucket field used */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define HASH_SIZE(n) (((long)(n))<<16) /* fixed bucket size */
#include <hashpart.h>
#define hashgetbucket(s) ((Hash_bucket_t*)((s)-((sizeof(Hash_bucket_t)+sizeof(char*)-1)/sizeof(char*))*sizeof(char*)))
#ifdef _HASH_POSITION_PRIVATE_
#ifdef _HASH_LAST_PRIVATE_
#ifdef _HASH_ROOT_PRIVATE_
#ifdef _HASH_TABLE_PRIVATE_
extern __MANGLE__ int hashwalk __PROTO__((Hash_table_t*, int, int (*)(const char*, char*, __V_*), __V_*));