1 /* +------------------------------------+
2 * | Inspire Internet Relay Chat Daemon |
3 * +------------------------------------+
5 * Inspire is copyright (C) 2002-2005 ChatSpike-Dev.
7 * <brain@chatspike.net>
8 * <Craig@chatspike.net>
10 * Written by Craig Edwards, Craig McLure, and others.
11 * This program is free but copyrighted software; see
12 * the file COPYING for details.
14 * ---------------------------------------------------
22 #include "helperfuncs.h"
24 #include <ext/hash_map>
30 #define nspace __gnu_cxx
35 // from helperfuncs.cpp
36 extern const char lowermap[255];
38 /******************************************************
40 * The hash functions of InspIRCd are the centrepoint
41 * of the entire system. If these functions are
42 * inefficient or wasteful, the whole program suffers
43 * as a result. A lot of C programmers in the ircd
44 * scene spend a lot of time debating (arguing) about
45 * the best way to write hash functions to hash irc
46 * nicknames, channels etc.
47 * We are lucky as C++ developers as hash_map does
48 * a lot of this for us. It does intellegent memory
49 * requests, bucketing, search functions, insertion
50 * and deletion etc. All we have to do is write some
51 * overloaded comparison and hash value operators which
52 * cause it to act in an irc-like way. The features we
53 * add to the standard hash_map are:
55 * Case insensitivity: The hash_map will be case
58 * Scandanavian Comparisons: The characters [, ], \ will
59 * be considered the lowercase of {, } and |.
61 * This file also contains hashing methods for hashing
62 * in_addr structs, we use this if we want to cache IP
65 ******************************************************/
69 size_t nspace::hash<in_addr>::operator()(const struct in_addr &a) const
72 memcpy(&q,&a,sizeof(size_t));
76 size_t nspace::hash<string>::operator()(const string &s) const
79 static struct hash<const char *> strhash;
80 strlcpy(a,s.c_str(),MAXBUF);
85 bool irc::StrHashComp::operator()(const std::string& s1, const std::string& s2) const
87 irc::string a = s1.c_str();
88 irc::string b = s2.c_str();
92 bool irc::InAddr_HashComp::operator()(const in_addr &s1, const in_addr &s2) const
97 memcpy(&q,&s1,sizeof(size_t));
98 memcpy(&p,&s2,sizeof(size_t));
103 /******************************************************
105 * This is the implementation of our special irc::string
106 * class which is a case-insensitive equivalent to
107 * std::string which is not only case-insensitive but
108 * can also do scandanavian comparisons, e.g. { = [, etc.
110 * This class depends on the global 'lowermap' which is
111 * initialized at startup by inspircd.cpp, and contains
112 * the 'scandanavian' casemappings for fast irc compare.
114 ******************************************************/
116 bool irc::irc_char_traits::eq(char c1st, char c2nd)
118 return lowermap[c1st] == lowermap[c2nd];
121 bool irc::irc_char_traits::ne(char c1st, char c2nd)
123 return lowermap[c1st] != lowermap[c2nd];
126 bool irc::irc_char_traits::lt(char c1st, char c2nd)
128 return lowermap[c1st] < lowermap[c2nd];
131 int irc::irc_char_traits::compare(const char* str1, const char* str2, size_t n)
133 for(int i = 0; i < n; i++)
135 if(lowermap[*str1] > lowermap[*str2])
138 if(lowermap[*str1] < lowermap[*str2])
141 if(*str1 == 0 || *str2 == 0)
150 const char* irc::irc_char_traits::find(const char* s1, int n, char c)
152 while(n-- > 0 && lowermap[*s1] != lowermap[c])