dthash.c

Go to the documentation of this file.

#include        <cdt/dthdr.h>
#include        <stdlib.h>
 
/*      Hash table.
**      dt:     dictionary
**      obj:    what to look for
**      type:   type of search
**
**      Written by Kiem-Phong Vo (05/25/96)
*/
 
/* resize the hash table */
static void dthtab(Dt_t* dt)
{
        Dtlink_t        *t, *r, *p, **s, **hs, **is, **olds;
        int n;
 
        /* compute new table size */
        if((n = dt->data->ntab) == 0)
                n = HSLOT;
        while(dt->data->size > HLOAD(n))
                n = HRESIZE(n);
        if(n == dt->data->ntab)
                return;
 
        /* allocate new table */
        olds = dt->data->ntab == 0 ? NULL : dt->data->htab;
        if (!(s = realloc(olds, n * sizeof(Dtlink_t*))))
                return;
        olds = s + dt->data->ntab;
        dt->data->htab = s;
        dt->data->ntab = n;
 
        /* rehash elements */
        for(hs = s+n-1; hs >= olds; --hs)
                *hs = NULL;
        for(hs = s; hs < olds; ++hs)
        {       for(p = NULL, t = *hs; t; t = r)
                {       r = t->right;
                        if((is = s + HINDEX(n,t->hash)) == hs)
                                p = t;
                        else    /* move to a new chain */
                        {       if(p)
                                        p->right = r;
                                else    *hs = r;
                                t->right = *is; *is = t;
                        }
                }
        }
}
 
