]>
Commit | Line | Data |
---|---|---|
27f616dd JT |
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 | ||
f9545a9b JT |
44 | struct operhash_entry |
45 | { | |
46 | char *name; | |
47 | int refcount; | |
48 | }; | |
49 | ||
27f616dd JT |
50 | static rb_dlink_list operhash_table[OPERHASH_MAX]; |
51 | ||
52 | const char * | |
53 | operhash_add(const char *name) | |
54 | { | |
55 | struct operhash_entry *ohash; | |
56 | unsigned int hashv; | |
57 | rb_dlink_node *ptr; | |
58 | ||
59 | if(EmptyString(name)) | |
60 | return NULL; | |
61 | ||
62 | hashv = hash_opername(name); | |
63 | ||
64 | RB_DLINK_FOREACH(ptr, operhash_table[hashv].head) | |
65 | { | |
66 | ohash = ptr->data; | |
67 | ||
68 | if(!irccmp(ohash->name, name)) | |
69 | { | |
70 | ohash->refcount++; | |
71 | return ohash->name; | |
72 | } | |
73 | } | |
74 | ||
75 | ohash = rb_malloc(sizeof(struct operhash_entry)); | |
76 | ohash->refcount = 1; | |
77 | ohash->name = rb_strdup(name); | |
78 | ||
79 | rb_dlinkAddAlloc(ohash, &operhash_table[hashv]); | |
80 | ||
81 | return ohash->name; | |
82 | } | |
83 | ||
84 | const char * | |
85 | operhash_find(const char *name) | |
86 | { | |
87 | struct operhash_entry *ohash; | |
88 | unsigned int hashv; | |
89 | rb_dlink_node *ptr; | |
90 | ||
91 | if(EmptyString(name)) | |
92 | return NULL; | |
93 | ||
94 | hashv = hash_opername(name); | |
95 | ||
96 | RB_DLINK_FOREACH(ptr, operhash_table[hashv].head) | |
97 | { | |
98 | ohash = ptr->data; | |
99 | ||
100 | if(!irccmp(ohash->name, name)) | |
101 | return ohash->name; | |
102 | } | |
103 | ||
104 | return NULL; | |
105 | } | |
106 | ||
107 | void | |
108 | operhash_delete(const char *name) | |
109 | { | |
110 | struct operhash_entry *ohash; | |
111 | unsigned int hashv; | |
112 | rb_dlink_node *ptr; | |
113 | ||
114 | if(EmptyString(name)) | |
115 | return; | |
116 | ||
117 | hashv = hash_opername(name); | |
118 | ||
119 | RB_DLINK_FOREACH(ptr, operhash_table[hashv].head) | |
120 | { | |
121 | ohash = ptr->data; | |
122 | ||
123 | if(irccmp(ohash->name, name)) | |
124 | continue; | |
125 | ||
126 | ohash->refcount--; | |
127 | ||
128 | if(ohash->refcount == 0) | |
129 | { | |
130 | rb_free(ohash->name); | |
131 | rb_free(ohash); | |
132 | rb_dlinkDestroy(ptr, &operhash_table[hashv]); | |
133 | return; | |
134 | } | |
135 | } | |
136 | } |