/* * ircd-ratbox: A slightly useful ircd. * hash.c: Maintains hashtables. * * Copyright (C) 1990 Jarkko Oikarinen and University of Oulu, Co Center * Copyright (C) 1996-2002 Hybrid Development Team * Copyright (C) 2002-2005 ircd-ratbox development team * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 * USA */ #include "stdinc.h" #include "ircd_defs.h" #include "s_conf.h" #include "channel.h" #include "client.h" #include "hash.h" #include "match.h" #include "ircd.h" #include "numeric.h" #include "send.h" #include "msg.h" #include "cache.h" #include "s_newconf.h" #include "s_assert.h" #include "rb_dictionary.h" #include "rb_radixtree.h" rb_dictionary *client_connid_tree = NULL; rb_radixtree *client_id_tree = NULL; rb_radixtree *client_name_tree = NULL; rb_radixtree *channel_tree = NULL; rb_radixtree *resv_tree = NULL; rb_radixtree *hostname_tree = NULL; /* * look in whowas.c for the missing ...[WW_MAX]; entry */ /* init_hash() * * clears the various hashtables */ void init_hash(void) { client_connid_tree = rb_dictionary_create("client connid", rb_uint32cmp); client_id_tree = rb_radixtree_create("client id", NULL); client_name_tree = rb_radixtree_create("client name", irccasecanon); channel_tree = rb_radixtree_create("channel", irccasecanon); resv_tree = rb_radixtree_create("resv", irccasecanon); hostname_tree = rb_radixtree_create("hostname", irccasecanon); } uint32_t fnv_hash_upper(const unsigned char *s, int bits) { uint32_t h = FNV1_32_INIT; while (*s) { h ^= irctoupper(*s++); h += (h<<1) + (h<<4) + (h<<7) + (h << 8) + (h << 24); } if (bits < 32) h = ((h >> bits) ^ h) & ((1<> bits) ^ h) & ((1<> bits) ^ h) & ((1<> bits) ^ h) & ((1<head; } /* find_channel() * * finds a channel from the channel hash table */ struct Channel * find_channel(const char *name) { s_assert(name != NULL); if(EmptyString(name)) return NULL; return rb_radixtree_retrieve(channel_tree, name); } /* * get_or_create_channel * inputs - client pointer * - channel name * - pointer to int flag whether channel was newly created or not * output - returns channel block or NULL if illegal name * - also modifies *isnew * * Get Channel block for chname (and allocate a new channel * block, if it didn't exist before). */ struct Channel * get_or_create_channel(struct Client *client_p, const char *chname, bool *isnew) { struct Channel *chptr; int len; const char *s = chname; if(EmptyString(s)) return NULL; len = strlen(s); if(len > CHANNELLEN) { char *t; if(IsServer(client_p)) { sendto_realops_snomask(SNO_DEBUG, L_NETWIDE, "*** Long channel name from %s (%d > %d): %s", client_p->name, len, CHANNELLEN, s); } len = CHANNELLEN; t = LOCAL_COPY(s); t[len] = '\0'; s = t; } chptr = rb_radixtree_retrieve(channel_tree, s); if (chptr != NULL) { if (isnew != NULL) *isnew = false; return chptr; } if(isnew != NULL) *isnew = true; chptr = allocate_channel(s); chptr->channelts = rb_current_time(); /* doesn't hurt to set it here */ rb_dlinkAdd(chptr, &chptr->node, &global_channel_list); rb_radixtree_add(channel_tree, chptr->chname, chptr); return chptr; } /* hash_find_resv() * * hunts for a resv entry in the resv hash table */ struct ConfItem * hash_find_resv(const char *name) { struct ConfItem *aconf; s_assert(name != NULL); if(EmptyString(name)) return NULL; aconf = rb_radixtree_retrieve(resv_tree, name); if (aconf != NULL) { aconf->port++; return aconf; } return NULL; } void clear_resv_hash(void) { struct ConfItem *aconf; rb_radixtree_iteration_state iter; RB_RADIXTREE_FOREACH(aconf, &iter, resv_tree) { /* skip temp resvs */ if(aconf->hold) continue; rb_radixtree_delete(resv_tree, aconf->host); free_conf(aconf); } } void add_to_cli_connid_hash(struct Client *client_p, uint32_t id) { rb_dictionary_add(client_connid_tree, RB_UINT_TO_POINTER(id), client_p); } void del_from_cli_connid_hash(uint32_t id) { rb_dictionary_delete(client_connid_tree, RB_UINT_TO_POINTER(id)); } struct Client * find_cli_connid_hash(uint32_t connid) { return rb_dictionary_retrieve(client_connid_tree, RB_UINT_TO_POINTER(connid)); }