1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
/* $Id: dtmethod.c,v 1.1.1.1 2004/12/23 04:04:00 ellson Exp $ $Revision: 1.1.1.1 $ */
/* vim:set shiftwidth=4 ts=8: */
/**********************************************************
* This software is part of the graphviz package *
* http://www.graphviz.org/ *
* *
* Copyright (c) 1994-2004 AT&T Corp. *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Corp. *
* *
* Information and Software Systems Research *
* AT&T Research, Florham Park NJ *
**********************************************************/
#include "dthdr.h"
#ifdef DMALLOC
#include "dmalloc.h"
#endif
/* Change search method.
**
** Written by Kiem-Phong Vo (05/25/96)
*/
#if __STD_C
Dtmethod_t *dtmethod(Dt_t * dt, Dtmethod_t * meth)
#else
Dtmethod_t *dtmethod(dt, meth)
Dt_t *dt;
Dtmethod_t *meth;
#endif
{
reg Dtlink_t *list, *r;
reg Dtdisc_t *disc = dt->disc;
reg Dtmethod_t *oldmeth = dt->meth;
if (!meth || meth->type == oldmeth->type)
return oldmeth;
if (disc->eventf &&
(*disc->eventf) (dt, DT_METH, (Void_t *) meth, disc) < 0)
return NIL(Dtmethod_t *);
/* get the list of elements */
list = dtflatten(dt);
if (dt->data->type & (DT_LIST | DT_STACK | DT_QUEUE))
dt->data->head = NIL(Dtlink_t *);
else if (dt->data->type & (DT_SET | DT_BAG)) {
if (dt->data->ntab > 0)
(*dt->memoryf) (dt, (Void_t *) dt->data->htab, 0, disc);
dt->data->ntab = 0;
dt->data->htab = NIL(Dtlink_t **);
}
dt->data->here = NIL(Dtlink_t *);
dt->data->type =
(dt->data->type & ~(DT_METHODS | DT_FLATTEN)) | meth->type;
dt->meth = meth;
if (dt->searchf == oldmeth->searchf)
dt->searchf = meth->searchf;
if (meth->type & (DT_LIST | DT_STACK | DT_QUEUE)) {
if (!(oldmeth->type & (DT_LIST | DT_STACK | DT_QUEUE))) {
if ((r = list)) {
reg Dtlink_t *t;
for (t = r->right; t; r = t, t = t->right)
t->left = r;
list->left = r;
}
}
dt->data->head = list;
} else if (meth->type & (DT_OSET | DT_OBAG)) {
dt->data->size = 0;
while (list) {
r = list->right;
(*meth->searchf) (dt, (Void_t *) list, DT_RENEW);
list = r;
}
} else if (!((meth->type & DT_BAG) && (oldmeth->type & DT_SET))) {
int rehash;
if ((meth->type & (DT_SET | DT_BAG))
&& !(oldmeth->type & (DT_SET | DT_BAG)))
rehash = 1;
else
rehash = 0;
dt->data->size = dt->data->loop = 0;
while (list) {
r = list->right;
if (rehash) {
reg Void_t *key = OBJ(list, disc->link);
key = KEY(key, disc->key, disc->size);
list->hash = HASH(dt, key, disc, disc->size);
}
(void) (*meth->searchf) (dt, (Void_t *) list, DT_RENEW);
list = r;
}
}
return oldmeth;
}
|
