]> jfr.im git - solanum.git/blob - ircd/operhash.c
ircd: add irc_radixtree, which is like irc_dictionary but uses a radix tree as the...
[solanum.git] / ircd / operhash.c
1 /* ircd-ratbox: an advanced Internet Relay Chat Daemon(ircd).
2 * operhash.c - Hashes nick!user@host{oper}
3 *
4 * Copyright (C) 2005 Lee Hardy <lee -at- leeh.co.uk>
5 * Copyright (C) 2005 ircd-ratbox development team
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions are
9 * met:
10 *
11 * 1.Redistributions of source code must retain the above copyright notice,
12 * this list of conditions and the following disclaimer.
13 * 2.Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3.The name of the author may not be used to endorse or promote products
17 * derived from this software without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
21 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
23 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
24 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
25 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
27 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
28 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
30 *
31 * $Id: operhash.c 26094 2008-09-19 15:33:46Z androsyn $
32 */
33 #include <ratbox_lib.h>
34 #include "stdinc.h"
35 #include "match.h"
36 #include "hash.h"
37 #include "operhash.h"
38
39 #define OPERHASH_MAX_BITS 7
40 #define OPERHASH_MAX (1<<OPERHASH_MAX_BITS)
41
42 #define hash_opername(x) fnv_hash_upper((const unsigned char *)(x), OPERHASH_MAX_BITS)
43
44 static rb_dlink_list operhash_table[OPERHASH_MAX];
45
46 const char *
47 operhash_add(const char *name)
48 {
49 void *ohash_mem;
50 char *ohash_copy;
51 unsigned int hashv;
52 rb_dlink_node *ptr;
53
54 if(EmptyString(name))
55 return NULL;
56
57 hashv = hash_opername(name);
58
59 RB_DLINK_FOREACH(ptr, operhash_table[hashv].head)
60 {
61 ohash_copy = ptr->data;
62
63 if(!irccmp(ohash_copy, name))
64 {
65 ohash_mem = ohash_copy - 5;
66 (*(int32_t *) ohash_mem)++;
67 return ohash_copy;
68 }
69 }
70
71 ohash_mem = rb_malloc(strlen(name) + 6);
72 (*(int32_t *) ohash_mem) = 1;
73 ohash_copy = ohash_mem + 5;
74 ohash_copy[-1] = '@';
75 strcpy(ohash_copy, name);
76
77 rb_dlinkAddAlloc(ohash_copy, &operhash_table[hashv]);
78
79 return ohash_copy;
80 }
81
82 const char *
83 operhash_find(const char *name)
84 {
85 char *ohash_copy;
86 unsigned int hashv;
87 rb_dlink_node *ptr;
88
89 if(EmptyString(name))
90 return NULL;
91
92 hashv = hash_opername(name);
93
94 RB_DLINK_FOREACH(ptr, operhash_table[hashv].head)
95 {
96 ohash_copy = ptr->data;
97
98 if(!irccmp(ohash_copy, name))
99 return ohash_copy;
100 }
101
102 return NULL;
103 }
104
105 void
106 operhash_delete(const char *name)
107 {
108 char *ohash_copy;
109 void *ohash_mem;
110 unsigned int hashv;
111 rb_dlink_node *ptr;
112
113 if(EmptyString(name))
114 return;
115
116 hashv = hash_opername(name);
117
118 RB_DLINK_FOREACH(ptr, operhash_table[hashv].head)
119 {
120 ohash_copy = ptr->data;
121
122 if(irccmp(ohash_copy, name))
123 continue;
124
125 ohash_mem = ohash_copy - 5;
126 (*(int32_t *) ohash_mem)--;
127
128 if((*(int32_t *) ohash_mem) == 0)
129 {
130 rb_dlinkDestroy(ptr, &operhash_table[hashv]);
131 rb_free(ohash_mem);
132 return;
133 }
134 }
135 }