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
25da2e3ebdSchin /* Renew the object at the current finger.
26da2e3ebdSchin **
27da2e3ebdSchin ** Written by Kiem-Phong Vo (5/25/96)
28da2e3ebdSchin */
29da2e3ebdSchin
30da2e3ebdSchin #if __STD_C
dtrenew(Dt_t * dt,reg Void_t * obj)31da2e3ebdSchin Void_t* dtrenew(Dt_t* dt, reg Void_t* obj)
32da2e3ebdSchin #else
33da2e3ebdSchin Void_t* dtrenew(dt, obj)
34da2e3ebdSchin Dt_t* dt;
35da2e3ebdSchin reg Void_t* obj;
36da2e3ebdSchin #endif
37da2e3ebdSchin {
38da2e3ebdSchin reg Void_t* key;
39da2e3ebdSchin reg Dtlink_t *e, *t, **s;
40da2e3ebdSchin reg Dtdisc_t* disc = dt->disc;
41da2e3ebdSchin
42da2e3ebdSchin UNFLATTEN(dt);
43da2e3ebdSchin
44da2e3ebdSchin if(!(e = dt->data->here) || _DTOBJ(e,disc->link) != obj)
45da2e3ebdSchin return NIL(Void_t*);
46da2e3ebdSchin
47da2e3ebdSchin if(dt->data->type&(DT_STACK|DT_QUEUE|DT_LIST))
48da2e3ebdSchin return obj;
49da2e3ebdSchin else if(dt->data->type&(DT_OSET|DT_OBAG) )
50da2e3ebdSchin { if(!e->right ) /* make left child the new root */
51da2e3ebdSchin dt->data->here = e->left;
52da2e3ebdSchin else /* make right child the new root */
53da2e3ebdSchin { dt->data->here = e->right;
54da2e3ebdSchin
55da2e3ebdSchin /* merge left subtree to right subtree */
56da2e3ebdSchin if(e->left)
57da2e3ebdSchin { for(t = e->right; t->left; t = t->left)
58da2e3ebdSchin ;
59da2e3ebdSchin t->left = e->left;
60da2e3ebdSchin }
61da2e3ebdSchin }
62da2e3ebdSchin }
63da2e3ebdSchin else /*if(dt->data->type&(DT_SET|DT_BAG))*/
64da2e3ebdSchin { s = dt->data->htab + HINDEX(dt->data->ntab,e->hash);
65da2e3ebdSchin if((t = *s) == e)
66da2e3ebdSchin *s = e->right;
67da2e3ebdSchin else
68da2e3ebdSchin { for(; t->right != e; t = t->right)
69da2e3ebdSchin ;
70da2e3ebdSchin t->right = e->right;
71da2e3ebdSchin }
72da2e3ebdSchin key = _DTKEY(obj,disc->key,disc->size);
73da2e3ebdSchin e->hash = _DTHSH(dt,key,disc,disc->size);
74da2e3ebdSchin dt->data->here = NIL(Dtlink_t*);
75da2e3ebdSchin }
76da2e3ebdSchin
77da2e3ebdSchin dt->data->size -= 1;
78da2e3ebdSchin return (*dt->meth->searchf)(dt,(Void_t*)e,DT_RENEW) ? obj : NIL(Void_t*);
79da2e3ebdSchin }
80