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"
23 #include "helperfuncs.h"
24 #include <ext/hash_map>
26 #define nspace __gnu_cxx
28 // from helperfuncs.cpp
29 extern const char lowermap[255];
31 /******************************************************
33 * The hash functions of InspIRCd are the centrepoint
34 * of the entire system. If these functions are
35 * inefficient or wasteful, the whole program suffers
36 * as a result. A lot of C programmers in the ircd
37 * scene spend a lot of time debating (arguing) about
38 * the best way to write hash functions to hash irc
39 * nicknames, channels etc.
40 * We are lucky as C++ developers as hash_map does
41 * a lot of this for us. It does intellegent memory
42 * requests, bucketing, search functions, insertion
43 * and deletion etc. All we have to do is write some
44 * overloaded comparison and hash value operators which
45 * cause it to act in an irc-like way. The features we
46 * add to the standard hash_map are:
48 * Case insensitivity: The hash_map will be case
51 * Scandanavian Comparisons: The characters [, ], \ will
52 * be considered the lowercase of {, } and |.
54 * This file also contains hashing methods for hashing
55 * insp_inaddr structs, we use this if we want to cache IP
58 ******************************************************/
62 size_t nspace::hash<insp_inaddr>::operator()(const insp_inaddr &a) const
65 memcpy(&q,&a,sizeof(size_t));
69 size_t nspace::hash<string>::operator()(const string &s) const
72 static struct hash<const char *> strhash;
73 strlcpy(a,s.c_str(),MAXBUF);
78 bool irc::StrHashComp::operator()(const std::string& s1, const std::string& s2) const
80 unsigned char* n1 = (unsigned char*)s1.c_str();
81 unsigned char* n2 = (unsigned char*)s2.c_str();
82 for (; *n1 && *n2; n1++, n2++)
83 if (lowermap[*n1] != lowermap[*n2])
85 return (lowermap[*n1] == lowermap[*n2]);
88 bool irc::InAddr_HashComp::operator()(const insp_inaddr &s1, const insp_inaddr &s2) const
91 for (int n = 0; n < 16; n++)
92 if (s2.s6_addr[n] != s1.s6_addr[n])
96 return (s1.s_addr == s1.s_addr);
100 /******************************************************
102 * This is the implementation of our special irc::string
103 * class which is a case-insensitive equivalent to
104 * std::string which is not only case-insensitive but
105 * can also do scandanavian comparisons, e.g. { = [, etc.
107 * This class depends on the global 'lowermap' which is
108 * initialized at startup by inspircd.cpp, and contains
109 * the 'scandanavian' casemappings for fast irc compare.
111 ******************************************************/
113 bool irc::irc_char_traits::eq(char c1st, char c2nd)
115 return lowermap[(unsigned char)c1st] == lowermap[(unsigned char)c2nd];
118 bool irc::irc_char_traits::ne(char c1st, char c2nd)
120 return lowermap[(unsigned char)c1st] != lowermap[(unsigned char)c2nd];
123 bool irc::irc_char_traits::lt(char c1st, char c2nd)
125 return lowermap[(unsigned char)c1st] < lowermap[(unsigned char)c2nd];
128 int irc::irc_char_traits::compare(const char* str1, const char* str2, size_t n)
130 for(unsigned int i = 0; i < n; i++)
132 if(lowermap[(unsigned char)*str1] > lowermap[(unsigned char)*str2])
135 if(lowermap[(unsigned char)*str1] < lowermap[(unsigned char)*str2])
138 if(*str1 == 0 || *str2 == 0)
147 std::string operator+ (std::string& leftval, irc::string& rightval)
149 return leftval + std::string(rightval.c_str());
152 irc::string operator+ (irc::string& leftval, std::string& rightval)
154 return leftval + irc::string(rightval.c_str());
157 bool operator== (std::string& leftval, irc::string& rightval)
159 return (leftval == std::string(rightval.c_str()));
162 bool operator== (irc::string& leftval, std::string& rightval)
164 return (rightval == std::string(leftval.c_str()));
167 const char* irc::irc_char_traits::find(const char* s1, int n, char c)
169 while(n-- > 0 && lowermap[(unsigned char)*s1] != lowermap[(unsigned char)c])
174 /* See hashcomp.h if you care about these... */
175 std::ostream& operator<<(std::ostream &os, const irc::string &str)
177 return os << str.c_str();
180 std::istream& operator>>(std::istream &is, irc::string &str)
188 irc::tokenstream::tokenstream(const std::string &source) : tokens(source), last_pushed(false)
190 last_starting_position = tokens.begin();
194 irc::tokenstream::~tokenstream()
198 const std::string irc::tokenstream::GetToken()
200 std::string::iterator lsp = last_starting_position;
202 while (n != tokens.end())
204 if ((last_pushed) && (*n == ':'))
206 /* If we find a token thats not the first and starts with :,
207 * this is the last token on the line
209 std::string::iterator curr = ++n;
211 return std::string(curr, tokens.end());
216 if ((*n == ' ') || (n+1 == tokens.end()))
218 /* If we find a space, or end of string, this is the end of a token.
220 last_starting_position = n+1;
222 return std::string(lsp, n+1 == tokens.end() ? n+1 : n++);
230 irc::commasepstream::commasepstream(const std::string &source) : tokens(source)
232 last_starting_position = tokens.begin();
236 const std::string irc::commasepstream::GetToken()
238 std::string::iterator lsp = last_starting_position;
240 while (n != tokens.end())
242 if ((*n == ',') || (n+1 == tokens.end()))
244 last_starting_position = n+1;
245 return std::string(lsp, n+1 == tokens.end() ? n+1 : n++);
254 irc::commasepstream::~commasepstream()