]> jfr.im git - irc/rqf/shadowircd.git/blame - src/operhash.c
Track who set a dline/kline/xline/resv as in ratbox3.
[irc/rqf/shadowircd.git] / src / operhash.c
CommitLineData
a0f4c418
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
44static rb_dlink_list operhash_table[OPERHASH_MAX];
45
46const char *
47operhash_add(const char *name)
48{
49 struct operhash_entry *ohash;
50 unsigned int hashv;
51 rb_dlink_node *ptr;
52
53 if(EmptyString(name))
54 return NULL;
55
56 hashv = hash_opername(name);
57
58 RB_DLINK_FOREACH(ptr, operhash_table[hashv].head)
59 {
60 ohash = ptr->data;
61
62 if(!irccmp(ohash->name, name))
63 {
64 ohash->refcount++;
65 return ohash->name;
66 }
67 }
68
69 ohash = rb_malloc(sizeof(struct operhash_entry));
70 ohash->refcount = 1;
71 ohash->name = rb_strdup(name);
72
73 rb_dlinkAddAlloc(ohash, &operhash_table[hashv]);
74
75 return ohash->name;
76}
77
78const char *
79operhash_find(const char *name)
80{
81 struct operhash_entry *ohash;
82 unsigned int hashv;
83 rb_dlink_node *ptr;
84
85 if(EmptyString(name))
86 return NULL;
87
88 hashv = hash_opername(name);
89
90 RB_DLINK_FOREACH(ptr, operhash_table[hashv].head)
91 {
92 ohash = ptr->data;
93
94 if(!irccmp(ohash->name, name))
95 return ohash->name;
96 }
97
98 return NULL;
99}
100
101void
102operhash_delete(const char *name)
103{
104 struct operhash_entry *ohash;
105 unsigned int hashv;
106 rb_dlink_node *ptr;
107
108 if(EmptyString(name))
109 return;
110
111 hashv = hash_opername(name);
112
113 RB_DLINK_FOREACH(ptr, operhash_table[hashv].head)
114 {
115 ohash = ptr->data;
116
117 if(irccmp(ohash->name, name))
118 continue;
119
120 ohash->refcount--;
121
122 if(ohash->refcount == 0)
123 {
124 rb_free(ohash->name);
125 rb_free(ohash);
126 rb_dlinkDestroy(ptr, &operhash_table[hashv]);
127 return;
128 }
129 }
130}