1da2e3ebdSchin /***********************************************************************
2da2e3ebdSchin * *
3da2e3ebdSchin * This software is part of the ast package *
4*3e14f97fSRoger A. Faulkner * Copyright (c) 1985-2010 AT&T Intellectual Property *
5da2e3ebdSchin * and is licensed under the *
6da2e3ebdSchin * Common Public License, Version 1.0 *
77c2fbfb3SApril Chin * by AT&T Intellectual Property *
8da2e3ebdSchin * *
9da2e3ebdSchin * A copy of the License is available at *
10da2e3ebdSchin * http://www.opensource.org/licenses/cpl1.0.txt *
11da2e3ebdSchin * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
12da2e3ebdSchin * *
13da2e3ebdSchin * Information and Software Systems Research *
14da2e3ebdSchin * AT&T Research *
15da2e3ebdSchin * Florham Park NJ *
16da2e3ebdSchin * *
17da2e3ebdSchin * Glenn Fowler <gsf@research.att.com> *
18da2e3ebdSchin * David Korn <dgk@research.att.com> *
19da2e3ebdSchin * Phong Vo <kpv@research.att.com> *
20da2e3ebdSchin * *
21da2e3ebdSchin ***********************************************************************/
22da2e3ebdSchin #include "dthdr.h"
23da2e3ebdSchin
24da2e3ebdSchin /* Change discipline.
25da2e3ebdSchin ** dt : dictionary
26da2e3ebdSchin ** disc : discipline
27da2e3ebdSchin **
28da2e3ebdSchin ** Written by Kiem-Phong Vo (5/26/96)
29da2e3ebdSchin */
30da2e3ebdSchin
31da2e3ebdSchin #if __STD_C
dtmemory(Dt_t * dt,Void_t * addr,size_t size,Dtdisc_t * disc)32da2e3ebdSchin static Void_t* dtmemory(Dt_t* dt,Void_t* addr,size_t size,Dtdisc_t* disc)
33da2e3ebdSchin #else
34da2e3ebdSchin static Void_t* dtmemory(dt, addr, size, disc)
35da2e3ebdSchin Dt_t* dt; /* dictionary */
36da2e3ebdSchin Void_t* addr; /* address to be manipulate */
37da2e3ebdSchin size_t size; /* size to obtain */
38da2e3ebdSchin Dtdisc_t* disc; /* discipline */
39da2e3ebdSchin #endif
40da2e3ebdSchin {
41da2e3ebdSchin if(addr)
42da2e3ebdSchin { if(size == 0)
43da2e3ebdSchin { free(addr);
44da2e3ebdSchin return NIL(Void_t*);
45da2e3ebdSchin }
46da2e3ebdSchin else return realloc(addr,size);
47da2e3ebdSchin }
48da2e3ebdSchin else return size > 0 ? malloc(size) : NIL(Void_t*);
49da2e3ebdSchin }
50da2e3ebdSchin
51da2e3ebdSchin #if __STD_C
dtdisc(Dt_t * dt,Dtdisc_t * disc,int type)52da2e3ebdSchin Dtdisc_t* dtdisc(Dt_t* dt, Dtdisc_t* disc, int type)
53da2e3ebdSchin #else
54da2e3ebdSchin Dtdisc_t* dtdisc(dt,disc,type)
55da2e3ebdSchin Dt_t* dt;
56da2e3ebdSchin Dtdisc_t* disc;
57da2e3ebdSchin int type;
58da2e3ebdSchin #endif
59da2e3ebdSchin {
60da2e3ebdSchin reg Dtsearch_f searchf;
61da2e3ebdSchin reg Dtlink_t *r, *t;
62da2e3ebdSchin reg char* k;
63da2e3ebdSchin reg Dtdisc_t* old;
64da2e3ebdSchin
65da2e3ebdSchin if(!(old = dt->disc) ) /* initialization call from dtopen() */
66da2e3ebdSchin { dt->disc = disc;
67da2e3ebdSchin if(!(dt->memoryf = disc->memoryf) )
68da2e3ebdSchin dt->memoryf = dtmemory;
69da2e3ebdSchin return disc;
70da2e3ebdSchin }
71da2e3ebdSchin
72da2e3ebdSchin if(!disc) /* only want to know current discipline */
73da2e3ebdSchin return old;
74da2e3ebdSchin
75da2e3ebdSchin searchf = dt->meth->searchf;
76da2e3ebdSchin
77da2e3ebdSchin UNFLATTEN(dt);
78da2e3ebdSchin
79da2e3ebdSchin if(old->eventf && (*old->eventf)(dt,DT_DISC,(Void_t*)disc,old) < 0)
80da2e3ebdSchin return NIL(Dtdisc_t*);
81da2e3ebdSchin
82da2e3ebdSchin dt->disc = disc;
83da2e3ebdSchin if(!(dt->memoryf = disc->memoryf) )
84da2e3ebdSchin dt->memoryf = dtmemory;
85da2e3ebdSchin
86da2e3ebdSchin if(dt->data->type&(DT_STACK|DT_QUEUE|DT_LIST))
87da2e3ebdSchin goto done;
88da2e3ebdSchin else if(dt->data->type&DT_BAG)
89da2e3ebdSchin { if(type&DT_SAMEHASH)
90da2e3ebdSchin goto done;
91da2e3ebdSchin else goto dt_renew;
92da2e3ebdSchin }
93da2e3ebdSchin else if(dt->data->type&(DT_SET|DT_BAG))
94da2e3ebdSchin { if((type&DT_SAMEHASH) && (type&DT_SAMECMP))
95da2e3ebdSchin goto done;
96da2e3ebdSchin else goto dt_renew;
97da2e3ebdSchin }
98da2e3ebdSchin else /*if(dt->data->type&(DT_OSET|DT_OBAG))*/
99da2e3ebdSchin { if(type&DT_SAMECMP)
100da2e3ebdSchin goto done;
101da2e3ebdSchin dt_renew:
102da2e3ebdSchin r = dtflatten(dt);
103da2e3ebdSchin dt->data->type &= ~DT_FLATTEN;
104da2e3ebdSchin dt->data->here = NIL(Dtlink_t*);
105da2e3ebdSchin dt->data->size = 0;
106da2e3ebdSchin
107da2e3ebdSchin if(dt->data->type&(DT_SET|DT_BAG))
108da2e3ebdSchin { reg Dtlink_t **s, **ends;
109da2e3ebdSchin ends = (s = dt->data->htab) + dt->data->ntab;
110da2e3ebdSchin while(s < ends)
111da2e3ebdSchin *s++ = NIL(Dtlink_t*);
112da2e3ebdSchin }
113da2e3ebdSchin
114da2e3ebdSchin /* reinsert them */
115da2e3ebdSchin while(r)
116da2e3ebdSchin { t = r->right;
117da2e3ebdSchin if(!(type&DT_SAMEHASH)) /* new hash value */
118da2e3ebdSchin { k = (char*)_DTOBJ(r,disc->link);
119da2e3ebdSchin k = _DTKEY((Void_t*)k,disc->key,disc->size);
120da2e3ebdSchin r->hash = _DTHSH(dt,k,disc,disc->size);
121da2e3ebdSchin }
122da2e3ebdSchin (void)(*searchf)(dt,(Void_t*)r,DT_RENEW);
123da2e3ebdSchin r = t;
124da2e3ebdSchin }
125da2e3ebdSchin }
126da2e3ebdSchin
127da2e3ebdSchin done:
128da2e3ebdSchin return old;
129da2e3ebdSchin }
130