1 /* +------------------------------------+
2 * | Inspire Internet Relay Chat Daemon |
3 * +------------------------------------+
5 * InspIRCd is copyright (C) 2002-2006 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 * ---------------------------------------------------
21 #include <ext/hash_map>
22 #define nspace __gnu_cxx
24 /******************************************************
26 * The hash functions of InspIRCd are the centrepoint
27 * of the entire system. If these functions are
28 * inefficient or wasteful, the whole program suffers
29 * as a result. A lot of C programmers in the ircd
30 * scene spend a lot of time debating (arguing) about
31 * the best way to write hash functions to hash irc
32 * nicknames, channels etc.
33 * We are lucky as C++ developers as hash_map does
34 * a lot of this for us. It does intellegent memory
35 * requests, bucketing, search functions, insertion
36 * and deletion etc. All we have to do is write some
37 * overloaded comparison and hash value operators which
38 * cause it to act in an irc-like way. The features we
39 * add to the standard hash_map are:
41 * Case insensitivity: The hash_map will be case
44 * Scandanavian Comparisons: The characters [, ], \ will
45 * be considered the lowercase of {, } and |.
47 * This file also contains hashing methods for hashing
48 * insp_inaddr structs, we use this if we want to cache IP
51 ******************************************************/
54 using namespace irc::sockets;
56 /* convert a string to lowercase. Note following special circumstances
57 * taken from RFC 1459. Many "official" server branches still hold to this
60 * Because of IRC's scandanavian origin, the characters {}| are
61 * considered to be the lower case equivalents of the characters []\,
62 * respectively. This is a critical issue when determining the
63 * equivalence of two nicknames.
65 void nspace::strlower(char *n)
69 for (char* t = n; *t; t++)
70 *t = lowermap[(unsigned char)*t];
74 size_t nspace::hash<insp_inaddr>::operator()(const insp_inaddr &a) const
77 memcpy(&q,&a,sizeof(size_t));
81 size_t nspace::hash<string>::operator()(const string &s) const
85 static struct hash<const char *> strhash;
87 for (const char* x = s.c_str(); *x; x++) /* Faster to do it this way than */
88 a[t++] = lowermap[(unsigned char)*x]; /* Seperate strlcpy and strlower */
95 bool irc::StrHashComp::operator()(const std::string& s1, const std::string& s2) const
97 unsigned char* n1 = (unsigned char*)s1.c_str();
98 unsigned char* n2 = (unsigned char*)s2.c_str();
99 for (; *n1 && *n2; n1++, n2++)
100 if (lowermap[*n1] != lowermap[*n2])
102 return (lowermap[*n1] == lowermap[*n2]);
105 bool irc::InAddr_HashComp::operator()(const insp_inaddr &s1, const insp_inaddr &s2) const
108 for (int n = 0; n < 16; n++)
109 if (s2.s6_addr[n] != s1.s6_addr[n])
113 return (s1.s_addr == s1.s_addr);
117 /******************************************************
119 * This is the implementation of our special irc::string
120 * class which is a case-insensitive equivalent to
121 * std::string which is not only case-insensitive but
122 * can also do scandanavian comparisons, e.g. { = [, etc.
124 * This class depends on the const array 'lowermap'.
126 ******************************************************/
128 bool irc::irc_char_traits::eq(char c1st, char c2nd)
130 return lowermap[(unsigned char)c1st] == lowermap[(unsigned char)c2nd];
133 bool irc::irc_char_traits::ne(char c1st, char c2nd)
135 return lowermap[(unsigned char)c1st] != lowermap[(unsigned char)c2nd];
138 bool irc::irc_char_traits::lt(char c1st, char c2nd)
140 return lowermap[(unsigned char)c1st] < lowermap[(unsigned char)c2nd];
143 int irc::irc_char_traits::compare(const char* str1, const char* str2, size_t n)
145 for(unsigned int i = 0; i < n; i++)
147 if(lowermap[(unsigned char)*str1] > lowermap[(unsigned char)*str2])
150 if(lowermap[(unsigned char)*str1] < lowermap[(unsigned char)*str2])
153 if(*str1 == 0 || *str2 == 0)
162 std::string operator+ (std::string& leftval, irc::string& rightval)
164 return leftval + std::string(rightval.c_str());
167 irc::string operator+ (irc::string& leftval, std::string& rightval)
169 return leftval + irc::string(rightval.c_str());
172 bool operator== (std::string& leftval, irc::string& rightval)
174 return (leftval == std::string(rightval.c_str()));
177 bool operator== (irc::string& leftval, std::string& rightval)
179 return (rightval == std::string(leftval.c_str()));
182 const char* irc::irc_char_traits::find(const char* s1, int n, char c)
184 while(n-- > 0 && lowermap[(unsigned char)*s1] != lowermap[(unsigned char)c])
189 /* See hashcomp.h if you care about these... */
190 std::ostream& operator<<(std::ostream &os, const irc::string &str)
192 return os << str.c_str();
195 std::istream& operator>>(std::istream &is, irc::string &str)
203 irc::tokenstream::tokenstream(const std::string &source) : tokens(source), last_pushed(false)
205 /* Record starting position and current position */
206 last_starting_position = tokens.begin();
210 irc::tokenstream::~tokenstream()
214 const std::string irc::tokenstream::GetToken()
216 std::string::iterator lsp = last_starting_position;
218 while (n != tokens.end())
220 if ((last_pushed) && (*n == ':'))
222 /* If we find a token thats not the first and starts with :,
223 * this is the last token on the line
225 std::string::iterator curr = ++n;
227 return std::string(curr, tokens.end());
232 if ((*n == ' ') || (n+1 == tokens.end()))
234 /* If we find a space, or end of string, this is the end of a token.
236 last_starting_position = n+1;
239 std::string strip(lsp, n+1 == tokens.end() ? n+1 : n++);
240 while ((strip.length()) && (strip.find_last_of(' ') == strip.length() - 1))
241 strip.erase(strip.end() - 1);
251 irc::commasepstream::commasepstream(const std::string &source) : tokens(source)
253 last_starting_position = tokens.begin();
257 const std::string irc::commasepstream::GetToken()
259 std::string::iterator lsp = last_starting_position;
261 while (n != tokens.end())
263 if ((*n == ',') || (n+1 == tokens.end()))
265 last_starting_position = n+1;
266 return std::string(lsp, n+1 == tokens.end() ? n+1 : n++);
275 irc::commasepstream::~commasepstream()