1/*
2 * Copyright (c) 1997-2006 Erez Zadok
3 * Copyright (c) 1989 Jan-Simon Pendry
4 * Copyright (c) 1989 Imperial College of Science, Technology & Medicine
5 * Copyright (c) 1989 The Regents of the University of California.
6 * All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by
9 * Jan-Simon Pendry at Imperial College, London.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 *    notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 *    notice, this list of conditions and the following disclaimer in the
18 *    documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 *    must display the following acknowledgment:
21 *      This product includes software developed by the University of
22 *      California, Berkeley and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 *    may be used to endorse or promote products derived from this software
25 *    without specific prior written permission.
26 *
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * SUCH DAMAGE.
38 *
39 *
40 * File: am-utils/fsinfo/fsi_dict.c
41 *
42 */
43
44/*
45 * Dictionary support
46 */
47
48#ifdef HAVE_CONFIG_H
49# include <config.h>
50#endif /* HAVE_CONFIG_H */
51#include <am_defs.h>
52#include <fsi_data.h>
53#include <fsinfo.h>
54
55
56static int
57dict_hash(char *k)
58{
59  u_int h;
60
61  for (h = 0; *k; h += *k++) ;
62  return h % DICTHASH;
63}
64
65
66dict *
67new_dict(void)
68{
69  dict *dp = CALLOC(struct dict);
70
71  return dp;
72}
73
74
75static void
76dict_add_data(dict_ent *de, char *v)
77{
78  dict_data *dd = CALLOC(struct dict_data);
79
80  dd->dd_data = v;
81  ins_que(&dd->dd_q, de->de_q.q_back);
82  de->de_count++;
83}
84
85
86static dict_ent *
87new_dict_ent(char *k)
88{
89  dict_ent *de = CALLOC(struct dict_ent);
90
91  de->de_key = k;
92  init_que(&de->de_q);
93  return de;
94}
95
96
97dict_ent *
98dict_locate(dict *dp, char *k)
99{
100  dict_ent *de = dp->de[dict_hash(k)];
101
102  while (de && !STREQ(de->de_key, k))
103    de = de->de_next;
104  return de;
105}
106
107
108void
109dict_add(dict *dp, char *k, char *v)
110{
111  dict_ent *de = dict_locate(dp, k);
112
113  if (!de) {
114    dict_ent **dep = &dp->de[dict_hash(k)];
115    de = new_dict_ent(k);
116    de->de_next = *dep;
117    *dep = de;
118  }
119  dict_add_data(de, v);
120}
121
122
123int
124dict_iter(dict *dp, int (*fn) (qelem *))
125{
126  int i;
127  int errors = 0;
128
129  for (i = 0; i < DICTHASH; i++) {
130    dict_ent *de = dp->de[i];
131    while (de) {
132      errors += (*fn) (&de->de_q);
133      de = de->de_next;
134    }
135  }
136  return errors;
137}
138