1 /* +------------------------------------+
2 * | Inspire Internet Relay Chat Daemon |
3 * +------------------------------------+
5 * InspIRCd: (C) 2002-2007 InspIRCd Development Team
6 * See: http://www.inspircd.org/wiki/index.php/Credits
8 * This program is free but copyrighted software; see
9 * the file COPYING for details.
11 * ---------------------------------------------------
17 #include <ext/hash_map>
18 #define nspace __gnu_cxx
22 using stdext::hash_map;
25 /******************************************************
27 * The hash functions of InspIRCd are the centrepoint
28 * of the entire system. If these functions are
29 * inefficient or wasteful, the whole program suffers
30 * as a result. A lot of C programmers in the ircd
31 * scene spend a lot of time debating (arguing) about
32 * the best way to write hash functions to hash irc
33 * nicknames, channels etc.
34 * We are lucky as C++ developers as hash_map does
35 * a lot of this for us. It does intellegent memory
36 * requests, bucketing, search functions, insertion
37 * and deletion etc. All we have to do is write some
38 * overloaded comparison and hash value operators which
39 * cause it to act in an irc-like way. The features we
40 * add to the standard hash_map are:
42 * Case insensitivity: The hash_map will be case
45 * Scandanavian Comparisons: The characters [, ], \ will
46 * be considered the lowercase of {, } and |.
48 ******************************************************/
50 using namespace irc::sockets;
52 /* convert a string to lowercase. Note following special circumstances
53 * taken from RFC 1459. Many "official" server branches still hold to this
56 * Because of IRC's scandanavian origin, the characters {}| are
57 * considered to be the lower case equivalents of the characters []\,
58 * respectively. This is a critical issue when determining the
59 * equivalence of two nicknames.
61 void nspace::strlower(char *n)
65 for (char* t = n; *t; t++)
66 *t = lowermap[(unsigned char)*t];
71 size_t nspace::hash<string>::operator()(const string &s) const
73 size_t nspace::hash_compare<string, std::less<string> >::operator()(const string &s) const
76 /* XXX: NO DATA COPIES! :)
77 * The hash function here is practically
78 * a copy of the one in STL's hash_fun.h,
79 * only with *x replaced with lowermap[*x].
80 * This avoids a copy to use hash<const char*>
82 register size_t t = 0;
83 for (std::string::const_iterator x = s.begin(); x != s.end(); ++x) /* ++x not x++, as its faster */
84 t = 5 * t + lowermap[(unsigned char)*x];
89 size_t nspace::hash<irc::string>::operator()(const irc::string &s) const
91 size_t nspace::hash_compare<irc::string, std::less<irc::string> >::operator()(const irc::string &s) const
94 register size_t t = 0;
95 for (irc::string::const_iterator x = s.begin(); x != s.end(); ++x) /* ++x not x++, as its faster */
96 t = 5 * t + lowermap[(unsigned char)*x];
100 bool irc::StrHashComp::operator()(const std::string& s1, const std::string& s2) const
102 unsigned char* n1 = (unsigned char*)s1.c_str();
103 unsigned char* n2 = (unsigned char*)s2.c_str();
104 for (; *n1 && *n2; n1++, n2++)
105 if (lowermap[*n1] != lowermap[*n2])
107 return (lowermap[*n1] == lowermap[*n2]);
110 /******************************************************
112 * This is the implementation of our special irc::string
113 * class which is a case-insensitive equivalent to
114 * std::string which is not only case-insensitive but
115 * can also do scandanavian comparisons, e.g. { = [, etc.
117 * This class depends on the const array 'lowermap'.
119 ******************************************************/
121 bool irc::irc_char_traits::eq(char c1st, char c2nd)
123 return lowermap[(unsigned char)c1st] == lowermap[(unsigned char)c2nd];
126 bool irc::irc_char_traits::ne(char c1st, char c2nd)
128 return lowermap[(unsigned char)c1st] != lowermap[(unsigned char)c2nd];
131 bool irc::irc_char_traits::lt(char c1st, char c2nd)
133 return lowermap[(unsigned char)c1st] < lowermap[(unsigned char)c2nd];
136 int irc::irc_char_traits::compare(const char* str1, const char* str2, size_t n)
138 for(unsigned int i = 0; i < n; i++)
140 if(lowermap[(unsigned char)*str1] > lowermap[(unsigned char)*str2])
143 if(lowermap[(unsigned char)*str1] < lowermap[(unsigned char)*str2])
146 if(*str1 == 0 || *str2 == 0)
155 const char* irc::irc_char_traits::find(const char* s1, int n, char c)
157 while(n-- > 0 && lowermap[(unsigned char)*s1] != lowermap[(unsigned char)c])
162 irc::tokenstream::tokenstream(const std::string &source) : tokens(source), last_pushed(false)
164 /* Record starting position and current position */
165 last_starting_position = tokens.begin();
169 irc::tokenstream::~tokenstream()
173 bool irc::tokenstream::GetToken(std::string &token)
175 std::string::iterator lsp = last_starting_position;
177 while (n != tokens.end())
179 /** Skip multi space, converting " " into " "
181 while ((n+1 != tokens.end()) && (*n == ' ') && (*(n+1) == ' '))
184 if ((last_pushed) && (*n == ':'))
186 /* If we find a token thats not the first and starts with :,
187 * this is the last token on the line
189 std::string::iterator curr = ++n;
191 token = std::string(curr, tokens.end());
197 if ((*n == ' ') || (n+1 == tokens.end()))
199 /* If we find a space, or end of string, this is the end of a token.
201 last_starting_position = n+1;
204 std::string strip(lsp, n+1 == tokens.end() ? n+1 : n++);
205 while ((strip.length()) && (strip.find_last_of(' ') == strip.length() - 1))
206 strip.erase(strip.end() - 1);
209 return !token.empty();
218 irc::sepstream::sepstream(const std::string &source, char seperator) : tokens(source), sep(seperator)
220 last_starting_position = tokens.begin();
224 const std::string irc::sepstream::GetToken()
226 std::string::iterator lsp = last_starting_position;
228 while (n != tokens.end())
230 if ((*n == sep) || (n+1 == tokens.end()))
232 last_starting_position = n+1;
233 std::string strip = std::string(lsp, n+1 == tokens.end() ? n+1 : n++);
235 while ((strip.length()) && (strip.find_last_of(sep) == strip.length() - 1))
236 strip.erase(strip.end() - 1);
247 const std::string irc::sepstream::GetRemaining()
249 return std::string(n, tokens.end());
252 bool irc::sepstream::StreamEnd()
254 return ((n + 1) == tokens.end());
257 irc::sepstream::~sepstream()
261 std::string irc::hex(const unsigned char *raw, size_t rawsz)
266 /* EWW! This used to be using sprintf, which is WAY inefficient. -Special */
268 const char *hex = "0123456789abcdef";
271 buf.reserve(rawsz * 2 + 1);
274 for (i = 0, j = 0; j < rawsz; ++j)
276 buf[i++] = hex[raw[j] / 16];
277 buf[i++] = hex[raw[j] % 16];
284 CoreExport const char* irc::Spacify(const char* n)
286 static char x[MAXBUF];
288 for (char* y = x; *y; y++)
295 irc::modestacker::modestacker(bool add) : adding(add)
298 sequence.push_back("");
301 void irc::modestacker::Push(char modeletter, const std::string ¶meter)
303 *(sequence.begin()) += modeletter;
304 sequence.push_back(parameter);
307 void irc::modestacker::Push(char modeletter)
309 this->Push(modeletter,"");
312 void irc::modestacker::PushPlus()
317 void irc::modestacker::PushMinus()
322 int irc::modestacker::GetStackedLine(std::deque<std::string> &result, int max_line_size)
324 if (sequence.empty())
331 int size = 1; /* Account for initial +/- char */
334 result.push_back(adding ? "+" : "-");
336 if (sequence.size() > 1)
337 nextsize = sequence[1].length() + 2;
339 while (!sequence[0].empty() && (sequence.size() > 1) && (result.size() < MAXMODES+1) && ((size + nextsize) < max_line_size))
341 result[0] += *(sequence[0].begin());
342 if (!sequence[1].empty())
344 result.push_back(sequence[1]);
345 size += nextsize; /* Account for mode character and whitespace */
347 sequence[0].erase(sequence[0].begin());
348 sequence.erase(sequence.begin() + 1);
350 if (sequence.size() > 1)
351 nextsize = sequence[1].length() + 2;
359 irc::stringjoiner::stringjoiner(const std::string &seperator, const std::vector<std::string> &sequence, int begin, int end)
361 for (int v = begin; v < end; v++)
362 joined.append(sequence[v]).append(seperator);
363 joined.append(sequence[end]);
366 irc::stringjoiner::stringjoiner(const std::string &seperator, const std::deque<std::string> &sequence, int begin, int end)
368 for (int v = begin; v < end; v++)
369 joined.append(sequence[v]).append(seperator);
370 joined.append(sequence[end]);
373 irc::stringjoiner::stringjoiner(const std::string &seperator, const char** sequence, int begin, int end)
375 for (int v = begin; v < end; v++)
376 joined.append(sequence[v]).append(seperator);
377 joined.append(sequence[end]);
380 std::string& irc::stringjoiner::GetJoined()
385 irc::portparser::portparser(const std::string &source, bool allow_overlapped) : in_range(0), range_begin(0), range_end(0), overlapped(allow_overlapped)
387 sep = new irc::commasepstream(source);
391 irc::portparser::~portparser()
396 bool irc::portparser::Overlaps(long val)
401 if (overlap_set.find(val) == overlap_set.end())
403 overlap_set[val] = true;
410 long irc::portparser::GetToken()
415 if (in_range <= range_end)
417 if (!Overlaps(in_range))
423 while (((Overlaps(in_range)) && (in_range <= range_end)))
426 if (in_range <= range_end)
434 std::string x = sep->GetToken();
439 while (Overlaps(atoi(x.c_str())))
447 std::string::size_type dash = x.rfind('-');
448 if (dash != std::string::npos)
450 std::string sbegin = x.substr(0, dash);
451 std::string send = x.substr(dash+1, x.length());
452 range_begin = atoi(sbegin.c_str());
453 range_end = atoi(send.c_str());
455 if ((range_begin > 0) && (range_end > 0) && (range_begin < 65536) && (range_end < 65536) && (range_begin < range_end))
457 in_range = range_begin;
462 /* Assume its just the one port */
463 return atoi(sbegin.c_str());
468 return atoi(x.c_str());
472 irc::dynamicbitmask::dynamicbitmask() : bits_size(4)
474 /* We start with 4 bytes allocated which is room
475 * for 4 items. Something makes me doubt its worth
476 * allocating less than 4 bytes.
478 bits = new unsigned char[bits_size];
479 memset(bits, 0, bits_size);
482 irc::dynamicbitmask::~dynamicbitmask()
484 /* Tidy up the entire used memory on delete */
488 irc::bitfield irc::dynamicbitmask::Allocate()
490 /* Yeah, this isnt too efficient, however a module or the core
491 * should only be allocating bitfields on load, the Toggle and
492 * Get methods are O(1) as these are called much more often.
494 unsigned char* freebits = this->GetFreeBits();
495 for (unsigned char i = 0; i < bits_size; i++)
497 /* Yes, this is right. You'll notice we terminate the loop when !current_pos,
498 * this is because we logic shift our bit off the end of unsigned char, and its
499 * lost, making the loop counter 0 when we're done.
501 for (unsigned char current_pos = 1; current_pos; current_pos = current_pos << 1)
503 if (!(freebits[i] & current_pos))
505 freebits[i] |= current_pos;
506 return std::make_pair(i, current_pos);
510 /* We dont have any free space left, increase by one */
512 if (bits_size == 255)
513 /* Oh dear, cant grow it any further */
514 throw std::bad_alloc();
516 unsigned char old_bits_size = bits_size;
518 /* Allocate new bitfield space */
519 unsigned char* temp_bits = new unsigned char[bits_size];
520 unsigned char* temp_freebits = new unsigned char[bits_size];
521 /* Copy the old data in */
522 memcpy(temp_bits, bits, old_bits_size);
523 memcpy(temp_freebits, freebits, old_bits_size);
524 /* Delete the old data pointers */
527 /* Swap the pointers over so now the new
528 * pointers point to our member values
531 freebits = temp_freebits;
532 this->SetFreeBits(freebits);
533 /* Initialize the new byte on the end of
534 * the bitfields, pre-allocate the one bit
535 * for this allocation
537 bits[old_bits_size] = 0;
538 freebits[old_bits_size] = 1;
539 /* We already know where we just allocated
540 * the bitfield, so no loop needed
542 return std::make_pair(old_bits_size, 1);
545 bool irc::dynamicbitmask::Deallocate(irc::bitfield &pos)
547 /* We dont bother to shrink the bitfield
548 * on deallocation, the most we could do
549 * is save one byte (!) and this would cost
550 * us a loop (ugly O(n) stuff) so we just
551 * clear the bit and leave the memory
552 * claimed -- nobody will care about one
555 if (pos.first < bits_size)
557 this->GetFreeBits()[pos.first] &= ~pos.second;
560 /* They gave a bitfield outside of the
561 * length of our array. BAD programmer.
566 void irc::dynamicbitmask::Toggle(irc::bitfield &pos, bool state)
568 /* Range check the value */
569 if (pos.first < bits_size)
572 /* Set state, OR the state in */
573 bits[pos.first] |= pos.second;
575 /* Clear state, AND the !state out */
576 bits[pos.first] &= ~pos.second;
580 bool irc::dynamicbitmask::Get(irc::bitfield &pos)
582 /* Range check the value */
583 if (pos.first < bits_size)
584 return (bits[pos.first] & pos.second);
586 /* We can't return false, otherwise we can't
587 * distinguish between failure and a cleared bit!
588 * Our only sensible choice is to throw (ew).
590 throw ModuleException("irc::dynamicbitmask::Get(): Invalid bitfield, out of range");
593 unsigned char irc::dynamicbitmask::GetSize()