1N/A
1N/A/* : : generated by proto : : */
1N/A/***********************************************************************
1N/A* *
1N/A* This software is part of the ast package *
1N/A* Copyright (c) 1985-2011 AT&T Intellectual Property *
1N/A* and is licensed under the *
1N/A* Common Public License, Version 1.0 *
1N/A* by AT&T Intellectual Property *
1N/A* *
1N/A* A copy of the License is available at *
1N/A* http://www.opensource.org/licenses/cpl1.0.txt *
1N/A* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
1N/A* *
1N/A* Information and Software Systems Research *
1N/A* AT&T Research *
1N/A* Florham Park NJ *
1N/A* *
1N/A* Glenn Fowler <gsf@research.att.com> *
1N/A* David Korn <dgk@research.att.com> *
1N/A* Phong Vo <kpv@research.att.com> *
1N/A* *
1N/A***********************************************************************/
1N/A
1N/A/*
1N/A * Glenn Fowler
1N/A * AT&T Research
1N/A *
1N/A * hash table library interface definitions
1N/A *
1N/A * NOTE: new code should use the more general <cdt.h>
1N/A */
1N/A
1N/A#ifndef _HASH_H
1N/A#if !defined(__PROTO__)
1N/A#include <prototyped.h>
1N/A#endif
1N/A#if !defined(__LINKAGE__)
1N/A#define __LINKAGE__ /* 2004-08-11 transition */
1N/A#endif
1N/A
1N/A#define _HASH_H
1N/A
1N/A#define HASH_ALLOCATE (1L<<0) /* allocate new key names */
1N/A#define HASH_FIXED (1L<<1) /* fixed table size */
1N/A#define HASH_HASHED (1L<<6) /* key names already hashed */
1N/A#define HASH_RESIZE (1L<<2) /* table has been resized */
1N/A#define HASH_SCANNING (1L<<3) /* currently scanning scope */
1N/A#define HASH_SCOPE (1L<<4) /* push scope / create in bot */
1N/A#define HASH_STATIC (1L<<5) /* static table allocation */
1N/A
1N/A#define HASH_CREATE (1L<<8) /* create bucket if not found */
1N/A#define HASH_DELETE (1L<<9) /* delete bucket if found */
1N/A#define HASH_LOOKUP 0 /* default op */
1N/A#define HASH_RENAME (1L<<7) /* rename bucket if found */
1N/A
1N/A#define HASH_BUCKET (1L<<11) /* name is installed bucket */
1N/A#define HASH_INSTALL (1L<<12) /* install allocated bucket */
1N/A#define HASH_NOSCOPE (1L<<13) /* top scope only */
1N/A#define HASH_OPAQUE (1L<<14) /* opaque bucket */
1N/A#define HASH_VALUE (1L<<15) /* value bucket field used */
1N/A
1N/A#define HASH_SIZE(n) (((long)(n))<<16) /* fixed bucket size */
1N/A#define HASH_SIZEOF(f) ((((long)(f))>>16)&0xffff) /* extract size */
1N/A
1N/A#define HASH_DELETED ((unsigned long)1<<(8*sizeof(int)-1)) /* deleted placeholder */
1N/A#define HASH_KEEP (1L<<(8*sizeof(int)-2)) /* no free on bucket */
1N/A#define HASH_HIDDEN (1L<<(8*sizeof(int)-3)) /* hidden by scope */
1N/A#define HASH_HIDES (1L<<(8*sizeof(int)-4)) /* hides lower scope */
1N/A#define HASH_OPAQUED (1L<<(8*sizeof(int)-5)) /* opaqued placeholder */
1N/A#define HASH_FREENAME (1L<<(8*sizeof(int)-6)) /* free bucket name */
1N/A
1N/A#define HASH_RESET (HASH_RESIZE|HASH_SCOPE|HASH_STATIC|HASH_VALUE)
1N/A#define HASH_INTERNAL (HASH_BUCKET|HASH_RESIZE|HASH_SCANNING|HASH_STATIC)
1N/A#define HASH_FLAGS (HASH_DELETED|HASH_FREENAME|HASH_HIDDEN|HASH_HIDES|HASH_KEEP|HASH_OPAQUED)
1N/A
1N/A#define HASH_alloc 1
1N/A#define HASH_clear 2
1N/A#define HASH_compare 3
1N/A#define HASH_free 4
1N/A#define HASH_hash 5
1N/A#define HASH_meanchain 6
1N/A#define HASH_name 7
1N/A#define HASH_namesize 8
1N/A#define HASH_set 9
1N/A#define HASH_size 10
1N/A#define HASH_table 11
1N/A#define HASH_va_list 12
1N/A
1N/A#define HASH_bucketsize 13
1N/A
1N/A#define HASH_region 14
1N/A
1N/A#include <hashpart.h>
1N/A
1N/A#define hashclear(t,f) ((t)->flags &= ~((f) & ~HASH_INTERNAL))
1N/A#define hashcover(b) (((b)->hash&HASH_HIDES)?(Hash_bucket_t*)((b)->name):(Hash_bucket_t*)0)
1N/A#define hashdel(t,n) hashlook(t, (char*)(n), HASH_DELETE, (char*)0)
1N/A#define hashget(t,n) hashlook(t, (char*)(n), HASH_LOOKUP|HASH_VALUE, (char*)0)
1N/A#define hashgetbucket(s) ((Hash_bucket_t*)((s)-((sizeof(Hash_bucket_t)+sizeof(char*)-1)/sizeof(char*))*sizeof(char*)))
1N/A#define hashkeep(b) ((b)->hash|=HASH_KEEP)
1N/A#define hashname(b) ((((b)->hash&HASH_HIDES)?((Hash_bucket_t*)((b)->name)):(b))->name)
1N/A#define hashput(t,n,v) hashlook(t, (char*)(n), HASH_CREATE|HASH_VALUE, (char*)(v))
1N/A#define hashref(t,n) hashlook(t, (char*)(n), HASH_LOOKUP|HASH_INTERNAL|HASH_VALUE, (char*)0)
1N/A#define hashscope(t) ((t)->scope)
1N/A#define hashset(t,f) ((t)->flags |= ((f) & ~HASH_INTERNAL))
1N/A
1N/A/*
1N/A * DEPRECATED renames for compatibility
1N/A */
1N/A
1N/A#define Hashbin_t Hash_bucket_t
1N/A#define HASHBUCKET Hash_bucket_t
1N/A#define Hashhdr_t Hash_header_t
1N/A#define HASHHEADER Hash_header_t
1N/A#define Hashpos_t Hash_position_t
1N/A#define HASHPOSITION Hash_position_t
1N/A#define Hashtab_t Hash_table_t
1N/A#define HASHTABLE Hash_table_t
1N/A
1N/A#define vhashalloc hashvalloc
1N/A#define hashvalloc(t,a) hashalloc(t,HASH_va_list,a,0)
1N/A
1N/A/*
1N/A * the #define's avoid union tags
1N/A */
1N/A
1N/Atypedef struct Hash_bucket Hash_bucket_t;
1N/Atypedef struct Hash_root Hash_root_t;
1N/Atypedef struct Hash_table Hash_table_t;
1N/A
1N/A#define HASH_HEADER /* common bucket header */ \
1N/A Hash_bucket_t* next; /* next in collision chain */ \
1N/A unsigned int hash; /* hash flags and value */ \
1N/A char* name /* key name */
1N/A
1N/A#define HASH_DEFAULT /* HASH_VALUE bucket elements */ \
1N/A char* value /* key value */
1N/A
1N/Atypedef struct /* bucket header */
1N/A{
1N/A HASH_HEADER;
1N/A} Hash_header_t;
1N/A
1N/Astruct Hash_bucket /* prototype bucket */
1N/A{
1N/A HASH_HEADER;
1N/A HASH_DEFAULT;
1N/A};
1N/A
1N/Atypedef struct /* hash scan bucket position */
1N/A{
1N/A Hash_bucket_t* bucket; /* bucket */
1N/A#ifdef _HASH_POSITION_PRIVATE_
1N/A _HASH_POSITION_PRIVATE_
1N/A#endif
1N/A} Hash_position_t;
1N/A
1N/Atypedef struct /* last lookup cache */
1N/A{
1N/A Hash_table_t* table; /* last lookup table */
1N/A Hash_bucket_t* bucket; /* last lookup bucket */
1N/A#ifdef _HASH_LAST_PRIVATE_
1N/A _HASH_LAST_PRIVATE_
1N/A#endif
1N/A} Hash_last_t;
1N/A
1N/Astruct Hash_root /* root hash table information */
1N/A{
1N/A int accesses; /* number of accesses */
1N/A int collisions; /* number of collisions */
1N/A int flags; /* flags: see HASH_[A-Z]* */
1N/A Hash_last_t last; /* last lookup cache */
1N/A __V_* context; /* user defined context */
1N/A#ifdef _HASH_ROOT_PRIVATE_
1N/A _HASH_ROOT_PRIVATE_
1N/A#endif
1N/A};
1N/A
1N/Astruct Hash_table /* hash table information */
1N/A{
1N/A Hash_root_t* root; /* root hash table information */
1N/A int size; /* table size */
1N/A int buckets; /* active bucket count */
1N/A char* name; /* table name */
1N/A Hash_table_t* scope; /* scope covered table */
1N/A short flags; /* flags: see HASH_[A-Z]* */
1N/A#ifdef _HASH_TABLE_PRIVATE_
1N/A _HASH_TABLE_PRIVATE_
1N/A#endif
1N/A};
1N/A
1N/A#if _BLD_ast && defined(__EXPORT__)
1N/A#undef __MANGLE__
1N/A#define __MANGLE__ __LINKAGE__ __EXPORT__
1N/A#endif
1N/A
1N/Aextern __MANGLE__ Hash_table_t* hashalloc __PROTO__((Hash_table_t*, ...));
1N/Aextern __MANGLE__ void hashdone __PROTO__((Hash_position_t*));
1N/Aextern __MANGLE__ void hashdump __PROTO__((Hash_table_t*, int));
1N/Aextern __MANGLE__ Hash_table_t* hashfree __PROTO__((Hash_table_t*));
1N/Aextern __MANGLE__ Hash_bucket_t* hashlast __PROTO__((Hash_table_t*));
1N/Aextern __MANGLE__ char* hashlook __PROTO__((Hash_table_t*, const char*, long, const char*));
1N/Aextern __MANGLE__ Hash_bucket_t* hashnext __PROTO__((Hash_position_t*));
1N/Aextern __MANGLE__ Hash_position_t* hashscan __PROTO__((Hash_table_t*, int));
1N/Aextern __MANGLE__ void hashsize __PROTO__((Hash_table_t*, int));
1N/Aextern __MANGLE__ Hash_table_t* hashview __PROTO__((Hash_table_t*, Hash_table_t*));
1N/Aextern __MANGLE__ int hashwalk __PROTO__((Hash_table_t*, int, int (*)(const char*, char*, __V_*), __V_*));
1N/A
1N/A#undef __MANGLE__
1N/A#define __MANGLE__ __LINKAGE__
1N/A
1N/A#endif