static void* dthash(Dt_t* dt, void* obj, int type)
{
        Dtlink_t        *t, *r = NULL, *p;
        void    *k, *key;
        unsigned hsh;
        int             lk, sz, ky;
        Dtcompar_f      cmpf;
        Dtdisc_t*       disc;
        Dtlink_t        **s = NULL, **ends;
 
        UNFLATTEN(dt);
 
        /* initialize discipline data */
        disc = dt->disc; _DTDSC(disc,ky,sz,lk,cmpf);
 
        if(!obj)
        {       if(type&(DT_NEXT|DT_PREV))
                        goto end_walk;
 
                if(dt->data->size <= 0 || !(type&(DT_CLEAR|DT_FIRST|DT_LAST)) )
                        return NULL;
 
                ends = (s = dt->data->htab) + dt->data->ntab;
                if(type&DT_CLEAR)
                {       /* clean out all objects */
                        for(; s < ends; ++s)
                        {       t = *s;
                                *s = NULL;
                                if(!disc->freef && disc->link >= 0)
                                        continue;
                                while(t)
                                {       r = t->right;
                                        if(disc->freef)
                                                disc->freef(_DTOBJ(t, lk));
                                        if(disc->link < 0)
                                                free(t);
                                        t = r;
                                }
                        }
                        dt->data->here = NULL;
                        dt->data->size = 0;
                        dt->data->loop = 0;
                        return NULL;
                }
                else    /* computing the first/last object */
                {       t = NULL;
                        while(s < ends && !t )
                                t = (type&DT_LAST) ? *--ends : *s++;
                        if(t && (type&DT_LAST))
                                for(; t->right; t = t->right)
                                        ;
 
                        dt->data->loop += 1;
                        dt->data->here = t;
                        return t ? _DTOBJ(t,lk) : NULL;
                }
        }
 
        if(type&(DT_MATCH|DT_SEARCH|DT_INSERT) )
        {       key = (type&DT_MATCH) ? obj : _DTKEY(obj,ky,sz);
                hsh = dtstrhash(key, sz);
                goto do_search;
        }
        else if(type&(DT_RENEW|DT_VSEARCH) )
        {       r = obj;
                obj = _DTOBJ(r,lk);
                key = _DTKEY(obj,ky,sz);
                hsh = r->hash;
                goto do_search;
        }
        else /*if(type&(DT_DELETE|DT_DETACH|DT_NEXT|DT_PREV))*/
        {       if((t = dt->data->here) && _DTOBJ(t,lk) == obj)
                {       hsh = t->hash;
                        s = dt->data->htab + HINDEX(dt->data->ntab,hsh);
                        p = NULL;
                }
                else
                {       key = _DTKEY(obj,ky,sz);
                        hsh = dtstrhash(key, sz);
                do_search:
                        t = dt->data->ntab <= 0 ? NULL :
                                *(s = dt->data->htab + HINDEX(dt->data->ntab,hsh));
                        for(p = NULL; t; p = t, t = t->right)
                        {       if(hsh == t->hash)
                                {       k = _DTOBJ(t,lk); k = _DTKEY(k,ky,sz);
                                        if(_DTCMP(key, k, cmpf, sz) == 0)
                                                break;
                                }
                        }
                }
        }
 
        if(type&(DT_MATCH|DT_SEARCH|DT_VSEARCH))
        {       if(!t)
                        return NULL;
                if(p && (dt->data->type&DT_SET) && dt->data->loop <= 0)
                {       /* move-to-front heuristic */
                        p->right = t->right;
                        t->right = *s;
                        *s = t;
                }
                dt->data->here = t;
                return _DTOBJ(t,lk);
        }
        else if(type&DT_INSERT)
        {       if(t && (dt->data->type&DT_SET) )
                {       dt->data->here = t;
                        return _DTOBJ(t,lk);
                }
 
                if (disc->makef && (type&DT_INSERT) && !(obj = disc->makef(obj, disc)))
                        return NULL;
                if(lk >= 0)
                        r = _DTLNK(obj,lk);
                else
                {       r = malloc(sizeof(Dthold_t));
                        if(r)
                                ((Dthold_t*)r)->obj = obj;
                        else
                        {       if(disc->makef && disc->freef && (type&DT_INSERT))
                                        disc->freef(obj);
                                return NULL;
                        }
                }
                r->hash = hsh;
 
                /* insert object */
        do_insert:
                if((dt->data->size += 1) > HLOAD(dt->data->ntab) && dt->data->loop <= 0 )
                        dthtab(dt);
                if(dt->data->ntab == 0)
                {       dt->data->size -= 1;
                        if(disc->freef && (type&DT_INSERT))
                                disc->freef(obj);
                        if(disc->link < 0)
                                free(r);
                        return NULL;
                }
                s = dt->data->htab + HINDEX(dt->data->ntab,hsh);
                if(t)
                {       r->right = t->right;
                        t->right = r;
                }
                else
                {       r->right = *s;
                        *s = r;
                }
                dt->data->here = r;
                return obj;
        }
        else if(type&DT_NEXT)
        {       if(t && !(p = t->right) )
                {       for(ends = dt->data->htab+dt->data->ntab, s += 1; s < ends; ++s)
                                if((p = *s) )
                                        break;
                }
                goto done_adj;
        }
        else if(type&DT_PREV)
        {       if(t && !p)
                {       if((p = *s) != t)
                        {       while(p->right != t)
                                        p = p->right;
                        }
                        else
                        {       p = NULL;
                                for(s -= 1, ends = dt->data->htab; s >= ends; --s)
                                {       if((p = *s) )
                                        {       while(p->right)
                                                        p = p->right;
                                                break;
                                        }
                                }
                        }
                }
        done_adj:
                if(!(dt->data->here = p) )
                { end_walk:
                        if((dt->data->loop -= 1) < 0)
                                dt->data->loop = 0;
                        if(dt->data->size > HLOAD(dt->data->ntab) && dt->data->loop <= 0)
                                dthtab(dt);
                        return NULL;
                }
                else
                {       dt->data->type |= DT_WALK;
                        return _DTOBJ(p,lk);
                }
        }
        else if(type&DT_RENEW)
        {       if(!t)
                        goto do_insert;
                else
                {       if(disc->freef)
                                disc->freef(obj);
                        if(disc->link < 0)
                                free(r);
                        return t ? _DTOBJ(t,lk) : NULL;
                }
        }
        else /*if(type&(DT_DELETE|DT_DETACH))*/
        {       /* take an element out of the dictionary */
                if(!t)
                        return NULL;
                else if(p)
                        p->right = t->right;
                else if((p = *s) == t)
                        p = *s = t->right;
                else
                {       while(p->right != t)
                                p = p->right;
                        p->right = t->right;
                }
                obj = _DTOBJ(t,lk);
                dt->data->size -= 1;
                dt->data->here = p;
                if(disc->freef && (type&DT_DELETE))
                        disc->freef(obj);
                if(disc->link < 0)
                        free(t);
                return obj;
        }
}
 
static Dtmethod_t       _Dtset = { dthash, DT_SET };
Dtmethod_t* Dtset = &_Dtset;