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/* Public interface for the dictionary library
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin** Written by Kiem-Phong Vo
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef struct _dt_s Dict_t; /* for libdict compatibility */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef Void_t* (*Dtsearch_f)_ARG_((Dt_t*,Void_t*,int));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef Void_t* (*Dtmake_f)_ARG_((Dt_t*,Void_t*,Dtdisc_t*));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef void (*Dtfree_f)_ARG_((Dt_t*,Void_t*,Dtdisc_t*));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef int (*Dtcompar_f)_ARG_((Dt_t*,Void_t*,Void_t*,Dtdisc_t*));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef unsigned int (*Dthash_f)_ARG_((Dt_t*,Void_t*,Dtdisc_t*));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef Void_t* (*Dtmemory_f)_ARG_((Dt_t*,Void_t*,size_t,Dtdisc_t*));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chintypedef int (*Dtevent_f)_ARG_((Dt_t*,int,Void_t*,Dtdisc_t*));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* private structure to hold an object */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* method to manipulate dictionary structure */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* stuff that may be in shared memory */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin /* for hash dt, > 0: fixed table size */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* structure to hold methods that manipulate an object */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin Dthash_f hashf; /* to compute hash value of an object */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DTDISC(dc,ky,sz,lk,mkf,frf,cmpf,hshf,memf,evf) \
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin ( (dc)->key = (ky), (dc)->size = (sz), (dc)->link = (lk), \
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DTOFFSET(struct_s, member) offsetof(struct_s, member)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DTOFFSET(struct_s, member) ((int)(&((struct_s*)0)->member))
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* the dictionary structure itself */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* structure to get status of a dictionary */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin int* dt_count; /* counts of chains or levels by size */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* flag set if the last search operation actually found the object */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* supported storage methods */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DT_OSET 0000004 /* ordered set (self-adjusting tree) */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DT_METHODS 0000177 /* all currently supported methods */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* asserts to dtdisc() */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DT_SAMECMP 0000001 /* compare methods equivalent */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DT_SAMEHASH 0000002 /* hash methods equivalent */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* types of search */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DT_INSERT 0000001 /* insert object if not found */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DT_VSEARCH 0002000 /* search using internal representation */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DT_ATTACH 0004000 /* attach an object to the dictionary */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DT_DETACH 0010000 /* detach an object from the dictionary */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* events */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DT_DISC 3 /* discipline is about to be changed */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define extern __EXPORT__
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define extern __IMPORT__
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* compatibility stuff; will go away */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define extern __EXPORT__
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chinextern Dtdisc_t* dtdisc _ARG_((Dt_t* dt, Dtdisc_t*, int));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chinextern Dtmethod_t* dtmethod _ARG_((Dt_t*, Dtmethod_t*));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chinextern int dtwalk _ARG_((Dt_t*, int(*)(Dt_t*,Void_t*,Void_t*), Void_t*));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chinextern unsigned int dtstrhash _ARG_((unsigned int, Void_t*, int));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chinextern int memcmp _ARG_((const Void_t*, const Void_t*, size_t));
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* internal functions for translating among holder, object and key */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin (ky = (dc)->key, sz = (dc)->size, lk = (dc)->link, cmpf = (dc)->comparf)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define _DTOBJ(e,lk) ((lk) < 0 ? ((Dthold_t*)(e))->obj : (Void_t*)((char*)(e) - (lk)) )
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define _DTKEY(o,ky,sz) (Void_t*)((sz) < 0 ? *((char**)((char*)(o)+(ky))) : ((char*)(o)+(ky)))
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define _DTHSH(dt,ky,dc,sz) ((dc)->hashf ? (*(dc)->hashf)(dt,ky,dc) : dtstrhash(0,ky,sz) )
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* special search function for tree structure only */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin do { Dtlink_t* _e; Void_t *_o, *_k, *_key; Dtdisc_t* _dc; \
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin for(_e = (dt)->data->here; _e; _e = _cmp < 0 ? _e->hl._left : _e->right) \
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if((_cmp = _DTCMP((dt), _key, _k, _dc, _cmpf, _sz)) == 0) \
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin } while(0)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin do { Dtlink_t* _e; Void_t *_o, *_k, *_key; Dtdisc_t* _dc; \
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin for(_e = (dt)->data->here; _e; _e = _cmp < 0 ? _e->hl._left : _e->right) \
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if((_cmp = _DTCMP((dt), _key, _k, _dc, _cmpf, _sz)) == 0) \
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin } while(0)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DTTREEMATCH(dt,key,action) _DTMTCH(_DT(dt),(Void_t*)(key),action)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DTTREESEARCH(dt,obj,action) _DTSRCH(_DT(dt),(Void_t*)(obj),action)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtfinger(d) (_DT(d)->data->here ? dtobj((d),_DT(d)->data->here):(Void_t*)(0))
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtfirst(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_FIRST)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtnext(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_NEXT)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtleast(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_NEXT)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtlast(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_LAST)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtprev(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_PREV)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtmost(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_PREV)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtsearch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtmatch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_MATCH)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtinsert(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_INSERT)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtdelete(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_DELETE)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtattach(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_ATTACH)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtdetach(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_DETACH)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtclear(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_CLEAR)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define DT_PRIME 17109811 /* 2#00000001 00000101 00010011 00110011 */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#define dtcharhash(h,c) (((unsigned int)(h) + (unsigned int)(c)) * DT_PRIME )
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#endif /* _CDT_H */