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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/*
* Copyright (c) 1989 Jan-Simon Pendry
* Copyright (c) 1989 Imperial College of Science, Technology & Medicine
* Copyright (c) 1989, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Jan-Simon Pendry at Imperial College, London.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* from: @(#)fsi_dict.c 8.1 (Berkeley) 6/6/93
* $Id: fsi_dict.c,v 1.1 1995/10/18 08:47:18 deraadt Exp $
*/
/*
* Dictionary support
*/
#include "../fsinfo/fsinfo.h"
static int dict_hash(k)
char *k;
{
unsigned int h;
for (h = 0; *k; h += *k++)
;
return h % DICTHASH;
}
dict *new_dict()
{
dict *dp = ALLOC(dict);
return dp;
}
static void dict_add_data(de, v)
dict_ent *de;
char *v;
{
dict_data *dd = ALLOC(dict_data);
dd->dd_data = v;
ins_que(&dd->dd_q, de->de_q.q_back);
de->de_count++;
}
static dict_ent *new_dict_ent(k)
char *k;
{
dict_ent *de = ALLOC(dict_ent);
de->de_key = k;
init_que(&de->de_q);
return de;
}
dict_ent *dict_locate(dp, k)
dict *dp;
char *k;
{
dict_ent *de = dp->de[dict_hash(k)];
while (de && !STREQ(de->de_key, k))
de = de->de_next;
return de;
}
void dict_add(dp, k, v)
dict *dp;
char *k, *v;
{
dict_ent *de = dict_locate(dp, k);
if (!de) {
dict_ent **dep = &dp->de[dict_hash(k)];
de = new_dict_ent(k);
de->de_next = *dep;
*dep = de;
}
dict_add_data(de, v);
}
int dict_iter(dp, fn)
dict *dp;
int (*fn)();
{
int i;
int errors = 0;
for (i = 0; i < DICTHASH; i++) {
dict_ent *de = dp->de[i];
while (de) {
errors += (*fn)(&de->de_q);
de = de->de_next;
}
}
return errors;
}
|
