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 * ---------------------------------------------------
19 #include "inspircd_config.h"
24 #include <ext/hash_map>
26 #define nspace __gnu_cxx
28 /******************************************************
30 * The hash functions of InspIRCd are the centrepoint
31 * of the entire system. If these functions are
32 * inefficient or wasteful, the whole program suffers
33 * as a result. A lot of C programmers in the ircd
34 * scene spend a lot of time debating (arguing) about
35 * the best way to write hash functions to hash irc
36 * nicknames, channels etc.
37 * We are lucky as C++ developers as hash_map does
38 * a lot of this for us. It does intellegent memory
39 * requests, bucketing, search functions, insertion
40 * and deletion etc. All we have to do is write some
41 * overloaded comparison and hash value operators which
42 * cause it to act in an irc-like way. The features we
43 * add to the standard hash_map are:
45 * Case insensitivity: The hash_map will be case
48 * Scandanavian Comparisons: The characters [, ], \ will
49 * be considered the lowercase of {, } and |.
51 * This file also contains hashing methods for hashing
52 * insp_inaddr structs, we use this if we want to cache IP
55 ******************************************************/
58 using namespace irc::sockets;
60 /* convert a string to lowercase. Note following special circumstances
61 * taken from RFC 1459. Many "official" server branches still hold to this
64 * Because of IRC's scandanavian origin, the characters {}| are
65 * considered to be the lower case equivalents of the characters []\,
66 * respectively. This is a critical issue when determining the
67 * equivalence of two nicknames.
69 void nspace::strlower(char *n)
73 for (char* t = n; *t; t++)
74 *t = lowermap[(unsigned char)*t];
78 size_t nspace::hash<insp_inaddr>::operator()(const insp_inaddr &a) const
81 memcpy(&q,&a,sizeof(size_t));
85 size_t nspace::hash<string>::operator()(const string &s) const
89 static struct hash<const char *> strhash;
91 for (const char* x = s.c_str(); *x; x++) /* Faster to do it this way than */
92 a[t++] = lowermap[(unsigned char)*x]; /* Seperate strlcpy and strlower */
99 bool irc::StrHashComp::operator()(const std::string& s1, const std::string& s2) const
101 unsigned char* n1 = (unsigned char*)s1.c_str();
102 unsigned char* n2 = (unsigned char*)s2.c_str();
103 for (; *n1 && *n2; n1++, n2++)
104 if (lowermap[*n1] != lowermap[*n2])
106 return (lowermap[*n1] == lowermap[*n2]);
109 bool irc::InAddr_HashComp::operator()(const insp_inaddr &s1, const insp_inaddr &s2) const
112 for (int n = 0; n < 16; n++)
113 if (s2.s6_addr[n] != s1.s6_addr[n])
117 return (s1.s_addr == s1.s_addr);
121 /******************************************************
123 * This is the implementation of our special irc::string
124 * class which is a case-insensitive equivalent to
125 * std::string which is not only case-insensitive but
126 * can also do scandanavian comparisons, e.g. { = [, etc.
128 * This class depends on the const array 'lowermap'.
130 ******************************************************/
132 bool irc::irc_char_traits::eq(char c1st, char c2nd)
134 return lowermap[(unsigned char)c1st] == lowermap[(unsigned char)c2nd];
137 bool irc::irc_char_traits::ne(char c1st, char c2nd)
139 return lowermap[(unsigned char)c1st] != lowermap[(unsigned char)c2nd];
142 bool irc::irc_char_traits::lt(char c1st, char c2nd)
144 return lowermap[(unsigned char)c1st] < lowermap[(unsigned char)c2nd];
147 int irc::irc_char_traits::compare(const char* str1, const char* str2, size_t n)
149 for(unsigned int i = 0; i < n; i++)
151 if(lowermap[(unsigned char)*str1] > lowermap[(unsigned char)*str2])
154 if(lowermap[(unsigned char)*str1] < lowermap[(unsigned char)*str2])
157 if(*str1 == 0 || *str2 == 0)
166 std::string operator+ (std::string& leftval, irc::string& rightval)
168 return leftval + std::string(rightval.c_str());
171 irc::string operator+ (irc::string& leftval, std::string& rightval)
173 return leftval + irc::string(rightval.c_str());
176 bool operator== (std::string& leftval, irc::string& rightval)
178 return (leftval == std::string(rightval.c_str()));
181 bool operator== (irc::string& leftval, std::string& rightval)
183 return (rightval == std::string(leftval.c_str()));
186 const char* irc::irc_char_traits::find(const char* s1, int n, char c)
188 while(n-- > 0 && lowermap[(unsigned char)*s1] != lowermap[(unsigned char)c])
193 /* See hashcomp.h if you care about these... */
194 std::ostream& operator<<(std::ostream &os, const irc::string &str)
196 return os << str.c_str();
199 std::istream& operator>>(std::istream &is, irc::string &str)
207 irc::tokenstream::tokenstream(const std::string &source) : tokens(source), last_pushed(false)
209 /* Remove trailing spaces, these muck up token parsing */
210 while (tokens.find_last_of(' ') == tokens.length() - 1)
211 tokens.erase(tokens.end() - 1);
213 /* Record starting position and current position */
214 last_starting_position = tokens.begin();
218 irc::tokenstream::~tokenstream()
222 const std::string irc::tokenstream::GetToken()
224 std::string::iterator lsp = last_starting_position;
226 while (n != tokens.end())
228 if ((last_pushed) && (*n == ':'))
230 /* If we find a token thats not the first and starts with :,
231 * this is the last token on the line
233 std::string::iterator curr = ++n;
235 return std::string(curr, tokens.end());
240 if ((*n == ' ') || (n+1 == tokens.end()))
242 /* If we find a space, or end of string, this is the end of a token.
244 last_starting_position = n+1;
246 return std::string(lsp, n+1 == tokens.end() ? n+1 : n++);
254 irc::commasepstream::commasepstream(const std::string &source) : tokens(source)
256 last_starting_position = tokens.begin();
260 const std::string irc::commasepstream::GetToken()
262 std::string::iterator lsp = last_starting_position;
264 while (n != tokens.end())
266 if ((*n == ',') || (n+1 == tokens.end()))
268 last_starting_position = n+1;
269 return std::string(lsp, n+1 == tokens.end() ? n+1 : n++);
278 irc::commasepstream::~commasepstream()