2 * InspIRCd -- Internet Relay Chat Daemon
4 * Copyright (C) 2009 Daniel De Graaf <danieldg@inspircd.org>
5 * Copyright (C) 2005-2009 Craig Edwards <craigedwards@brainbox.cc>
6 * Copyright (C) 2007-2008 Robin Burchell <robin+git@viroteck.net>
7 * Copyright (C) 2007 Dennis Friis <peavey@inspircd.org>
9 * This file is part of InspIRCd. InspIRCd is free software: you can
10 * redistribute it and/or modify it under the terms of the GNU General Public
11 * License as published by the Free Software Foundation, version 2.
13 * This program is distributed in the hope that it will be useful, but WITHOUT
14 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
15 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
18 * You should have received a copy of the GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
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 unordered_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 ******************************************************/
55 * A case insensitive mapping of characters from upper case to lower case for
56 * the ASCII character set.
58 unsigned const char ascii_case_insensitive_map[256] = {
59 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, // 0-9
60 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, // 10-19
61 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, // 20-29
62 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, // 30-39
63 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, // 40-49
64 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, // 50-59
65 60, 61, 62, 63, 64, 97, 98, 99, 100, 101, // 60-69
66 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, // 70-79
67 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, // 80-89
68 122, 91, 92, 93, 94, 95, 96, 97, 98, 99, // 90-99
69 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, // 100-109
70 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, // 110-119
71 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, // 120-129
72 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, // 130-139
73 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, // 140-149
74 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, // 150-159
75 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, // 160-169
76 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, // 170-179
77 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, // 180-189
78 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, // 190-199
79 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, // 200-209
80 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, // 210-219
81 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, // 220-229
82 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, // 230-249
83 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, // 240-249
84 250, 251, 252, 253, 254, 255, // 250-255
90 * A case insensitive mapping of characters from upper case to lower case for
91 * the character set of RFC 1459. This is identical to ASCII with the small
92 * exception of {}| being considered to be the lower case equivalents of the
93 * characters []\ respectively.
95 unsigned const char rfc_case_insensitive_map[256] = {
96 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, // 0-9
97 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, // 10-19
98 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, // 20-29
99 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, // 30-39
100 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, // 40-49
101 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, // 50-59
102 60, 61, 62, 63, 64, 97, 98, 99, 100, 101, // 60-69
103 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, // 70-79
104 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, // 80-89
105 122, 123, 124, 125, 94, 95, 96, 97, 98, 99, // 90-99
106 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, // 100-109
107 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, // 110-119
108 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, // 120-129
109 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, // 130-139
110 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, // 140-149
111 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, // 150-159
112 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, // 160-169
113 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, // 170-179
114 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, // 180-189
115 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, // 190-199
116 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, // 200-209
117 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, // 210-219
118 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, // 220-229
119 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, // 230-239
120 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, // 240-249
121 250, 251, 252, 253, 254, 255, // 250-255
125 * A case sensitive mapping of characters from upper case to lower case for the
126 * character set of RFC 1459. This is identical to ASCII.
128 unsigned const char rfc_case_sensitive_map[256] = {
129 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, // 0-9
130 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, // 10-19
131 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, // 20-29
132 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, // 30-39
133 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, // 40-49
134 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, // 50-59
135 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, // 60-69
136 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, // 70-79
137 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, // 80-89
138 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, // 90-99
139 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, // 100-109
140 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, // 110-119
141 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, // 120-129
142 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, // 130-139
143 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, // 140-149
144 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, // 150-159
145 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, // 160-169
146 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, // 170-179
147 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, // 180-189
148 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, // 190-199
149 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, // 200-209
150 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, // 210-219
151 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, // 220-229
152 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, // 230-239
153 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, // 240-249
154 250, 251, 252, 253, 254, 255, // 250-255
157 void std::tr1::strlower(char *n)
161 for (char* t = n; *t; t++)
162 *t = national_case_insensitive_map[(unsigned char)*t];
166 size_t std::tr1::insensitive::operator()(const std::string &s) const
168 /* XXX: NO DATA COPIES! :)
169 * The hash function here is practically
170 * a copy of the one in STL's hash_fun.h,
171 * only with *x replaced with national_case_insensitive_map[*x].
172 * This avoids a copy to use hash<const char*>
174 register size_t t = 0;
175 for (std::string::const_iterator x = s.begin(); x != s.end(); ++x) /* ++x not x++, as its faster */
176 t = 5 * t + national_case_insensitive_map[(unsigned char)*x];
180 size_t CoreExport irc::hash::operator()(const irc::string &s) const
182 register size_t t = 0;
183 for (irc::string::const_iterator x = s.begin(); x != s.end(); ++x) /* ++x not x++, as its faster */
184 t = 5 * t + national_case_insensitive_map[(unsigned char)*x];
188 bool irc::StrHashComp::operator()(const std::string& s1, const std::string& s2) const
190 const unsigned char* n1 = (const unsigned char*)s1.c_str();
191 const unsigned char* n2 = (const unsigned char*)s2.c_str();
192 for (; *n1 && *n2; n1++, n2++)
193 if (national_case_insensitive_map[*n1] != national_case_insensitive_map[*n2])
195 return (national_case_insensitive_map[*n1] == national_case_insensitive_map[*n2]);
198 /******************************************************
200 * This is the implementation of our special irc::string
201 * class which is a case-insensitive equivalent to
202 * std::string which is not only case-insensitive but
203 * can also do scandanavian comparisons, e.g. { = [, etc.
205 * This class depends on the const array 'national_case_insensitive_map'.
207 ******************************************************/
209 bool irc::irc_char_traits::eq(char c1st, char c2nd)
211 return national_case_insensitive_map[(unsigned char)c1st] == national_case_insensitive_map[(unsigned char)c2nd];
214 bool irc::irc_char_traits::ne(char c1st, char c2nd)
216 return national_case_insensitive_map[(unsigned char)c1st] != national_case_insensitive_map[(unsigned char)c2nd];
219 bool irc::irc_char_traits::lt(char c1st, char c2nd)
221 return national_case_insensitive_map[(unsigned char)c1st] < national_case_insensitive_map[(unsigned char)c2nd];
224 int irc::irc_char_traits::compare(const char* str1, const char* str2, size_t n)
226 for(unsigned int i = 0; i < n; i++)
228 if(national_case_insensitive_map[(unsigned char)*str1] > national_case_insensitive_map[(unsigned char)*str2])
231 if(national_case_insensitive_map[(unsigned char)*str1] < national_case_insensitive_map[(unsigned char)*str2])
234 if(*str1 == 0 || *str2 == 0)
243 const char* irc::irc_char_traits::find(const char* s1, int n, char c)
245 while(n-- > 0 && national_case_insensitive_map[(unsigned char)*s1] != national_case_insensitive_map[(unsigned char)c])
247 return (n >= 0) ? s1 : NULL;
250 irc::tokenstream::tokenstream(const std::string &source) : tokens(source), last_pushed(false)
252 /* Record starting position and current position */
253 last_starting_position = tokens.begin();
257 irc::tokenstream::~tokenstream()
261 bool irc::tokenstream::GetToken(std::string &token)
263 std::string::iterator lsp = last_starting_position;
265 while (n != tokens.end())
267 /** Skip multi space, converting " " into " "
269 while ((n+1 != tokens.end()) && (*n == ' ') && (*(n+1) == ' '))
272 if ((last_pushed) && (*n == ':'))
274 /* If we find a token thats not the first and starts with :,
275 * this is the last token on the line
277 std::string::iterator curr = ++n;
279 token = std::string(curr, tokens.end());
285 if ((*n == ' ') || (n+1 == tokens.end()))
287 /* If we find a space, or end of string, this is the end of a token.
289 last_starting_position = n+1;
290 last_pushed = *n == ' ';
292 std::string strip(lsp, n+1 == tokens.end() ? n+1 : n++);
293 while ((strip.length()) && (strip.find_last_of(' ') == strip.length() - 1))
294 strip.erase(strip.end() - 1);
297 return !token.empty();
306 bool irc::tokenstream::GetToken(irc::string &token)
308 std::string stdstring;
309 bool returnval = GetToken(stdstring);
310 token = assign(stdstring);
314 bool irc::tokenstream::GetToken(int &token)
317 bool returnval = GetToken(tok);
318 token = ConvToInt(tok);
322 bool irc::tokenstream::GetToken(long &token)
325 bool returnval = GetToken(tok);
326 token = ConvToInt(tok);
330 irc::sepstream::sepstream(const std::string &source, char seperator) : tokens(source), sep(seperator)
332 last_starting_position = tokens.begin();
336 bool irc::sepstream::GetToken(std::string &token)
338 std::string::iterator lsp = last_starting_position;
340 while (n != tokens.end())
342 if ((*n == sep) || (n+1 == tokens.end()))
344 last_starting_position = n+1;
345 token = std::string(lsp, n+1 == tokens.end() ? n+1 : n++);
347 while ((token.length()) && (token.find_last_of(sep) == token.length() - 1))
348 token.erase(token.end() - 1);
353 return n == tokens.end() ? false : true;
363 const std::string irc::sepstream::GetRemaining()
365 return std::string(n, tokens.end());
368 bool irc::sepstream::StreamEnd()
370 return ((n + 1) == tokens.end());
373 irc::sepstream::~sepstream()
377 std::string irc::hex(const unsigned char *raw, size_t rawsz)
382 /* EWW! This used to be using sprintf, which is WAY inefficient. -Special */
384 const char *hex = "0123456789abcdef";
385 static char hexbuf[MAXBUF];
388 for (i = 0, j = 0; j < rawsz; ++j)
390 hexbuf[i++] = hex[raw[j] / 16];
391 hexbuf[i++] = hex[raw[j] % 16];
398 CoreExport const char* irc::Spacify(const char* n)
400 static char x[MAXBUF];
402 for (char* y = x; *y; y++)
409 irc::modestacker::modestacker(bool add) : adding(add)
412 sequence.push_back("");
415 void irc::modestacker::Push(char modeletter, const std::string ¶meter)
417 *(sequence.begin()) += modeletter;
418 sequence.push_back(parameter);
421 void irc::modestacker::Push(char modeletter)
423 this->Push(modeletter,"");
426 void irc::modestacker::PushPlus()
431 void irc::modestacker::PushMinus()
436 int irc::modestacker::GetStackedLine(std::vector<std::string> &result, int max_line_size)
438 if (sequence.empty())
444 int size = 1; /* Account for initial +/- char */
446 int start = result.size();
447 std::string modeline = adding ? "+" : "-";
448 result.push_back(modeline);
450 if (sequence.size() > 1)
451 nextsize = sequence[1].length() + 2;
453 while (!sequence[0].empty() && (sequence.size() > 1) && (n < ServerInstance->Config->Limits.MaxModes) && ((size + nextsize) < max_line_size))
455 modeline += *(sequence[0].begin());
456 if (!sequence[1].empty())
458 result.push_back(sequence[1]);
459 size += nextsize; /* Account for mode character and whitespace */
461 sequence[0].erase(sequence[0].begin());
462 sequence.erase(sequence.begin() + 1);
464 if (sequence.size() > 1)
465 nextsize = sequence[1].length() + 2;
469 result[start] = modeline;
474 irc::stringjoiner::stringjoiner(const std::string &seperator, const std::vector<std::string> &sequence, int begin, int end)
477 return; // nothing to do here
479 for (int v = begin; v < end; v++)
480 joined.append(sequence[v]).append(seperator);
481 joined.append(sequence[end]);
484 irc::stringjoiner::stringjoiner(const std::string &seperator, const std::deque<std::string> &sequence, int begin, int end)
487 return; // nothing to do here
489 for (int v = begin; v < end; v++)
490 joined.append(sequence[v]).append(seperator);
491 joined.append(sequence[end]);
494 irc::stringjoiner::stringjoiner(const std::string &seperator, const char* const* sequence, int begin, int end)
497 return; // nothing to do here
499 for (int v = begin; v < end; v++)
500 joined.append(sequence[v]).append(seperator);
501 joined.append(sequence[end]);
504 std::string& irc::stringjoiner::GetJoined()
509 irc::portparser::portparser(const std::string &source, bool allow_overlapped)
510 : sep(source), in_range(0), range_begin(0), range_end(0), overlapped(allow_overlapped)
514 bool irc::portparser::Overlaps(long val)
519 return (!overlap_set.insert(val).second);
522 long irc::portparser::GetToken()
527 if (in_range <= range_end)
529 if (!Overlaps(in_range))
535 while (((Overlaps(in_range)) && (in_range <= range_end)))
538 if (in_range <= range_end)
552 while (Overlaps(atoi(x.c_str())))
554 if (!sep.GetToken(x))
558 std::string::size_type dash = x.rfind('-');
559 if (dash != std::string::npos)
561 std::string sbegin = x.substr(0, dash);
562 std::string send = x.substr(dash+1, x.length());
563 range_begin = atoi(sbegin.c_str());
564 range_end = atoi(send.c_str());
566 if ((range_begin > 0) && (range_end > 0) && (range_begin < 65536) && (range_end < 65536) && (range_begin < range_end))
568 in_range = range_begin;
573 /* Assume its just the one port */
574 return atoi(sbegin.c_str());
579 return atoi(x.c_str());