1 /* +------------------------------------+
\r * | Inspire Internet Relay Chat Daemon |
\r * +------------------------------------+
\r *
\r * InspIRCd: (C) 2002-2007 InspIRCd Development Team
\r * See: http://www.inspircd.org/wiki/index.php/Credits
\r *
\r * This program is free but copyrighted software; see
\r * the file COPYING for details.
\r *
\r * ---------------------------------------------------
\r */
\r\r#include "inspircd.h"
\r#include "hashcomp.h"
\r#ifndef WIN32
\r#include <ext/hash_map>
\r#define nspace __gnu_cxx
\r#else
\r#include <hash_map>
\r#define nspace stdext
\rusing stdext::hash_map;
\r#endif
\r\r/******************************************************
\r *
\r * The hash functions of InspIRCd are the centrepoint
\r * of the entire system. If these functions are
\r * inefficient or wasteful, the whole program suffers
\r * as a result. A lot of C programmers in the ircd
\r * scene spend a lot of time debating (arguing) about
\r * the best way to write hash functions to hash irc
\r * nicknames, channels etc.
\r * We are lucky as C++ developers as hash_map does
\r * a lot of this for us. It does intellegent memory
\r * requests, bucketing, search functions, insertion
\r * and deletion etc. All we have to do is write some
\r * overloaded comparison and hash value operators which
\r * cause it to act in an irc-like way. The features we
\r * add to the standard hash_map are:
\r *
\r * Case insensitivity: The hash_map will be case
\r * insensitive.
\r *
\r * Scandanavian Comparisons: The characters [, ], \ will
\r * be considered the lowercase of {, } and |.
\r *
\r ******************************************************/
\r\rusing namespace irc::sockets;
\r\r/* convert a string to lowercase. Note following special circumstances
\r * taken from RFC 1459. Many "official" server branches still hold to this
\r * rule so i will too;
\r *
\r * Because of IRC's scandanavian origin, the characters {}| are
\r * considered to be the lower case equivalents of the characters []\,
\r * respectively. This is a critical issue when determining the
\r * equivalence of two nicknames.
\r */
\rvoid nspace::strlower(char *n)
\r{
\r if (n)
\r {
\r for (char* t = n; *t; t++)
\r *t = lowermap[(unsigned char)*t];
\r }
\r}
\r\r#ifndef WIN32
\rsize_t nspace::hash<string>::operator()(const string &s) const
\r#else
\rsize_t nspace::hash_compare<string, std::less<string> >::operator()(const string &s) const
\r#endif
\r{
\r /* XXX: NO DATA COPIES! :)
\r * The hash function here is practically
\r * a copy of the one in STL's hash_fun.h,
\r * only with *x replaced with lowermap[*x].
\r * This avoids a copy to use hash<const char*>
\r */
\r register size_t t = 0;
\r for (std::string::const_iterator x = s.begin(); x != s.end(); ++x) /* ++x not x++, as its faster */
\r t = 5 * t + lowermap[(unsigned char)*x];
\r return t;
\r}
\r\r#ifndef WIN32
\rsize_t nspace::hash<irc::string>::operator()(const irc::string &s) const
\r#else
\rsize_t nspace::hash_compare<irc::string, std::less<irc::string> >::operator()(const irc::string &s) const
\r#endif
\r{
\r register size_t t = 0;
\r for (irc::string::const_iterator x = s.begin(); x != s.end(); ++x) /* ++x not x++, as its faster */
\r t = 5 * t + lowermap[(unsigned char)*x];
\r return t;
\r}
\r\rbool irc::StrHashComp::operator()(const std::string& s1, const std::string& s2) const
\r{
\r unsigned char* n1 = (unsigned char*)s1.c_str();
\r unsigned char* n2 = (unsigned char*)s2.c_str();
\r for (; *n1 && *n2; n1++, n2++)
\r if (lowermap[*n1] != lowermap[*n2])
\r return false;
\r return (lowermap[*n1] == lowermap[*n2]);
\r}
\r\r/******************************************************
\r *
\r * This is the implementation of our special irc::string
\r * class which is a case-insensitive equivalent to
\r * std::string which is not only case-insensitive but
\r * can also do scandanavian comparisons, e.g. { = [, etc.
\r *
\r * This class depends on the const array 'lowermap'.
\r *
\r ******************************************************/
\r\rbool irc::irc_char_traits::eq(char c1st, char c2nd)
\r{
\r return lowermap[(unsigned char)c1st] == lowermap[(unsigned char)c2nd];
\r}
\r\rbool irc::irc_char_traits::ne(char c1st, char c2nd)
\r{
\r return lowermap[(unsigned char)c1st] != lowermap[(unsigned char)c2nd];
\r}
\r\rbool irc::irc_char_traits::lt(char c1st, char c2nd)
\r{
\r return lowermap[(unsigned char)c1st] < lowermap[(unsigned char)c2nd];
\r}
\r\rint irc::irc_char_traits::compare(const char* str1, const char* str2, size_t n)
\r{
\r for(unsigned int i = 0; i < n; i++)
\r {
\r if(lowermap[(unsigned char)*str1] > lowermap[(unsigned char)*str2])
\r return 1;
\r\r if(lowermap[(unsigned char)*str1] < lowermap[(unsigned char)*str2])
\r return -1;
\r\r if(*str1 == 0 || *str2 == 0)
\r return 0;
\r\r str1++;
\r str2++;
\r }
\r return 0;
\r}
\r\rconst char* irc::irc_char_traits::find(const char* s1, int n, char c)
\r{
\r while(n-- > 0 && lowermap[(unsigned char)*s1] != lowermap[(unsigned char)c])
\r s1++;
\r return s1;
\r}
\r\rirc::tokenstream::tokenstream(const std::string &source) : tokens(source), last_pushed(false)
\r{
\r /* Record starting position and current position */
\r last_starting_position = tokens.begin();
\r n = tokens.begin();
\r}
\r\rirc::tokenstream::~tokenstream()
\r{
\r}
\r\rbool irc::tokenstream::GetToken(std::string &token)
\r{
\r std::string::iterator lsp = last_starting_position;
\r\r while (n != tokens.end())
\r {
\r /** Skip multi space, converting " " into " "
\r */
\r while ((n+1 != tokens.end()) && (*n == ' ') && (*(n+1) == ' '))
\r n++;
\r\r if ((last_pushed) && (*n == ':'))
\r {
\r /* If we find a token thats not the first and starts with :,
\r * this is the last token on the line
\r */
\r std::string::iterator curr = ++n;
\r n = tokens.end();
\r token = std::string(curr, tokens.end());
\r return true;
\r }
\r\r last_pushed = false;
\r\r if ((*n == ' ') || (n+1 == tokens.end()))
\r {
\r /* If we find a space, or end of string, this is the end of a token.
\r */
\r last_starting_position = n+1;
\r last_pushed = true;
\r\r std::string strip(lsp, n+1 == tokens.end() ? n+1 : n++);
\r while ((strip.length()) && (strip.find_last_of(' ') == strip.length() - 1))
\r strip.erase(strip.end() - 1);
\r\r token = strip;
\r return !token.empty();
\r }
\r\r n++;
\r }
\r token.clear();
\r return false;
\r}
\r\rbool irc::tokenstream::GetToken(irc::string &token)
\r{
\r std::string stdstring;
\r bool returnval = GetToken(stdstring);
\r token = assign(stdstring);
\r return returnval;
\r}
\r\rbool irc::tokenstream::GetToken(int &token)
\r{
\r std::string tok;
\r bool returnval = GetToken(tok);
\r token = ConvToInt(tok);
\r return returnval;
\r}
\r\rbool irc::tokenstream::GetToken(long &token)
\r{
\r std::string tok;
\r bool returnval = GetToken(tok);
\r token = ConvToInt(tok);
\r return returnval;
\r}
\r\rirc::sepstream::sepstream(const std::string &source, char seperator) : tokens(source), sep(seperator)
\r{
\r last_starting_position = tokens.begin();
\r n = tokens.begin();
\r}
\r\rconst std::string irc::sepstream::GetToken()
\r{
\r std::string::iterator lsp = last_starting_position;
\r\r while (n != tokens.end())
\r {
\r if ((*n == sep) || (n+1 == tokens.end()))
\r {
\r last_starting_position = n+1;
\r std::string strip = std::string(lsp, n+1 == tokens.end() ? n+1 : n++);
\r\r while ((strip.length()) && (strip.find_last_of(sep) == strip.length() - 1))
\r strip.erase(strip.end() - 1);
\r\r return strip;
\r }
\r\r n++;
\r }
\r\r return "";
\r}
\r\rconst std::string irc::sepstream::GetRemaining()
\r{
\r return std::string(n, tokens.end());
\r}
\r\rbool irc::sepstream::StreamEnd()
\r{
\r return ((n + 1) == tokens.end());
\r}
\r\rirc::sepstream::~sepstream()
\r{
\r}
\r\rstd::string irc::hex(const unsigned char *raw, size_t rawsz)
\r{
\r if (!rawsz)
\r return "";
\r\r /* EWW! This used to be using sprintf, which is WAY inefficient. -Special */
\r \r const char *hex = "0123456789abcdef";
\r static char hexbuf[MAXBUF];
\r\r size_t i, j;
\r for (i = 0, j = 0; j < rawsz; ++j)
\r {
\r hexbuf[i++] = hex[raw[j] / 16];
\r hexbuf[i++] = hex[raw[j] % 16];
\r }
\r hexbuf[i] = 0;
\r\r return hexbuf;
\r}
\r\rCoreExport const char* irc::Spacify(const char* n)
\r{
\r static char x[MAXBUF];
\r strlcpy(x,n,MAXBUF);
\r for (char* y = x; *y; y++)
\r if (*y == '_')
\r *y = ' ';
\r return x;
\r}
\r\r\rirc::modestacker::modestacker(bool add) : adding(add)
\r{
\r sequence.clear();
\r sequence.push_back("");
\r}
\r\rvoid irc::modestacker::Push(char modeletter, const std::string ¶meter)
\r{
\r *(sequence.begin()) += modeletter;
\r sequence.push_back(parameter);
\r}
\r\rvoid irc::modestacker::Push(char modeletter)
\r{
\r this->Push(modeletter,"");
\r}
\r\rvoid irc::modestacker::PushPlus()
\r{
\r this->Push('+',"");
\r}
\r\rvoid irc::modestacker::PushMinus()
\r{
\r this->Push('-',"");
\r}
\r\rint irc::modestacker::GetStackedLine(std::deque<std::string> &result, int max_line_size)
\r{
\r if (sequence.empty())
\r {
\r result.clear();
\r return 0;
\r }
\r\r int n = 0;
\r int size = 1; /* Account for initial +/- char */
\r int nextsize = 0;
\r result.clear();
\r result.push_back(adding ? "+" : "-");
\r\r if (sequence.size() > 1)
\r nextsize = sequence[1].length() + 2;
\r\r while (!sequence[0].empty() && (sequence.size() > 1) && (result.size() < MAXMODES) && ((size + nextsize) < max_line_size))
\r {
\r result[0] += *(sequence[0].begin());
\r if (!sequence[1].empty())
\r {
\r result.push_back(sequence[1]);
\r size += nextsize; /* Account for mode character and whitespace */
\r }
\r sequence[0].erase(sequence[0].begin());
\r sequence.erase(sequence.begin() + 1);
\r\r if (sequence.size() > 1)
\r nextsize = sequence[1].length() + 2;
\r\r n++;
\r }
\r\r return n;
\r}
\r\rirc::stringjoiner::stringjoiner(const std::string &seperator, const std::vector<std::string> &sequence, int begin, int end)
\r{
\r for (int v = begin; v < end; v++)
\r joined.append(sequence[v]).append(seperator);
\r joined.append(sequence[end]);
\r}
\r\rirc::stringjoiner::stringjoiner(const std::string &seperator, const std::deque<std::string> &sequence, int begin, int end)
\r{
\r for (int v = begin; v < end; v++)
\r joined.append(sequence[v]).append(seperator);
\r joined.append(sequence[end]);
\r}
\r\rirc::stringjoiner::stringjoiner(const std::string &seperator, const char** sequence, int begin, int end)
\r{
\r for (int v = begin; v < end; v++)
\r joined.append(sequence[v]).append(seperator);
\r joined.append(sequence[end]);
\r}
\r\rstd::string& irc::stringjoiner::GetJoined()
\r{
\r return joined;
\r}
\r\rirc::portparser::portparser(const std::string &source, bool allow_overlapped) : in_range(0), range_begin(0), range_end(0), overlapped(allow_overlapped)
\r{
\r sep = new irc::commasepstream(source);
\r overlap_set.clear();
\r}
\r\rirc::portparser::~portparser()
\r{
\r delete sep;
\r}
\r\rbool irc::portparser::Overlaps(long val)
\r{
\r if (!overlapped)
\r return false;
\r\r if (overlap_set.find(val) == overlap_set.end())
\r {
\r overlap_set[val] = true;
\r return false;
\r }
\r else
\r return true;
\r}
\r\rlong irc::portparser::GetToken()
\r{
\r if (in_range > 0)
\r {
\r in_range++;
\r if (in_range <= range_end)
\r {
\r if (!Overlaps(in_range))
\r {
\r return in_range;
\r }
\r else
\r {
\r while (((Overlaps(in_range)) && (in_range <= range_end)))
\r in_range++;
\r \r if (in_range <= range_end)
\r return in_range;
\r }
\r }
\r else
\r in_range = 0;
\r }
\r\r std::string x = sep->GetToken();
\r\r if (x.empty())
\r return 0;
\r\r while (Overlaps(atoi(x.c_str())))
\r {
\r x = sep->GetToken();
\r\r if (x.empty())
\r return 0;
\r }
\r\r std::string::size_type dash = x.rfind('-');
\r if (dash != std::string::npos)
\r {
\r std::string sbegin = x.substr(0, dash);
\r std::string send = x.substr(dash+1, x.length());
\r range_begin = atoi(sbegin.c_str());
\r range_end = atoi(send.c_str());
\r\r if ((range_begin > 0) && (range_end > 0) && (range_begin < 65536) && (range_end < 65536) && (range_begin < range_end))
\r {
\r in_range = range_begin;
\r return in_range;
\r }
\r else
\r {
\r /* Assume its just the one port */
\r return atoi(sbegin.c_str());
\r }
\r }
\r else
\r {
\r return atoi(x.c_str());
\r }
\r}
\r\rirc::dynamicbitmask::dynamicbitmask() : bits_size(4)
\r{
\r /* We start with 4 bytes allocated which is room
\r * for 4 items. Something makes me doubt its worth
\r * allocating less than 4 bytes.
\r */
\r bits = new unsigned char[bits_size];
\r memset(bits, 0, bits_size);
\r}
\r\rirc::dynamicbitmask::~dynamicbitmask()
\r{
\r /* Tidy up the entire used memory on delete */
\r delete[] bits;
\r}
\r\rirc::bitfield irc::dynamicbitmask::Allocate()
\r{
\r /* Yeah, this isnt too efficient, however a module or the core
\r * should only be allocating bitfields on load, the Toggle and
\r * Get methods are O(1) as these are called much more often.
\r */
\r unsigned char* freebits = this->GetFreeBits();
\r for (unsigned char i = 0; i < bits_size; i++)
\r {
\r /* Yes, this is right. You'll notice we terminate the loop when !current_pos,
\r * this is because we logic shift our bit off the end of unsigned char, and its
\r * lost, making the loop counter 0 when we're done.
\r */
\r for (unsigned char current_pos = 1; current_pos; current_pos = current_pos << 1)
\r {
\r if (!(freebits[i] & current_pos))
\r {
\r freebits[i] |= current_pos;
\r return std::make_pair(i, current_pos);
\r }
\r }
\r }
\r /* We dont have any free space left, increase by one */
\r\r if (bits_size == 255)
\r /* Oh dear, cant grow it any further */
\r throw std::bad_alloc();
\r\r unsigned char old_bits_size = bits_size;
\r bits_size++;
\r /* Allocate new bitfield space */
\r unsigned char* temp_bits = new unsigned char[bits_size];
\r unsigned char* temp_freebits = new unsigned char[bits_size];
\r /* Copy the old data in */
\r memcpy(temp_bits, bits, old_bits_size);
\r memcpy(temp_freebits, freebits, old_bits_size);
\r /* Delete the old data pointers */
\r delete[] bits;
\r delete[] freebits;
\r /* Swap the pointers over so now the new
\r * pointers point to our member values
\r */
\r bits = temp_bits;
\r freebits = temp_freebits;
\r this->SetFreeBits(freebits);
\r /* Initialize the new byte on the end of
\r * the bitfields, pre-allocate the one bit
\r * for this allocation
\r */
\r bits[old_bits_size] = 0;
\r freebits[old_bits_size] = 1;
\r /* We already know where we just allocated
\r * the bitfield, so no loop needed
\r */
\r return std::make_pair(old_bits_size, 1);
\r}
\r\rbool irc::dynamicbitmask::Deallocate(irc::bitfield &pos)
\r{
\r /* We dont bother to shrink the bitfield
\r * on deallocation, the most we could do
\r * is save one byte (!) and this would cost
\r * us a loop (ugly O(n) stuff) so we just
\r * clear the bit and leave the memory
\r * claimed -- nobody will care about one
\r * byte.
\r */
\r if (pos.first < bits_size)
\r {
\r this->GetFreeBits()[pos.first] &= ~pos.second;
\r return true;
\r }
\r /* They gave a bitfield outside of the
\r * length of our array. BAD programmer.
\r */
\r return false;
\r}
\r\rvoid irc::dynamicbitmask::Toggle(irc::bitfield &pos, bool state)
\r{
\r /* Range check the value */
\r if (pos.first < bits_size)
\r {
\r if (state)
\r /* Set state, OR the state in */
\r bits[pos.first] |= pos.second;
\r else
\r /* Clear state, AND the !state out */
\r bits[pos.first] &= ~pos.second;
\r }
\r}
\r\rbool irc::dynamicbitmask::Get(irc::bitfield &pos)
\r{
\r /* Range check the value */
\r if (pos.first < bits_size)
\r return (bits[pos.first] & pos.second);
\r else
\r /* We can't return false, otherwise we can't
\r * distinguish between failure and a cleared bit!
\r * Our only sensible choice is to throw (ew).
\r */
\r throw ModuleException("irc::dynamicbitmask::Get(): Invalid bitfield, out of range");
\r}
\r\runsigned char irc::dynamicbitmask::GetSize()
\r{
\r return bits_size;
\r}
\r\r
projects / user / henk / code / inspircd.git / blob