X-Git-Url: https://git.netwichtig.de/gitweb/?a=blobdiff_plain;f=src%2Fhashcomp.cpp;h=e948134205827e3f2380189273ca311d2576a464;hb=59b1a8955142935b02af6446005ab47fc7c3fc8c;hp=1122c3867598eb1b16d9d13ae27578730473c52a;hpb=c4a230243f93709bd9e3629ce6c9c84da0f9c31f;p=user%2Fhenk%2Fcode%2Finspircd.git

diff --git a/src/hashcomp.cpp b/src/hashcomp.cpp
index 1122c3867..e94813420 100644
--- a/src/hashcomp.cpp
+++ b/src/hashcomp.cpp
@@ -2,7 +2,7 @@
  *       | Inspire Internet Relay Chat Daemon |
  *       +------------------------------------+
  *
- *  Inspire is copyright (C) 2002-2005 ChatSpike-Dev.
+ *  InspIRCd is copyright (C) 2002-2006 ChatSpike-Dev.
  *                       E-mail:
  *                <brain@chatspike.net>
  *                <Craig@chatspike.net>
@@ -14,8 +14,11 @@
  * ---------------------------------------------------
  */
 
-#include <string>
+using namespace std;
+
+#include "inspircd_config.h"
 #include "inspircd.h"
+#include <string>
 #include "hashcomp.h"
 #include "helperfuncs.h"
 #ifdef GCC3
@@ -30,24 +33,48 @@
 #define nspace std
 #endif
 
+// from helperfuncs.cpp
+extern const char lowermap[255];
+
+/******************************************************
+ *
+ * The hash functions of InspIRCd are the centrepoint
+ * of the entire system. If these functions are
+ * inefficient or wasteful, the whole program suffers
+ * as a result. A lot of C programmers in the ircd
+ * scene spend a lot of time debating (arguing) about
+ * the best way to write hash functions to hash irc
+ * nicknames, channels etc.
+ * We are lucky as C++ developers as hash_map does
+ * a lot of this for us. It does intellegent memory
+ * requests, bucketing, search functions, insertion
+ * and deletion etc. All we have to do is write some
+ * overloaded comparison and hash value operators which
+ * cause it to act in an irc-like way. The features we
+ * add to the standard hash_map are:
+ *
+ * Case insensitivity: The hash_map will be case
+ * insensitive.
+ *
+ * Scandanavian Comparisons: The characters [, ], \ will
+ * be considered the lowercase of {, } and |.
+ *
+ * This file also contains hashing methods for hashing
+ * in_addr structs, we use this if we want to cache IP
+ * addresses.
+ *
+ ******************************************************/
+
 using namespace std;
 
-#ifdef GCC34
-size_t hash<in_addr>::operator()(const struct in_addr &a) const
-#else
 size_t nspace::hash<in_addr>::operator()(const struct in_addr &a) const
-#endif
 {
         size_t q;
         memcpy(&q,&a,sizeof(size_t));
         return q;
 }
 
-#ifdef GCC34
-size_t hash<string>::operator()(const string &s) const
-#else
 size_t nspace::hash<string>::operator()(const string &s) const
-#endif
 {
         char a[MAXBUF];
         static struct hash<const char *> strhash;
@@ -56,24 +83,102 @@ size_t nspace::hash<string>::operator()(const string &s) const
         return strhash(a);
 }
 
-bool StrHashComp::operator()(const string& s1, const string& s2) const
+bool irc::StrHashComp::operator()(const std::string& s1, const std::string& s2) const
 {
-        char a[MAXBUF],b[MAXBUF];
-        strlcpy(a,s1.c_str(),MAXBUF);
-        strlcpy(b,s2.c_str(),MAXBUF);
-        strlower(a);
-        strlower(b);
-        return (strcasecmp(a,b) == 0);
+	irc::string a = s1.c_str();
+	irc::string b = s2.c_str();
+        return (a == b);
 }
 
-bool InAddr_HashComp::operator()(const in_addr &s1, const in_addr &s2) const
+bool irc::InAddr_HashComp::operator()(const in_addr &s1, const in_addr &s2) const
 {
-        size_t q;
-        size_t p;
+        return (s1.s_addr == s1.s_addr);
+}
+
+/******************************************************
+ *
+ * This is the implementation of our special irc::string
+ * class which is a case-insensitive equivalent to
+ * std::string which is not only case-insensitive but
+ * can also do scandanavian comparisons, e.g. { = [, etc.
+ *
+ * This class depends on the global 'lowermap' which is
+ * initialized at startup by inspircd.cpp, and contains
+ * the 'scandanavian' casemappings for fast irc compare.
+ *
+ ******************************************************/
+
+bool irc::irc_char_traits::eq(char c1st, char c2nd)
+{
+	return lowermap[(unsigned)c1st] == lowermap[(unsigned)c2nd];
+}
+
+bool irc::irc_char_traits::ne(char c1st, char c2nd)
+{
+	return lowermap[(unsigned)c1st] != lowermap[(unsigned)c2nd];
+}
+
+bool irc::irc_char_traits::lt(char c1st, char c2nd)
+{
+	return lowermap[(unsigned)c1st] < lowermap[(unsigned)c2nd];
+}
+
+int irc::irc_char_traits::compare(const char* str1, const char* str2, size_t n)
+{
+	for(unsigned int i = 0; i < n; i++)
+	{
+		if(lowermap[(unsigned)*str1] > lowermap[(unsigned)*str2])
+       	        	return 1;
+
+		if(lowermap[(unsigned)*str1] < lowermap[(unsigned)*str2])
+	               	return -1;
 
-        memcpy(&q,&s1,sizeof(size_t));
-        memcpy(&p,&s2,sizeof(size_t));
+	        if(*str1 == 0 || *str2 == 0)
+	              	return 0;
 
-        return (q == p);
+	       	str1++;
+		str2++;
+	}
+	return 0;
 }
 
+std::string operator+ (std::string& leftval, irc::string& rightval)
+{
+	return leftval + std::string(rightval.c_str());
+}
+
+irc::string operator+ (irc::string& leftval, std::string& rightval)
+{
+	return leftval + irc::string(rightval.c_str());
+}
+
+bool operator== (std::string& leftval, irc::string& rightval)
+{
+	return (leftval == std::string(rightval.c_str()));
+}
+
+bool operator== (irc::string& leftval, std::string& rightval)
+{
+	return (rightval == std::string(leftval.c_str()));
+}
+
+const char* irc::irc_char_traits::find(const char* s1, int  n, char c)
+{
+	while(n-- > 0 && lowermap[(unsigned)*s1] != lowermap[(unsigned)c])
+		s1++;
+	return s1;
+}
+
+/* See hashcomp.h if you care about these... */
+std::ostream& operator<<(std::ostream &os, const irc::string &str)
+{
+	return os << str.c_str();
+}
+
+std::istream& operator>>(std::istream &is, irc::string &str)
+{
+	std::string tmp;
+	is >> tmp;
+	str = tmp.c_str();
+	return is;
+}