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 "inspircd_config.h"
21 #define _CRT_SECURE_NO_DEPRECATE
22 #define _SCL_SECURE_NO_DEPRECATE
24 /*******************************************************
25 * This file contains classes and templates that deal
26 * with the comparison and hashing of 'irc strings'.
27 * An 'irc string' is a string which compares in a
28 * case insensitive manner, and as per RFC 1459 will
29 * treat [ identical to {, ] identical to }, and \
32 * Our hashing functions are designed to accept
33 * std::string and compare/hash them as type irc::string
34 * by converting them internally. This makes them
35 * backwards compatible with other code which is not
36 * aware of irc::string.
37 *******************************************************/
40 using irc::sockets::insp_aton;
41 using irc::sockets::insp_ntoa;
45 /** A mapping of uppercase to lowercase, including scandinavian
46 * 'oddities' as specified by RFC1459, e.g. { -> [, and | -> \
48 unsigned const char lowermap[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, /* 0-19 */
49 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, /* 20-39 */
50 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, /* 40-59 */
51 60, 61, 62, 63, 64, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, /* 60-79 */
52 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 94, 95, 96, 97, 98, 99, /* 80-99 */
53 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, /* 100-119 */
54 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, /* 120-139 */
55 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, /* 140-159 */
56 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, /* 160-179 */
57 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, /* 180-199 */
58 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, /* 200-219 */
59 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, /* 220-239 */
60 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255 /* 240-255 */
64 /** The irc namespace contains a number of helper classes.
69 /** This class returns true if two strings match.
70 * Case sensitivity is ignored, and the RFC 'character set'
75 /** The operator () does the actual comparison in hash_map
77 bool operator()(const std::string& s1, const std::string& s2) const;
81 /** irc::stringjoiner joins string lists into a string, using
82 * the given seperator string.
83 * This class can join a vector of std::string, a deque of
84 * std::string, or a const char** array, using overloaded
87 class CoreExport stringjoiner
94 /** Join elements of a vector, between (and including) begin and end
95 * @param seperator The string to seperate values with
96 * @param sequence One or more items to seperate
97 * @param begin The starting element in the sequence to be joined
98 * @param end The ending element in the sequence to be joined
100 stringjoiner(const std::string &seperator, const std::vector<std::string> &sequence, int begin, int end);
101 /** Join elements of a deque, between (and including) begin and end
102 * @param seperator The string to seperate values with
103 * @param sequence One or more items to seperate
104 * @param begin The starting element in the sequence to be joined
105 * @param end The ending element in the sequence to be joined
107 stringjoiner(const std::string &seperator, const std::deque<std::string> &sequence, int begin, int end);
108 /** Join elements of an array of char arrays, between (and including) begin and end
109 * @param seperator The string to seperate values with
110 * @param sequence One or more items to seperate
111 * @param begin The starting element in the sequence to be joined
112 * @param end The ending element in the sequence to be joined
114 stringjoiner(const std::string &seperator, const char** sequence, int begin, int end);
116 /** Get the joined sequence
117 * @return A reference to the joined string
119 std::string& GetJoined();
122 /** irc::modestacker stacks mode sequences into a list.
123 * It can then reproduce this list, clamped to a maximum of MAXMODES
126 class CoreExport modestacker
129 /** The mode sequence and its parameters
131 std::deque<std::string> sequence;
132 /** True if the mode sequence is initially adding
133 * characters, false if it is initially removing
138 /** Construct a new modestacker.
139 * @param add True if the stack is adding modes,
140 * false if it is removing them
142 modestacker(bool add);
143 /** Push a modeletter and its parameter onto the stack.
144 * No checking is performed as to if this mode actually
145 * requires a parameter. If you stack invalid mode
146 * sequences, they will be tidied if and when they are
147 * passed to a mode parser.
148 * @param modeletter The mode letter to insert
149 * @param parameter The parameter for the mode
151 void Push(char modeletter, const std::string ¶meter);
152 /** Push a modeletter without parameter onto the stack.
153 * No checking is performed as to if this mode actually
154 * requires a parameter. If you stack invalid mode
155 * sequences, they will be tidied if and when they are
156 * passed to a mode parser.
157 * @param modeletter The mode letter to insert
159 void Push(char modeletter);
160 /** Push a '+' symbol onto the stack.
163 /** Push a '-' symbol onto the stack.
166 /** Return zero or more elements which form the
167 * mode line. This will be clamped to a max of
168 * MAXMODES+1 items (MAXMODES mode parameters and
169 * one mode sequence string), and max_line_size
170 * characters. As specified below, this function
171 * should be called in a loop until it returns zero,
172 * indicating there are no more modes to return.
173 * @param result The deque to populate. This will
174 * be cleared before it is used.
175 * @param max_line_size The maximum size of the line
176 * to build, in characters, seperate to MAXMODES.
177 * @return The number of elements in the deque.
178 * The function should be called repeatedly until it
179 * returns 0, in case there are multiple lines of
180 * mode changes to be obtained.
182 int GetStackedLine(std::deque<std::string> &result, int max_line_size = 360);
185 /** irc::tokenstream reads a string formatted as per RFC1459 and RFC2812.
186 * It will split the string into 'tokens' each containing one parameter
188 * For instance, if it is instantiated with the string:
189 * "PRIVMSG #test :foo bar baz qux"
190 * then each successive call to tokenstream::GetToken() will return
191 * "PRIVMSG", "#test", "foo bar baz qux", "".
192 * Note that if the whole string starts with a colon this is not taken
193 * to mean the string is all one parameter, and the first item in the
194 * list will be ":item". This is to allow for parsing 'source' fields
197 class CoreExport tokenstream
203 /** Last position of a seperator token
205 std::string::iterator last_starting_position;
206 /** Current string position
208 std::string::iterator n;
209 /** True if the last value was an ending value
213 /** Create a tokenstream and fill it with the provided data
215 tokenstream(const std::string &source);
218 /** Fetch the next token from the stream
219 * @return The next token is returned, or an empty string if none remain
221 bool GetToken(std::string &token);
224 /** irc::sepstream allows for splitting token seperated lists.
225 * Each successive call to sepstream::GetToken() returns
226 * the next token, until none remain, at which point the method returns
229 class CoreExport sepstream : public classbase
235 /** Last position of a seperator token
237 std::string::iterator last_starting_position;
238 /** Current string position
240 std::string::iterator n;
245 /** Create a sepstream and fill it with the provided data
247 sepstream(const std::string &source, char seperator);
248 virtual ~sepstream();
250 /** Fetch the next token from the stream
251 * @return The next token is returned, or an empty string if none remain
253 virtual const std::string GetToken();
255 /** Fetch the entire remaining stream, without tokenizing
256 * @return The remaining part of the stream
258 virtual const std::string GetRemaining();
260 /** Returns true if the end of the stream has been reached
261 * @return True if the end of the stream has been reached, otherwise false
263 virtual bool StreamEnd();
266 /** A derived form of sepstream, which seperates on commas
268 class CoreExport commasepstream : public sepstream
271 commasepstream(const std::string &source) : sepstream(source, ',')
276 /** A derived form of sepstream, which seperates on spaces
278 class CoreExport spacesepstream : public sepstream
281 spacesepstream(const std::string &source) : sepstream(source, ' ')
286 /** The portparser class seperates out a port range into integers.
287 * A port range may be specified in the input string in the form
288 * "6660,6661,6662-6669,7020". The end of the stream is indicated by
289 * a return value of 0 from portparser::GetToken(). If you attempt
290 * to specify an illegal range (e.g. one where start >= end, or
291 * start or end < 0) then GetToken() will return the first element
292 * of the pair of numbers.
294 class CoreExport portparser : public classbase
297 /** Used to split on commas
300 /** Current position in a range of ports
303 /** Starting port in a range of ports
306 /** Ending port in a range of ports
309 /** Allow overlapped port ranges
312 /** Used to determine overlapping of ports
313 * without O(n) algorithm being used
315 std::map<long, bool> overlap_set;
316 /** Returns true if val overlaps an existing range
318 bool Overlaps(long val);
320 /** Create a portparser and fill it with the provided data
321 * @param source The source text to parse from
322 * @param allow_overlapped Allow overlapped ranges
324 portparser(const std::string &source, bool allow_overlapped = true);
325 /** Frees the internal commasepstream object
328 /** Fetch the next token from the stream
329 * @return The next port number is returned, or 0 if none remain
334 /** Used to hold a bitfield definition in dynamicbitmask.
335 * You must be allocated one of these by dynamicbitmask::Allocate(),
336 * you should not fill the values yourself!
338 typedef std::pair<size_t, unsigned char> bitfield;
340 /** The irc::dynamicbitmask class is used to maintain a bitmap of
341 * boolean values, which can grow to any reasonable size no matter
342 * how many bitfields are in it.
344 * It starts off at 32 bits in size, large enough to hold 32 boolean
345 * values, with a memory allocation of 8 bytes. If you allocate more
346 * than 32 bits, the class will grow the bitmap by 8 bytes at a time
347 * for each set of 8 bitfields you allocate with the Allocate()
350 * This method is designed so that multiple modules can be allocated
351 * bit values in a bitmap dynamically, rather than having to define
352 * costs in a fixed size unsigned integer and having the possibility
353 * of collisions of values in different third party modules.
357 * To use this class, you must derive from it.
358 * This is because each derived instance has its own freebits array
359 * which can determine what bitfields are allocated on a TYPE BY TYPE
360 * basis, e.g. an irc::dynamicbitmask type for userrecs, and one for
361 * chanrecs, etc. You should inheret it in a very simple way as follows.
362 * The base class will resize and maintain freebits as required, you are
363 * just required to make the pointer static and specific to this class
367 * class mydbitmask : public irc::dynamicbitmask
371 * static unsigned char* freebits;
375 * mydbitmask() : irc::dynamicbitmask()
377 * freebits = new unsigned char[this->bits_size];
378 * memset(freebits, 0, this->bits_size);
386 * unsigned char* GetFreeBits()
391 * void SetFreeBits(unsigned char* freebt)
398 class CoreExport dynamicbitmask : public classbase
401 /** Data bits. We start with four of these,
402 * and we grow the bitfield as we allocate
403 * more than 32 entries with Allocate().
407 /** Current set size (size of freebits and bits).
408 * Both freebits and bits will ALWAYS be the
411 unsigned char bits_size;
413 /** Allocate the initial memory for bits and
414 * freebits and zero the memory.
418 /** Free the memory used by bits and freebits
420 virtual ~dynamicbitmask();
422 /** Allocate an irc::bitfield.
423 * @return An irc::bitfield which can be used
424 * with Get, Deallocate and Toggle methods.
425 * @throw Can throw std::bad_alloc if there is
426 * no ram left to grow the bitmask.
430 /** Deallocate an irc::bitfield.
431 * @param An irc::bitfield to deallocate.
432 * @return True if the bitfield could be
433 * deallocated, false if it could not.
435 bool Deallocate(bitfield &pos);
437 /** Toggle the value of a bitfield.
438 * @param pos A bitfield to allocate, previously
439 * allocated by dyamicbitmask::Allocate().
440 * @param state The state to set the field to.
442 void Toggle(bitfield &pos, bool state);
444 /** Get the value of a bitfield.
445 * @param pos A bitfield to retrieve, previously
446 * allocated by dyamicbitmask::Allocate().
447 * @return The value of the bitfield.
448 * @throw Will throw ModuleException if the bitfield
449 * you provide is outside of the range
450 * 0 >= bitfield.first < size_bits.
452 bool Get(bitfield &pos);
454 /** Return the size in bytes allocated to the bits
456 * Note that the actual allocation is twice this,
457 * as there are an equal number of bytes allocated
458 * for the freebits array.
460 unsigned char GetSize();
462 virtual unsigned char* GetFreeBits() { return NULL; }
464 virtual void SetFreeBits(unsigned char* freebits) { }
467 /** The irc_char_traits class is used for RFC-style comparison of strings.
468 * This class is used to implement irc::string, a case-insensitive, RFC-
469 * comparing string class.
471 struct irc_char_traits : std::char_traits<char> {
473 /** Check if two chars match
475 static bool eq(char c1st, char c2nd);
477 /** Check if two chars do NOT match
479 static bool ne(char c1st, char c2nd);
481 /** Check if one char is less than another
483 static bool lt(char c1st, char c2nd);
485 /** Compare two strings of size n
487 static CoreExport int compare(const char* str1, const char* str2, size_t n);
489 /** Find a char within a string up to position n
491 static CoreExport const char* find(const char* s1, int n, char c);
494 CoreExport std::string hex(const unsigned char *raw, size_t rawsz);
496 /** This typedef declares irc::string based upon irc_char_traits
498 typedef basic_string<char, irc_char_traits, allocator<char> > string;
500 CoreExport const char* Spacify(const char* n);
503 /* Define operators for using >> and << with irc::string to an ostream on an istream. */
504 /* This was endless fun. No. Really. */
505 /* It was also the first core change Ommeh made, if anyone cares */
506 inline std::ostream& operator<<(std::ostream &os, const irc::string &str) { return os << str.c_str(); }
507 inline std::istream& operator>>(std::istream &is, irc::string &str)
515 /* Define operators for + and == with irc::string to std::string for easy assignment
516 * and comparison - Brain
518 inline std::string operator+ (std::string& leftval, irc::string& rightval)
520 return leftval + std::string(rightval.c_str());
523 inline irc::string operator+ (irc::string& leftval, std::string& rightval)
525 return leftval + irc::string(rightval.c_str());
528 inline bool operator== (const std::string& leftval, const irc::string& rightval)
530 return (leftval.c_str() == rightval);
533 inline bool operator== (const irc::string& leftval, const std::string& rightval)
535 return (leftval == rightval.c_str());
538 inline std::string assign(const irc::string &other) { return other.c_str(); }
539 inline irc::string assign(const std::string &other) { return other.c_str(); }
540 inline std::string& trim(std::string &str)
542 std::string::size_type start = str.find_first_not_of(" ");
543 std::string::size_type end = str.find_last_not_of(" ");
544 if (start == std::string::npos || end == std::string::npos)
547 str = str.substr(start, end-start+1);
552 /* Hashing stuff is totally different on vc++'s hash_map implementation, so to save a buttload of #ifdefs we'll just
553 do it all at once - Burlex */
557 /** Hashing function to hash irc::string
560 template<> class CoreExport hash_compare<irc::string, std::less<irc::string> >
563 enum { bucket_size = 4, min_buckets = 8 }; // Got these numbers from the CRT source,
564 // if anyone wants to change them feel free.
565 bool operator()(const irc::string & s1, const irc::string & s2) const
567 if(s1.length() != s2.length()) return true;
568 return (irc::irc_char_traits::compare(s1.c_str(), s2.c_str(), s1.length()) < 0);
571 size_t operator()(const irc::string & s) const;
574 template<> class CoreExport hash_compare<std::string, std::less<std::string> >
577 enum { bucket_size = 4, min_buckets = 8 };
578 bool operator()(const std::string & s1, const std::string & s2) const
580 if(s1.length() != s2.length()) return true;
581 return (irc::irc_char_traits::compare(s1.c_str(), s2.c_str(), s1.length()) < 0);
584 /** Hash a std::string using RFC1459 case sensitivity rules
585 * @param s A string to hash
586 * @return The hash value
588 size_t operator()(const std::string & s) const;
591 template<> struct hash<irc::string>
593 size_t operator()(const irc::string &s) const;
596 template<> struct hash<std::string>
598 /** Hash a std::string using RFC1459 case sensitivity rules
599 * @param s A string to hash
600 * @return The hash value
602 size_t operator()(const string &s) const;
606 /** Convert a string to lower case respecting RFC1459
607 * @param n A string to lowercase
609 void strlower(char *n);