contrib/amd/fsinfo/fsi_dict.c

   1 /*
   2  * Copyright (c) 1997-1999 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  *      %W% (Berkeley) %G%
  40  *
  41  * $Id: fsi_dict.c,v 1.2 1999/01/10 21:54:28 ezk Exp $
  42  *
  43  */
  44
  45 /*
  46  * Dictionary support
  47  */
  48
  49 #ifdef HAVE_CONFIG_H
  50 # include <config.h>
  51 #endif /* HAVE_CONFIG_H */
  52 #include <am_defs.h>
  53 #include <fsi_data.h>
  54 #include <fsinfo.h>
  55
  56
  57 static int
  58 dict_hash(char *k)
  59 {
  60   u_int h;
  61
  62   for (h = 0; *k; h += *k++) ;
  63   return h % DICTHASH;
  64 }
  65
  66
  67 dict *
  68 new_dict(void)
  69 {
  70   dict *dp = CALLOC(struct dict);
  71
  72   return dp;
  73 }
  74
  75
  76 static void
  77 dict_add_data(dict_ent *de, char *v)
  78 {
  79   dict_data *dd = CALLOC(struct dict_data);
  80
  81   dd->dd_data = v;
  82   ins_que(&dd->dd_q, de->de_q.q_back);
  83   de->de_count++;
  84 }
  85
  86
  87 static dict_ent *
  88 new_dict_ent(char *k)
  89 {
  90   dict_ent *de = CALLOC(struct dict_ent);
  91
  92   de->de_key = k;
  93   init_que(&de->de_q);
  94   return de;
  95 }
  96
  97
  98 dict_ent *
  99 dict_locate(dict *dp, char *k)
 100 {
 101   dict_ent *de = dp->de[dict_hash(k)];
 102
 103   while (de && !STREQ(de->de_key, k))
 104     de = de->de_next;
 105   return de;
 106 }
 107
 108
 109 void
 110 dict_add(dict *dp, char *k, char *v)
 111 {
 112   dict_ent *de = dict_locate(dp, k);
 113
 114   if (!de) {
 115     dict_ent **dep = &dp->de[dict_hash(k)];
 116     de = new_dict_ent(k);
 117     de->de_next = *dep;
 118     *dep = de;
 119   }
 120   dict_add_data(de, v);
 121 }
 122
 123
 124 int
 125 dict_iter(dict *dp, int (*fn) (qelem *))
 126 {
 127   int i;
 128   int errors = 0;
 129
 130   for (i = 0; i < DICTHASH; i++) {
 131     dict_ent *de = dp->de[i];
 132     while (de) {
 133       errors += (*fn) (&de->de_q);
 134       de = de->de_next;
 135     }
 136   }
 137   return errors;
 138 }