mirror of
https://github.com/matrix-construct/construct
synced 2024-07-02 16:58:19 +02:00
61b517ca3c
* To benefit from the precompiled-header (PCH) it MUST provide "the first C token." Advantages: Never worry about the include stack again. Remember, this means one less thing for random module developers, community people learning C++, and new developers to deal with. It should reduce the learning curve and barrier for participation. Disadvantages: Makes overall compilation a bit slower, especially without any additional work to improve it again. There are several opportunities, places where the PCH is probably being ignored, etc that can be addressed.
95 lines
2.7 KiB
C++
95 lines
2.7 KiB
C++
/* charybdis
|
|
* operhash.c - Hashes nick!user@host{oper}
|
|
*
|
|
* Copyright (C) 2005 Lee Hardy <lee -at- leeh.co.uk>
|
|
* Copyright (C) 2005-2016 ircd-ratbox development team
|
|
* Copyright (C) 2016 William Pitcock <nenolod@dereferenced.org>
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met:
|
|
*
|
|
* 1.Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
* 2.Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3.The name of the author may not be used to endorse or promote products
|
|
* derived from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
|
|
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
|
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
namespace ircd {
|
|
|
|
static rb_radixtree *operhash_tree = NULL;
|
|
|
|
struct operhash_entry
|
|
{
|
|
unsigned int refcount;
|
|
char name[];
|
|
};
|
|
|
|
void
|
|
init_operhash(void)
|
|
{
|
|
operhash_tree = rb_radixtree_create("operhash", NULL);
|
|
}
|
|
|
|
const char *
|
|
operhash_add(const char *name)
|
|
{
|
|
struct operhash_entry *ohash;
|
|
size_t len;
|
|
|
|
if(EmptyString(name))
|
|
return NULL;
|
|
|
|
if((ohash = (struct operhash_entry *) rb_radixtree_retrieve(operhash_tree, name)) != NULL)
|
|
{
|
|
ohash->refcount++;
|
|
return ohash->name;
|
|
}
|
|
|
|
len = strlen(name) + 1;
|
|
ohash = (operhash_entry *)rb_malloc(sizeof(struct operhash_entry) + len);
|
|
ohash->refcount = 1;
|
|
memcpy(ohash->name, name, len);
|
|
rb_radixtree_add(operhash_tree, ohash->name, ohash);
|
|
return ohash->name;
|
|
}
|
|
|
|
const char *
|
|
operhash_find(const char *name)
|
|
{
|
|
return (const char *)rb_radixtree_retrieve(operhash_tree, name);
|
|
}
|
|
|
|
void
|
|
operhash_delete(const char *name)
|
|
{
|
|
struct operhash_entry *ohash = (operhash_entry *)rb_radixtree_retrieve(operhash_tree, name);
|
|
|
|
if(ohash == NULL)
|
|
return;
|
|
|
|
ohash->refcount--;
|
|
if(ohash->refcount == 0)
|
|
{
|
|
rb_radixtree_delete(operhash_tree, ohash->name);
|
|
rb_free(ohash);
|
|
}
|
|
}
|
|
|
|
} // namespace ircd
|