1/*
2 * Copyright (c) 1997-2014 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. Neither the name of the University nor the names of its contributors
20 *    may be used to endorse or promote products derived from this software
21 *    without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 *
35 *
36 * File: am-utils/fsinfo/fsi_dict.c
37 *
38 */
39
40/*
41 * Dictionary support
42 */
43
44#ifdef HAVE_CONFIG_H
45# include <config.h>
46#endif /* HAVE_CONFIG_H */
47#include <am_defs.h>
48#include <fsi_data.h>
49#include <fsinfo.h>
50
51
52static int
53dict_hash(char *k)
54{
55  u_int h;
56
57  for (h = 0; *k; h += *k++) ;
58  return h % DICTHASH;
59}
60
61
62dict *
63new_dict(void)
64{
65  dict *dp = CALLOC(struct dict);
66
67  return dp;
68}
69
70
71static void
72dict_add_data(dict_ent *de, char *v)
73{
74  dict_data *dd = CALLOC(struct dict_data);
75
76  dd->dd_data = v;
77  ins_que(&dd->dd_q, de->de_q.q_back);
78  de->de_count++;
79}
80
81
82static dict_ent *
83new_dict_ent(char *k)
84{
85  dict_ent *de = CALLOC(struct dict_ent);
86
87  de->de_key = k;
88  init_que(&de->de_q);
89  return de;
90}
91
92
93dict_ent *
94dict_locate(dict *dp, char *k)
95{
96  dict_ent *de = dp->de[dict_hash(k)];
97
98  while (de && !STREQ(de->de_key, k))
99    de = de->de_next;
100  return de;
101}
102
103
104void
105dict_add(dict *dp, char *k, char *v)
106{
107  dict_ent *de = dict_locate(dp, k);
108
109  if (!de) {
110    dict_ent **dep = &dp->de[dict_hash(k)];
111    de = new_dict_ent(k);
112    de->de_next = *dep;
113    *dep = de;
114  }
115  dict_add_data(de, v);
116}
117
118
119int
120dict_iter(dict *dp, int (*fn) (qelem *))
121{
122  int i;
123  int errors = 0;
124
125  for (i = 0; i < DICTHASH; i++) {
126    dict_ent *de = dp->de[i];
127    while (de) {
128      errors += (*fn) (&de->de_q);
129      de = de->de_next;
130    }
131  }
132  return errors;
133}
134