cadey
/
elemental-ircd
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

hash.{h,c} from ratbox3, let's work around them! xD

This commit is contained in:
Valery Yatsko 2008-04-02 13:58:52 +04:00
parent dbb537badf
commit 162828b85d
2 changed files with 885 additions and 834 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

216
include/hash.h
View File

@ -1,103 +1,113 @@
/* /*
* ircd-ratbox: A slightly useful ircd. * ircd-ratbox: A slightly useful ircd.
* hash.h: A header for the ircd hashtable code. * hash.h: A header for the ircd hashtable code.
* *
* Copyright (C) 1990 Jarkko Oikarinen and University of Oulu, Co Center * Copyright (C) 1990 Jarkko Oikarinen and University of Oulu, Co Center
* Copyright (C) 1996-2002 Hybrid Development Team * Copyright (C) 1996-2002 Hybrid Development Team
* Copyright (C) 2002-2004 ircd-ratbox development team * Copyright (C) 2002-2005 ircd-ratbox development team
* *
* This program is free software; you can redistribute it and/or modify * 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 * it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or * the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version. * (at your option) any later version.
* *
* This program is distributed in the hope that it will be useful, * This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of * but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details. * GNU General Public License for more details.
* *
* You should have received a copy of the GNU General Public License * You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software * along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
* USA * USA
* *
* $Id: hash.h 3177 2007-02-01 00:19:14Z jilles $ * $Id: hash.h 24794 2007-12-28 02:36:59Z androsyn $
*/ */
#ifndef INCLUDED_hash_h #ifndef INCLUDED_hash_h
#define INCLUDED_hash_h #define INCLUDED_hash_h
struct Dictionary; extern rb_dlink_list resvTable[];
extern rb_dlink_list ndTable[];
extern rb_dlink_list *clientTable;
extern rb_dlink_list *channelTable; /* Magic value for FNV hash functions */
extern rb_dlink_list *idTable; #define FNV1_32_INIT 0x811c9dc5UL
extern rb_dlink_list *resvTable;
extern rb_dlink_list *hostTable; /* Client hash table size, used in hash.c/s_debug.c */
extern rb_dlink_list *helpTable; #define U_MAX_BITS 17
#define U_MAX (1<<U_MAX_BITS)
extern struct Dictionary *nd_dict;
/* Client fd hash table size, used in hash.c */
/* Magic value for FNV hash functions */ #define CLI_FD_MAX 4096
#define FNV1_32_INIT 0x811c9dc5UL
/* Channel hash table size, hash.c/s_debug.c */
/* Client hash table size, used in hash.c/s_debug.c */ #define CH_MAX_BITS 16
#define U_MAX_BITS 17 #define CH_MAX (1<<CH_MAX_BITS) /* 2^16 */
#define U_MAX 131072 /* 2^17 */
/* hostname hash table size */
/* Channel hash table size, hash.c/s_debug.c */ #define HOST_MAX_BITS 17
#define CH_MAX_BITS 16 #define HOST_MAX (1<<HOST_MAX_BITS) /* 2^17 */
#define CH_MAX 65536 /* 2^16 */
/* RESV/XLINE hash table size, used in hash.c */
/* hostname hash table size */ #define R_MAX_BITS 10
#define HOST_MAX_BITS 17 #define R_MAX (1<<R_MAX_BITS) /* 2^10 */
#define HOST_MAX 131072 /* 2^17 */
/* RESV/XLINE hash table size, used in hash.c */ #define HASH_WALK(i, max, ptr, table) for (i = 0; i < max; i++) { RB_DLINK_FOREACH(ptr, table[i].head)
#define R_MAX_BITS 10 #define HASH_WALK_SAFE(i, max, ptr, nptr, table) for (i = 0; i < max; i++) { RB_DLINK_FOREACH_SAFE(ptr, nptr, table[i].head)
#define R_MAX 1024 /* 2^10 */ #define HASH_WALK_END }
typedef enum
#define HASH_WALK(i, max, ptr, table) for (i = 0; i < max; i++) { RB_DLINK_FOREACH(ptr, table[i].head) {
#define HASH_WALK_SAFE(i, max, ptr, nptr, table) for (i = 0; i < max; i++) { RB_DLINK_FOREACH_SAFE(ptr, nptr, table[i].head) HASH_CLIENT,
#define HASH_WALK_END } HASH_ID,
HASH_CHANNEL,
struct Client; HASH_HOSTNAME,
struct Channel; HASH_RESV
struct ConfItem; } hash_type;
struct cachefile;
struct nd_entry; struct Client;
struct Channel;
extern u_int32_t fnv_hash_upper(const unsigned char *s, int bits); struct ConfItem;
extern u_int32_t fnv_hash(const unsigned char *s, int bits); struct cachefile;
extern u_int32_t fnv_hash_len(const unsigned char *s, int bits, int len); struct nd_entry;
extern u_int32_t fnv_hash_upper_len(const unsigned char *s, int bits, int len);
uint32_t fnv_hash_upper(const unsigned char *s, unsigned int bits, unsigned int unused);
extern void init_hash(void); uint32_t fnv_hash(const unsigned char *s, unsigned int bits, unsigned int unused);
uint32_t fnv_hash_len(const unsigned char *s, unsigned int bits, unsigned int len);
extern void add_to_client_hash(const char *name, struct Client *client); uint32_t fnv_hash_upper_len(const unsigned char *s, unsigned int bits, unsigned int len);
extern void del_from_client_hash(const char *name, struct Client *client);
extern struct Client *find_client(const char *name); void init_hash(void);
extern struct Client *find_named_client(const char *name);
extern struct Client *find_server(struct Client *source_p, const char *name); void add_to_hash(hash_type, const char *, void *);
void del_from_hash(hash_type, const char *, void *);
extern void add_to_id_hash(const char *, struct Client *);
extern void del_from_id_hash(const char *name, struct Client *client); struct Client *find_any_client(const char *name);
extern struct Client *find_id(const char *name); struct Client *find_client(const char *name);
struct Client *find_named_client(const char *name);
extern struct Channel *get_or_create_channel(struct Client *client_p, const char *chname, int *isnew); struct Client *find_server(struct Client *source_p, const char *name);
extern void del_from_channel_hash(const char *name, struct Channel *chan);
extern struct Channel *find_channel(const char *name); struct Client *find_id(const char *name);
extern void add_to_hostname_hash(const char *, struct Client *); struct Channel *get_or_create_channel(struct Client *client_p, const char *chname, int *isnew);
extern void del_from_hostname_hash(const char *, struct Client *); struct Channel *find_channel(const char *name);
extern rb_dlink_node *find_hostname(const char *);
rb_dlink_node *find_hostname(const char *);
extern void add_to_resv_hash(const char *name, struct ConfItem *aconf);
extern void del_from_resv_hash(const char *name, struct ConfItem *aconf); struct ConfItem *hash_find_resv(const char *name);
extern struct ConfItem *hash_find_resv(const char *name); void clear_resv_hash(void);
extern void clear_resv_hash(void);
void add_to_help_hash(const char *name, struct cachefile *hptr);
extern void hash_stats(struct Client *); void clear_help_hash(void);
struct cachefile *hash_find_help(const char *name, int flags);
#endif /* INCLUDED_hash_h */
void add_to_nd_hash(const char *name, struct nd_entry *nd);
struct nd_entry *hash_find_nd(const char *name);
void add_to_cli_fd_hash(struct Client *client_p);
void del_from_cli_fd_hash(struct Client *client_p);
struct Client *find_cli_fd_hash(int fd);
void hash_stats(struct Client *);
#endif /* INCLUDED_hash_h */

1503
src/hash.c
View File

File diff suppressed because it is too large Load Diff